Safe convergence of simultaneous methods for polynomial zeros

Numerical Algorithms

Volumn 17, Issue 3-4, 1998, Pages 313-331

  Petković, Miodrag S ^a   Herceg, Dorde ^b   Ilić, Snežana ^a  

^a UNIVERSITY OF NI   (Serbia)

^b UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

Point estimation; Safe convergence; Simultaneous methods; Zeros of polynomials

Indexed keywords

EID: 0032372229     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1016688508558     Document Type: Article

References (24)

1. P. Chen, Approximate zeros of quadratically convergent algorithms, Math. Comp. 63 (1994) 247-270.
2. J.H. Curry, On zero finding methods of higher order from data at one point, J. Complexity 5 (1989) 219-237.
3. K. Dochev, Modified Newton method for the simultaneous approximate calculation of all roots of a given algebraic equation (in Bulgarian), Mat. Spis. B''lgar. Akad. Nauk 5 (1962) 136-139.
4. E. Durand, Solutions Numériques des Équations Algébraiques, Tom. I: Équations du Type F(x) = 0; Racines d'un Polynôme (Masson, Paris, 1960).
5. S. Kanno, N. Kjurkchiev and T. Yamamoto, On some methods for the simultaneous determination of polynomial zeros, Japan J. Indust. Appl. Math. 2 (1996) 267-288.
6. I.O. Kerner, Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen, Numer. Math. 8 (1966) 290-294.
7. M. Kim, Ph.D. thesis, City University of New York, New York (1985).
8. M. Kim, On approximate zeros and rootfinding algorithms for a complex polynomial, Math. Comp. 51 (1988) 707-719.
9. G.V. Milovanović, A method to accelerate iterative processes in Banach space, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 461-497 (1974) 67-71.
10. G.V. Milovanović and M.S. Petković, On the convergence order of a modified method for simultaneous finding polynomial zeros, Computing 30 (1983) 171-178.
11. A.W.M. Nourein, An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (an algorithm), J. Comput. Appl. Math. 3 (1977) 109-110.
12. M.S. Petković, On initial conditions for the convergence of simultaneous root finding methods, Computing 57 (1996) 163-177.
13. M.S. Petković, C. Carstensen and M. Trajković, Weierstrass' formula and zero-finding methods, Numer. Math. 69 (1995) 353-372.
14. M.S. Petković and D. Herceg, Börsch-Supan-like methods: Point estimation and parallel implementation, Internat. J. Comput. Math. 64 (1997) 327-341.
15. M.S. Petković, D. Herceg and S. Ilić, Point estimation and some applications to iterative methods, BIT 38 (1998) 111-126.
16. M.S. Petković and S. Ilić, Point estimation and the convergence of the Ehrlich-Aberth method, Publications de l'Institut Mathématique 62 (1997) 141-149.
17. M.S. Petković, M. Mignotte and M. Trajković, The root separation of polynomials and some applications, Z. Angew. Math. Mech. 75 (1995) 551-561.
18. M. Prešić, An iterative procedure for determination of k roots of a polynomial, Ph.D. thesis, University of Belgrade, Belgrade (1971) (in Serbian).
19. S. Smale, The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc. 4 (1981) 1-35.
20. S. Smale, Newton's method estimates from data at one point, in: The Merging Disciplines: New Directions in Pure, Applied and Computational Mathematics (Springer, New York, 1986) pp. 185-196.
21. K. Tanabe, Behavior of the sequences around multiple zeros generated by some simultaneous methods for solving algebraic equations, Tech. Rep. Inf. Procces. Numer. Anal. 4-2 (1983) 1-6 (in Japanese).
22. X. Wang and D. Han, On dominating sequence method in the point estimate and Smale's theorem, Sci. China Ser. A (1989) 905-913.
23. D. Wang and F. Zhao, The theory of Smale's point estimation and its application, J. Comput. Appl. Math. 60 (1995) 253-269.
24. F. Zhao and D. Wang, The theory of Smale's point estimation and the convergence of Durand-Kerner program, Math. Numer. Sinica 15 (1993) 196-206 (in Chinese).