Half-closed Discontinuous Galerkin discretisations
<|reference_start|>Half-closed Discontinuous Galerkin discretisations: We introduce the concept of half-closed nodes for nodal Discontinuous Galerkin (DG) discretisations. This is in contrast to more commonly used closed nodes in DG where in each element nodes are placed on every boundary. Half-closed nodes relax this constraint by only requiring nodes on a subset of the boundaries in each element, with this extra freedom in node placement allowing for increased efficiency in the assembly of DG operators. To determine which element boundaries half-closed nodes are placed on we outline a simple procedure based on switch functions. We examine the effect on operator sparsity from using the different types of nodes and show that in particular for the Laplace operator there is no difference in the sparsity from using half-closed or closed nodes. We also discuss in this work some linear solver techniques commonly used for Finite Element or Discontinuous Galerkin methods such as static condensation and block-based methods, and how they can be applied to half-closed DG discretisations.<|reference_end|>
@article{pan2024half-closed,
    title={Half-closed Discontinuous Galerkin discretisations},
    author={Yulong Pan and Per-Olof Persson},
    journal={arXiv preprint arXiv:2405.12383},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.12383},
    primaryClass={math.NA cs.NA}
}