Solution of the Sylvester matrix equation AXBT + CXDT = E
ACM Transactions on Mathematical Software (TOMS)
Solution of the Sylvester matrix equation AXBT + CXDT = E
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Parallel Two-Sided Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
On the numerical solution of large-scale sparse discrete-time Riccati equations
Advances in Computational Mathematics
Hi-index | 0.00 |
This paper documents a software package for solving the Sylvester matrix equation (1) AXBT + CXDT = e All quantities are real matrices; A and C are m x n; B and D are m x n; and X and E are m x n. The unknown is X. Two symmetric forms of Eq. (1) are treated separately for efficiency. They are the continuous-time symmetric Sylvester equation (2) AXET + EXAT + C = 0 and the discrete time equation (3) AXAT + C = 0, for which A, E, and C is symmetric. The software also provides a means for estimating the condition number of these three equations. The algorithms employed are more fully described in an accompanying paper [3].