Volume 33, pp. 126-150, 2008-2009.
A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
Raf Vandebril, Marc Van Barel, and Nicola Mastronardi
Abstract
This paper proposes a new type of iteration for computing
eigenvalues of semiseparable (plus diagonal) matrices based on a
structured-rank factorization. Remarks on higher order
semiseparability ranks are also made. More precisely, instead of the
traditional iteration, a iteration is used.
The factorization is characterized by a unitary matrix
and a Hessenberg-like matrix in which the lower triangular
part is semiseparable (often called a lower semiseparable
matrix).
The factor of this factorization determines the similarity
transformation of the method.
It is shown that this iteration is extremely useful for
computing the eigenvalues of structured-rank matrices. Whereas the
traditional method applied to semiseparable (plus diagonal) and
Hessenberg-like matrices uses similarity transformations involving
Givens transformations (where denotes the
semiseparability rank), the iteration only needs Givens
transformations, which is comparable to the generalized Hessenberg
(symmetric band) situation having subdiagonals. It is also
shown that this method can in some sense be interpreted as an
extension of the traditional method for Hessenberg matrices,
i.e., the traditional case also fits into this framework.
It is also shown that
this iteration exhibits an extra type of
convergence behavior compared to the traditional method.
The algorithm is implemented in an implicit way, based on the
Givens-weight representation of the structured rank
matrices. Numerical experiments show the viability of this
approach. The new approach yields better
complexity and more accurate results than the
traditional method.
Full Text (PDF) [289 KB],
BibTeX
Key words
algorithm, structured rank matrices, implicit computations, eigenvalue, algorithm, rational iteration
AMS subject classifications
65F05
Links to the cited ETNA articles
[4] |
Vol. 18 (2004), pp. 137-152 Dario A. Bini, Francesco Daddi, and Luca Gemignani:
On the shifted QR iteration applied to companion matrices
|