Error Analysis for Polynomial Evaluation

DOI10.2307/2005700zbMath0292.65019OpenAlexW4235127458MaRDI QIDQ4044053

A. C. R. Newbery

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/2005700

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical computation of solutions to single equations (65H05)

Related Items (10)

An algebraic approach to approximate evaluation of a polynomial on a set of real points ⋮ On Stable Calculation of Linear Functionals ⋮ On the application of Newbery's transformation to the Reinsch polynomial evaluation scheme ⋮ A stable method for the evaluation of a polynomial and of a rational function of one variable ⋮ Stability of parallel algorithms to evaluate Chebyshev series ⋮ Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series ⋮ Rounding error propagation in polynomial evaluation schemes ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ Rounding error analysis of Horner's scheme ⋮ Polynomial Evaluation Schemes

Cites Work

• Unnamed Item
• Optimally scaled matrices
• On the conditioning of polynomial and rational forms
• Error Analysis for Fourier Series Evaluation
• An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients

This page was built for publication: Error Analysis for Polynomial Evaluation