Eigen-solving via reduction to DPR1 matrices

Highly effective polynomial root-finders have been recently designed based on eigen-solving for DPR1 (that is diagonal + rank-one) 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.

[1]  Victor Y. Pan,et al.  Linking the TPR1, DPR1 and Arrow-Head Matrix Structures , 2006, Comput. Math. Appl..

[2]  Israel Gohberg,et al.  Fast inversion algorithms for a class of block structured matrices , 2001 .

[3]  Raf Vandebril,et al.  Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal , 2006, Numerische Mathematik.

[4]  Raf Vandebril,et al.  A note on the representation and definition of semiseparable matrices , 2005, Numer. Linear Algebra Appl..

[5]  Victor Y. Pan,et al.  Additive preconditioning, eigenspaces, and the inverse iteration☆ , 2009 .

[6]  Victor Y. Pan,et al.  Null space and eigenspace computations with additive preprocessing , 2007, SNC '07.

[7]  Victor Y. Pan,et al.  Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations , 2005, Numerische Mathematik.

[8]  G. W. Stewart,et al.  Matrix algorithms , 1998 .

[9]  V. Pan,et al.  Inverse power and Durand-Kerner iterations for univariate polynomial root-finding , 2002 .

[10]  Victor Y. Pan,et al.  Additive preconditioning and aggregation in matrix computations , 2008, Comput. Math. Appl..

[11]  Luca Gemignani.  Structured matrix methods for polynomial root-finding , 2007, ISSAC '07.

[12]  V. Pan,et al.  Improved initialization of the accelerated and robust QR-like polynomial root-finding. , 2004 .

[13]  Victor Y. Pan,et al.  Root-Finding with Eigen-Solving , 2007 .

[14]  Y. Ikebe.  On inverses of Hessenberg matrices , 1979 .

[15]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[16]  Raf Vandebril,et al.  An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form , 2003, SIAM J. Matrix Anal. Appl..

[17]  Gene H. Golub,et al.  Matrix computations , 1983 .