arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.08839math.NAcs.NA
收藏

牛顿插值法在极高次插值中的数值研究

A Numerical Study of Newton Interpolation with Extremely High Degrees

Michael Breuß, Friedemann Kemm, Oliver Vogel

AI总结:

本文通过数值实验表明,使用快速Leja点的牛顿插值在高次插值中与切比雪夫节点的插值效果相当,且具有更便捷的构造方法和更高的实用性。

摘要:

目前教科书推荐使用切比雪夫节点进行牛顿插值,因其在逼近精度和计算努力方面最为高效。然而,我们通过数值实验表明,使用快速Leja(FL)点进行牛顿插值所获得的逼近质量与切比雪夫节点相当,甚至在极高次插值中也是如此。这是关于FL点和切比雪夫节点极限分布相同的解析结果的实验证明。由于FL构造简单且允许随时添加插值节点,与切比雪夫节点的使用相比,我们的研究表明,使用FL点的牛顿插值目前是多项式插值最有效的方法。此外,我们还提供了数值证据表明,任何合理的函数都可以通过使用FL点的牛顿插值近似到机器精度,这展示了该方法的潜力。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑