A dynamical adaptive tensor method for the Vlasov-Poisson system
Virginie Ehrlacher, Damiano Lombardi

TL;DR
This paper introduces an adaptive tensor decomposition method for solving the high-dimensional Vlasov-Poisson system, combining a modified PGD algorithm with a symplectic time discretization to preserve system properties.
Contribution
It presents a novel adaptive tensor method with a proven convergence for efficiently solving high-dimensional Vlasov-Poisson equations.
Findings
Efficient tensor decomposition reduces computational complexity.
The method preserves Hamiltonian structure via symplectic discretization.
Numerical examples demonstrate accuracy and efficiency.
Abstract
A numerical method is proposed to solve the full-Eulerian time-dependent Vlasov-Poisson system in high dimension. The algorithm relies on the construction of a tensor decomposition of the solution whose rank is adapted at each time step. This decomposition is obtained through the use of an efficient modified Progressive Generalized Decomposition (PGD) method, whose convergence is proved. We suggest in addition a symplectic time-discretization splitting scheme that preserves the Hamiltonian properties of the system. This scheme is naturally obtained by considering the tensor structure of the approximation. The efficiency of our approach is illustrated through time-dependent 2D-2D numerical examples.
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.
