You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Error Analysis for Polynomial Evaluation
A. C. R. Newbery
Mathematics of Computation
Vol. 28, No. 127 (Jul., 1974), pp. 789-793
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2005700
Page Count: 5
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
A floating-point error analysis is given for the evaluation of a real polynomial at a real argument by Horner's scheme. A computable error bound is derived. It is observed that when a polynomial has coefficients of constant sign or of strictly alternating sign, one cannot expect better accuracy by reformulating the problem in terms of Chebyshev polynomials.
Mathematics of Computation © 1974 American Mathematical Society