Search

• We proposed an iterative algorithm for a class of generalized coupled Sylvester-conjugate matrix equations over generalized Hamiltonian matrix. • We proved the proposed algorithm is finitely terminated. • Some numerical examples are tested to verify the efficiency and stability of the proposed algorithm. In this work, we present an iterative algorithm to solve a class of generalized coupled Sylvester-conjugate matrix equations over the generalized Hamiltonian matrices. We show that if the equations are consistent, a generalized Hamiltonian solution can be obtained within finite iteration steps in the absence of round-off errors for any initial generalized Hamiltonian matrix by the proposed iterative algorithm. Furthermore, we can obtain the minimum-norm generalized Hamiltonian solution by choosing the special initial matrices. Finally, numerical examples show that the iterative algorithm is effective. [ABSTRACT FROM AUTHOR]

In this work, we introduce a modified generalized shift-splitting (MGSS) iteration method for a class of complex symmetric linear systems. Meanwhile, we establish the convergence analysis and give the spectral properties of the corresponding preconditioned matrix. Finally, a numerical example illustrates the effectiveness of the MGSS. [ABSTRACT FROM AUTHOR]