General
A physics-based adaptive low-rank method for 6D Vlasov simulations
arXiv cs.NA0 views
arXiv:2611.07107v1 Announce Type: new Abstract: The numerical simulation of kinetic plasma models in six-dimensional phase space poses significant computational and memory challenges, particularly when considering modern high-performance computing architectures. In this work, we propose an adaptive dynamical low-rank approach for the efficient solution of the 6D Vlasov--Poisson system. Our strategy is an extension of the projector-splitting dynamical low-rank integrator. The algorithm changes the rank based on physical observables (e.g., the electric field and energy) as opposed to controlling the error in the distribution function. Our approach is memory efficient in the sense that only rank $r$ objects are required to implement the scheme. This makes the algorithm suitable for performing high-dimensional computations on graphic processing units. Comparisons with rank adaptive Basis-Update & Galerkin integrators exhibit both significant memory savings and reduction in run time. We show, by presenting a variety of 6D benchmark experiments implemented in the C++/CUDA low-rank framework Ensign, that our technique allows us to run simulations with a significantly smaller rank, while still preserving the physical fidelity. Thus, the approach substantially reduces memory footprint and computational cost and enables simulations that are prohibitively expensive for full-rank or less memory-efficient low-rank schemes.
Source:https://arxiv.org/abs/2611.07107PreviousBoundary Projection Acceleration for 2D One-cell Inversions in the Scattering LimitNextEnergy-conserving scheme for a shallow-water model with capillary effects
Related posts
Who Uses Grok? and for What?
0Hacker News Ask
DSA
0Hacker News Ask
Show HN: Moosik – open-source YouTube music client with discord, stats, & themes
0Hacker News Show
Show HN: BollyQuiz for Diwali House Parties
0Hacker News Show
Need Help Running a Live Player Auction? How to Reach the TheBidNow Team
0dev.to Tutorial
Geometry-Aware Channel Aging in MIMO Systems: When Is Kronecker Separability Enough?
0arXiv eess.SP