Rates of robust superlinear convergence of preconditioned Krylov methods for elliptic FEM problems-Reference-Cited by-同舟云学术

Rates of robust superlinear convergence of preconditioned Krylov methods for elliptic FEM problems

Published:2023-10-07 Issue: Volume: Page:
ISSN:1017-1398
Container-title:Numerical Algorithms
language:en
Short-container-title:Numer Algor

Author:

Castillo S. J.,Karátson J.

Abstract

AbstractThis paper considers the iterative solution of finite element discretizations of second-order elliptic boundary value problems. Mesh independent estimations are given for the rate of superlinear convergence of preconditioned Krylov methods, involving the connection between the convergence rate and the Lebesgue exponent of the data. Numerical examples demonstrate the theoretical results.

Funder

Nemzeti Kutatási Fejlesztési és Innovációs Hivatal

Eötvös Loránd University

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics

Link

https://link.springer.com/content/pdf/10.1007/s11075-023-01663-1.pdf

Reference16 articles.

1. Axelsson, O.: Iterative solution methods. Cambridge University Press (1994)

2. Axelsson, O., Karátson, J.: Mesh independent superlinear PCG rates via compact-equivalent operators. SIAM J. Numer. Anal. 45(4), 1495–1516 (2007)

3. Axelsson, O., Karátson, J.: Equivalent operator preconditioning for elliptic problems. Numer. Algorithms 50(3), 297–380 (2009)

4. Axelsson, O., Karátson, J.: Superlinear convergence of the GMRES for pde-constrained optimization problems. Numer. Funct. Anal. Optim. 39(9), 921–936 (2018)

5. Axelsson, O., Karátson, J., Magoules, F.: Robust superlinear Krylov convergence for complex non-coercive compact-equivalent operator preconditioners. SIAM J. Numer. Anal. 61(2), 1057–1079 (2023)