Refined saddle-point preconditioners for discretized Stokes problems

John W. Pearson, Jennifer Pestana, David J. Silvester

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)
41 Downloads (Pure)

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 languageEnglish
Pages (from-to)331-363
Number of pages33
JournalNumerische Mathematik
Volume138
Issue number2
Early online date25 Jul 2017
DOIs
Publication statusPublished - 1 Feb 2018

Keywords

  • Stokes equations
  • stabilization
  • saddle-point systems
  • preconditioning
  • inf-sup condition

Cite this