Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint

@article{Liao2007LeastsquaresSO,
  title={Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint},
  author={An-ping Liao and Yuan Lei},
  journal={Numerical Lin. Alg. with Applic.},
  year={2007},
  volume={14},
  pages={425-444}
}
An n × n real matrix A = (aij)n × n is called bi-symmetric matrix if A is both symmetric and per-symmetric, that is, aij = aji and aij = an+1−1,n+1−i (i, j = 1, 2,..., n). This paper is mainly concerned with finding the least-squares bi-symmetric solutions of matrix inverse problem AX = B with a submatrix constraint, where X and B are given matrices of suitable sizes. Moreover, in the corresponding solution set, the analytical expression of the optimal approximation solution to a given matrix A… CONTINUE READING