摘要

By utilizing the preconditioned Hermitian and skew-Hermitian splitting (PHSS) iteration technique, we establish a non-alternating PHSS (NPHSS) iteration method for solving large sparse non-Hermitian positive definite linear systems. The convergence analysis demonstrates that the iterative series produced by the NPHSS method converge to the unique solution of the linear system when the parameters satisfy some moderate conditions. We also give a possible optimal upper bound for the iterative spectral radius. Moreover, to reduce the computational cost, we establish an inexact variant of the NPHSS (INPHSS) iteration method whose convergence property is studied. Both theoretical and numerical results validate that the NPHSS method outperforms the PHSS method when the Hermitian part of the coefficient matrix is dominant.