Structured matrix methods for polynomial root-finding

Authors:
Luca Gemignani
Affiliations:
University of Pisa, Pisa, Italy
Venue:
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Year:
2007

Citing 5
Cited 2

Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems

Journal of the ACM (JACM)
Polynomial root finding using iterated Eigenvalue computation

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
An iterated eigenvalue algorithm for approximating roots of univariate polynomials

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations

Numerische Mathematik
Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank-One Perturbations of Unitary Matrices

SIAM Journal on Matrix Analysis and Applications

Eigen-solving via reduction to DPR1 matrices

Computers & Mathematics with Applications
Parallel algorithms for finding polynomial Roots on OTIS-torus

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-finding algorithms based on floating-point eigenvalue computation can benefit from the structure of the matrix problem to reduce their complexity and memory requirements by an order of magnitude.