论文信息 - On the Local Convergence of a Third Order Family of Iterative Processes

On the Local Convergence of a Third Order Family of Iterative Processes

Efficiency is generally the most important aspect to take into account when choosing an iterative method to approximate a solution of an equation, but is not the only aspect to consider in the iterative process. Another important aspect to consider is the accessibility of the iterative process, which shows the domain of starting points from which the iterative process converges to a solution of the equation. So, we consider a family of iterative processes with a higher efficiency index than Newton’s method. However, this family of proecsses presents problems of accessibility to the solution x∗. From a local study of the convergence of this family, we perform an optimization study of the accessibility and obtain iterative processes with better accessibility than Newton’s method.

Miguel Ángel Hernández | Natalia Romero Álvarez

[1] Alicia Cordero,et al. Efficient high-order methods based on golden ratio for nonlinear systems , 2011, Appl. Math. Comput..

[2] A. Ostrowski. Solution of equations and systems of equations , 1967 .

[3] Miguel Ángel Hernández,et al. An optimization of Chebyshev's method , 2009, J. Complex..

[4] José Luis Díaz-Barrero,et al. On computational efficiency for multi-precision zero-finding methods , 2006, Appl. Math. Comput..

[5] Miquel Grau-Sánchez,et al. Improvements of the efficiency of some three-step iterative like-Newton methods , 2007, Numerische Mathematik.

[6] José Antonio Ezquerro,et al. Improving the efficiency index of one-point iterative processes , 2009 .

[7] John E. Dennis,et al. Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.