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

基于求积的最优迭代方法

Quadrature based optimal iterative methods

Stord Haugesund University College(斯托德豪格松大学学院);Florida Institute of Technology(佛罗里达理工学院)

Sanjay K. Khattri, Ravi P. Agarwal

AI总结:

提出一种基于求积的简单且通用的方案来构造最优迭代方法,通过求积开发了四阶和八阶最优方法,并可与已知方法媲美。

摘要:

我们提出了一种简单而强大且适用的基于求积的方案,用于构造最优迭代方法。根据尚未证明的Kung-Traub猜想,基于$n+1$次评估的最优迭代方法可以达到最大收敛阶$2^n$。通过求积,我们开发了四阶和八阶的最优迭代方法。该方案可进一步应用于开发更高阶的迭代方法。计算结果表明,与许多已知方法相比,所开发的方法是高效的。

英文摘要:

We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve a maximum convergence order of $2^n$. Through quadrature, we develop optimal iterative methods of orders four and eight. The scheme can be further applied to develop iterative methods of even higher order. Computational results demonstrate that the developed methods are efficient as compared with many well known methods.

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

↑