On an efficient simultaneous method for finding polynomial zeros

Abstract A new iterative method for the simultaneous determination of simple zeros of algebraic polynomials is stated. This method is more efficient compared to the all existing simultaneous methods based on fixed point relations. A very high computational efficiency is obtained using suitable corrections resulting from the Kung–Traub three-step method of low computational complexity. The presented convergence analysis shows that the convergence rate of the basic third order method is increased from 3 to 10 using this special type of corrections and applying 2 n additional polynomial evaluations per iteration. Some computational aspects and numerical examples are given to demonstrate a very fast convergence and high computational efficiency of the proposed zero-finding method.

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

[2]  Beny Neta,et al.  Multipoint Methods for Solving Nonlinear Equations , 2012 .

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

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

[5]  Yu-Jiang Wu,et al.  Some modifications of the parallel Halley iteration method and their convergence , 1987, Computing.

[6]  H. T. Kung,et al.  Optimal Order of One-Point and Multipoint Iteration , 1974, JACM.

[7]  Richard P. Brent,et al.  Modern Computer Arithmetic , 2010 .

[8]  Miodrag S. Petkovic,et al.  The improved Farmer–Loizou method for finding polynomial zeros , 2012, Int. J. Comput. Math..

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

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

[11]  Qing-biao Wu,et al.  Convergence ball and error analysis of Ostrowski-Traub’s method , 2010 .

[12]  P. Henrici,et al.  Circular arithmetic and the determination of polynomial zeros , 1971 .

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

[14]  Miodrag S. Petković,et al.  Families of optimal multipoint methods for solving nonlinear equations: A survey , 2010 .

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

[16]  Louis W. Ehrlich,et al.  A modified Newton method for polynomials , 1967, CACM.