343 research outputs found
A class of nonsymmetric preconditioners for saddle point problems
For iterative solution of saddle point problems, a nonsymmetric preconditioning is studied which, with respect to the upper-left block of the system matrix, can be seen as a variant of SSOR. An idealized situation where the SSOR is taken with respect to the skew-symmetric part plus the diagonal part of the upper-left block is analyzed in detail. Since action of the preconditioner involves solution of a Schur complement system, an inexact form of the preconditioner can be of interest. This results in an inner-outer iterative process. Numerical experiments with solution of linearized Navier-Stokes equations demonstrate efficiency of the new preconditioner, especially when the left-upper block is far from symmetric
Absolute value preconditioning for symmetric indefinite linear systems
We introduce a novel strategy for constructing symmetric positive definite
(SPD) preconditioners for linear systems with symmetric indefinite matrices.
The strategy, called absolute value preconditioning, is motivated by the
observation that the preconditioned minimal residual method with the inverse of
the absolute value of the matrix as a preconditioner converges to the exact
solution of the system in at most two steps. Neither the exact absolute value
of the matrix nor its exact inverse are computationally feasible to construct
in general. However, we provide a practical example of an SPD preconditioner
that is based on the suggested approach. In this example we consider a model
problem with a shifted discrete negative Laplacian, and suggest a geometric
multigrid (MG) preconditioner, where the inverse of the matrix absolute value
appears only on the coarse grid, while operations on finer grids are based on
the Laplacian. Our numerical tests demonstrate practical effectiveness of the
new MG preconditioner, which leads to a robust iterative scheme with minimalist
memory requirements
Preconditioning and fast solvers for incompressible flow
We give a brief description with references of work on fast solution methods for incompressible Navier-Stokes problems which has been going on for about a decade. Specifically we describe preconditioned iterative strategies which involve the use of simple multigrid cycles for subproblems
Preconditioning for Sparse Linear Systems at the Dawn of the 21st Century: History, Current Developments, and Future Perspectives
Iterative methods are currently the solvers of choice for large sparse linear systems of equations. However, it is well known that the key factor for accelerating, or even allowing for, convergence is the preconditioner. The research on preconditioning techniques has characterized the last two decades. Nowadays, there are a number of different options to be considered when choosing the most appropriate preconditioner for the specific problem at hand. The present work provides an overview of the most popular algorithms available today, emphasizing the respective merits and limitations. The overview is restricted to algebraic preconditioners, that is, general-purpose algorithms requiring the knowledge of the system matrix only, independently of the specific problem it arises from. Along with the traditional distinction between incomplete factorizations and approximate inverses, the most recent developments are considered, including the scalable multigrid and parallel approaches which represent the current frontier of research. A separate section devoted to saddle-point problems, which arise in many different applications, closes the paper
- …