In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the approximation quality obtained by Newton interpolation with Fast Leja (FL) points is competitive to the use of Chebyshev nodes, even for extremely high degree interpolation. This is an experimental account of the analytic result that the limit distribution of FL points and Chebyshev nodes is the same when letting the number of points go to infinity. Since the FL construction is easy to perform and allows to add interpolation nodes on the fly in contrast to the use of Chebyshev nodes, our study suggests that Newton interpolation with FL points is currently the most efficient numerical technique for polynomial interpolation. Moreover, we give numerical evidence that any reasonable function can be approximated up to machine accuracy by Newton interpolation with FL points if desired, which shows the potential of this method.
Bivariate Quasi-Tower Sets and Their Associated Lagrange Interpolation Bases
School of Mathemathics, Key Lab. of Symbolic Computation and Knowledge Engineering (Ministry of Education), Jilin University(吉林大学数学学院,符号计算与知识工程教育部重点实验室)
School of Mathematical Sciences and Fujian Provincial Key Laboratory of Mathematical Modeling and High-Performance Scientific Computation, Xiamen University(厦门大学数学科学学院、福建省数学建模与高性能科学计算重点实验室)
Numerical Stability on Local Integral Methods using RBF-QR
Faculty of Exact Sciences, Engineering and Surveying,National University of Rosario(罗萨里奥国立大学精确科学、工程与测量学院);French Argentine International Centerfor Information and Systems Sciences,UAM (France)/UNR-CONICET(法阿国际信息与系统科学中心,法国UAM/罗萨里奥国立大学-阿根廷国家科学研究委员会)