Mesh agglomeration

Novel polytopal mesh agglomeration for (high-order) discontinuous Galerkin methods, with applications

polyDEAL is a C++ library, built on top of deal.II, for the efficient implementation of polytopal discontinuous Galerkin methods on agglomerated meshes. Its core ingredient is the R-tree based agglomeration algorithm introduced in (Feder et al., 2025): a spatial index over the fine cells is used to generate, fully automatically, a nested hierarchy of polytopal grids out of an arbitrary fine mesh, in two and three dimensions.

The nested hierarchy is exactly what multilevel methods need. R3MG uses it as a multigrid preconditioner for discontinuous Galerkin discretizations, with applications ranging from elliptic model problems to the monodomain model of cardiac electrophysiology (Feder & Africa, 2026). R3MG-C extends the idea to continuous finite element discretizations through an algebraic–geometric multilevel preconditioner (Polverino et al., 2026).

Source code and instructions are at: github.com/fdrmrc/Polydeal.

References

2026

  1. An agglomeration-based multigrid solver for the discontinuous Galerkin discretization of cardiac electrophysiology
    Marco Feder and Pasquale Claudio Africa
    Computer Methods in Applied Mechanics and Engineering, 2026
  2. R3MG-C: a high-order algebraic-geometric multilevel preconditioner for continuous finite element discretizations
    Davide Polverino, Marco Feder, and Luca Heltai
    arXiv preprint, 2026
    Under review

2025

  1. R3MG: R-tree based agglomeration of polytopal grids with applications to multilevel methods
    Marco Feder, Andrea Cangiani, and Luca Heltai
    Journal of Computational Physics, 2025