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 |
---|---|
פורמט: | Journal article |
שפה: | English |
יצא לאור: |
Association for Computing Machinery
2021
|
פריטים דומים
-
Robust multigrid methods for nearly incompressible elasticity using macro elements
מאת: Farrell, P, et al.
יצא לאור: (2022) -
Multigrid Relaxation Methods and the Analysis of Lightness, Shading and Flow
מאת: Terzopoulos, Demetri
יצא לאור: (2004) -
Multigrid solvers for the de Rham complex with optimal complexity in polynomial degree
מאת: Brubeck, PD, et al.
יצא לאור: (2024) -
Monolithic multigrid for implicit Runge-Kutta discretizations of incompressible fluid flow
מאת: Abu-Labdeh, R, et al.
יצא לאור: (2023) -
Monolithic multigrid for magnetohydrodynamics
מאת: Adler, J, et al.
יצא לאור: (2021)