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

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.

[1]  Bo Kågström,et al.  Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2] , 1980, TOMS.

[2]  J. Demmel,et al.  Stably Computing the Kronecker Structure and Reducing Subspaces of Singular Pencils A-λ for Uncertain Data , 1986 .

[3]  Bo Kågström,et al.  On computing the Kronecker canonical form of regular (A-λB)-pencils , 1983 .

[4]  Gene H. Golub,et al.  The Lanczos-Arnoldi algorithm and controllability , 1984 .

[5]  James Hardy Wilkinson,et al.  Kronecker''s canonical form and the QZ algorithm , 1979 .

[6]  V. Kublanovskaya,et al.  On a method of solving the complete eigenvalue problem for a degenerate matrix , 1966 .

[7]  Ji-guang Sun,et al.  Perturbation analysis for the generalized eigenvalue and the generalized singular value problem , 1983 .

[8]  Bo Kågström,et al.  An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix , 1980, TOMS.

[9]  Charles Van Loan.  Computing the CS and the generalized singular value decompositions , 1985 .

[10]  T. Chan.  Rank revealing QR factorizations , 1987 .

[11]  P. Dooren.  Reducing subspaces: Definitions, properties and algorithms , 1983 .

[12]  G. Stewart.  Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems , 1973 .

[13]  James Hardy Wilkinson,et al.  Linear Differential Equations and Kronecker's Canonical Form , 1978 .

[14]  A. Pokrzywa,et al.  On perturbations and the equivalence orbit of a matrix pencil , 1986 .

[15]  V. Kublanovskaya.  AB-Algorithm and its modifications for the spectral problems of linear pencils of matrices , 1984 .

[16]  Bo Kågström,et al.  The generalized singular value decomposition and the general (A-λB)-problem , 1984 .

[17]  V. Kublanovskaya,et al.  An approach to solving the spectral problem of A-λB , 1983 .

[18]  James Demmel,et al.  The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II: software and applications , 1993, TOMS.

[19]  King-Wah Eric Chu.  Exclusion theorems and the perturbation analysis of the generalized eigenvalue problem , 1987 .

[20]  P. Dooren.  The Computation of Kronecker's Canonical Form of a Singular Pencil , 1979 .

[21]  P. Dooren,et al.  An improved algorithm for the computation of Kronecker's canonical form of a singular pencil , 1988 .

[22]  P. Van Dooren,et al.  A class of fast staircase algorithms for generalized state-space systems , 1986, 1986 American Control Conference.

[23]  Jack J. Dongarra,et al.  Distribution of mathematical software via electronic mail , 1985, SGNM.

[24]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[25]  G. Stewart,et al.  Gershgorin Theory for the Generalized Eigenvalue Problem Ax — \ Bx , 2010 .

[26]  C. Paige.  Properties of numerical algorithms related to computing controllability , 1981 .

[27]  P. Dooren.  The generalized eigenstructure problem in linear system theory , 1981 .

[28]  William C. Waterhouse.  The codimension of singular matrix pairs , 1984 .

[29]  Ji-guang Sun.  Perturbation Analysis for the Generalized Singular Value Problem , 1983 .

[30]  P. Dooren.  Reducing subspaces : computational aspects and applications in linear system theory , 1982 .

[31]  Bo Kågström,et al.  RGSD an algorithm for computing the Kronecker structure and reducing subspaces of singular A-lB pencils , 1986 .

[32]  James Demmel,et al.  Accurate solutions of ill-posed problems in control theory , 1988 .

[33]  Daniel Boley,et al.  Computing the controllability - observability decomposition of a linear time-invariant dynamic system, a numerical approach , 1981 .

[34]  G. Stewart.  On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$ , 1972 .