Abstract
In this paper, we execute the shift-splitting preconditioner for asymmetric saddle point problems with its (1,2) block's transposition unequal to its (2,1) block under the removed minus of its (2,1) block. The proposed preconditioner is stemmed from the shift splitting (SS) iteration method for solving asymmetric saddle point problems, which is convergent under suitable conditions. The relaxed version of the shift-splitting preconditioner is obtained as well. The spectral distributions of the related preconditioned matrices are given. Numerical experiments from the Stokes problem are offered to show the convergence performance of these two preconditioners.
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
