Enclosing clusters of zeros of polynomials

Journal of Computational and Applied Mathematics

Volumn 156, Issue 2, 2003, Pages 389-401

  Neumaier, Arnold ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Eigenvalue problem; Gerschgorin disk; Multiple roots; Polynomial zeros; Root cluster; Rouch 's theorem

Indexed keywords

APPROXIMATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; THEOREM PROVING;

PARTIAL FRACTION EXPANSION;

POLYNOMIALS;

MATHEMATICAL ANALYSIS;

EID: 0042342393     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(03)00380-7     Document Type: Article

References (35)

1. P. Batra, Abschätzungen und Iterationsverfahren für Polynom-Nullstellen, Dissertation, Technische Univ. Hamburg-Harburg, 1999.
2. Bauhuber F. Direkte Verfahren zur Berechnung der Nullstellen von Polynomen Computing 5 1970 97-118
3. Bell H.E. Gershgorin's theorem and the zeros of polynomials Amer. Math. Monthly 72 1965 292-295
4. Börsch-Supan W. Residuenabschätzungen für Polynom-Nullstellen mittels Lagrange-Interpolation Numer. Math. 14 1970 287-296
5. Braess D. Hadeler K.P. Simultaneous inclusion of the zeros of a polynomial Numer. Math. 21 1973 161-165
6. Bunch J.R. Nielsen C.P. Sorensen D.C. Rank one modification of the symmetric eigenproblem Numer. Math. 31 1978 31-48
7. Carstensen C. Anwendungen von Begleitmatrizen Z. Angew. Math. Mech. 71 1991 T809-T812
8. Carstensen C. Inclusion of the roots of a polynomial based on Gershgorin's theorem Numer. Math. 59 1991 349-360
9. Carstensen C. Stein E. Über die Falksche ECP-transformation und Verallgemeinerungen Z. Angew. Math. Mech. 69 1989 375-391
10. Cuppen J.J.M. A divide and conquer method for the symmetric tridiagonal eigenproblem Numer. Math. 36 1981 177-195
11. I.E. Durand, Solutions Numérique des Équations Algébriques. Tome I: Équations du Type F(x)=0, Racines d'une Polynôme Masson, Paris, 1960, pp. 279-281.
12. Elsner L. A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem Numer. Math. 21 1973 425-427
13. Gargantini I. Henrici P. Circular arithmetic and the determination of polynomial zeros Numer. Math. 18 1972 305-320
14. Golub G.H. Some modified matrix eigenvalue problems SIAM Rev. 15 1973 318-344
15. Gu M. Eisenstat S.C. Stable and efficient algorithm for the rank one modification of the symmetric eigenproblem SIAM J. Matrix Anal. Appl. 15 1994 1266-1276
16. Henrici P. Uniformly convergent algorithms for the simultaneous determination of all zeros of a polynomial Ortega J.M. Rheinboldt W.C. Proceedings of the Symposium on Numerical Problems Studies in Numerical Analysis Vol. 2 1970 1-8 SIAM Philadelphia
17. P. Henrici, Applied and Computational Complex Analysis, Vol. 1, Power Series-Integration-Conformal Mapping-Location of Zeros, Wiley, New York, 1974.
18. Hribernig V. Stetter H.J. Detection and validation of clusters of polynomial zeros J. Symbolic Comput. 24 1997 667-681
19. Jenkins M.A. Algorithm 493: zeros of a real polynomial ACM Trans. Math. Software 1 1975 178-189
20. Jenkins M.A. Traub J.F. A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration Numer. Math. 14 1970 252-263
21. Kerner I.O. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen Numer. Math. 8 1966 290-294
22. Kravanja P. Sakurai T. Van Barel M. On locating clusters of zeros of analytic functions BIT 39 1999 646-682
23. McNamee J.M. A bibliography on roots of polynomials J. Comput. Appl. Math. 47 1993 391-394 Available online at http://www.elsevier.com/homepage/sac/cam/mcnamee
24. Neumaier A. An existence test for root clusters and multiple roots Z. Angew. Math. Mech. 68 1988 256-257
25. Nourein A.W. An iteration formula for simultaneous determination of the zeroes of a polynomial J. Comput. Appl. Math. 1 1975 251-254
26. M.S. Petkovic, Iterative Methods for Simultaneous Inclusion of Polynomial Zeros, Lecture Notes in Mathematics, Vol. 1387, Springer, Berlin, 1989.
27. Petkovic M.S. Herceg D. Ilic S. Point estimation and some application to iterative methods BIT 38 1998 111-126
28. Rump S.M. INTLAB-interval laboratory Csendes T. Developments in reliable computing, Kluwer Dordrecht, 1999 77-104 http://www.ti3.tu-harburg.de/~rump/intlab/index.html
29. S.M. Rump, Ten methods to bound multiple roots of polynomials, J. Comput. Appl. Math., this issue
30. Sakurai T. Sugiura H. Improvement of convergence of an iterative method for finding polynomial factors of analytic functions J. Comput. Appl. Math. 140 2002 713-725
31. Smith B.T. Error bounds for zeros of a polynomial based upon Gerschgorin's theorems J. ACM 17 1970 661-674
32. Stoer J. Bulirsch R. Introduction to Numerical Analysis 1987 Springer Berlin
33. K. Weierstrass, Neuer Beweis des Satzes, daß jede ganze rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Veränderlichen, in: Ges. Math. Werke 3, Meyer und Muller, Berlin, 1903, pp. 251-269 (reprinted by Johnson Reprint Corporation, New York, 1967.).
34. Werner W. Über Abschätzungen von Polynomnullstellen mittels des Gerschgorinschen Kreissatzes Z. Angew. Math. Mech. 63 1983 T390-T391
35. Wilkinson J.H. Rounding Errors in Algebraic Processes 1963 Prentice-Hall Englewood Cliffs, NJ