Rates of robust superlinear convergence of preconditioned Krylov methods for elliptic FEM problems
From MaRDI portal
Publication:6543333
DOI10.1007/S11075-023-01663-1MaRDI QIDQ6543333FDOQ6543333
Authors: S. J. Castillo, János Karátson 
Publication date: 24 May 2024
Published in: Numerical Algorithms (Search for Journal in Brave)
Recommendations
- On the Superlinear Convergence Rate of the Preconditioned CGM for Some Nonsymmetric Elliptic Problems
- Robust Superlinear Krylov Convergence for Complex Noncoercive Compact-Equivalent Operator Preconditioners
- Superlinearly convergent CG methods via equivalent preconditioning for nonsymmetric elliptic operators
- scientific article; zbMATH DE number 572208
- Superlinearly convergent PCG algorithms for some nonsymmetric elliptic systems
finite element methodelliptic boundary value problemssuperlinear convergencepreconditioned Krylov iterations
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)
