A note on constraint preconditioners for nonsymmetric saddle point problems
β Scribed by Yiqin Lin; Yimin Wei
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 89 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1070-5325
- DOI
- 10.1002/nla.536
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
A class of constraint preconditioners for solving twoβbyβtwo block linear equations with the (1,2)βblock being the transpose of the (2,1)βblock and the (2,2)βblock being zero was investigated in a recent paper of Cao (Numer. Math. 2006; 103:47β61). In this short note, we extend his idea by allowing the (1,2)βblock to be not equal to the transpose of the (2,1)βblock. Results concerning the spectrum, the form of the eigenvectors and the convergence behaviour of a Krylov subspace method, such as GMRES are presented. Copyright Β© 2007 John Wiley & Sons, Ltd.
π SIMILAR VOLUMES
## Abstract In this note, results concerning the eigenvalue distribution and form of the eigenvectors of the constraint preconditioned generalized saddle point matrix and its minimal polynomial are given. These results extend previous ones that appeared in the literature. Copyright Β© 2009 John Wile
Three domain decomposition methods for saddle point problems are introduced and compared. The first two are blockdiagonal and block-triangular preconditioners with diagonal blocks approximated by an overlapping Schwarz technique with positive definite local and coarse problems. The third is an overl