Volume 17, pp. 195-205, 2004.
Improved initialization of the accelerated and robust QR-like polynomial root-finding
Dario A. Bini, Luca Gemignani, and Victor Y. Pan
Abstract
We approximate polynomial roots numerically as the eigenvalues of a
unitary diagonal plus rank-one matrix. We rely on our earlier
adaptation of the
Full Text (PDF) [166 KB], BibTeX
Key words
AMS subject classifications
65H17, 65F15.
Links to the cited ETNA articles
[21] | Vol. 12 (2001), pp. 66-87 Hong Zhang: Numerical condition of polynomials in different forms |