An Adaptive-rank Approach with Greedy Sampling for Multi-scale BGK Equations
William A. Sands, Jing-Mei Qiu, Daniel Hayes, Nanyi Zheng

TL;DR
This paper introduces an adaptive-rank, greedy sampling method for efficiently simulating multi-scale BGK equations, ensuring conservation and robustness across different regimes with large time steps.
Contribution
It extends semi-Lagrangian adaptive-rank frameworks to nonlinear BGK equations, avoiding explicit low-rank decompositions and incorporating conservation corrections.
Findings
Accurately captures shocks in kinetic simulations.
Robust performance across wide Knudsen number regimes.
Enables large time steps with semi-Lagrangian solver.
Abstract
In this paper, we propose a novel adaptive-rank method for simulating multi-scale BGK equations, based on a greedy sampling strategy. The method adaptively selects important rows and columns of the solution matrix and updates them using a local semi-Lagrangian solver. An adaptive cross approximation then reconstructs the full solution matrix. This extends our prior semi-Lagrangian adaptive-rank framework, developed for the Vlasov-Poisson system, to nonlinear collisional kinetic equations. Unlike step-and-truncate low-rank integrators, our greedy sampling approach avoids explicit low-rank decompositions of nonlinear terms, such as the local Maxwellian in the BGK operator. To ensure conservation, we introduce a locally macroscopic conservative correction that implicitly couples the kinetic and macroscopic systems, enforcing mass, momentum, and energy conservation. Through asymptotic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
