Variants of a classic Traub's result

We present a generalization of a modification of a classic Traub's result, which allows constructing, from a given iterative method with order of convergence p, efficient iterative methods with order of convergence at least pq+1 (q@?p-1, q@?N).

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

[2]  Ernst Schröder,et al.  Ueber unendlich viele Algorithmen zur Auflösung der Gleichungen , 1870 .

[3]  Miquel Grau-Sánchez,et al.  A variant of Cauchy's method with accelerated fifth-order convergence , 2004, Appl. Math. Lett..

[4]  A. Ralston.  A first course in numerical analysis , 1965 .

[5]  Sunethra Weerakoon,et al.  A variant of Newton's method with accelerated third-order convergence , 2000, Appl. Math. Lett..

[6]  M. V Mederos,et al.  Gautschi, Walter. Numerical analysis: an introduction, Birkhäuser, 1997 , 1999 .

[7]  J. Traub.  Iterative Methods for the Solution of Equations , 1982 .

[8]  José Antonio Ezquerro,et al.  A discretization scheme for some conservative problems , 2000 .

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

[10]  Miquel Grau-Sánchez,et al.  Some variants of the Chebyshev–Halley family of methods with fifth order of convergence , 2010, Int. J. Comput. Math..

[11]  A. Householder.  Solution of Equations and Systems of Equations (A. M. Ostrowski) , 1967 .

[12]  A. Householder.  The numerical treatment of a single nonlinear equation , 1970 .

[13]  José Luis Díaz-Barrero,et al.  An improvement of the Euler-Chebyshev iterative method , 2006 .

[14]  W. Gautschi.  Numerical analysis: an introduction , 1997 .