Skip to main content
Log in

Roundoff errors for polynomial evaluation by a family of formulae

  • Published:
Computing Aims and scope Submit manuscript

Abstract

A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formulae are linear combinations of basis functions, which can be computed with high relative accuracy. We have taken into account that all steps but the last one can be computed to high relative accuracy. The exactness of the initial data is crucial for obtaining low error bounds. The Lagrange interpolation formula and related formulae are considered and numerical experiments are provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berrut JP, Trefethen LN (2004) Barycentric Lagrange interpolation. SIAM Rev 46: 501–517

    Article  MATH  MathSciNet  Google Scholar 

  2. Demmel J, Gu M, Eisenstat S, Slapniar I, Veseli K, Drma Z (1999) Computing the singular value decomposition with high relative accuracy. Linear Algebra Appl 299: 21–80

    Article  MATH  MathSciNet  Google Scholar 

  3. Farin G (2002) Curves and Surfaces of CAGD. A practical guide, 5th edn. Academic Press, San Diego

    Google Scholar 

  4. Farouki RT, Rajan VT (1988) Algorithms for polynomials in Bernstein form. Comput. Aided Geom Des 5: 1–26

    Article  MATH  MathSciNet  Google Scholar 

  5. Higham NJ (2002) Accuracy and stability of numerical algorithms. SIAM, Philadelphia

    MATH  Google Scholar 

  6. Higham NJ (2004) The Numerical Stability of barycentric Lagrange interpolation. IMA J Numer Anal 24: 547–556

    Article  MATH  MathSciNet  Google Scholar 

  7. Mainar E, Peña JM (1999) Error analysis of corner cutting algorithms. Numer Algorithms 22: 41–52

    Article  MATH  MathSciNet  Google Scholar 

  8. Peña JM, Sauer T (2000a) On the multivariate Horner scheme. SIAM J Numer Anal 37: 1186–1197

    Article  MATH  MathSciNet  Google Scholar 

  9. Peña JM, Sauer T (2000b) On the multivariate Horner scheme. II: Running error analysis. Computing 65: 313–322

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. M. Carnicer.

Additional information

Research partially supported by the Spanish Research Grant MTM2006-03388, by Gobierno de Aragón and Fondo Social Europeo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carnicer, J.M., Goodman, T.N.T. & Peña, J.M. Roundoff errors for polynomial evaluation by a family of formulae. Computing 82, 199–215 (2008). https://doi.org/10.1007/s00607-008-0007-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-008-0007-6

Keywords

Mathematics Subject Classification (2000)

Navigation