Least Squares Based Iterative Algorithm for the Coupled Sylvester Matrix Equations

الملخص EN

By analyzing the eigenvalues of the related matrices, the convergence analysis of the least squares based iteration is given for solving the coupled Sylvester equations AX+YB=C and DX+YE=F in this paper.

The analysis shows that the optimal convergence factor of this iterative algorithm is 1.

In addition, the proposed iterative algorithm can solve the generalized Sylvester equation AXB+CXD=F.

The analysis demonstrates that if the matrix equation has a unique solution then the least squares based iterative solution converges to the exact solution for any initial values.

A numerical example illustrates the effectiveness of the proposed algorithm.