Restarting the Numerical Flow Iteration through low rank tensor approximations

Rostislav-Paul Wilhelm, Katharina Kormann

Published: 2025/9/10

Abstract

The numerical flow iteration method has recently been proposed as a memory-slim solution method for the Vlasov-Poisson equation. It stores the temporal evolution of the electric field and reconstructs the solution in each time step by following the characteristics backwards in time and reconstructing the solution from the initial distribution. If the number of time steps gets large, the computational cost of this reconstruction may get prohibitive. Given a representation of the intermediate solution, the time intervals over which the characteristic curves need to be solved backwards in time can be reduced by restarting the numerical flow iteration after certain time intervals. In this paper, we propose an algorithm that reconstructs a low-rank representation of the solution at the restart times using the blackbox approximation. The proposed algorithm reduces the computational complexity compared to the pure numerical flow iteration from quadratic to linear in the number of times step while still keeping its memory complexity. On the other hand, our numerical results demonstrate that the methods preserves the property of the numerical flow iteration of showing much less dissipation of filaments compared to the semi-Lagrangian method.

Restarting the Numerical Flow Iteration through low rank tensor approximations | SummarXiv | SummarXiv