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