A third-order modification of Newton's method for multiple roots

In this paper, we present a new third-order modification of Newton's method for multiple roots, which is based on existing third-order multiple root-finding methods. Numerical examples show that the new method is competitive to other methods for multiple roots.

[1]  Gerald S. Shedler,et al.  Parallel numerical methods for the solution of equations , 1967, CACM.

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

[3]  Beny Neta,et al.  High-order nonlinear solver for multiple roots , 2008, Comput. Math. Appl..

[4]  Takahiko Murakami.  Some Fifth Order Multipoint Iterative Formulae for Solving Equations , 1978 .

[5]  E. Hansen,et al.  A family of root finding methods , 1976 .

[6]  Changbum Chun,et al.  A simply constructed third-order modifications of Newton's method , 2008 .

[7]  R. F. King.  A Family of Fourth Order Methods for Nonlinear Equations , 1973 .

[8]  Naoki Osada,et al.  An optimal multiple root-finding method of order three , 1994 .

[9]  P. Jarratt,et al.  Multipoint Iterative Methods for Solving Certain Equations , 1966, Comput. J..

[10]  Beny Neta,et al.  A higher order method for multiple zeros of nonlinear functions , 1983 .

[11]  Beny Neta,et al.  Extension of Murakami's high-order non-linear solver to multiple roots , 2010, Int. J. Comput. Math..

[12]  Chen Dong,et al.  A family of multiopoint iterative functions for finding multiple roots of equations , 1987 .

[13]  Darren Redfern,et al.  The Maple handbook , 1994 .

[14]  David A. Redfern,et al.  The Maple Handbook: Maple V Release 3 , 1995 .

[15]  P. Jarratt.  Some fourth order multipoint iterative methods for solving equations , 1966 .

[16]  Beny Neta,et al.  New third order nonlinear solvers for multiple roots , 2008, Appl. Math. Comput..

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