...
首页> 外文期刊>International journal of computer mathematics >Optimal Newton-Secant like methods without memory for solving nonlinear equations with its dynamics
【24h】

Optimal Newton-Secant like methods without memory for solving nonlinear equations with its dynamics

机译:无需记忆的最优牛顿-割线法,可解决非线性方程组的动力学问题

获取原文
获取原文并翻译 | 示例

摘要

We construct two optimal Newton-Secant like iterative methods for solving nonlinear equations. The proposed classes have convergence order four and eight and cost only three and four function evaluations per iteration, respectively. These methods support the Kung and Traub conjecture and possess a high computational efficiency. The new methods are illustrated by numerical experiments and a comparison with some existing optimal methods. We conclude with an investigation of the basins of attraction of the solutions in the complex plane.
机译:我们构造了两个最优的类似于牛顿-割线的迭代方法来求解非线性方程。所提出的类的收敛阶数为4和8,每次迭代分别仅花费3和4个函数求值。这些方法支持Kung和Traub猜想,并具有很高的计算效率。通过数值实验说明了新方法,并与一些现有的最佳方法进行了比较。最后,我们对复杂平面中解的吸引盆地进行了研究。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号