An iterated eigenvalue algorithm for approximating roots of univariate polynomials
The author studies an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. A few interesting examples including ill-conditioned polynomials are carefully implemented for the algorithms.
scientific article; zbMATH DE number 1801676