A new efficient algorithm for polynomial interpolation
From MaRDI portal
Publication:873149
DOI10.1007/S00607-006-0185-ZzbMATH Open1120.65011OpenAlexW2153658907MaRDI QIDQ873149FDOQ873149
Authors: Alicja Smoktunowicz, Iwona Wróbel, Przemysław Kosowski 
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
Recommendations
numerical exampleserror analysiscondition numbernumerical stabilitydivided differencescomparison of methodsinterpolation polynomialAitken's algorithmLagrange formNewton form
Cites Work
- On the evaluation of polynomial coefficients
- Newton interpolation at Leja points
- Backward stability of Clenshaw's algorithm
- High Degree Polynomial Interpolation in Newton Form
- The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form
- On improving the accuracy of Horner's and Goertzel's algorithms
Cited In (15)
- Constructing New Time Integrators Using Interpolating Polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Note on Polynomial Interpolation
- Polynomial Interpolation: Lagrange versus Newton
- Efficient Ehrlich-Aberth iteration for finding intersections of interpolating polynomials and rational functions
- Fast and stable contour integration for high order divided differences via elliptic functions
- A comparison of algorithms for polynomial interpolation
- Iterative polynomial interpolation and data compression
- Efficient Interpolation in the Guruswami–Sudan Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advanced algorithm for interpolation with Wendland functions
This page was built for publication: A new efficient algorithm for polynomial interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q873149)
