Session B7 - Numerical Linear Algebra
July 13, 16:00 ~ 16:30 - Room B5
Polynomial root-finding using companion matrices
Fernando De Terán
Universidad Carlos III de Madrid, Spain - email@example.com
The use of companion matrices for computing the roots of scalar polynomials is a standard approach (it is, for instance, the one followed by the command 'roots' in MATLAB). It consists in computing the roots of a scalar polynomial as the eigenvalues of a companion matrix. In this talk, I will review several numerical and theoretical issues on this topic. I will pay special attention to the backward stability of solving the polynomial root-finding problem using companion matrices. More precisely, the question is the following: Even if the computed eigenvalues of the companion matrix are the eigenvalues of a nearby matrix, does this guarantee that they are the roots of a nearby polynomial? Usually, the companion matrix approach focuses on monic polynomials, since one can always divide by the leading coefficient, if necessary. But, is it enough for the backward stability issue to focus on monic polynomials? I will also pay attention to some other (more theoretical) questions like: How many companion matrices are there and what do they look like?