...
首页> 外文期刊>Advances in numerical analysis >An Efficient Family of Root-Finding Methods with Optimal Eighth-Order Convergence
【24h】

An Efficient Family of Root-Finding Methods with Optimal Eighth-Order Convergence

机译:具有最佳八阶收敛性的有效寻根方法族

获取原文
   

获取外文期刊封面封底 >>

       

摘要

We derive a family of eighth-order multipoint methods for the solution of nonlinear equations. In terms of computational cost, the family requires evaluations of only three functions and one first derivative per iteration. This implies that the efficiency index of the present methods is 1.682. Kung and Traub (1974) conjectured that multipoint iteration methods without memory based on n evaluations have optimal order2n-1. Thus, the family agrees with Kung-Traub conjecture for the casen=4. Computational results demonstrate that the developed methods are efficient and robust as compared with many well-known methods.
机译:我们推导出了一系列的八阶多点方法来求解非线性方程。就计算成本而言,该系列仅需要评估三个函数,并且每次迭代需要一个一阶导数。这意味着本方法的效率指数为1.682。 Kung和Traub(1974)推测,基于n个评估而没有记忆的多点迭代方法具有最优order2n-1。因此,对于casen = 4,家庭同意Kung-Traub猜想。计算结果表明,与许多众所周知的方法相比,所开发的方法是有效且稳健的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号