Refined saddle-point preconditioners for discretized Stokes problems
نویسندگان
چکیده
This paper is concerned with the implementation of efficient solution algorithms for elliptic problems with constraints. We establish theory which shows that including a simple scaling within well-established block diagonal preconditioners for Stokes problems can result in significantly faster convergence when applying the preconditioned MINRES method. The codes used in the numerical studies are available online.
منابع مشابه
UN CO RR EC TE D PR O O F 1 On Block Preconditioners for Generalized Saddle 2 Point Problems
We assume that A is n×n and C is an m×m matrix. Many such systems arise from 9 the discretization of (systems of) partial differential equations. For example, Stokes 10 equations discretized with stable finite elements or a mixed finite element method 11 for second order elliptic PDEs lead to a positive definite matrix A and to C = 0, so 12 that (1) has a genuine saddle point structure. Certain...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملTwo preconditioners for saddle point problems in fluid flows
In this paper two preconditioners for the saddle point problem are analysed: one based on the augmented Lagrangian approach and another involving artificial compressibility. Eigenvalue analysis shows that with these preconditioners small condition numbers can be achieved for the preconditioned saddle point matrix. The preconditioners are compared with commonly used preconditioners from literatu...
متن کاملDomain Decomposition Algorithms for Saddle Point Problems
In this paper, we introduce some domain decomposition methods for saddle point problems with or without a penalty term, such as the Stokes system and the mixed formulation of linear elasticity. We also consider more general nonsymmetric problems, such as the Oseen system, which are no longer saddle point problems but can be studied in the same abstract framework which we adopt. Several approach...
متن کاملEVIEW A RTICLE Preconditioners for Incompressible Navier - Stokes Solvers †
In this paper we give an overview of the present state of fast solvers for the solution of the incompressible Navier-Stokes equations discretized by the finite element method and linearized by Newton or Picard’s method. It is shown that block preconditioners form an excellent approach for the solution, however if the grids are not to fine preconditioning with a Saddle point ILU matrix (SILU) ma...
متن کامل