A method for finding the roots of a polynomial
✍ Scribed by Jiří Soukup
- Publisher
- Springer-Verlag
- Year
- 1969
- Tongue
- English
- Weight
- 273 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Conventional numerical methods for finding multiple roots of polynomials are inaccurate. The accuracy is unsatisfactory because the derivatives of the polynomial in the intermediate steps of the associated root-finding procedures are eliminated. Engineering applications require that this problem be
Cardinal's matrix version of the Sebastiao e Silva polynomial root-finder rapidly approximates the roots as the eigenvalues of the associated Frobenius matrix. We preserve rapid convergence to the roots but amend the algorithm to allow input polynomials with multiple roots and root clusters. As in C