Abstract: Iterative algorithms are proposed for solving the
matrix equation with symmetric, P-commuting
symmetric or F-symmetric orthogonal
constraints if it is consistent, where matrix F
and symmetric matrix P are given. By
several times singular value decompositions of coefficient matrix product, the
different constrained solutions are constructed simply. Numerical results are
reported that show the efficiency of the proposed methods.
Keywords and phrases: iterative algorithms, orthogonal constraints, singular value decomposition, coefficient matrix product.
