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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
