An iterative algorithm is proposed for solving the least-squares problem of a general matrix equation , where () are to be determined centro-symmetric matrices with given central principal submatrices. For any initial iterative matrices, we show that the least-squares solution can be derived by this method within finite iteration steps in the absence of roundoff errors. Meanwhile, the unique optimal approximation solution pair for given matrices can also be obtained by the least-norm least-squares solution of matrix equation , in which . The given numerical examples illustrate the efficiency of this algorithm.
"An Iterative Method for the Least-Squares Problems of a General Matrix Equation Subjects to Submatrix Constraints." J. Appl. Math. 2013 1 - 11, 2013. https://doi.org/10.1155/2013/697947