An iterated eigenvalue algorithm for approximating roots of univariate polynomials

Journal of Symbolic Computation

Volumn 33, Issue 5, 2002, Pages 627-646

  Fortune, Steven ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036335550     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0526     Document Type: Article

References (27)

1. Numerical computation of polynomial roots using mpsolve, manuscript
2. Design, analysis, and implementation of a multiprecision polynomial rootfinder
3. Safe and effective determinant evaluation
4. On condition numbers and the distance to the nearest ill-posed problem
5. Polynomial roots from companion matrix eigenvalues
6. A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
7. Expressing a polynomial as the characteristic polynomial of a symmetric matrix
8. Polynomial root finding using iterated eigenvalue computation
9. Polynomial zerofinding iterative matrix algorithms
10. A composite polynomial zerofinding matrix algorithm
11. A bibliography on roots of polynomials
12. Solving a polynomial equation: Some history and recent progress
13. Error bounds for the zeroes of a polynomial based upon Gershgorin's theorem
14. Convergence conditions of some methods for the simultaneous computation of polynomial zeroes
15. Pseudozeroes of polynomials and pseudospectra of companion matrices
16. The eigenstructure of an arbitrary polynomial matrix: Computational aspects