A family of optimal three-point methods for solving nonlinear equations using two parametric functions

作者:

Highlights:

摘要

Using an interactive approach which combines symbolic computation and Taylor’s series, a wide family of three-point iterative methods for solving nonlinear equations is constructed. These methods use two suitable parametric functions at the second and third step and reach the eighth order of convergence consuming only four function evaluations per iteration. This means that the proposed family supports the Kung–Traub hypothesis (1974) on the upper bound 2m of the order of multipoint methods based on m + 1 function evaluations, providing very high computational efficiency. Different methods are obtained by taking specific parametric functions. The presented numerical examples demonstrate exceptional convergence speed with only few function evaluations.

论文关键词:Root solvers,Three-point iterative methods,Nonlinear equations,Optimal order of convergence,Computational efficiency

论文评审过程:Available online 21 February 2011.

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