Abstract
In this paper, a new relaxed splitting preconditioner is proposed for the generalized saddle point problems. The proposed preconditioner is based on a new matrix splitting of the coefficient matrix and is easier to be implemented than the dimensional splitting preconditioner. Eigenvalue distribution of the preconditioned matrix is analyzed. An upper bound of the degree of the minimal polynomial of the preconditioned matrix is discussed. Finally, some numerical experiments are illustrated to show the efficiency of the new preconditioner.
Sign-in/Register to access full text options 
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.
