Tensor-product vertex patch smoothers for biharmonic problems

Abstract

We discuss vertex patch smoothers as overlapping domain decomposition methods for fourth order elliptic partial differential equations. We show that they are numerically very efficient and yield high convergence rates. Furthermore, we discuss low rank tensor approximations for their efficient implementation. Our experiments demonstrate that the inexact local solver yields a method which converges fast and uniformly with respect to mesh refinement. The multiplicative smoother shows superior performance in terms of solution efficiency, requiring fewer iterations. However, in three-dimensional cases, the additive smoother outperforms its multiplicative counterpart due to the latter's lower potential for parallelism. Additionally, the solver infrastructure supports a mixed-precision approach, executing the multigrid preconditioner in single precision while performing the outer iteration in double precision, thereby increasing throughput by up to 70 percent.

References in corpus (6)

• Fast matrix-free evaluation of discontinuous Galerkin finite element operators
• 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
• A scalable and robust vertex-star relaxation for high-order FEM
• Fast Tensor Product Schwarz Smoothers for High-Order Discontinuous Galerkin Methods
• An implementation of tensor product patch smoothers on GPU