The PPS method-based constraint preconditioners for generalized saddle point problems
- 18 Downloads
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.
KeywordsGeneralized saddle point problems Non-Hermitian matrix Positive definite matrix Constraint Preconditioner
Mathematics Subject Classification65F10 65F08
The authors would like to express their great thankfulness to the referees for the comments and constructive suggestions, which were valuable in improving the quality of the original paper. The project was supported by the National Natural Science Foundation of China (No. 11371081) and Liaoning Natural Science Foundation (No. 20170540323).
- Li C-L and Ma C-F (2017) The Uzawa-PPS iteration methods for nonsingular and singular non-Hermitian saddle point problems. Comput Math ApplGoogle Scholar