Proposes two positivity-preserving correction schemes for dynamical low-rank approximations of the Vlasov equation using quadratic programming constraints, with one also preserving mass and momentum.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
citing papers explorer
-
Positivity-preserving dynamical low-rank methods for the Vlasov equation
Proposes two positivity-preserving correction schemes for dynamical low-rank approximations of the Vlasov equation using quadratic programming constraints, with one also preserving mass and momentum.
- The EDGE Language: Extended General Einsums for Graph Algorithms