Iterative solutions to the extended Sylvester-conjugate matrix equations (Q708149)

The authors investigate the extended Sylvester-conjugate matrix equation \(AXB+C\bar{X}D=F\), where \(A,C\in\mathbb{C}^{m\times r}\), \(B,D\in\mathbb{C}^{s\times n}\) and \(F\in\mathbb{C}^{m\times n}\) are known matrices, and \(X\in\mathbb{C}^{r\times s}\) is the matrix to be determined. They present an iterative algorithm to solve the extended Sylvester-conjugate matrix equation and a sufficient condition to guarantee that the proposed algorithm converges to the exact solution for arbitrary initial matrix. In addition, a more general Sylvester-conjugate matrix equation of the form \(\sum_{i=1}^pA_iXB_i+\sum_{j=1}^qC_j\bar{X}D_j=F\) is also considered in this paper, where \(A_i,C_j\in\mathbb{C}^{m\times r}\), \(B_i,D_j\in\mathbb{C}^{s\times n}\;(1\leq i\leq p,\;1\leq j\leq q)\) and \(F\in\mathbb{C}^{m\times n}\) are known matrices, and \(X\in\mathbb{C}^{r\times s}\) is the matrix to be determined, and the convergence analysis is given as well.