LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
- 1 March 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 22 (1) , 78-103
- https://doi.org/10.1145/225545.225552
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On computing condition numbers for the nonsymmetric eigenproblemACM Transactions on Mathematical Software, 1993
- Perturbation theory and backward error forAX−XB=CBIT Numerical Mathematics, 1993
- Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXB
T
+ CXD
T
= EACM Transactions on Mathematical Software, 1992
- Solution of the Sylvester matrix equation AXB
T
+ CXD
T
= EACM Transactions on Mathematical Software, 1992
- A set of level 3 basic linear algebra subprogramsACM Transactions on Mathematical Software, 1990
- Generalized Schur methods with condition estimators for solving the generalized Sylvester equationIEEE Transactions on Automatic Control, 1989
- Algorithm 674ACM Transactions on Mathematical Software, 1989
- The solution of the matrix equations AXB−CXD=E AND (YA−DZ,YC−BZ)=(E,F)Linear Algebra and its Applications, 1987
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972