REVIEW 2 cited by
Multigrid methods for the Stokes problem on GPU systems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
This paper presents a matrix-free multigrid method for solving the Stokes problem, discretized using $H^{\text{div}}$-conforming discontinuous Galerkin methods. We employ a Schur complement method combined with the fast diagonalization method for the efficient evaluation of the local solver within the multiplicative Schwarz smoother. This approach operates directly on both the velocity and pressure spaces, eliminating the need for a global Schur complement approximation. By leveraging the tensor product structure of Raviart-Thomas elements and an optimized, conflict-free shared memory access pattern, the matrix-free operator evaluation demonstrates excellent performance numbers, reaching over one billion degrees of freedom per second on a single NVIDIA A100 GPU. Numerical results indicate efficiency comparable to that of the three-dimensional Poisson problem.
Forward citations
Cited by 2 Pith papers
-
Tensor-product vertex patch smoothers for biharmonic problems
Vertex-patch smoothers with approximate fast-diagonalized local solvers give a fast, mesh-uniform multigrid method for C0 interior penalty discretizations of the biharmonic equation on Cartesian meshes.
-
Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in $H(\mathrm{div})$
Three preconditioners for H(div) interior penalty DG are constructed and analyzed, with provably h-, p-, and eta-robust conditioning on affine and Cartesian meshes.
Discussion (0). Continue with ORCID to comment.