Roundoff Error Analysis of Algorithms for Polynomial Interpolation
Received:January 16, 1989  
Key Word:   
Fund ProjectL:The project supported by National Natural Science Foundation of China.
Author NameAffiliation
Huamg Kaibing Dept. Math.
Nanjing Normal University 
Li Zhilin Dept. Math.
Nanjing Normal University 
Hits: 1471
Download times: 685
      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.
View Full Text  View/Add Comment  Download reader