Least squares solutions to AX = B for bisymmetric matrices under a central principal submatrix constraint and the optimal approximation Original Research Article

A matrix Aset membership, variantRn×n is called a bisymmetric matrix if its elements ai,j satisfy the properties ai,j=aj,i and ai,j=an-j+1,n-i+1 for 1less-than-or-equals, slanti,jless-than-or-equals, slantn. This paper considers least squares solutions to the matrix equation AX=B for A under a central principal submatrix constraint and the optimal approximation. A central principal submatrix is a submatrix obtained by deleting the same number of rows and columns in edges of a given matrix. We first discuss the specified structure of bisymmetric matrices and their central principal submatrices. Then we give some necessary and sufficient conditions for the solvability of the least squares problem, and derive the general representation of the solutions. Moreover, we also obtain the expression of the solution to the corresponding optimal approximation problem.