6 research outputs found
A dynamical adaptive tensor method for the Vlasov-Poisson system
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
Fully adaptive structure-preserving hyper-reduction of parametric Hamiltonian systems
Model order reduction provides low-complexity high-fidelity surrogate models
that allow rapid and accurate solutions of parametric differential equations.
The development of reduced order models for parametric nonlinear Hamiltonian
systems is still challenged by several factors: (i) the geometric structure
encoding the physical properties of the dynamics; (ii) the slowly decaying
Kolmogorov -width of conservative dynamics; (iii) the gradient structure of
the nonlinear flow velocity; (iv) high variations in the numerical rank of the
state as a function of time and parameters. We propose to address these aspects
via a structure-preserving adaptive approach that combines symplectic dynamical
low-rank approximation with adaptive gradient-preserving hyper-reduction and
parameters sampling. Additionally, we propose to vary in time the dimensions of
both the reduced basis space and the hyper-reduction space by monitoring the
quality of the reduced solution via an error indicator related to the
projection error of the Hamiltonian vector field. The resulting adaptive
hyper-reduced models preserve the geometric structure of the Hamiltonian flow,
do not rely on prior information on the dynamics, and can be solved at a cost
that is linear in the dimension of the full order model and linear in the
number of test parameters. Numerical experiments demonstrate the improved
performances of the resulting fully adaptive models compared to the original
and reduced order models