A robust method for finding the roots of polynomials using the Routh array is given. Certain multipoint approximation properties of the array are clarified, which enable a simple criterion to be used in the root-finding algorithm. A bisection-type iteration guarantees convergence to the roots.
- Approximation theory
- Convergence of numerical methods
- Iterative methods