Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Approximation theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Chebyshev approximation== One can obtain polynomials very close to the optimal one by expanding the given function in terms of [[Chebyshev polynomials]] and then cutting off the expansion at the desired degree. This is similar to the [[Harmonic analysis|Fourier analysis]] of the function, using the Chebyshev polynomials instead of the usual trigonometric functions. If one calculates the coefficients in the Chebyshev expansion for a function: :<math>f(x) \sim \sum_{i=0}^\infty c_i T_i(x)</math> and then cuts off the series after the <math>T_N</math> term, one gets an ''N''<span style="padding-left:0.1em;">th</span>-degree polynomial approximating ''f''(''x''). The reason this polynomial is nearly optimal is that, for functions with rapidly converging power series, if the series is cut off after some term, the total error arising from the cutoff is close to the first term after the cutoff. That is, the first term after the cutoff dominates all later terms. The same is true if the expansion is in terms of bucking polynomials. If a Chebyshev expansion is cut off after <math>T_N</math>, the error will take a form close to a multiple of <math>T_{N+1}</math>. The Chebyshev polynomials have the property that they are level – they oscillate between +1 and −1 in the interval [−1, 1]. <math>T_{N+1}</math> has ''N''+2 level extrema. This means that the error between ''f''(''x'') and its Chebyshev expansion out to <math>T_N</math> is close to a level function with ''N''+2 extrema, so it is close to the optimal ''N''<span style="padding-left:0.1em;">th</span>-degree polynomial. In the graphs above, the blue error function is sometimes better than (inside of) the red function, but sometimes worse, meaning that it is not quite the optimal polynomial. The discrepancy is less serious for the exp function, which has an extremely rapidly converging power series, than for the log function. Chebyshev approximation is the basis for [[Clenshaw–Curtis quadrature]], a [[numerical integration]] technique.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)