Adaptive multigrid for high-order discontinuous Galerkin methods based on the full approximation scheme
Jörg Stiller
Abstract
We propose an adaptive multigrid (MG) method for discontinuous Galerkin formulations of elliptic problems using Brandt's full approximation scheme (FAS). Unlike common approaches, this method achieves local hp-refinement of hexahedral meshes without the need for hanging nodes. The core component of the FAS-MG method is an overlapping Schwarz smoother, which is optionally accelerated by a Krylov method. This smoother is designed for unstructured curvilinear meshes but maintains a tensor-product structure for fast diagonalization. Numerical experiments demonstrate the exceptional efficiency of the FAS-MG method. Dedicated studies confirm its robustness against high aspect ratios, element deformation, and irregular mesh topology. We also verify its capability for dynamic parallel mesh adaptation using the wave-front benchmark of Červený, Dobrev, and Kolev (SIAM J. Sci. Comp. 41, 2019). Finally, we present preliminary results of extending the method to incompressible Navier-Stokes problems.
Create a lesson
Related papers
Graph lattice sums and graph zeta functions for long-range interacting quantum lattice models
Andreas Alexander Buchheit, Andreas Rupp
A numerical benchmark for fluid--structure--contact interaction
Daniele Corti, Jakub Fara, Miguel Angel Fernández et al.
Largest-dihedral-angle bisection algorithm does not preserve mesh regularity for tetrahedral partitions
Sergey Korotov, Jérôme Michaud
A Highly Scalable Quantized Tensor-Train FDTD Framework for the Simulation of Three-Dimensional Electromagnetic Scattering Problems
Daan Vanhaecke, Emile Vanderstraeten, Dries Vande Ginste
Pressure-robustness by commuting interpolation operators for Stokes discretizations with continuous pressures
Philip L. Lederer, Theresa Vock
A Reynolds-Semi-Robust, Globally Divergence-Free HDG Method for the Smagorinsky Model
Shuaijun Liu, Xiaoping Xie