Extracting Partial Canonical Structure for Large Scale Eigenvalue Problems
2000 (English)In: Numerical Algorithms, Vol. 24, no 3, 195-237 p.Article in journal (Refereed) Published
We present methods for computing a nearby partial Jordan-Schur form of a given matrix and a nearby partial Weierstrass-Schur form of a matrix pencil. The focus is on the use and the interplay of the algorithmic building blocks - the implicitly restarted Arnoldi method with prescribed restarts for computing an invariant subspace associated with the dominant eigenvalue, the clustering method for grouping computed eigenvalues into numerically multiple eigenvalues and the staircase algorithm for computing the structure revealing form of the projected problem. For matrix pencils, we present generalizations of these methods. We introduce a new and more accurate clustering heuristic for both matrices and matrix pencils. Particular emphasis is placed on reliability of the partial Jordan-Schur and Weierstrass-Schur methods with respect to the choice of deflation parameters connecting the steps of the algorithm such that the errors are controlled. Finally, successful results from computational experiments conducted on problems with known canonical structure and varying ill-conditioning are presented.
Place, publisher, year, edition, pages
2000. Vol. 24, no 3, 195-237 p.
IdentifiersURN: urn:nbn:se:umu:diva-21958ISBN: 1017-1398OAI: oai:DiVA.org:umu-21958DiVA: diva2:212218