Robust multigrid for high-order discontinuous Galerkin methods: A fast Poisson solver suitable for high-aspect ratio Cartesian grids

Abstract

We present a polynomial multigrid method for nodal interior penalty and local discontinuous Galerkin formulations of the Poisson equation on Cartesian grids. For smoothing we propose two classes of overlapping Schwarz methods. The first class comprises element-centered and the second face-centered methods. Within both classes we identify methods that achieve superior convergence rates, prove robust with respect to the mesh spacing and the polynomial order, at least up to $P=32$. Consequent structure exploitation yields a computational complexity of $O(PN)$, where $N$ is the number of unknowns. Further we demonstrate the suitability of the face-centered method for element aspect ratios up to 32.

References in corpus (1)

• Factorizing the factorization - a spectral-element solver for elliptic equations with linear operation count

Cited by in corpus (8)

• Efficiency of high-performance discontinuous Galerkin spectral element methods for under-resolved turbulent incompressible flows
• Hybrid multigrid methods for high-order discontinuous Galerkin discretizations
• Scaling to the stars -- a linearly scaling elliptic solver for $p$-multigrid
• A scalable elliptic solver with task-based parallelism for the SpECTRE numerical relativity code
• A spectral deferred correction method for incompressible flow with variable viscosity
• Fast Tensor Product Schwarz Smoothers for High-Order Discontinuous Galerkin Methods
• Linearizing the hybridizable discontinuous Galerkin method: A linearly scaling operator
• Manycore parallel computing for a hybridizable discontinuous Galerkin nested multigrid method