The ( R, S )-symmetric least squares solutions of the general coupled matrix equations.

Letandbe two real symmetric orthogonal matrices. Anreal matrixis said to be an-symmetric matrix if. The-symmetric matrices have been widely used in engineering and scientific computing. In this paper, we construct an algorithm to solve the general coupled matrix equations, whereis a-symmetric matrix. The algorithm produces suitablesuch thatis minimized within a finite number of iteration steps in the absence of round-off errors. We show that the algorithm is stable any case. The algorithm requires little storage capacity. Numerical examples are given to show that the algorithm is efficient. [ABSTRACT FROM AUTHOR]