{"title":"Iterative solutions to the linear matrix equation AXB + CXTD = E","authors":"Yongxin Yuan, Jiashang Jiang","country":null,"institution":"","volume":55,"journal":"International Journal of Mathematical and Computational Sciences","pagesStart":1046,"pagesEnd":1050,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/12577","abstract":"In this paper the gradient based iterative algorithm is\r\npresented to solve the linear matrix equation AXB +CXTD = E,\r\nwhere X is unknown matrix, A,B,C,D,E are the given constant\r\nmatrices. It is proved that if the equation has a solution, then the\r\nunique minimum norm solution can be obtained by choosing a special\r\nkind of initial matrices. Two numerical examples show that the\r\nintroduced iterative algorithm is quite efficient.","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 55, 2011"}