PCPATCH: software for the topological construction of multigrid relaxation methods
Effective relaxation methods are necessary for good multigrid convergence. For many equations, standard Jacobi and Gauß–Seidel are inadequate, and more sophisticated space decompositions are required; examples include problems with semidefinite terms or saddle point structure. In this article, we pr...
Main Authors: | Farrell, PE, Knepley, MG, Mitchell, L, Wechsung, F |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Association for Computing Machinery
2021
|
Similar Items
-
Robust multigrid methods for nearly incompressible elasticity using macro elements
by: Farrell, P, et al.
Published: (2022) -
Multigrid Relaxation Methods and the Analysis of Lightness, Shading and Flow
by: Terzopoulos, Demetri
Published: (2004) -
Multigrid solvers for the de Rham complex with optimal complexity in polynomial degree
by: Brubeck, PD, et al.
Published: (2024) -
Monolithic multigrid for implicit Runge-Kutta discretizations of incompressible fluid flow
by: Abu-Labdeh, R, et al.
Published: (2023) -
Monolithic multigrid for magnetohydrodynamics
by: Adler, J, et al.
Published: (2021)