Abstract
Recently, Huang and Su [A modified shift-splitting method for nonsymmetric saddle, <i>Journal of Computational and Applied Mathematics</i>, 317 (2017) 535-546] introduced a modified shift-splitting (denoted by MSSP) preconditioner. In this paper, based on modified shift-splitting (denoted by MSSP) iteration technique, we establish a accelerated (named after AMSSP) iterative method for nonsymmetric saddle point problems. Furthermore, we theoretically verify the AMSSP iteration method unconditionally converges to the unique solution of the saddle point problems, compute the spectral radius of the AMSSP iteration matrix. Finally, numerical examples show the spectrum of the new preconditioned matrix for the different parameters.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
