Matrix-free GPU-accelerated saddle-point solvers for high-order problems in H(\mathrm{div})

DOI10.1137/23M1568806MaRDI QIDQ6434176zbMATH OpenOpenAlexFDO

Authors Will Pazner, Tzanio V. Kolev, Panayot S. Vassilevski

Publication date 24 April 2023

Full work available at URL https://doi.org/10.1137/23m1568806

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Parallel numerical computation (65Y05)

Abstract: This work describes the development of matrix-free GPU-accelerated solvers for high-order finite element problems in $H(mathrmdiv)$. The solvers are applicable to grad-div and Darcy problems in saddle-point formulation, and have applications in radiation diffusion and porous media flow problems, among others. Using the interpolation-histopolation basis (cf. SIAM J. Sci. Comput., 45 (2023), A675-A702, arXiv:2203.02465), efficient matrix-free preconditioners can be constructed for the $(1,1)$-block and Schur complement of the block system. With these approximations, block-preconditioned MINRES converges in a number of iterations that is independent of the mesh size and polynomial degree. The approximate Schur complement takes the form of an M-matrix graph Laplacian, and therefore can be well-preconditioned by highly scalable algebraic multigrid methods. High-performance GPU-accelerated algorithms for all components of the solution algorithm are developed, discussed, and benchmarked. Numerical results are presented on a number of challenging test cases, including the "crooked pipe" grad-div problem, the SPE10 reservoir modeling benchmark problem, and a nonlinear radiation diffusion test case.

Recommendations

• High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners
• Efficient parallel preconditioners for high-order finite element discretizations of \(H(\mathrm{grad})\) and \(H(\mathrm{curl})\) problems
• Parallel solver for \(\boldsymbol{H}(\operatorname{div})\) problems using hybridization and AMG
• Efficient low-order refined preconditioners for high-order matrix-free continuous and discontinuous Galerkin methods
• Parallel auxiliary space AMG solver for \(H(\operatorname{div})\) problems

Cited in

(6)

• Multigrid methods for the Stokes problem on GPU systems
• A robust algebraic two-level Schwarz preconditioner for sparse matrices
• Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in \(H(\mathrm{div})\)
• Smoothers with localized residual computations for geometric multigrid methods for higher-order finite elements
• An algebraic preconditioner for the exactly divergence-free discontinuous Galerkin method for Stokes
• Fea of very large bone models based on micro-CT scans

This page was built for publication: Matrix-free GPU-accelerated saddle-point solvers for high-order problems in $H(\mathrm{div})$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434176)