The effect of approximate coarsest-level solves on the convergence of multigrid V-cycle methods
DOI10.1137/23M1578255zbMATH Open1545.65148MaRDI QIDQ6590135
Kirk M. Soodhalter, Erin Carson, Petr Vacek
Publication date: 21 August 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
stopping criteriaiterative methodsmultigrid methodV-cycle methodapproximate solverscoarse-level solvers
Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iterative solution of large sparse systems of equations
- Automated solution of differential equations by the finite element method. The FEniCS book
- Accurate error estimation in CG
- Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG
- Multigrid Techniques
- Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution
- Convergence Analysis of Perturbed Two‐Grid and Multigrid Methods
- Iterative Methods by Space Decomposition and Subspace Correction
- A Multigrid Tutorial, Second Edition
- Inexact Krylov Subspace Methods for Linear Systems
- Convergence Analysis of Inexact Two-Grid Methods: A Theoretical Framework
- Block low‐rank single precision coarse grid solvers for extreme scale multigrid methods
- Methods of conjugate gradients for solving linear systems
- Computable error bounds and estimates for the conjugate gradient method
This page was built for publication: The effect of approximate coarsest-level solves on the convergence of multigrid V-cycle methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590135)
