Derivative free two-point methods with and without memory for solving nonlinear equations

作者:

Highlights:

摘要

Two families of derivative free two-point iterative methods for solving nonlinear equations are constructed. These methods use a suitable parametric function and an arbitrary real parameter. It is proved that the first family has the convergence order four requiring only three function evaluations per iteration. In this way it is demonstrated that the proposed family without memory supports the Kung–Traub hypothesis (1974) on the upper bound 2n of the order of multipoint methods based on n + 1 function evaluations. Further acceleration of the convergence rate is attained by varying a free parameter from step to step using information available from the previous step. This approach leads to a family of two-step self-accelerating methods with memory whose order of convergence is at least 2+5≈4.236 and even 2+6≈4.449 in special cases. The increase of convergence order is attained without any additional calculations so that the family of methods with memory possesses a very high computational efficiency. Numerical examples are included to demonstrate exceptional convergence speed of the proposed methods using only few function evaluations.

论文关键词:Multipoint iterative methods,Nonlinear equations,Derivative free methods,Methods with memory,Computational efficiency

论文评审过程:Available online 30 June 2010.

论文官网地址:https://doi.org/10.1016/j.amc.2010.06.043