A Comparison of “Best” Polynomial Approximations with Truncated Chebyshev Series Expansions

DOI10.1137/0701003zbMath0136.36303OpenAlexW2064379668MaRDI QIDQ5511092

C. W. Clenshaw

Publication date: 1964

Published in: Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0701003

zbMATH Keywords

approximation and series expansion

Related Items

Classes of functions with explicit best uniform approximations, Truncation Errors in Two Chebyshev Series Approximations, Parameter redundancy in neural networks: an application of Chebyshev polynomials, How much faster does the best polynomial approximation converge than Legendre projection?, Comparisons between best polynomial approximations and interpolating polynomials, The uniform approximation of polynomials by polynomials of lower degree, On the sensitivity to rounding errors of Chebyshev series approximations, Bayesian automatic polynomial wavelet regression, Bayesian curve estimation by polynomial of random order., Rational Carathéodory-Fejér approximation on a disk, a circle, and an interval, Unnamed Item