LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs

Robust and fast software to solve the generalized Sylvester equation (AR - LB = C, DR - LE = F) for unknowns R and L is presented. This special linear system of equations, and its transpose, arises in computing error bounds for computed eigenvalues and eigenspaces of the generalized eigenvalue problem S-λT, in computing deflating subspaces of the same problem, and in computing certain decompositions of transfer matrices arising in control theory. Our contributions are twofold. First, we reorganize the standard algorithm for this problem to use Level 3 BLAS operations, like matrix multiplication, in its inner loop. This speeds up the algorithm by a factor of 9 on an IBM RS6000. Second, we develop and compare several condition estimation algorithms, which inexpensively but accurately estimate the sensitivity of the solution of this linear system.

[1]  J. Varah.  On the Separation of Two Matrices , 1979 .

[2]  Nicholas J. Higham,et al.  FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation , 1988, TOMS.

[3]  J. H. Wilkinson,et al.  AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .

[4]  Paul Van Dooren,et al.  A generalized state-space approach for the additive decomposition of a transfer matrix , 1992 .

[5]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

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

[7]  G. Stewart,et al.  An Algorithm for the Generalized Matrix Eigenvalue Problem Ax = Lambda Bx , 1971 .

[8]  Bo Kågström,et al.  A Perturbation Analysis of the Generalized Sylvester Equation $( AR - LB,DR - LE ) = ( C,F )$ , 1994, SIAM J. Matrix Anal. Appl..

[9]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[10]  Antony Jameson,et al.  Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix , 1968 .

[11]  Alan J. Laub,et al.  Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXBT + CXDT = E , 1992, TOMS.

[12]  Bo Kågström,et al.  Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with øperatornamesep - 1 Estimators , 1992, SIAM J. Matrix Anal. Appl..

[13]  B. Kågström,et al.  Generalized Schur methods with condition estimators for solving the generalized Sylvester equation , 1989 .

[14]  G. Stewart,et al.  An Algorithm for Generalized Matrix Eigenvalue Problems. , 1973 .

[15]  K. Chu.  The solution of the matrix equations AXB−CXD=E AND (YA−DZ,YC−BZ)=(E,F) , 1987 .

[16]  V. N. Bogaevski,et al.  Matrix Perturbation Theory , 1991 .

[17]  James Demmel,et al.  On computing condition numbers for the nonsymmetric eigenproblem , 1993, TOMS.

[18]  KågströmBo,et al.  LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs , 1996 .

[19]  N. Gould.  On growth in Gaussian elimination with complete pivoting , 1991 .

[20]  Jack J. Dongarra,et al.  A set of level 3 basic linear algebra subprograms , 1990, TOMS.

[21]  Alan J. Laub,et al.  Solution of the Sylvester matrix equation AXBT + CXDT = E , 1992, TOMS.

[22]  Nicholas J. Higham,et al.  Perturbation theory and backward error forAX−XB=C , 1993 .

[23]  BO K Agstr,et al.  A GENERALIZED STATE-SPACE APPROACH FOR THE ADDITIVE DECOMPOSITION OF A TRANSFER MATRIX , 1992 .

[24]  Bo Kågström,et al.  LAPACK Working Note 87: Computing Eigenspaces with Specified Eigenvalues of a Regular Matrix Pair and Condition Estimation: Theory, Algorithms and Software , 1994 .

[25]  B. Kågström,et al.  A Direct Method for Reordering Eigenvalues in the Generalized Real Schur form of a Regular Matrix Pair (A, B) , 1993 .