Multigrid methods for the Stokes problem on GPU systems
arXiv:2410.09497 · doi:10.1016/j.compfluid.2025.106703
Abstract
This paper presents a matrix-free multigrid method for solving the Stokes problem, discretized using -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.
References in corpus (13)
- High order exactly divergence-free Hybrid Discontinuous Galerkin Methods for unsteady incompressible flows
- A finite element method with strong mass conservation for Biot's linear consolidation model
- A high-order semi-explicit discontinuous Galerkin solver for 3D incompressible flow with application to DNS and LES of turbulent channel flow
- Efficient Exascale Discretizations: High-Order Finite Element Methods
- On the stability of projection methods for the incompressible Navier-Stokes equations based on high-order discontinuous Galerkin discretizations
- Dissecting Tensor Cores via Microbenchmarks: Latency, Throughput and Numeric Behaviors
- Efficiency of high-performance discontinuous Galerkin spectral element methods for under-resolved turbulent incompressible flows
- Multigrid methods for Hdiv-conforming discontinuous Galerkin methods for the Stokes equations
- Low-order preconditioning for the high-order finite element de Rham complex
- High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners
- Fast Tensor Product Schwarz Smoothers for High-Order Discontinuous Galerkin Methods
- Matrix-free GPU-accelerated saddle-point solvers for high-order problems in
- An implementation of tensor product patch smoothers on GPU