Ten methods to bound multiple roots of polynomials

Journal of Computational and Applied Mathematics

Volumn 156, Issue 2, 2003, Pages 403-432

  Rump, Siegfried M ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ERROR ANALYSIS; MATHEMATICAL MODELS;

UNIVARIATE POLYNOMIALS;

POLYNOMIALS;

MATHEMATICAL ANALYSIS;

EID: 0041841198     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(03)00381-9     Document Type: Article

References (40)

1. Alefeld G. Herzberger J. Introduction to Interval Computations 1983 Academic Press New York
2. P. Batra, Abschätzungen und Iterationsverfahren für Polynom-Nullstellen, Dissertation, Technische Informatik III, TU Hamburg-Harburg, 1999.
3. Bell H.E. Gershgorin's theorem and the zeros of polynomials Amer. Math. Monthly 72 1965 292-295
4. Bhatia R. Elsner L. Krause G. Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix Linear Algebra Appl. 142 1990 195-209
5. Börsch-Supan W. Residuenabschätzungen für Polynom-Nullstellen mittels Lagrange-Interpolation Numer. Math. 14 1970 287-296
6. Braess D. Hadeler K.P. Simultaneous inclusion of the zeros of a polynomial Numer. Math. 21 1973 161-165
7. Carstensen C. Inclusion of the roots of a polynomial based on Gershgorin's theorem Numer. Math. 59 1991 349-360
8. Carstensen C. Stein E. Über die Falksche ECP-Transformation und Verallgemeinerungen Z. Angew. Math. Mech. 69 1989 375-391
9. I.E. Durand, Solutions Numérique des Équations Algébriques, Tome I: Équations du Type F(x)=0, Racines d'une Polynôme Masson, 1960, pp. 279-281.
10. Elsner L. A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem Numer. Math. 21 1973 425-427
11. A. Frommer, Proving Conjectures by Use of Interval Arithmetic, in: U. Kulisch et al. (Eds.), Perspectives on enclosure methods, SCAN 2000, GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Univ. Karlsruhe, Germany, September 19-22, 2000, Wien, Springer, 2001.
12. Gargantini I. Henrici P. Circular arithmetic and the determination of polynomial zeros Numer. Math. 18 1972 305-320
13. T.C. Hales, The Kepler conjecture, Manuscript, 1998, http://www.math.lsa.umich.edu/~hales/countdown
14. Hass J. Hutchings M. Schlafly R. The double bubble conjecture Elec. Res. Announcement of the Am. Math. Soc. 1 3 1995 98-102
15. P. Henrici, Applied and Computational Complex Analysis, Vol. 1, Wiley, New York, 1974.
16. ANSI/IEEE 754-1985, Standard for Binary Floating-Point Arithmetic, 1985.
17. Kerner I.O. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen Numer. Math. 8 1966 290-294
18. Krawczyk R. Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken Computing 4 1969 187-201
19. M. Marden, Geometry of polynomials, AMS Mathematical Surveys 3, 1966.
20. MATLAB User's Guide, Version 6, The MathWorks Inc., 2000.
21. McNamee J.M. A bibliography on roots of polynomials J. Comput. Appl. Math. 47 1993 391-394
22. Moore R.E. Interval Analysis 1966 Prentice-Hall Englewood Cliffs, NJ
23. A. Neumaier, Enclosing clusters of zeros of polynomials, J. Comput. Appl. Math., this issue
24. Neumaier A. An existence test for root clusters and multiple roots ZAMM 68 6 1988 256-257
25. A. Neumaier, Interval Methods for Systems of Equations, Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge, 1990.
26. Ostrowski A. Solution of Equations in Euclidean and Banach Spaces 3rd Edition 1973 Academic New York
27. Phillips D. Improving spectral-variation bounds with Chebyshev polynomials Linear Algebra Appl. 133 1990 165-173
28. L.B. Rall, Automatic differentiation: techniques and applications, in: Lecture Notes in Computer Science, Vol. 120, Springer, Berlin-Heidelberg-New York, 1981.
29. Rump S.M. Verification methods for dense and sparse systems of equations Herzberger J. Topics in Validated Computations-Studies in Computational Mathematics 1994 63-136 Elsevier Amsterdam
30. Rump S.M. INTLAB-INTerval LABoratory Csendes Tibor Developments in Reliable Computing 1999 77-104 Kluwer Academic Publishers Dordrecht http://www.ti3.tu-harburg.de/rump/intlab/index.html
31. Rump S.M. Computational error bounds for multiple or nearly multiple eigenvalues Linear Algebra Appl. 324 2001 209-226
32. Rump S.M. Self-validating methods Linear Algebra Appl. 324 2001 3-13
33. Schönhage A. Quasi-gcd computations J. Complexity 1 1985 118-137
34. Smith B.T. Error bounds for zeros of a polynomial based upon Gerschgorin's theorems J. ACM 17 1970 661-674
35. Sunaga T. Theory of an interval algebra and its application to numerical analysis RAAG Memoirs 2 1958 29-46
36. Tucker W. The Lorenz attractor exists C. R. Acad. Sci., Paris, Sér. I, Math. 328 12 1999 1197-1202
37. van der Sluis A. Upper bounds for roots of polynomials Numer. Mathematik 15 1970 250-262
38. K. Weierstraß, Neuer Beweis des Satzes, daß jede ganze rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Veränderlichen, Vol. 3, in: Ges. Math. Werke, Meyer und Muller, Berlin, 1903, pp. 251-269 (Reprint by Johnson Reprint Corp., New York, 1967).
39. Werner W. Über Abschätzungen von Polynomnullstellen mittels des Gerschgorinschen Kreissatzes Z. Angew. Math. Mech. 63 1983 T390-391
40. Wilkinson J.H. The Algebraic Eigenvalue Problem 1965 Clarendon Press Oxford