A quadratic knapsack objective for subcell limiting in entropy-stable DG methods is reduced to finite-iteration scalar root-finding and shown to improve temporal regularity and reduce adaptive timestep counts.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Entropy Stable Nodal Discontinuous Galerkin Methods via Quadratic Knapsack Limiting
A quadratic knapsack objective for subcell limiting in entropy-stable DG methods is reduced to finite-iteration scalar root-finding and shown to improve temporal regularity and reduce adaptive timestep counts.