Abstract
Abstract In this paper, the generalized shift-splitting (GSS) preconditioner is implemented for solving a class of generalized saddle point problems which stem from the solution of complex symmetric linear systems. The GSS preconditioner is induced by the generalized shift-splitting iterative method. Theoretical analysis shows that the generalized shift-splitting iterative method is unconditionally convergent. Some numerical experiments are provided to show the effectiveness of the proposed preconditioner.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
