The complexity of evaluating interpolation polynomials (Q1081273)
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: The complexity of evaluating interpolation polynomials |
scientific article; zbMATH DE number 3969981
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of evaluating interpolation polynomials |
scientific article; zbMATH DE number 3969981 |
Statements
The complexity of evaluating interpolation polynomials (English)
0 references
1985
0 references
It is well known that the complexity of computing all coefficients of the Lagrangian interpolation polynomial for n nodes and n values is of order n log n. Proving in this paper a more general theorem with respect to the complexity bounds of the tasks of computing the coefficients of the Lagrangian interpolation polynomials, the author derives from this the previous result about the complexity order n log n.
0 references
coefficients of the Lagrangian interpolation polynomial
0 references
complexity bounds
0 references
0 references
