Remark on Algorithms to Find Roots of Polynomials
Stefan Goedecker · SIAM Journal on Scientific Computing · 1994
The problem of finding the roots of a polynomial is equivalent to finding the eigenvalues of an upper Hessenberg matrix, which can be done with the QR algorithm. It is shown that the QR algorithm has considerable advantages over other standard algorithms to find the roots of a polynomial.