Local Solvers for High-Order Patch Smoothers via p-Multigrid
By: Michał Wichrowski
Potential Business Impact:
Solves hard math problems faster on computers.
I propose a vertex patch smoother where local problems are solved inexactly by a nested, matrix-free p-multigrid, creating a multigrid-within-multigrid framework. A single iteration of the local solver can be evaluated with $\mathcal{O}(p^{d+1})$ operations, and the approach is applicable to non-separable problems on unstructured meshes. Numerical experiments demonstrate limited sensitivity to geometric distortion and high-contrast coefficients. When used in a global geometric multigrid solver, the method achieves robustness with respect to both polynomial degree $p$ and mesh refinement, even on heavily distorted meshes.
Similar Papers
A scalable high-order multigrid-FFT Poisson solver for unbounded domains on adaptive multiresolution grids
Numerical Analysis (Math)
Solves hard math problems faster for science.
Implementation techniques for multigrid solvers for high-order Discontinuous Galerkin methods
Numerical Analysis
Makes computer simulations run much faster.
Large-scale Multigrid with Adaptive Galerkin Coarsening
Performance
Solves huge math problems faster with less memory.