Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints (Q870162): Difference between revisions

The matrix least squares (LS) problem \(BXA^T= F\) is considered with various linear constraints on the solutions such as symmetry, skew-symmetry, and symmetry/skew-symmetry commuting with a given symmetric matrix. Matrix iterative algorithms are proposed, based on the classical LSQR algorithm [see \textit{C. C. Paige} and \textit{M. A. Saunders}, ACM Trans. Math. Softw. 8, 43--71 (1982; Zbl 0478.65016)] for solving the unconstrained LS problem. Numerical examples are given to display the efficiency of the algorithms.