Abstract
Various block preconditioners for two by two block linear saddle point systems are studied. All block preconditioners are derived from a splitting of the (1,1) block of the two by two block matrix. We analyze the properties of the corresponding preconditioned matrices, in particular their spectra, and discuss the computational performance of the preconditioned iterative methods. It is shown that fast convergence depends mainly on the quality of the splitting of the (1,1) block. Moreover, some strategies of the implementation of the block preconditioners based on purely algebraic considerations are discussed. Thus, applying our block preconditioners to the related saddle point problems, we obtain preconditioned iterative methods in a “black box” fashion.
Keywords: saddle point systems, iterative methods, preconditioning, convergence, algebraic, eigenvalues, block preconditioners
Related Books
Boundary Element Methods for Heat Transfer with Phase Change Problems: Theory and Application
Advanced Calculus - Fundamentals of Mathematics
Advanced Numerical Methods for Complex Environmental Models: Needs and Availability
An Introduction to Sobolev Spaces
An Introduction to Trigonometry and its Applications
Analysis and Optimal Control of Phase-Field Transition System: Fractional Steps Methods
Applied Computational Mathematics in Social Sciences
Calculus: The Logical Extension of Arithmetic
Complex Analyses in Engineering, Science and Technology
Convergence Theorems for Lattice Group-Valued Measures