A modified shift-splitting method for nonsymmetric saddle point problems

摘要

To solve large sparse saddle point problems, based on modified shift-splitting (denoted by MSSP) iteration technique, a MSSP preconditioner is proposed. We theoretically verify the MSSP iteration method unconditionally converges to the unique solution of the saddle point problems, compute the spectral radius of the MSSP iteration matrix and estimate the sharp bounds of the eigenvalues of the corresponding iteration matrix. Numerical experiments show that the MSSP iteration method is effective and accurate.