科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we propose a modified generalized shift-splitting (denoted by MGSSP) preconditioned method for solving large sparse saddle-point problems. By theoretical analyses, we verify the MGSSP iteration method unconditionally converges to the unique solution of the saddle point problems, estimate the sharp eigenvalue bounds of the related iteration matrix and point out the corresponding preconditioned matrix is positive real. Finally, we perform some numerical computations to show the efficiency and the feasibility of the MGSSP preconditioner.
