Refined saddle-point preconditioners for discretized Stokes problems

Pearson, John W. and Pestana, Jennifer and Silvester, David J. (2018) Refined saddle-point preconditioners for discretized Stokes problems. Numerische Mathematik, 138 (2). pp. 331-363. ISSN 0029-599X

[thumbnail of Pearson-etal-NM2017-Refined-saddle-point-preconditioners-for-discretized-Stokes-problems]
Preview
Text (Pearson-etal-NM2017-Refined-saddle-point-preconditioners-for-discretized-Stokes-problems)
Pearson_etal_NM2017_Refined_saddle_point_preconditioners_for_discretized_Stokes_problems.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (1MB)| Preview

    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.

    ORCID iDs

    Pearson, John W., Pestana, Jennifer ORCID logoORCID: https://orcid.org/0000-0003-1527-3178 and Silvester, David J.;