Structured matrix methods for polynomial root-finding

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. Categories and Subject Descriptors

• Type: Conference
• Year: 2007
• Where: ISSAC
• Authors: Luca Gemignani
• Keywords: ISSAC 2007, Structured Matrix Methods, Univariate Polynomial, floating-point Eigenvalue Computation