A new efficient algorithm for polynomial interpolation (Q873149)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new efficient algorithm for polynomial interpolation |
scientific article; zbMATH DE number 5138266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new efficient algorithm for polynomial interpolation |
scientific article; zbMATH DE number 5138266 |
Statements
A new efficient algorithm for polynomial interpolation (English)
0 references
28 March 2007
0 references
The authors propose a new algorithm for the evaluation of the Lagrange interpolation polynomial and for computing its Newton coefficients. The algorithm does not require any special ordering of the interpolation points. The given error analysis proves that this algorithm is backward stable with respect to perturbations in the function values, for any choice of interpolating knots. Numerical examples show that the new algorithm is more accurate than Aitken's algorithm and the divided differences scheme.
0 references
numerical stability
0 references
condition number
0 references
Lagrange form
0 references
Newton form
0 references
divided differences
0 references
Aitken's algorithm
0 references
comparison of methods
0 references
interpolation polynomial
0 references
error analysis
0 references
numerical examples
0 references
0 references
0.8311175107955933
0 references
0.8193304538726807
0 references
0.7922796010971069
0 references
