Fast Tensor Product Schwarz Smoothers for High-Order Discontinuous Galerkin Methods

Abstract

In this article, we discuss the efficient implementation of powerful domain decomposition smoothers for multigrid methods for high order discontinuous Galerkin (DG) finite element methods. In particular, we study the inversion of matrices associated to mesh cells and to the patches around a vertex, respectively, in order to obtain fast local solvers for additive and multiplicative subspace correction methods. The effort of inverting local matrices for tensor product polynomials of degree $k$ is reduced from $\mathcal{O}(k^{3d})$ to $\mathcal{O}(d{k}^{d+1})$ by exploiting the separability of the differential operator and resulting low rank representation of its inverse as a prototype for more general low rank representations.

References in corpus (7)

• LIKWID: Lightweight Performance Tools
• Fast matrix-free evaluation of discontinuous Galerkin finite element operators
• Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods
• Matrix-free multigrid block-preconditioners for higher order Discontinuous Galerkin discretisations
• Multigrid methods for Hdiv-conforming discontinuous Galerkin methods for the Stokes equations
• Geometric Multigrid for Darcy and Brinkman models of flows in highly heterogeneous porous media: A numerical study
• Robust multigrid for high-order discontinuous Galerkin methods: A fast Poisson solver suitable for high-aspect ratio Cartesian grids

Cited by in corpus (6)

• A scalable and robust vertex-star relaxation for high-order FEM
• An implementation of tensor product patch smoothers on GPU
• Smoothers with localized residual computations for geometric multigrid methods
• Multilevel Interior Penalty Methods on GPUs
• Multigrid methods for the Stokes problem on GPU systems
• Tensor-product vertex patch smoothers for biharmonic problems