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

任意函数的多项式逼近

A Polynomial Approximation for Arbitrary Functions

Boston University(波士顿大学);Harvard Medical School(哈佛医学院);Spaulding Rehabilitation Hospital(斯波丁康复医院)

Michael A. Cohen, Can Ozan Tan

AI总结:

提出一种类似泰勒展开的勒让德多项式展开,用于逼近任意函数,证明其系数收敛更快且误差更小。

摘要:

我们描述了一种勒让德多项式的展开,类似于泰勒展开,用于逼近任意函数。我们证明了勒让德展开中的多项式系数,因此整个级数,比同阶泰勒展开收敛到零快得多。此外,通过使用六阶多项式展开的数值分析,我们证明了勒让德多项式逼近产生的误差比类似的泰勒级数逼近至少小一个数量级。这强烈表明,当全局精度重要时,应使用勒让德展开而不是泰勒展开。

英文摘要:

We describe an expansion of Legendre polynomials, analogous to the Taylor expansion, to approximate arbitrary functions. We show that the polynomial coefficients in Legendre expansion, therefore the whole series, converge to zero much more rapidly compared to the Taylor expansion of the same order. Furthermore, using numerical analysis using sixth-order polynomial expansion, we demonstrate that the Legendre polynomial approximation yields an error at least an order of magnitude smaller than the analogous Taylor series approximation. This strongly suggests that Legendre expansions, instead of Taylor expansions, should be used when global accuracy is important.

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

↑