Affiliation:
1. Univ. of California. Berkeley
2. Univ. of Umeaˆ, Umeaˆ, Sweden
Abstract
Robust software with error bounds for computing the generalized Schur decomposition of an arbitrary matrix pencil A – λB (regular or singular) is presented. The decomposition is a generalization of the Schur canonical form of A – λI to matrix pencils and reveals the Kronecker structure of a singular pencil. Since computing the Kronecker structure of a singular pencil is a potentially ill-posed problem, it is important to be able to compute rigorous and reliable error bounds for the computed features. The error bounds rely on perturbation theory for reducing subspaces and generalized eigenvalues of singular matrix pencils. The first part of this two-part paper presents the theory and algorithms for the decomposition and its error bounds, while the second part describes the computed generalized Schur decomposition and the software, and presents applications and an example of its use.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference44 articles.
1. An improved algorithm for the computation of Kronecker's canomcal form of a singular pencil;BEELEN T.;Lin. Alg Appl.,1988
2. The Lanczos-Arnoldi algorithm and controllability;BOLE~ D.;Syst. Control Lett.,1984
3. Rank revealing QR factorizations;CHAN T;Lin. Alg. Appl.,1987
Cited by
132 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献