An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB = C\) (Q2572054)

A new iteration method is proposed to solve the minimum Frobenius norm residual problem: \(\min\| AXB- C\|\) with unknown symmetric matrix \(X\). The algorithm is finite with any initial symmetric matrix, and the solution with least norm can be obtained with special selection of the initial symmetric matrix. The algorithm is also used to find the optimal approximation solution to a given matrix. Numerical examples illustrate the methodology.