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

DOI10.1007/S11075-023-01663-1MaRDI QIDQ6543333FDOQ6543333

S. J. Castillo, János Karátson

Publication date: 24 May 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

finite element methodelliptic boundary value problemssuperlinear convergencepreconditioned Krylov iterations

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Functional analysis, Sobolev spaces and partial differential equations
• Entropy Numbers and Approximation Numbers in Function Spacess
• Iterative Solution Methods
• Widths of embeddings in function spaces
• Mesh Independent Superlinear PCG Rates Via Compact-Equivalent Operators
• Equivalent operator preconditioning for elliptic problems
• A Note on the Superlinear Convergence of GMRES
• Some Superlinear Convergence Results for the Conjugate Gradient Method
• Mesh independent superlinear convergence estimates of the conjugate gradient method for some equivalent self-adjoint operators.
• Superlinear Convergence of the GMRES for PDE-Constrained Optimization Problems
• Robust Superlinear Krylov Convergence for Complex Noncoercive Compact-Equivalent Operator Preconditioners

This page was built for publication: Rates of robust superlinear convergence of preconditioned Krylov methods for elliptic FEM problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543333)