The reflexive least squares solutions of the matrix equation with a submatrix constraint

In this paper, an efficient algorithm is presented for minimizing where is the Frobenius norm, is a reflexive matrix with a specified central principal submatrix . The algorithm produces suitable such that within finite iteration steps in the absence of roundoff errors. We show that the algorithm is stable any case. The algorithm requires little storage capacity. Given numerical examples show that the algorithm is efficient.