Rounding error propagation in polynomial evaluation schemes

DOI10.1016/0771-050X(79)90002-0zbMath0399.65024OpenAlexW2000539294MaRDI QIDQ1254825

K. Appert

Publication date: 1979

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(79)90002-0

zbMATH Keywords

Error BoundsClenshaw's AlgorithmHorner MethodPolynomial Evaluation SchemesRounding Error Propagation

Mathematics Subject Classification ID

Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Algorithms for approximation of functions (65D15)

Related Items (10)

On the application of Newbery's transformation to the Reinsch polynomial evaluation scheme ⋮ Evaluation schemes in the ring of quaternionic polynomials ⋮ Existence of the first magic angle for the chiral model of bilayer graphene ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Stability of parallel algorithms to evaluate Chebyshev series ⋮ On the sensitivity to rounding errors of Chebyshev series approximations ⋮ Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series ⋮ A note on the signs of truncated Chebyshev polynomials ⋮ Accurate evaluation of polynomials in Legendre basis ⋮ On the numerical evaluation of linear recurrences

Cites Work

• Unnamed Item
• Unnamed Item
• Error Analysis for Polynomial Evaluation
• Polynomial Evaluation Schemes
• A note on the signs of truncated Chebyshev polynomials
• An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients
• Stable evaluation of polynomials

This page was built for publication: Rounding error propagation in polynomial evaluation schemes