On the sensitivity to rounding errors of Chebyshev series approximations
From MaRDI portal
Cites work
- A ccuracy and speed of real and complex interpolation
- A Comparison of “Best” Polynomial Approximations with Truncated Chebyshev Series Expansions
- An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
- An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
- Efficiency of a Procedure for Near-Minimax Approximation
- scientific article; zbMATH DE number 3336324 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- On a Conjecture of C. W. Clenshaw
- On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria
- Rounding error propagation in polynomial evaluation schemes
- Stable Methods for Evaluating the Points cos(iπ/n)
- The evaluation of the coefficients in the Chebyshev expansion
This page was built for publication: On the sensitivity to rounding errors of Chebyshev series approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1240515)