Skip to main content
Kent Academic Repository

Refined saddle-point preconditioners for discretized Stokes problems

Pearson, John W., Pestana, Jennifer, Silvester, David J. (2017) Refined saddle-point preconditioners for discretized Stokes problems. Numerische Mathematik, 138 (2). pp. 331-363. ISSN 0029-599X. (doi:10.1007/s00211-017-0908-4) (KAR id:53811)

PDF Publisher pdf
Language: English

Download this file
[thumbnail of 10.1007%2Fs00211-017-0908-4.pdf]
Request a format suitable for use with assistive technology e.g. a screenreader
PDF Author's Accepted Manuscript
Language: English

Restricted to Repository staff only
Contact us about this Publication
[thumbnail of Stokes_NumerMath.pdf]
Official URL:


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.

Item Type: Article
DOI/Identification number: 10.1007/s00211-017-0908-4
Subjects: Q Science > QA Mathematics (inc Computing science) > QA297 Numerical analysis
Q Science > QA Mathematics (inc Computing science) > QA377 Partial differential equations
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Mathematics, Statistics and Actuarial Science
Funders: Engineering and Physical Sciences Research Council (
Depositing User: John Pearson
Date Deposited: 20 Jan 2016 17:15 UTC
Last Modified: 04 Mar 2024 16:00 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

Pearson, John W..

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.