加载中…
We propose the first optimal geometric multigrid solver for hybrid high-order discretizations that can handle arbitrary polytopal agglomeration hierarchies in both two and three dimensions. The key ingredient is the use of modified skeleton spaces, which naturally accommodate non-planar interfaces arising during coarsening while reducing the number of degrees of freedom. We prove robust convergence with respect to the mesh size and the number of levels, and we validate our results numerically on a range of agglomeration-based mesh hierarchies. The approach extends naturally to other hybrid discretizations such as hybridizable discontinuous Galerkin and Weak Galerkin methods.

生成讲解博客的中文版本

生成AI智能校验的中文版本