LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation between Regular Matrix Pairs

ACM Transactions on Mathematical Software

Volumn 22, Issue 1, 1996, Pages 78-103

  Kågström, Bo ^a   Poromaa, Peter ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

F.2.1 Analysis of Algorithms and Problem Complexity : Numerical Algorithms and Problems computation on matrices; G.1.3 Numerical Analysis : Numerical Linear Algebra conditioning; eigenvalues; linear system

Indexed keywords

ALGEBRA; COMPUTER SOFTWARE; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; NUMERICAL ANALYSIS;

CONDITION NUMBERS; DIF-ESTIMATORS; GENERALIZED SYLVESTER EQUATION; LAPACK;

ALGORITHMS;

EID: 0030092417     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/225545.225552     Document Type: Article

References (27)

1. ANDERSON, E., BAI, Z., BISCHOF, C., DEMMEL, J., DONGARRA, J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., OSTROUCHOV, S., AND SORENSEN, D. 1992. LAPACK Users' Guide. SIAM, Philadelphia, Pa.
2. BAI, Z., DEMMEL, J., AND MCKENNEY, A. 1993. On computing condition numbers for the nonsymmetric eigenproblem. ACM Trans. Math. Softw. 19, 2, 202-223.
3. BARTELS, R. H. AND STEWART, G. W. 1992. Solution of the equation AX + XB = C. Commun. ACM 15, 820-826.
4. CHU, K-W. E. 1987. The solution of the matrix equations AXB - CXD = E and (YA - DZ, YC - BZ) = (E, F). Lin. Alg. Appl. 93, 93-105.
5. CLINE, A., MOLER, C., STEWART, G. W., AND WILKINSON, J. 1979. An estimate of the condition number of a matrix. SIAM J. Numer. Anal. 16, 368-375.
6. DEMMEL, J. AND KÅGSTRÖM, B. 1987. Computing stable eigendecompositions of matrix pencils. Lin. Alg. Appl. 88/89 (Apr.), 139-186.
7. DONGARRA, J., DU CROZ, J., DUFF, I., AND HAMMARLING, S. 1990a. ALGORITHM 656: A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 18-32.
8. DONGARRA, J., DU CROZ, J., DUFF, I., AND HAMMARLING, S. 1990b. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 1-17.
9. T = E. ACM Trans. Math. Softw. 18, 2, 232-238.
10. T = E. ACM Trans. Math. Softw. 18, 2, 223-231.
11. GOLUB, G., NASH, S., AND VAN LOAN, C. 1979. A Hessenberg-Schur method for the matrix problem AX + XB = C. IEEE Trans. Automat. Contr. AC-24, 909-913.
12. GOULD, N. 1990. On growth in Gaussian elimination with pivoting. SIAM J. Matrix Anal. Appl. 12, 2, 354-361.
13. HAGER, W. W. 1984. Condition estimators. SZAM J. Sci. Stat. Comput. 5, 311-316.
14. HIGHAM, N. J. 1989. ALGORITHM 674: Fortran codes for estimating the one-norm of a real or a complex matrix, with applications to condition estimation. ACM Trans. Math. Softw. 15, 2, 168.
15. HIGHAM, N. J. 1993. Perturbation theory and backward error analysis for AX - XB = C. BIT 33, 1, 124-136.
16. KÅGSTRÖM, B. 1993. A direct method for reordering eigenvalues in the generalized real Schur form of a regular matrix pair (A, B). In Linear Algebra for Large Scale and Real-Time Applications, M. S. Moonen, G. H. Golub, and B. L. R. De Moor, Eds. Kluwer Academic, Amsterdam, 195-218.
17. KÅGSTRÖM, B. 1994. A perturbation analysis of the generalized Sylvester equation (AR -LB, DR - LB) = (C, F). SIAM J. Matrix Anal. Appl. 15, 4, 1045-1060.
18. -1 estimators. SIAM J. Matrix Anal. Appl. 13, 1, 99-101.
19. KÅGSTRÖM, B. AND POROMAA, P. 1993. LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs. Rep. UMINF-93.23, Dept. of Computing Science, Umeå Univ., Umeå, Sweden. Dec. Revised Apr. 1994. Also appears as LAPACK Working Note 75.
20. KÅGSTRÖM, B. AND PoROMAA, P. 1994, Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: Theory, algorithms and software. Rep. UMINF-94.04, Dept. of Computer Science, Umeå Univ., Umeå, Sweden. Also appears as LAPACK Working Note 87.
21. KÅGSTRÖM, B. AND VAN DOOREN, P. 1992. A generalized state-space approach for the additive decomposition of a transfer matrix. Int. J. Numer. Lin. Alg. Appl. 1, 2, 165-181.
22. KÅGSTRÖM, B. AND WESTIN, L. 1989. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. IEEE Trans. Automat. Contr. 34, 4, 745-751.
23. MOLER, C. AND STEWART, G. 1973. An algorithm for the generalized matrix eigenvalue problem. SIAM J. Numer. Anal. 10, 241-256.
24. POROMAA, P. 1995. On efficient and robust estimators for the separation between two regular matrix pairs with applications in condition estimation. Rep. UMINF-95.05, Dept. of Computing Science, Umeå Univ., Umeå, Sweden.
25. STEWART, G. W. 1973. Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Rev. 15, 4 (Oct.), 727-764.
26. STEWART, G. W. AND SUN, J.-G. 1990. Matrix Perturbation Theory. Academic Press, New York.
27. VARAH, J. 1979. On the separation of two matrices. SIAM J. Numer. Anal. 16, 216-222.