Abstract
AbstractWe consider the use of block preconditioners for the application of the preconditioned Krylov subspace iterative methods to the solution of large saddle point‐type systems with singular (1, 1) blocks. Two block triangular preconditioners are introduced and the block diagonal preconditioner in Greif and Schötzau (Electron. Trans. Numer. Anal. 2006; 22:114–121) is extended to nonsymmetric saddle point systems. All these preconditioners are based on augmentation, using nonsingular weight matrices. If the nullity of the (1, 1) block takes its highest possible value, the preconditioned matrix with either block triangular preconditioner has precisely three distinct eigenvalues, and the preconditioned matrix with the block diagonal preconditioner has precisely two distinct eigenvalues, giving rise to immediate convergence of preconditioned GMRES. Finally, numerical experiments that validate the analysis are reported. Copyright © 2008 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Free) 
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 call
