Related papers: A quasi-conservative dynamical low-rank algorithm …

The primary challenge in solving kinetic equations, such as the Vlasov equation, is the high-dimensional phase space. In this context, dynamical low-rank approximations have emerged as a promising way to reduce the high computational cost…

Dynamical low-rank approximation, as has been demonstrated recently, can be extremely efficient in solving kinetic equations. However, a major deficiency is that they do not preserve the structure of the underlying physical problem. For…

A numerical dynamical low-rank approximation (DLRA) scheme for the solution of the Vlasov-Poisson equation is presented. Based on the formulation of the DLRA equations as Friedrichs' systems in a continuous setting, it combines recently…

In this paper, we propose a conservative low rank tensor method to approximate nonlinear Vlasov solutions. The low rank approach is based on our earlier work (arxiv: 2106.08834). It takes advantage of the fact that the differential…

Existing approaches to solving the Vlasov equation treat the system as a partial differential equation on a phase space grid, and track in either an Eulerian, Lagrangian, or semi-Lagrangian picture. We present an alternative approach, which…

Continuum Vlasov simulations can be utilized for highly accurate modelling of fully kinetic plasmas. Great progress has been made recently regarding the applicability of the method in realistic plasma configurations. However, a reduction of…

Many problems encountered in plasma physics require a description by kinetic equations, which are posed in an up to six-dimensional phase space. A direct discretization of this phase space, often called the Eulerian approach, has many…

In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal…

Kinetic equations are difficult to solve numerically due to their high dimensionality. A promising approach for reducing computational cost is the dynamical low-rank algorithm, which decouples the dimensions of the phase space by proposing…

In this paper, we propose a novel Local Macroscopic Conservative (LoMaC) low rank tensor method for simulating the Vlasov-Poisson (VP) system. The LoMaC property refers to the exact local conservation of macroscopic mass, momentum and…

To preserve a number of physically relevant invariants is a major concern when considering long time integration of the Vlasov equation. In the present work we consider the semi-Lagrangian discontinuous Galerkin method for the…

The Vlasov--Maxwell equations are used for the kinetic description of magnetized plasmas. As they are posed in an up to 3+3 dimensional phase space, solving this problem is extremely expensive from a computational point of view. In this…

We introduce novel dynamical low-rank methods for solving large-scale matrix differential equations, motivated by algorithms from randomized numerical linear algebra. In terms of performance (cost and accuracy), our methods overperform…

The semi-Lagrangian discontinuous Galerkin method, coupled with a splitting approach in time, has recently been introduced for the Vlasov--Poisson equation. Since these methods are conservative, local in space, and able to limit numerical…

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 paper presents a weakly intrusive strategy for computing a low-rank approximation of the solution of a system of nonlinear parameter-dependent equations. The proposed strategy relies on a Newton-like iterative solver which only…

We introduce a high-order finite element method for approximating the Vlasov-Poisson equations. This approach employs continuous Lagrange polynomials in space and explicit Runge-Kutta schemes for time discretization. To stabilize the…

In this study, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the…

We consider dynamical low-rank approximation (DLRA) for the numerical simulation of Vlasov--Poisson equations based on separation of space and velocity variables, as proposed in several recent works. The standard approach for the time…

A numerical method is proposed to compute a low-rank Galerkin approximation to the solution of a parametric or stochastic equation in a non-intrusive fashion. The considered nonlinear problems are associated with the minimization of a…