The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
-
- James Demmel
- Univ. of California. Berkeley
-
- Bo Kågström
- Univ. of Umeaˆ, Umeaˆ, Sweden
書誌事項
- タイトル別名
-
- theory and algorithms
説明
<jats:p>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.</jats:p>
収録刊行物
-
- ACM Transactions on Mathematical Software
-
ACM Transactions on Mathematical Software 19 (2), 160-174, 1993-06
Association for Computing Machinery (ACM)
