A family of simultaneous zero-finding methods

Computers and Mathematics with Applications

Volumn 34, Issue 10, 1997, Pages 49-59

  Petkovic M ^a   Ilic S ^a   Trickovic S ^a  

^a UNIVERSITY OF NI   (Serbia)

Author keywords

Convergence order; Iteration functions; Simultaneous methods; Zeros of polynomials

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ITERATIVE METHODS; POLYNOMIALS; PROBLEM SOLVING;

HANSEN PATRICK'S FORMULA; WEIERSTRASS' METHOD; ZERO FINDING METHODS;

POLES AND ZEROS;

EID: 0031272653     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(97)00206-X     Document Type: Article

References (19)

1. E. Hansen and M. Patrick, A family of root finding methods, Numer. Math. 27, 257-269, (1977).
2. E. Schröder, Über unendlich viele Algorithmen zur Auflösung der Gleichungen, Math. Ann. 2, 317-365, (1870).
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, 136-139, (1962).
4. I.O. Kerner, Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen, Numer. Math. 8, 290-294, (1966).
5. T. Yamamoto, S. Kanno and L. Atanassova, Validated computation of polynomial zeros by the Durand-Kerner method, In Topics in Validated Computations, (Edited by J. Herzberger), pp. 27-53, Elsevier Science B.V., (1994).
6. K. Weierstrass, Neuer Beweis des Satzes, dass jede ganze rationale Funktion einer Veränderlichen dargestellt werden kann als ein Produkt aus linearen Funktionen derselben Veränderlichen, Ges. Werke 3 (Johnson Reprint Corp., New York 1967), 251-269, (1903).
7. A.M. Ostrowski, Solution of Equations and Systems of Equations, Academic Press, New York, (1966).
8. G.H. Ellis and L.T. Watson, A parallel algorithm for simple roots of polynomials, Computers Math. Applic. 10 (2), 107-121, (1984).
9. W. Börsch-Supan, Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation, Numer. Math. 14, 287-296, (1970).
10. T. Sakurai and M.S. Petković, On some simultaneous methods based on Weierstrass' correction, J. Comput. Appl. Math. 72, 275-291, (1995).
11. I. Gargantini, Parallel Laguerre iterations: The complex case, Numer. Math. 26, 317-323, (1976).
12. M.S. Petković and L.V. Stefanović, On some improvements of square root iteration for polynomial zeros, J. Comput. Appl. Math. 15, 13-25, (1986).
13. T. Sakurai, T. Torii and H. Sugiura, A high-order iterative formula for simultaneous determination of zeros of a polynomial, J. Comput. Appl. Math. 38, 387-397, (1991).
14. I. Gargantini, Further applications of circular arithmetic: Schroeder-like algorithms with error bounds for finding zeros of polynomials, SIAM J. Numer. Anal. 15, 497-510, (1979).
15. O. Aberth, Iteration methods for finding all zeros of a polynomial simultaneously, Math. Comp. 27, 339-344, (1973).
16. L.W. Ehrlich, A modified Newton method for polynomials, Comm. ACM 10, 107-108, (1967).
17. V. H. Maehly, Zur iterativen Auflösung algebraischer Gleichungen, Z. Angew. Math. Phys. 5, 260-263, (1954).
18. M.S. Petković, Iterative Methods for Simultaneous Inclusion of Polynomial Zeros, Springer-Verlag, Berlin, (1989).
19. P. Henrici, Applied and Computational Complex Analysis, Vol. I, John Wiley and Sons, New York, (1974).