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...
Auteurs principaux: | Farrell, PE, Knepley, MG, Mitchell, L, Wechsung, F |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
Association for Computing Machinery
2021
|
Documents similaires
-
Robust multigrid methods for nearly incompressible elasticity using macro elements
par: Farrell, P, et autres
Publié: (2022) -
Multigrid Relaxation Methods and the Analysis of Lightness, Shading and Flow
par: Terzopoulos, Demetri
Publié: (2004) -
Multigrid solvers for the de Rham complex with optimal complexity in polynomial degree
par: Brubeck, PD, et autres
Publié: (2024) -
Monolithic multigrid for implicit Runge-Kutta discretizations of incompressible fluid flow
par: Abu-Labdeh, R, et autres
Publié: (2023) -
Monolithic multigrid for magnetohydrodynamics
par: Adler, J, et autres
Publié: (2021)