The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II: Software and applications

92Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

Robust software with error bounds for computing the generalized Schur decomposition of an arbitrary matrix pencil A – λB 1993 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. The second part of this two-part paper describes the computed generalized Schur decomposition in more detail and the software, and presents applications and an example of its use. Background theory and algorithms for the decomposition and its error bounds are presented in Part I of this paper. © 1993, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Demmel, J., & Kågström, B. (1993). The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II: Software and applications. ACM Transactions on Mathematical Software (TOMS), 19(2), 175–201. https://doi.org/10.1145/152613.152616

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free