Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5776350 | Journal of Computational and Applied Mathematics | 2017 | 21 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhuo-Hong Huang, Hong Su,