Roundoff Error Analysis of Algorithms for Polynomial Interpolation

Abstract:

      The condition of a polynomial interpolation operator and the numerical stabi-lity of an algorithm for polynomial interpolation are defined. The main result is that both Newton and Lagrange interpolation algorithms are numerically stable provided that the nodes are evenly distributed, but the extrapolation computation of these methods will lose the accuracy whatever the nodes are.