A new efficient algorithm for polynomial interpolation

DOI10.1007/s00607-006-0185-zzbMath1120.65011OpenAlexW2153658907MaRDI QIDQ873149

Alicja Smoktunowicz, Przemysław Kosowski, Iwona Wróbel

Publication date: 28 March 2007

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-006-0185-z

zbMATH Keywords

comparison of methodsnumerical exampleserror analysiscondition numbernumerical stabilityNewton formdivided differencesinterpolation polynomialAitken's algorithmLagrange form

Mathematics Subject Classification ID

Numerical interpolation (65D05) Roundoff error (65G50)

Related Items (1)

Fast and stable contour integration for high order divided differences via elliptic functions

Cites Work

• Newton interpolation at Leja points
• The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form
• On the evaluation of polynomial coefficients
• On improving the accuracy of Horner's and Goertzel's algorithms
• Backward stability of Clenshaw's algorithm
• High Degree Polynomial Interpolation in Newton Form

This page was built for publication: A new efficient algorithm for polynomial interpolation