Polynomial evaluation schemes
HTML articles powered by AMS MathViewer
- by A. C. R. Newbery PDF
- Math. Comp. 29 (1975), 1046-1050 Request permission
Abstract:
An attempt is made to define a polynomial evaluation algorithm that is more resistant to accumulated round-off error than the schemes of Horner and Clenshaw under conditions of floating-point arithmetic. An algorithm is presented which generally compares favorably with both. Some suggestions are made, which could plausibly lead to substantial further improvements.References
- A. C. R. Newbery, Error analysis for polynomial evaluation, Math. Comp. 28 (1974), 789–793. MR 373227, DOI 10.1090/S0025-5718-1974-0373227-8
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Math. Comp. 29 (1975), 1046-1050
- MSC: Primary 65G05
- DOI: https://doi.org/10.1090/S0025-5718-1975-0388757-3
- MathSciNet review: 0388757