A Sparse and High-Order Accurate Line-Based Discontinuous Galerkin Method for Unstructured Meshes
Per-Olof Persson

TL;DR
This paper introduces a sparse, high-order accurate line-based discontinuous Galerkin method for unstructured meshes that enhances computational efficiency by reducing connectivity, suitable for complex PDEs including fluid dynamics.
Contribution
The paper presents a novel DG scheme that maximizes sparsity and efficiency on unstructured meshes by applying 1D DG solvers along coordinate directions, maintaining accuracy for complex PDEs.
Findings
Achieves high-order accuracy comparable to standard DG methods.
Significantly reduces Jacobian matrix connectivity, improving implicit solver performance.
Demonstrates effectiveness on Poisson, Euler, and Navier-Stokes equations.
Abstract
We present a new line-based discontinuous Galerkin (DG) discretization scheme for first- and second-order systems of partial differential equations. The scheme is based on fully unstructured meshes of quadrilateral or hexahedral elements, and it is closely related to the standard nodal DG scheme as well as several of its variants such as the collocation-based DG spectral element method (DGSEM) or the spectral difference (SD) method. However, our motivation is to maximize the sparsity of the Jacobian matrices, since this directly translates into higher performance in particular for implicit solvers, while maintaining many of the good properties of the DG scheme. To achieve this, our scheme is based on applying one-dimensional DG solvers along each coordinate direction in a reference element. This reduces the number of connectivities drastically, since the scheme only connects each node…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
