Polynomial root finding using iterated eigenvalue computation

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 121-128

  Fortune, S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DIGITAL ARITHMETIC; EIGENVALUES AND EIGENFUNCTIONS; ERROR ANALYSIS; INTERPOLATION; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; VECTORS;

FLOATING POINT EIGENVALUE COMPUTATION; ILL CONDITIONED POLYNOMIALS; LAGRANGE INTERPOLATION; POLYNOMIAL ROOT FINDING;

POLYNOMIALS;

EID: 0034772120     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384119     Document Type: Conference Paper

References (19)

1. A portable high performance multiprecision package
2. Design, analysis, and implementation of a multiprecision polynomial rootfinder
3. Numerical computation of polynomial roots using MPSolve, manuscript
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. GNU MP: The GNU multiple precision arithmetic library, Edition 2.0, 1996
8. A composite polynomial zerofinding matrix algorithm
9. Error bounds for the zeroes of a polynomial based upon Gershgorin's theorem
10. Matrix eigensystem routines - EISPACK guide
11. A bibliography on roots of polynomials
12. Solving a polynomial equation: Some history and recent progress
13. Convergence conditions of some methods for the simultaneous computation of polynomial zeroes
14. The eigenstructure of an arbitrary polynomial matrix: Computational aspects