Polynomial approximation errors for functions of low-order continuity
From MaRDI portal
A given function f defined on \(<-1,+1>\) is expressed using \((n+1)\)-th divided differences. Minimax error \(E_ 0(f)\) and error \(S_ 0(f)\) are obtained by truncating the Chebyshev series of f after \(n+1\) terms. This method requires continuous second derivative on \(<-1,+1>\).
Recommendations
- Error of truncated Chebyshev series and other near minimax polynomial approximations
- Improved error bounds for near-minimax approximations
- Concentration of the error between a function and its polynomial of best uniform approximation
- Error bounds for a near-minimax approximation
- Boundedness of minimax series from values of the function and its derivative
Cites work
- A Chebyshev series method for the numerical solution of Fredholm integral equations
- Error estimates for least squares approximation by polynomials
- Error of truncated Chebyshev series and other near minimax polynomial approximations
- scientific article; zbMATH DE number 3116984 (Why is no real title available?)
- Polynomial approximation using equioscillation on the extreme points of Chebyshev polynomials
Cited in
(3)
This page was built for publication: Polynomial approximation errors for functions of low-order continuity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809284)
