Eigen-solving via reduction to DPR1 matrices

✍ Scribed by V.Y. Pan; B. Murphy; R.E. Rosholt; Y. Tang; X. Wang; A. Zheng

• Book ID: 104008114
• Publisher: Elsevier Science
• Year: 2008
• Tongue: English
• Weight: 223 KB
• Volume: 56
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/j.camwa.2007.09.012

✦ Synopsis

Highly effective polynomial root-finders have been recently designed based on eigen-solving for DPR1 (that is diagonal + rankone) matrices. We extend these algorithms to eigen-solving for the general matrix by reducing the problem to the case of the DPR1 input via intermediate transition to a TPR1 (that is triangular + rank-one) matrix. Our transforms use substantially fewer arithmetic operations than the QR classical algorithms but employ non-unitary similarity transforms of a TPR1 matrix, whose representation tends to be numerically unstable. We, however, operate with TPR1 matrices implicitly, as with the inverses of Hessenberg matrices. In this way our transform of an input matrix into a similar DPR1 matrix partly avoids numerical stability problems and still substantially decreases arithmetic cost versus the QR algorithm.