PCPATCH: software for the topological construction of multigrid relaxation methods
From MaRDI portal
Abstract: Effective relaxation methods are necessary for good multigrid convergence. For many equations, standard Jacobi and Gau{ss}-Seidel are inadequate, and more sophisticated space decompositions are required; examples include problems with semidefinite terms or saddle point structure. In this paper we present a unifying software abstraction, PCPATCH, for the topological construction of space decompositions for multigrid relaxation methods. Space decompositions are specified by collecting topological entities in a mesh (such as all vertices or faces) and applying a construction rule (such as taking all degrees of freedom in the cells around each entity). The software is implemented in PETSc and facilitates the elegant expression of a wide range of schemes merely by varying solver options at runtime. In turn, this allows for the very rapid development of fast solvers for difficult problems.
Cited in
(6)- A black-box, multilevel algebraic preconditioning framework for conforming finite elements
- Coupling-Aware Vanka Smoothing for Multigrid Preconditioning of the Implicit Immersed Boundary Equations
- Parameter-Robust Subspace Correction with Multiple Semidefinite Penalties
- Energy conserving compatible space--time FEM for deterministic and stochastic rotating shallow water
- Preconditioning proximal Galerkin: mesh and degree robust solvers for variational inequalities
- A unified variational framework for augmented Lagrangian preconditioning of saddle point systems: applications to mixed-dimensional and fictitious domain methods
This page was built for publication: PCPATCH: software for the topological construction of multigrid relaxation methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6331340)
