A family of three-point methods of optimal order for solving nonlinear equations
作者:
Highlights:
•
摘要
A family of three-point iterative methods for solving nonlinear equations is constructed using a suitable parametric function and two arbitrary real parameters. It is proved that these methods have the convergence order eight requiring only four function evaluations per iteration. In this way it is demonstrated that the proposed class of methods supports the Kung–Traub hypothesis (1974) [3] on the upper bound 2n of the order of multipoint methods based on n+1 function evaluations. Consequently, this class of root solvers possesses very high computational efficiency. Numerical examples are included to demonstrate exceptional convergence speed with only few function evaluations.
论文关键词:65H05,Multipoint iterative methods,Nonlinear equations,Optimal order of convergence,Computational efficiency,Kung–Traub’s conjecture
论文评审过程:Received 14 June 2009, Revised 3 September 2009, Available online 12 October 2009.
论文官网地址:https://doi.org/10.1016/j.cam.2009.10.012