On the efficiency index of one-point iterative processes

摘要

In this paper, we analyze the index of efficiency of one-point iterative processes, which are in practice the most used methods to solve a nonlinear equation. We obtain the best situation for one-point iterative processes with cubic convergence: Chebyshev’s method, Halley’s method, the super-Halley method and many others classical iterative methods with order of convergence three. By means of a construction of particular multipoint iterations, we get to improve the best situation obtained for one-point methods. Moreover, these type of multipoint iterations, can be considered as quasi-one-point iterations, since they only depend on one initial approximation. Numerical examples are given and the computed results support this theory.