Dynamical Tensor Train Approximation for Kinetic Equations

Abstract

The numerical solution of kinetic equations is challenging due to the high dimensionality of the underlying phase space. In this paper, we develop a dynamical low-rank method based on the projector-splitting integrator in tensor-train (TT) format. The key idea is to discretize the three-dimensional velocity variable using tensor trains while treating the spatial variable as a parameter, thereby exploiting the low-rank structure of the distribution function in velocity space. In contrast to the standard step-and-truncate approach, this method updates the tensor cores through a sweeping procedure, allowing the use of relatively small TT-ranks and leading to substantial reductions in memory usage and computational cost. We demonstrate the effectiveness of the proposed approach on several representative kinetic equations.

References in corpus (14)

• The density-matrix renormalization group in the age of matrix product states
• The density-matrix renormalization group
• Unifying time evolution and optimization with matrix product states
• Time-evolution methods for matrix-product states
• Time integration of tensor trains
• Exploiting the causal tensor network structure of quantum processes to efficiently simulate non-Markovian path integrals
• A semi-Lagrangian Vlasov solver in tensor train format
• Constructing Tensor Network Influence Functionals for General Quantum Dynamics
• A dynamical adaptive tensor method for the Vlasov-Poisson system
• Dynamic tensor approximation of high-dimensional nonlinear PDEs
• Low-rank approximation in the numerical modeling of the Farley-Buneman instability in ionospheric plasma
• Efficient Quantum Simulation of Open Quantum System Dynamics on Noisy Quantum Computers
• Quantized tensor networks for solving the Vlasov-Maxwell equations
• Sylvester-Preconditioned Adaptive-Rank Implicit Time Integrators for Advection-Diffusion Equations with Variable Coefficients