Search

This paper is concerned with several variants of the Hermitian and skew-Hermitian splitting iteration method to solve a class of complex symmetric linear systems. Theoretical analysis shows that several Hermitian and skew-Hermitian splitting based iteration methods are unconditionally convergent. Numerical experiments from an n-degree-of-freedom linear system are reported to illustrate the efficiency of the proposed methods. Copyright © 2014 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The consistent conditions and the general expressions about the Hermitian solutions of the linear matrix equations AXB=C and (AX, XB)=(C, D) are studied in depth, where A, B, C and D are given matrices of suitable sizes. The Hermitian minimum F-norm solutions are obtained for the matrix equations AXB=C and (AX, XB)=(C, D) by Moore–Penrose generalized inverse, respectively. For both matrix equations, we design iterative methods according to the fundamental idea of the classical conjugate direction method for the standard system of linear equations. Numerical results show that these iterative methods are feasible and effective in actual computations of the solutions of the above-mentioned two matrix equations. Copyright © 2006 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]