Ten methods to bound multiple roots of polynomials
- 15 July 2003
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 156 (2) , 403-432
- https://doi.org/10.1016/s0377-0427(03)00381-9
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Computational error bounds for multiple or nearly multiple eigenvaluesLinear Algebra and its Applications, 2001
- Self-validating methodsLinear Algebra and its Applications, 2001
- A bibliography on roots of polynomialsJournal of Computational and Applied Mathematics, 1993
- Inclusion of the roots of a polynomial based on Gerschgorin's theoremNumerische Mathematik, 1991
- Improving spectral-variation bounds with Chebyshev polynomialsLinear Algebra and its Applications, 1990
- Über die Falksche ECP‐Transformation und VerallgemeinerungenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1989
- An Existence Test for Root Clusters and Multiple RootsZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1988
- Quasi-GCD computationsJournal of Complexity, 1985
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's TheoremsJournal of the ACM, 1970
- Gershgorin's Theorem and the Zeros of PolynomialsThe American Mathematical Monthly, 1965