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
This work is licensed under a Creative Commons Attribution 4.0 International License.
|
|
Download this file (PDF/1MB) |
Preview |
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
|
|
Official URL: http://dx.doi.org/10.1007/s00211-017-0908-4 |
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 |
---|---|
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 (https://ror.org/0439y7842) |
Depositing User: | John Pearson |
Date Deposited: | 20 Jan 2016 17:15 UTC |
Last Modified: | 04 Mar 2024 16:00 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/53811 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):