On an efficient inclusion method for finding polynomial zeros

New efficient iterative method of Halley's type for the simultaneous inclusion of all simple complex zeros of a polynomial is proposed. The presented convergence analysis, which uses the concept of the R -order of convergence of mutually dependent sequences, shows that the convergence rate of the basic fourth order method is increased from 4 to 9 using a two-point correction. The proposed inclusion method possesses high computational efficiency since the increase of convergence is attained with only one additional function evaluation per sought zero. Further acceleration of the proposed method is carried out using the Gauss-Seidel procedure. Some computational aspects and three numerical examples are given in order to demonstrate high computational efficiency and the convergence properties of the proposed methods.

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

[2]  Miodrag S. Petkovic,et al.  Halley-Like Method with Corrections for the Inclusion of Polynomial Zeros , 1999, Computing.

[3]  Miodrag S. Petkovic,et al.  Multipoint methods for solving nonlinear equations: A survey , 2014, Appl. Math. Comput..

[4]  Miodrag S. Petković,et al.  On Halley-like algorithms for simultaneous approximation of polynomial complex zeros , 1989 .

[5]  L. Jay,et al.  A Note on Q-order of Convergence , 2001 .

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

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

[8]  Miodrag S. Petkovic,et al.  Higher Order Methods for the Inclusion of Multiple Zeros of Polynomials , 2011, Reliab. Comput..

[9]  G. Alefeld,et al.  Introduction to Interval Computation , 1983 .

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

[11]  Carsten Carstensen,et al.  An improvement of Gargantini's simultaneous inclusion method for polynomial roots by Schro¨der's correction , 1994 .

[12]  Miodrag S. Petković,et al.  Complex Interval Arithmetic and Its Applications , 1998 .

[13]  Irene Gargantini,et al.  The numerical stability of simultaneous iterations via square-rooting , 1979 .

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

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

[16]  Jürgen Herzberger.  On theQ-order of convergence for coupled sequences arising in iterative numerical processes , 2005, Computing.

[17]  Miodrag S. Petkovic,et al.  Improved Halley-like methods for the inclusion of polynomial zeros , 2005, Appl. Math. Comput..

[18]  Irene Gargantini,et al.  Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials , 1978 .

[19]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

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

[21]  Miodrag S. Petković,et al.  The numerical stability of the generalised root iterations for polynomial zeros , 1984 .