Skip to content

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model

This work studies adaptive sparse-grid discontinuous Galerkin (DG) discretizations for the Bhatnagar--Gross--Krook (BGK) model, a kinetic equation posed in four- and six-dimensional phase-space. Standard DG methods are rendered impractical for the BGK model by the curse of dimensionality, motivating compressed representations that adapt to the solution in time. Using the adaptive sparse-grid DG method, we quantify accuracy and compression by comparing the adaptive degrees of freedom to full-grid DG methods and by assessing the resulting kinetic and fluid quantities in both fluid and rarefied regimes. Test cases include a relaxation problem, a multidimensional Sod shock tube, and shear/expansion flows used in prior low-rank BGK studies. To build an efficient Maxwellian evaluation without violating conservation, a central obstacle for structure-perserving BGK simulations, we introduce a hybrid interpolation strategy that exploits velocity separability to recover the correct discrete collision invariants and prove conservation of the resulting discrete collision operator on adaptive sparse grids. Our results show that the adaptive sparse-grid strategy can recover accurate and physically relevant solutions with sharp gradients, and the method reduces the active degrees of freedom by factors ranging from several-fold to several orders of magnitude, with the largest reductions occurring in the six-dimensional examples. All computations are performed with the open-source ASGarD adaptive sparse-grid DG library.

Stefan R. Schnake, M. Stoyanov, E. Endeve et al. · 0 citations
Preprint Aug 2026

Mesh-Based Filtering to Alleviate Time-Step Restrictions in Runge--Kutta Discontinuous Galerkin Methods in Spherical-polar Coordinates: Application to the Euler Equations

We propose a mesh-based filtering approach to alleviate the severe timestep restrictions arising in explicit Runge--Kutta discontinuous Galerkin (RKDG) methods formulated in spherical-polar coordinates. The filter enables stable evolution on the original logically Cartesian mesh while using larger time steps associated with an auxiliary merged mesh constructed to eliminate the extreme cell anisotropies produced by converging coordinate lines near coordinate singularities. The filter is implemented as a sequence of post-processing operations applied within an $s$-stage RK time integrator, making it straightforward to incorporate into existing structured-mesh DG frameworks. We analyze the filter in one spatial dimension and prove that the filtered RKDG method is equivalent to evolving the RKDG discretization on a nonuniform mesh obtained by merging selected elements of the underlying uniform mesh. This equivalence implies that the filtered method inherits the accuracy and stability properties of the corresponding RKDG discretization on the merged mesh. We apply the mesh-based filter to an existing RKDG method for the Euler equations in spherical-polar coordinates and demonstrate, through selected two- and three-dimensional examples, its effectiveness in accelerating simulations through significantly larger stable timesteps.

J. Hunter, E. Endeve, Yulong Xing · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.