arXiv subjects

Laurent Navoret

Publications and source records attributed to Laurent Navoret.

At least 19 recordsLinked to original sources

arXiv2026

Hermite Semi-Lagrangian schemes on triangular meshes for advection equations

High-order Hermite semi-Lagrangian schemes on unstructured triangular grids are proposed for advection equations, based on Bell and Argyris finite elements. Nodal semi-Lagrangian schemes transport point values together with gradients and Hessians, while projection semi-Lagrangian schemes are basically semi-Lagrangian Discontinuous Galerkin schemes (SLDG) with straight remaining backward triangles and shared degrees of freedoms. Stability and convergence studies of the different schemes are carried out numerically.

math.NA↗

arXiv2025

From flocking to jamming in collective cell dynamics: a Vicsek-like model including contact forces

The goal of the present work is to propose an agent-based model that originally combines classical Vicsek-like polarity alignments and contact forces, as implemented in the framework developed by Maury and Venel in [Maury, Venel, 2011]. The description additionally incorporates velocity feedback on polarity and soft attraction-repulsion interactions. After carefully studying the well posedness of the model, we introduce a suitable discretization and perform an extensive range of numerical experiments to assess the impact of different modeling ingredients. The dynamical system is capable of recovering the order-disorder phase transition of the flock, as well as the jamming effect in high density regimes. As such, the developed framework can be seen as a promising theoretical tool that could contribute to improving the understanding of complex collective cell dynamics and emerging tissue flows.

math.NA↗

arXiv2025

Neural non-canonical Hamiltonian dynamics for long-time simulations

This work focuses on learning non-canonical Hamiltonian dynamics from data, where long-term predictions require the preservation of structure both in the learned model and in numerical schemes. Previous research focused on either facet, respectively with a potential-based architecture and with degenerate variational integrators, but new issues arise when combining both. In experiments, the learnt model is sometimes numerically unstable due to the gauge dependency of the scheme, rendering long-time simulations impossible. In this paper, we identify this problem and propose two different training strategies to address it, either by directly learning the vector field or by learning a time-discrete dynamics through the scheme. Several numerical test cases assess the ability of the methods to learn complex physical dynamics, like the guiding center from gyrokinetic plasma physics.

cs.LG↗

arXiv2025

Reduced Particle in Cell method for the Vlasov-Poisson system using auto-encoder and Hamiltonian neural

Hamiltonian particle-based simulations of plasma dynamics are inherently computationally intensive, primarily due to the large number of particles required to obtain accurate solutions. This challenge becomes even more acute in many-query contexts, where numerous simulations must be conducted across a range of time and parameter values. Consequently, it is essential to construct reduced order models from such discretizations to significantly lower computational costs while ensuring validity across the specified time and parameter domains. Preserving the Hamiltonian structure in these reduced models is also crucial, as it helps maintain long-term stability. In this paper, we introduce a nonlinear, non-intrusive, data-driven model order reduction method for the 1D-1V Vlasov--Poisson system, discretized using a Hamiltonian Particle-In-Cell scheme. Our approach relies on a two-step projection framework: an initial linear projection based on the Proper Symplectic Decomposition, followed by a nonlinear projection learned via an autoencoder neural network. The reduced dynamics are then modeled using a Hamiltonian neural network. The offline phase of the method is split into two stages: first, constructing the linear projection using full-order model snapshots; second, jointly training the autoencoder and the Hamiltonian neural network to simultaneously learn the encoder-decoder mappings and the reduced dynamics. We validate the proposed method on several benchmarks, including Landau damping and two-stream instability. The results show that our method has better reduction properties than standard linear Hamiltonian reduction methods.

math.NA↗

arXiv2025

Neural semi-Lagrangian method for high-dimensional advection-diffusion problems

This work is devoted to the numerical approximation of high-dimensional advection-diffusion equations. It is well-known that classical methods, such as the finite volume method, suffer from the curse of dimensionality, and that their time step is constrained by a stability condition. The semi-Lagrangian method is known to overcome the stability issue, while recent time-discrete neural network-based approaches overcome the curse of dimensionality. In this work, we propose a novel neural semi-Lagrangian method that combines these last two approaches. It relies on projecting the initial condition onto a finite-dimensional neural space, and then solving an optimization problem, involving the backwards characteristic equation, at each time step. It is particularly well-suited for implementation on GPUs, as it is fully parallelizable and does not require a mesh. We provide rough error estimates present several high-dimensional numerical experiments to assess the performance of our approach, and compare it to other neural methods.

math.NA↗

arXiv2024

Fourth-order entropy-stable lattice Boltzmann schemes for hyperbolic systems

We present a novel framework for the development of fourth-order lattice Boltzmann schemes to tackle multidimensional nonlinear systems of conservation laws. As for other numerical schemes for hyperbolic problems, high-order accuracy applies only to smooth solutions. Our numerical schemes preserve two fundamental characteristics inherent in classical lattice Boltzmann methods: a local relaxation phase and a transport phase composed of elementary shifts on a Cartesian grid. Achieving fourth-order accuracy is accomplished through the composition of second-order time-symmetric basic schemes utilizing rational weights. This enables the representation of the transport phase in terms of elementary shifts. Introducing local variations in the relaxation parameter during each stage of relaxation ensures entropy stability of the schemes. This not only enhances stability in the long-time limit but also maintains fourth-order accuracy. To validate our approach, we conduct comprehensive testing on scalar equations and systems in both one and two spatial dimensions.

math.NA↗

arXiv2023

Hamiltonian reduction using a convolutional auto-encoder coupled to an Hamiltonian neural network

The reduction of Hamiltonian systems aims to build smaller reduced models, valid over a certain range of time and parameters, in order to reduce computing time. By maintaining the Hamiltonian structure in the reduced model, certain long-term stability properties can be preserved. In this paper, we propose a non-linear reduction method for models coming from the spatial discretization of partial differential equations: it is based on convolutional auto-encoders and Hamiltonian neural networks. Their training is coupled in order to simultaneously learn the encoder-decoder operators and the reduced dynamics. Several test cases on non-linear wave dynamics show that the method has better reduction properties than standard linear Hamiltonian reduction methods.

math.NA↗

arXiv2023

Optimal scenario for road evacuation in an urban environment

How to free a road from vehicle traffic as efficiently as possible and in a given time, in order to allow for example the passage of emergency vehicles? We are interested in this question which we reformulate as an optimal control problem. We consider a macroscopic road traffic model on networks, semi-discretized in space and decide to give ourselves the possibility to control the flow at junctions. Our target is to smooth the traffic along a given path within a fixed time. A parsimony constraint is imposed on the controls, in order to ensure that the optimal strategies are feasible in practice. We perform an analysis of the resulting optimal control problem, proving the existence of an optimal control and deriving optimality conditions, which we rewrite as a single functional equation. We then use this formulation to derive a new mixed algorithm interpreting it as a mix between two methods: a descent method combined with a fixed point method allowing global perturbations. We verify with numerical experiments the efficiency of this method on examples of graphs, first simple, then more complex. We highlight the efficiency of our approach by comparing it to standard methods. We propose an open source code implementing this approach in the Julia language.

math.OC↗

arXiv2023

Approximately well-balanced Discontinuous Galerkin methods using bases enriched with Physics-Informed Neural Networks

This work concerns the enrichment of Discontinuous Galerkin (DG) bases, so that the resulting scheme provides a much better approximation of steady solutions to hyperbolic systems of balance laws. The basis enrichment leverages a prior - an approximation of the steady solution - which we propose to compute using a Physics-Informed Neural Network (PINN). To that end, after presenting the classical DG scheme, we show how to enrich its basis with a prior. Convergence results and error estimates follow, in which we prove that the basis with prior does not change the order of convergence, and that the error constant is improved. To construct the prior, we elect to use parametric PINNs, which we introduce, as well as the algorithms to construct a prior from PINNs. We finally perform several validation experiments on four different hyperbolic balance laws to highlight the properties of the scheme. Namely, we show that the DG scheme with prior is much more accurate on steady solutions than the DG scheme without prior, while retaining the same approximation quality on unsteady solutions.

math.NA↗

arXiv2023

An optimal control deep learning method to design artificial viscosities for Discontinuous Galerkin schemes

In this paper, we propose a method for constructing a neural network viscosity in order to reduce the non-physical oscillations generated by high-order Discontiuous Galerkin (DG) methods. To this end, the problem is reformulated as an optimal control problem for which the control is the viscosity function and the cost function involves comparison with a reference solution after several compositions of the scheme. The learning process is strongly based on gradient backpropagation tools. Numerical simulations show that the artificial viscosities constructed in this way are just as good or better than those used in the literatur

math.NA↗

arXiv2020

A neural network closure for the Euler-Poisson system based on kinetic simulations

This work deals with the modeling of plasmas, which are charged-particle fluids. Thanks to machine leaning, we construct a closure for the one-dimensional Euler-Poisson system valid for a wide range of collision regimes. This closure, based on a fully convolutional neural network called V-net, takes as input the whole spatial density, mean velocity and temperature and predicts as output the whole heat flux. It is learned from data coming from kinetic simulations of the Vlasov-Poisson equations. Data generation and preprocessings are designed to ensure an almost uniform accuracy over the chosen range of Knudsen numbers (which parametrize collision regimes). Finally, several numerical tests are carried out to assess validity and flexibility of the whole pipeline.

math.NA↗

arXiv2018

An analysis of over-relaxation in kinetic approximation

The over-relaxation approach is an alternative to the Jin-Xin relaxation method (Jin and Xin [1]) in order to apply the equilibrium source term in a more precise way (Coulette et al. [2, 3]). This is also a key ingredient of the Lattice-Boltzmann method for achieving second order accuracy (Dellar [4]). In this work we provide an analysis of the over-relaxation kinetic scheme. We compute its equivalent equation, which is particularly useful for devising stable boundary conditions for the hidden kinetic variables.

math.AP↗

arXiv2018

Numerical stability of plasma sheath

We are interested in developing a numerical method for capturing stationary sheaths, that a plasma forms in contact with a metallic wall. This work is based on a bi-species (ion/electron) Vlasov-Amp{\`e}re model proposed in [3]. The main question addressed in this work is to know if classical numerical schemes can preserve stationary solutions with boundary conditions, since these solutions are not a priori conserved at the discrete level. In the context of high-order semi-Lagrangian method, due to their large stencil, interpolation near the boundary of the domain requires also a specific treatment.

math.NA↗

arXiv2018

High-order implicit palindromic discontinuous Galerkin method for kinetic-relaxation approximation

We construct a high order discontinuous Galerkin method for solving general hyperbolic systems of conservation laws. The method is CFL-less, matrix-free, has the complexity of an explicit scheme and can be of arbitrary order in space and time. The construction is based on: (a) the representation of the system of conservation laws by a kinetic vectorial representation with a stiff relaxation term; (b) a matrix-free, CFL-less implicit discontinuous Galerkin transport solver; and (c) a stiffly accurate composition method for time integration. The method is validated on several one-dimensional test cases. It is then applied on two-dimensional and three-dimensional test cases: flow past a cylinder, magnetohydrodynamics and multifluid sedimentation.

math.AP↗

arXiv2017

Finite Volume approximations of the Euler system with variable congestion

We are interested in the numerical simulations of the Euler system with variable congestion encoded by a singular pressure. This model describes for instance the macroscopic motion of a crowd with individual congestion preferences. We propose an asymptotic preserving (AP) scheme based on a conservative formulation of the system in terms of density, momentum and density fraction. A second order accuracy version of the scheme is also presented. We validate the scheme on one-dimensional test-cases and extended here to higher order accuracy. We finally carry out two dimensional numerical simulations and show that the model exhibit typical crowd dynamics.

math.NA↗

arXiv2016

Palindromic discontinuous Galerkin method for kinetic equations with stiff relaxation

We present a high order scheme for approximating kinetic equations with stiff relaxation. The objective is to provide efficient methods for solving the underlying system of conservation laws. The construction is based on several ingredients: (i) a high order implicit upwind Discontinuous Galerkin approximation of the kinetic equations with easy-to-solve triangular linear systems; (ii) a second order asymptotic-preserving time integration based on symmetry arguments; (iii) a palindromic composition of the second order method for achieving higher orders in time. The method is then tested at orders 2, 4 and 6. It is asymptotic-preserving with respect to the stiff relaxation and accepts high CFL numbers.

math.AP↗

arXiv2015

A multi-layer model for self-propelled disks interacting through alignment and volume exclusion

We present an individual-based model describing disk-like self-propelled particles moving inside parallel planes. The disk directions of motion follow alignment rules inside each layer. Additionally, the disks are subject to interactions with those of the neighboring layers arising from volume exclusion constraints. These interactions affect the disk inclinations with respect to the plane of motion. We formally de-rive a macroscopic model composed of planar Self-Organized Hydrodynamic (SOH) models describing the transport of mass and evolution of mean direction of motion of the disks in each plane, supplemented with transport equations for the mean disk inclination. These planar models are coupled due to the interactions with the neighboring planes. Numerical comparisons between the individual-based and macroscopic models are carried out. These models could be applicable, for instance, to describe sperm-cell collective dynamics.

nlin.AO↗

arXiv2014

A two-species hydrodynamic model of particles interacting through self-alignment

In this paper, we present a two-species Vicsek model, that describes alignment interactions of self-propelled particles which can either move or not. The model consists in two populations with distinct Vicsek dynamics that interact only via the passage of the particles from one population to the other. The derivation of a macroscopic description of this model is performed using the methodology used for the Vicsek model: we find out a regime where alignment in the whole population occurs. We obtain a new macroscopic model for the densities of each populations and the common mean direction of the particles. The treatment of the non-conservativity of the interactions requires a detail study of the linearised interaction operator.

math-ph↗