Solution of the Sylvester matrix equation AXB T + CXD T = E
- 1 June 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 18 (2) , 223-231
- https://doi.org/10.1145/146847.146929
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithm 705; a FORTRAN-77 software package for solving the Sylvester matrix equation AXB
T
+ CXD
T
= EACM Transactions on Mathematical Software, 1992
- FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimationACM Transactions on Mathematical Software, 1988
- The Sensitivity of the Stable Lyapunov EquationSIAM Journal on Control and Optimization, 1988
- The solution of the matrix equations AXB−CXD=E AND (YA−DZ,YC−BZ)=(E,F)Linear Algebra and its Applications, 1987
- A LINPACK-style condition estimator for the equationAX-XB^{T} = CIEEE Transactions on Automatic Control, 1984
- Generalized eigenproblem algorithms and software for algebraic Riccati equationsProceedings of the IEEE, 1984
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- An Estimate for the Condition Number of a MatrixSIAM Journal on Numerical Analysis, 1979
- An Algorithm for Generalized Matrix Eigenvalue ProblemsSIAM Journal on Numerical Analysis, 1973
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972