On the new fourth-order methods for the simultaneous approximation of polynomial zeros

A new iterative method of the fourth-order for the simultaneous determination of polynomial zeros is proposed. This method is based on a suitable zero-relation derived from the fourth-order method for a single zero belonging to the Schroder basic sequence. One of the most important problems in solving polynomial equations, the construction of initial conditions that enable both guaranteed and fast convergence, is studied in detail for the proposed method. These conditions are computationally verifiable since they depend only on initial approximations, the polynomial coefficients and the polynomial degree, which is of practical importance. The construction of improved methods in ordinary complex arithmetic and complex circular arithmetic is discussed. Finally, numerical examples and the comparison with existing fourth-order methods are given.

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

[2]  W. Deren,et al.  The theory of Smale's point estimation and its applications , 1995 .

[3]  M. Petkovic,et al.  Point estimation of simultaneous methods for solving polynomial equations , 2007 .

[4]  Abdel Wahab M. Anourein.  An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial , 1977 .

[5]  Oliver Aberth,et al.  Iteration methods for finding all zeros of a polynomial simultaneously , 1973 .

[6]  Miodrag S. Petković,et al.  Point Estimation of Root Finding Methods , 2008 .

[7]  Shiming Zheng,et al.  Some simultaneous iterations for finding all zeros of a polynomial with high order convergence , 1999, Appl. Math. Comput..

[8]  Richard E. Ewing,et al.  "The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics" , 1986 .

[9]  S. Smale.  Newton’s Method Estimates from Data at One Point , 1986 .

[10]  Miodrag S. Petković,et al.  Iterative Methods for Simultaneous Inclusion of Polynomial Zeros , 1989 .

[11]  Carsten Carstensen,et al.  Some improved inclusion methods for polynomial roots with Weierstrass' corrections , 1993 .

[12]  Carsten Carstensen.  On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials , 1993 .

[13]  M. Petkovic,et al.  On the convergence order of accelerated root iterations , 1984 .

[14]  Miodrag S. Petkovic,et al.  Chebyshev‐like root‐finding methods with accelerated convergence , 2009, Numer. Linear Algebra Appl..

[15]  Immo O. Kerner,et al.  Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen , 1966 .

[16]  S. Smale.  The fundamental theorem of algebra and complexity theory , 1981 .

[17]  Miodrag S. Petkovic,et al.  Safe convergence of simultaneous methods for polynomial zeros , 2004, Numerical Algorithms.

[18]  Henry C. Thacher,et al.  Applied and Computational Complex Analysis. , 1988 .

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

[20]  A. W. Nourein.  An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (An algorithm) , 1977 .

[21]  Petko D. Proinov.  New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems , 2010, J. Complex..

[22]  J. McNamee.  A bibliography on roots of polynomials , 1993 .