Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.04334

Entropy stable high-order discontinuous Galerkin spectral-element methods on curvilinear, hybrid meshes

Jens Keim·Anna Schwarz·Patrick Kopper·Marcel Blind·Christian Rohde·Andrea Beck
View original source ↗Read source document ↗Export metadata ↓

Abstract

Hyperbolic-parabolic partial differential equations are widely used for the modeling of complex, multiscale problems. High-order methods such as the discontinuous Galerkin (DG) scheme are attractive candidates for their numerical approximation. However, high-order methods are prone to instabilities in the presence of underresolved flow features. A popular counter measure to stabilize DG methods is the use of entropy-stable formulations based on summation-by-parts (SBP) operators. The present paper aims to construct a robust and efficient entropy-stable discontinuous Galerkin spectral element method (DGSEM) of arbitrary order on heterogeneous, curvilinear grids composed of triangular and quadrilateral elements or hexahedral, prismatic, tetrahedral and pyramid elements. To the author's knowledge, with the exception of hexahedral and quadrilateral elements, entropy-stable DGSE operators have been constructed exclusively for tetrahedral and triangular meshes. The extension of the DGSEM to more complex element shapes is achieved by means of a collapsed coordinate transformation. Legendre--Gauss quadrature nodes are employed as collocation points in conjunction with a generalized SBP operator and entropy-projected variables. The purely hyperbolic operator is extended to hyperbolic-parabolic problems by the use of a lifting procedure. To circumvent the penalizing time step restriction imposed by the collapsing, modal rather than nodal degrees of freedom are evolved in time, thereby relying on a memory-efficient weight-adjusted approximation to the inverse of the mass matrix. Essential properties of the proposed numerical scheme including free-stream preservation, polynomial and grid convergence as well as entropy conservation / stability are verified. Finally, with the flow around the common research model, the applicability of the presented method to real-world problems is demonstrated.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jens Keim, Anna Schwarz, Patrick Kopper, Marcel Blind, Christian Rohde, Andrea Beck. 2025-07-06. Entropy stable high-order discontinuous Galerkin spectral-element methods on curvilinear, hybrid meshes. https://arxiv.org/abs/2507.04334

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗