LSMR iterative method for general coupled matrix equations (Q2336938): Difference between revisions

Summary: By extending the idea of LSMR method, we present an iterative method to solve the general coupled matrix equations \(\sum_{k = 1}^q A_{i k} X_k B_{i k} = C_i, i = 1,2, \dots, p\), (including the generalized (coupled) Lyapunov and Sylvester matrix equations as special cases) over some constrained matrix groups \((X_1, X_2, \ldots, X_q)\), such as symmetric, generalized bisymmetric, and \((R, S)\)-symmetric matrix groups. By this iterative method, for any initial matrix group \((X_1^{(0)}, X_2^{(0)}, \dots, X_q^{(0)})\), a solution group \((X_1^*, X_2^*, \dots, X_q^*)\) can be obtained within finite iteration steps in absence of round-off errors, and the minimum Frobenius norm solution or the minimum Frobenius norm least-squares solution group can be derived when an appropriate initial iterative matrix group is chosen. In addition, the optimal approximation solution group to a given matrix group \((\overline{X}_1, \overline{X}_2, \ldots, \overline{X}_q)\) in the Frobenius norm can be obtained by finding the least Frobenius norm solution group of new general coupled matrix equations. Finally, numerical examples are given to illustrate the effectiveness of the presented method.