Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 331-363 |
Number of pages | 33 |
Journal | Numerische Mathematik |
Volume | 138 |
Issue number | 2 |
Early online date | 25 Jul 2017 |
DOIs | |
Publication status | Published - 1 Feb 2018 |
Keywords
- Stokes equations
- stabilization
- saddle-point systems
- preconditioning
- inf-sup condition