Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1519–1521 |
| Number of pages | 3 |
| Journal | Electronics Letters |
| Volume | 32 |
| Issue number | 16 |
| DOIs | |
| Publication status | Published - 1 Aug 1996 |
Keywords
- Approximation theory
- Convergence of numerical methods
- Iterative methods
- Polynomials