Numerical solutions of \(AXB = C\) for mirrorsymmetric matrix \(X\) under a specified submatrix constraint (Q708830)

For given \(A\in \mathbb{R}^{m\times n}\), \(B\in \mathbb{R}^{n\times s}\), \(C\in \mathbb{R}^{m\times s}\) and \(X_p\in \mathbb{R}^{p\times p}\) with \(n=2r+p\), the authors present an efficient algorithm for minimizing \(\|AXB-C\|\) based on the classical conjugate gradient least squares method, where \(\|\cdot\|\) is the Frobenius norm and \(X\in \mathbb{R}^{n\times n}\) is mirrorsymmetric with the specified central submatrix \([x_{ij}]_{r+1\leq i,j\leq r+p}=X_p\). They show that the algorithm is stable and can produce a suitable \(X\) such that \(AXB=C\) in finitely many steps if such an \(X\) exists. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.