Refined Saddle-Point Preconditioners for Discretized Stokes Problems

John W.  Pearson; Jennifer Pestana; David Silvester

doi:10.1007/s00211-017-0908-4

Refined Saddle-Point Preconditioners for Discretized Stokes Problems

John W. Pearson, Jennifer Pestana, David Silvester

Research output: Contribution to journal › Article › peer-review

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
Journal	NUMERISCHE MATHEMATIK
Early online date	25 Jul 2017
DOIs	https://doi.org/10.1007/s00211-017-0908-4
Publication status	Published - 2017

Keywords

Stokes equations
Stabilization
saddle-point systems
Preconditioning
inf-sup condition

Access to Document

10.1007/s00211-017-0908-4Licence: CC BY

Cite this

@article{d68cd777a5ab44beb415715dc08bfdcd,

title = "Refined Saddle-Point Preconditioners for Discretized Stokes Problems",

abstract = "This paper is concerned with the implementation of efficient solution algorithms forelliptic 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.",

keywords = "Stokes equations, Stabilization, saddle-point systems, Preconditioning, inf-sup condition",

author = "Pearson, {John W.} and Jennifer Pestana and David Silvester",

year = "2017",

doi = "10.1007/s00211-017-0908-4",

language = "English",

journal = "NUMERISCHE MATHEMATIK",

issn = "0945-3245",

publisher = "Springer Nature",

}

TY - JOUR

T1 - Refined Saddle-Point Preconditioners for Discretized Stokes Problems

AU - Pearson, John W.

AU - Pestana, Jennifer

AU - Silvester, David

PY - 2017

Y1 - 2017

N2 - This paper is concerned with the implementation of efficient solution algorithms forelliptic 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.

AB - This paper is concerned with the implementation of efficient solution algorithms forelliptic 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.

KW - Stokes equations

KW - Stabilization

KW - saddle-point systems

KW - Preconditioning

KW - inf-sup condition

U2 - 10.1007/s00211-017-0908-4

DO - 10.1007/s00211-017-0908-4

M3 - Article

SN - 0945-3245

JO - NUMERISCHE MATHEMATIK

JF - NUMERISCHE MATHEMATIK

ER -

Refined Saddle-Point Preconditioners for Discretized Stokes Problems

Abstract

Keywords

Access to Document

Fingerprint

Cite this