Backward stability of Clenshaw's algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1547082
- A general condition number for polynomials
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- An analogue for Szegő polynomials of the Clenshaw algorithm
Cited in
(13)- An Hermite-Obreshkov method for 2nd-order linear initial-value problems for ODE. With special attention paid to the Mathieu equation
- scientific article; zbMATH DE number 1547082 (Why is no real title available?)
- Accurate evaluation of polynomials in Legendre basis
- A new efficient algorithm for polynomial interpolation
- Towards a reliable implementation of least-squares collocation for higher index differential-algebraic equations. I: Basics and ansatz function choices
- Accurate evaluation of a polynomial in Chebyshev form
- Limited‐memory polynomial methods for large‐scale matrix functions
- On improving the accuracy of Horner's and Goertzel's algorithms
- On computing modified moments for half-range Hermite weights
- Chebyshev subdivision and reduction methods for solving multivariable systems of equations
- The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
This page was built for publication: Backward stability of Clenshaw's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864779)
