Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
From MaRDI portal
Publication:1999710
Recommendations
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- Accurate evaluation of a polynomial in Chebyshev form
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic
- Stability of parallel algorithms to evaluate Chebyshev series
Cites work
- Accuracy and Stability of Numerical Algorithms
- Another Characterization of the Classical Orthogonal Polynomials
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- scientific article; zbMATH DE number 624739 (Why is no real title available?)
- NIST handbook of mathematical functions
- Underflow and the Reliability of Numerical Software
Cited in
(9)- Accurate simple zeros of polynomials in floating point arithmetic
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
- scientific article; zbMATH DE number 5124811 (Why is no real title available?)
- scientific article; zbMATH DE number 62660 (Why is no real title available?)
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- Evaluation of Chebyshev Polynomials on Intervals and Application to Root Finding
- Accurate evaluation of a polynomial in Chebyshev form
- Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic
This page was built for publication: Accurate evaluation of Chebyshev polynomials in floating-point arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999710)