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 (https://doi.org/10.1007/s00211-017-0908-4)
Preview |
Text.
Filename: Pearson_etal_NM2017_Refined_saddle_point_preconditioners_for_discretized_Stokes_problems.pdf
Final Published Version License: 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.
-
-
Item type: Article ID code: 61193 Dates: DateEvent1 February 2018Published25 July 2017Published Online1 July 2017Accepted20 January 2016SubmittedSubjects: Science > Mathematics Department: Faculty of Science > Mathematics and Statistics Depositing user: Pure Administrator Date deposited: 03 Jul 2017 11:41 Last modified: 24 Mar 2024 02:28 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/61193
CORE (COnnecting REpositories)