Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A comparison of algorithms for polynomial interpolation

From MaRDI portal
Publication:1169244
Jump to:navigation, search

DOI10.1016/0771-050X(82)90051-1zbMath0494.65006MaRDI QIDQ1169244

Allan J. MacLeod

Publication date: 1982

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


zbMATH Keywords

stabilityefficiencyLagrangiancomparison of algorithmsbarycentricAitkenKroghmodified AitkenNeville


Mathematics Subject Classification ID

Numerical interpolation (65D05)


Related Items

Some comments on a paper by Macleod on Lagrangian interpolation ⋮ Comparison of spline and Lagrangian interpolation ⋮ Lagrange multivariate polynomial interpolation: a random algorithmic approach ⋮ Rounding error analysis of interpolation procedures ⋮ A parallel method for fast and practical high-order Newton interpolation ⋮ Linear combination of independent exponential random variables



Cites Work

  • On Interpolation by Iteration of Proportional Parts, without the Use of Differences
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1169244&oldid=13234573"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki