Skip to main content
Peter O.'s user avatar
Peter O.'s user avatar
Peter O.'s user avatar
Peter O.
  • Member for 3 years, 11 months
  • Last seen more than a week ago
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
revised
Loading…
comment
Explicit and fast error bounds for polynomial approximation
(cont'd): Also does the result on the polynomial interpolant relate to the "exact" Chebyshev coefficients, or the "approximate" and "easier-to-compute" coefficients? (These and other unsure points on the Chebyshev method have made me prefer other methods to approximate functions, especially those that don't introduce transcendental functions.)
comment
Explicit and fast error bounds for polynomial approximation
I remind you of a revised version of my question on another MathOverflow page. Also: You write that this answer's result "should be easy to map ... to [0, 1]". I don't see how, especially since not every function meeting the result's assumptions on [0, 1] can be extended to one that does so on [-1, 1].
Loading…
1 2
3
4 5
14