REMARK ON ALGORITHMS TO FIND ROOTS OF POLYNOMIALS

Authors
GOEDECKER S
Citation
S. Goedecker, REMARK ON ALGORITHMS TO FIND ROOTS OF POLYNOMIALS, SIAM journal on scientific computing, 15(5), 1994, pp. 1059-1063
Citations number
8
Categorie Soggetti
Computer Sciences",Mathematics
Journal title
SIAM journal on scientific computing → ACNP
ISSN journal
10648275
Volume
15
Issue
5
Year of publication
1994
Pages
1059 - 1063
Database
ISI
SICI code
1064-8275(1994)15:5<1059:ROATFR>2.0.ZU;2-G
Abstract
The problem of finding the roots of a polynomial is equivalent to find ing the eigenvalues of an upper Hessenberg matrix, which can be done w ith the QR algorithm. It is shown that the QR algorithm has considerab le advantages over other standard algorithms to find the roots of a po lynomial.