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