Abstract
For the large sparse generalized saddle point problems with non-Hermitian (1,1) blocks, we introduce a constraint preconditioner, which is based on the positive definite and semidefinite splitting (PPS) iteration method. Then we discuss one trait of the PPS-based constraint preconditioner, such as invertibility. We give the convergence of conditions of the preconditioning iteration method. Moreover, numerical experiments are given to illustrate that PPS-based constraint preconditioner has an obvious advantage of efficiency.
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.
