摘要

The iterative method of the generalized coupled Sylvester-conjugate matrix equations over Hermitian and generalized skew Hamiltonian solution is presented. When these systems of matrix equations are consistent, for arbitrary initial Hermitian and generalized skew Hamiltonian matrices X (j) (1), j = 1,2,ai , l, the exact solutions can be obtained by iterative algorithm within finite iterative steps in the absence of round-off errors. Furthermore, we provide a method for choosing the initial matrices to obtain the least Frobenius norm Hermitian and generalized skew Hamiltonian solution of the problem. Finally, numerical examples are presented to demonstrate the proposed algorithm is efficient.