Rates of robust superlinear convergence of preconditioned Krylov methods for elliptic FEM problems
From MaRDI portal
Publication:6543333
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
Cites work
- A Note on the Superlinear Convergence of GMRES
- Entropy Numbers and Approximation Numbers in Function Spacess
- Equivalent operator preconditioning for elliptic problems
- Functional analysis, Sobolev spaces and partial differential equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Iterative Solution Methods
- Mesh Independent Superlinear PCG Rates Via Compact-Equivalent Operators
- Mesh independent superlinear convergence estimates of the conjugate gradient method for some equivalent self-adjoint operators.
- Robust Superlinear Krylov Convergence for Complex Noncoercive Compact-Equivalent Operator Preconditioners
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- Superlinear convergence of the GMRES for PDE-constrained optimization problems
- Widths of embeddings in function spaces
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)
