| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4632833 | Applied Mathematics and Computation | 2010 | 8 Pages |
Abstract
For the iterative solution of large sparse generalized saddle point problems, a class of new constraint preconditioners is presented, and the spectral properties and parameter choices are discussed. Numerical experiments are used to demonstrate the feasibility and effectiveness of the new preconditioners, as well as their advantages over the modified product-type skew-Hermitian triangular splitting (MPSTS) preconditioners.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Guo-Feng Zhang, Jing-Yu Zhao,