On the sensitivity to rounding errors of Chebyshev series approximations
From MaRDI portal
Publication:1240515
DOI10.1016/0771-050X(77)90003-1zbMath0363.65006OpenAlexW2041925652MaRDI QIDQ1240515
Publication date: 1977
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0771-050x(77)90003-1
Numerical smoothing, curve fitting (65D10) Numerical interpolation (65D05) Approximation by polynomials (41A10)
Cites Work
- Unnamed Item
- Unnamed Item
- Rounding error propagation in polynomial evaluation schemes
- A ccuracy and speed of real and complex interpolation
- Stable Methods for Evaluating the Points cos(iπ/n)
- An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
- A Comparison of “Best” Polynomial Approximations with Truncated Chebyshev Series Expansions
- On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria
- The evaluation of the coefficients in the Chebyshev expansion
- An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
- Efficiency of a Procedure for Near-Minimax Approximation
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- On a Conjecture of C. W. Clenshaw
This page was built for publication: On the sensitivity to rounding errors of Chebyshev series approximations
