A comparison of algorithms for polynomial interpolation

DOI10.1016/0771-050X(82)90051-1MaRDI QIDQ1169244zbMATH OpenFDO

Authors Allan J. MacLeod

Publication date 1982

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

efficiencystabilityLagrangianbarycentriccomparison of algorithmsAitkenKroghmodified AitkenNeville

Mathematics Subject Classification ID

Numerical interpolation (65D05)

Recommendations

• Publication:4945930
• A new efficient algorithm for polynomial interpolation
• scientific article; zbMATH DE number 2087114
• Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
• Publication:3469655

Cites work

• On Interpolation by Iteration of Proportional Parts, without the Use of Differences

Cited in

(13)

• scientific article; zbMATH DE number 1424904 (Why is no real title available?)
• Comparison of spline and Lagrangian interpolation
• A Note on Polynomial Interpolation
• Lagrange multivariate polynomial interpolation: a random algorithmic approach
• Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
• A new efficient algorithm for polynomial interpolation
• Rounding error analysis of interpolation procedures
• A parallel method for fast and practical high-order Newton interpolation
• Linear combination of independent exponential random variables
• scientific article; zbMATH DE number 4162155 (Why is no real title available?)
• scientific article; zbMATH DE number 4024619 (Why is no real title available?)
• scientific article; zbMATH DE number 3883487 (Why is no real title available?)
• Some comments on a paper by Macleod on Lagrangian interpolation

This page was built for publication: A comparison of algorithms for polynomial interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1169244)