On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros

References

• McNamee , J. M. (1993) . A bibliography on roots of polynomials . J. Comput. Appl. Math. , 47 : 391 – 394 .
   Google Scholar
• Cosnard , M. and Fraigniaud , P. (1990) . Finding the roots of a polynomial on an MIMD multicomputer . Parallel Computing , 15 : 75 – 85 .
   Web of Science ®Google Scholar
• Kanno , S. , Kjurkchiev , N. and Yamamoto , T. (1995) . On some methods for the simultaneous determination of polynomial zeros . Japan J. Industr. Appl. Math. , 13 : 267 – 288 .
   Google Scholar
• Petković M. S. (1989) Iterative Methods for Simultaneous Inclusion of Polynomial Zeros Springer-Verlag Berlin-Heidelberg-New York
   Google Scholar
• Petković M. S. Herceg Đ. Ilić S. (1997) Point Estimation Theory and its Applications Institute of Mathematics, University of Novi Sad Novi Sad
   Google Scholar
• Sendov Bl. Andreev A. Kjurkchiev N. (1994) Numerical solution of polynomial equations Handbook of Numerical Analysis III Elsevier Science New York
   Google Scholar
• Aberth , O. (1993) . Iteration, methods for finding all zeros of a polynomial simultaneously . Math. Comp. , 27 : 339 – 344 .
   Google Scholar
• Ehrlich , L. W. (1967) . A modified Newton method for polynomials . Comm. ACM , 10 : 107 – 108 .
   Google Scholar
• Zheng , S. and Sun , F. (1999) . Some simultaneous iterations for finding all zeros of a polynomial with high order of convergence . Appl. Math. Comput. , 99 : 233 – 240 .
   Google Scholar
• Börsch-Supan , W. (1963) . A posteriori error bounds for the zeros of polynomials . Numer. Math. , 5 : 380 – 398 .
   Google Scholar
• Braess , D. and Hadeler , K. P. (1973) . Simultaneous inclusion of the zeros of a polynomial . Numer. Math. , 21 : 161 – 165 .
   Web of Science ®Google Scholar
• Nourein , A. W. M. (1975) . An iteration formula for the simultaneous determination of the zeroes of a polynomial . J. Comput. Appl. Math. , 4 : 251 – 254 .
   Google Scholar
• Börsch-Supan , W. (1970) . Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation . Numer. Math. , 14 : 287 – 296 .
   Google Scholar
• Petković , M. S. , Ilić , S. and Tri[cbreve]ković , S. (1997) . A family of simultaneous zero-finding methods . Comput. Math. Appl. , 34 : 49 – 59 .
   Google Scholar
• Ellis , G. H. and Watson , L. T. (1984) . A parallel algorithm for simple roots of polynomials . Comput. Math. Appl. , 2 : 107 – 121 .
   Google Scholar
• Carstensen , C. (1993) . On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials . BIT , 33 : 64 – 73 .
   Google Scholar
• Smale , S. (1981) . The fundamental theorem of algebra and complexity theory . Bull. Amer. Math. Soc. , 4 : 1 – 35 .
   Web of Science ®Google Scholar
• Smale S. (1986) Newton's method estimates from data at one point In: The Merging Disciplines: New Directions in Pure Applied and Computational Mathematics Springer-Verlag New York pp. 185–196
   Google Scholar
• Petković , M. S. and Herceg , Đ. (2001) . Point estimation of simultaneous methods for solving polynomial equations: a survey . J. Comput. Appl. Math. , 136 : 183 – 207 .
   Google Scholar
• Petković , M. S. , Herceg , Đ. and Ilić , S. (1998) . Safe convergence of simultaneous methods for polynomial zeros . Numerical Algorithms , 17 : 313 – 332 .
   Web of Science ®Google Scholar
• Wang , D. and Zhao , F. (1991) . On the determination of the safe initial approximation for the Durand-Kerner algorithm . J. Comput. Appl. Math. , 38 : 447 – 456 .
   Google Scholar
• Wang , D. and Zhao , F. (1995) . The theory of Smale's point estimation its application . J. Comput. Appl. Math. , 60 : 253 – 269 .
   Web of Science ®Google Scholar
• Nourein , A. W. M. (1977) . An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial . Intern. J. Comput. Math. , 6 : 241 – 252 .
   Google Scholar
• Wang , X. and Zheng , S. (1984) . A family of parallel and interval iterations for finding all roots of a polynomial simultaneously with rapid convergence (I) . J. Comput. Math. , 1 : 70 – 76 .
   Google Scholar