A study of accelerated Newton methods for multiple polynomial roots

We analyze and compare several accelerated Newton methods with built in multiplicity estimates. We also introduce the concept of indicator functions and discuss the Crouse-Putt method. It is shown that many of the accelerated Newton methods not only derive from Schröder’s classic approach but are equivalent. The related computational experiments show that the built in multiplicity estimates can significantly decrease the number of Newton iterations, while the error of these estimates may significantly increase.

[1]  C. W. Putt,et al.  Computer program to determine roots of polynomials by ratio of successive derivatives , 1972 .

[2]  J. McNamee.  A comparison of methods for accelerating convergence of Newton's method for multiple polynomial roots , 1998, SGNM.

[3]  Kenneth Steiglitz,et al.  Phase unwrapping by factorization , 1982 .

[4]  Victor Y. Pan,et al.  Numerical methods for roots of polynomials , 2007 .

[5]  John Reid,et al.  Fortran Subroutines for Finding Polynomial Zeros , 1975 .

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

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

[8]  K. Madsen.  A root-finding algorithm based on Newton's method , 1973 .

[9]  T. J. Ypma.  Finding a Multiple Zero by Transformations and Newton-Like Methods , 1983 .

[10]  P. Henrici,et al.  Elements of Numerical Analysis , 1966 .

[11]  H. Vel.  A method for computing a root of a single nonlinear equation, including its multiplicity , 2005, Computing.

[12]  Miguel Angel Hernández Verón,et al.  A note on Halley's method , 1991 .

[13]  G. W. Stewart,et al.  The behavior of a multiplicity independent root-finding scheme in the presence of error , 1980 .

[14]  Peter Kravanja,et al.  A Modification of Newton's Method for Analytic Mappings Having Multiple Zeros , 1999, Computing.

[15]  E. Bodewig,et al.  On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation , 1949 .

[16]  Joseph F. Traub,et al.  Principles for Testing Polynomial Zerofinding Programs , 1975, TOMS.

[17]  E. Hansen,et al.  Estimating the multiplicity of a root , 1976 .

[18]  L. B. Rall.  Convergence of the newton process to multiple solutions , 1966 .

[19]  J. Delahaye,et al.  Sequence Transformations , 1988 .

[20]  R. F. King,et al.  Improving the Van de Vel Root-Finding method , 1983, Computing.

[21]  Miguel Ángel Hernández,et al.  Indices of convexity and concavity. Application to Halley method , 1999, Appl. Math. Comput..

[22]  T. Ypma,et al.  Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation , 1997 .

[23]  Zhonggang Zeng.  Algorithm 835: MultRoot---a Matlab package for computing polynomial roots and multiplicities , 2004, TOMS.

[24]  Zhonggang Zeng.  Computing multiple roots of inexact polynomials , 2005, Math. Comput..

[25]  Naoki Osada,et al.  Improving the order of convergence of iteration functions , 1998 .

[26]  Rudolf Mathon,et al.  The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence , 1996, TOMS.

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

[28]  Tjalling Ypma,et al.  Relationships between order and efficiency of a class of methods for multiple zeros of polynomials , 1995 .

[29]  Markus Lang,et al.  A New and Efficient Program for Finding All Polynomial Roots , 1993 .