Papers › Kinetic scrape off layer simulations with semi-Lagrangian discontinuous Galerkin schemes
Kinetic scrape off layer simulations with semi-Lagrangian discontinuous Galerkin schemes
Lukas Einkemmer, Alexander Moriggl
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we propose a semi-Lagrangian discontinuous Galerkin solver for the simulation of the scrape off layer for an electron-ion plasma. We use a time adaptive velocity space to deal with fast particles leaving the computational domain, a block structured mesh to resolve the sharp gradient in the plasma sheath, and limiters to avoid oscillations in the density function. In particular, we propose a limiter that can be computed directly from the information used in the semi-Lagrangian discontinuous Galerkin advection step. This limiter is particularly efficient on graphic processing units (GPUs) and compares favorable with limiters from the literature. We provide numerical results for a set of benchmark problems and compare different limiting strategies.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections