The Polynomial Pivots as Initial Values for a New Root-Finding Iterative Method

A new iterative method for polynomial root-finding based on the development of two novel recursive functions is proposed. In addition, the concept of polynomial pivots associated with these functions is introduced. The pivots present the property of lying close to some of the roots under certain conditions; this closeness leads us to propose them as efficient starting points for the proposed iterative sequences. Conditions for local convergence are studied demonstrating that the new recursive sequences converge with linear velocity. Furthermore, an a priori checkable global convergence test inside pivots-centered balls is proposed. In order to accelerate the convergence from linear to quadratic velocity, new recursive functions together with their associated sequences are constructed. Both the recursive functions (linear) and the corrected (quadratic convergence) are validated with two nontrivial numerical examples. In them, the efficiency of the pivots as starting points, the quadratic convergence of the proposed functions, and the validity of the theoretical results are visualized.

[1]  Victor Y. Pan,et al.  Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding , 2002, J. Symb. Comput..

[2]  John Michael McNamee.  An updated supplementary bibliography on roots of polynomials , 1999 .

[3]  Emilio Defez,et al.  Analytic-numerical solutions with a priori error bounds for time-dependent mixed partial differential problems , 1997 .

[4]  W. Marsden.  I and J , 2012 .

[5]  Mansor Monsi.  The Point Symmetric Single-Step Procedure for the Simultaneous Approximation of Polynomial Zeros , 2012 .

[6]  Victor Y. Pan,et al.  Efficient polynomial root-refiners: A survey and new record efficiency estimates , 2012, Comput. Math. Appl..

[7]  V. Pan,et al.  Improved initialization of the accelerated and robust QR-like polynomial root-finding. , 2004 .

[8]  V. Pan.  Optimal and nearly optimal algorithms for approximating polynomial zeros , 1996 .

[9]  Mario Lázaro,et al.  Computation of eigenvalues in proportionally damped viscoelastic structures based on the fixed-point iteration , 2012, Appl. Math. Comput..

[10]  J. Stoer,et al.  Introduction to Numerical Analysis , 2002 .

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

[12]  Slobodan Ilic,et al.  The guaranteed convergence of Laguerre-like method , 2003 .

[13]  A. Ostrowski.  Solution of equations in Euclidean and Banach spaces , 1973 .

[14]  J. F. Steffensen.  Remarks on iteration. , 1933 .

[15]  Dorde Herceg,et al.  Point estimation of a family of simultaneous zero-finding methods , 1998 .

[16]  Victor Y. Pan,et al.  New progress in real and complex polynomial root-finding , 2011, Comput. Math. Appl..

[17]  Zhan Zhou,et al.  Global attractivity of neutral difference equations , 1998 .

[18]  Ling Zhu.  On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial , 2004, Appl. Math. Comput..

[19]  Nikolay Kyurkchiev,et al.  Initial Approximations and Root Finding Methods , 1998 .

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

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

[22]  C. Kelley.  Iterative Methods for Linear and Nonlinear Equations , 1987 .

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

[24]  M. S. Petkovi,et al.  A family of root-finding methods with accelerated convergence , 2006 .

[25]  J. McNamee.  A supplementary bibliography On roots of polynomials , 1997 .

[26]  Jean-Michel Muller,et al.  Choosing starting values for certain Newton-Raphson iterations , 2006, Theor. Comput. Sci..

[27]  N. Kjurkchiev.  Initial approximations in Euler-Chebyshev's method , 1995 .

[28]  Ling Zhu.  On the convergent conditions of Durand-Kerner method in parallel circular iteration of single-step and double-step , 2004, Appl. Math. Comput..

[29]  R. M. McLeod,et al.  Mean Value Theorems for Vector Valued Functions , 1965, Proceedings of the Edinburgh Mathematical Society.

[30]  J. McNamee.  A 2002 update of the supplementary bibliography on roots of polynomials , 2002 .

[31]  J. Hubbard,et al.  How to find all roots of complex polynomials by Newton’s method , 2001 .

[32]  Miodrag S. Petković,et al.  A family of simultaneous zero-finding methods , 1997 .

[33]  Victor Y. Pan,et al.  Solving a Polynomial Equation: Some History and Recent Progress , 1997, SIAM Rev..

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

[35]  Nasruddin Hassan,et al.  The Point Zoro Symmetric Single-Step Procedure for Simultaneous Estimation of Polynomial Zeros , 2012, J. Appl. Math..

[36]  Saeid Saidanlu,et al.  Choosing Improved Initial Values for Polynomial Zerofinding in Extended Newbery Method to Obtain Convergence , 2012, J. Appl. Math..

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

[38]  Ling Zhu.  On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial, II , 2005, Appl. Math. Comput..

[39]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[40]  Peter Henrici,et al.  Finding zeros of a polynomial by the Q-D algorithm , 1965, CACM.