摘要
In this paper, we present two alternating direction methods for the solution and best approximate solution of the Sylvester-type matrix equation AXB ＋ CXTD = E arising in the control theory, where A, B, C, D and E are given matrices of suitable sizes. If the matrix equation is consistent （inconsistent）, then the solution （the least squares solution） can be obtained. Preliminary convergence properties of the proposed algorithms are presented. Numerical experiments show that the proposed algorithms tend to deliver higher quality solutions with less iteration steps and CPU time than some existing algorithms on the tested problems.
In this paper, we present two alternating direction methods for the solution and best approximate solution of the Sylvester-type matrix equation AXB ＋ CXTD = E arising in the control theory, where A, B, C, D and E are given matrices of suitable sizes. If the matrix equation is consistent （inconsistent）, then the solution （the least squares solution） can be obtained. Preliminary convergence properties of the proposed algorithms are presented. Numerical experiments show that the proposed algorithms tend to deliver higher quality solutions with less iteration steps and CPU time than some existing algorithms on the tested problems.
