一种基于Kung和Traub方法的最优八阶迭代类方法及其动力学
An optimal class of eighth-order iterative methods based on Kung and Traub's method with its dynamics
AI总结:
本文提出一种无需记忆的三阶迭代方法,用于求解单变量非线性方程,具有八阶收敛性,仅需四次函数评估,验证了Kung-Traub猜想。通过构造、收敛性分析和数值实现,对比了其他最优八阶方法的精度和吸引盆地。
摘要:
在本文中,我们提出了一种基于Kung和Traub方法的三阶无记忆迭代方法,用于求解单变量非线性方程。所提出的方法具有八阶收敛性,并且每次迭代仅需四次函数评估,支持Kung-Traub关于最优收敛阶的猜想。因此,该方法具有非常高的计算效率。我们给出了该方法的构造、收敛性分析和数值实现。此外,还将对一些测试问题中与其他现有最优八阶方法在精度和吸引盆地方面的比较进行说明。
英文摘要:
In this paper, we present a three-point without memory iterative method based on Kung and Traub's method for solving non-linear equations in one variable. The proposed method has eighth-order convergence and costs only four function evaluations each iteration which supports the Kung-Traub conjecture on the optimal order of convergence. Consequently, this method possesses very high computational efficiency. We present the construction, the convergence analysis, and the numerical implementation of the method. Furthermore, comparisons with some other existing optimal eighth-order methods concerning accuracy and basins of attraction for several test problems will be given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。