The class of commutator-free Magnus integrators is known to provide a favourable alternative to standard interpolatory Magnus integrators, in particular for large-scale applications arising in the time integration of non-autonomous linear evolution equations. A high-order commutator-free Magnus integrator is given by a composition of several exponentials that comprise certain linear combinations of the values of the defining operator at specified nodes. Due to the fact that previously proposed commutator-free Magnus integrators of order five or higher involve negative coefficients in the linear combinations, severe instabilities are observed for spatially semi-discretised partial differential equations of parabolic type or for master equations describing dissipative quantum systems, respectively. In order to remedy this issue, two different approaches for the design of efficient Magnus integrators of orders four, five, and six are pursued: (i) the study of commutator-free Magnus integrators involving complex coefficients with positive real part, and (ii) the study of unconventional Magnus integrators that comprise in addition a single exponential involving a commutator. Numerical experiments for test equations of Schrödinger and parabolic type confirm that the identified novel Magnus integrators are superior to Magnus integrators previously proposed in the literature.[-]

Recently, an important research activity on mean field games (MFGs for short) has been initiated by the pioneering works of Lasry and Lions: it aims at studying the asymptotic behavior of stochastic differential games (Nash equilibria) as the number $n$ of agents tends to infinity. The field is now rapidly growing in several directions, including stochastic optimal control, analysis of PDEs, calculus of variations, numerical analysis and computing, and the potential applications to economics and social sciences are numerous.
In the limit when $n \to +\infty$, a given agent feels the presence of the others through the statistical distribution of the states. Assuming that the perturbations of a single agent's strategy does not influence the statistical states distribution, the latter acts as a parameter in the control problem to be solved by each agent. When the dynamics of the agents are independent stochastic processes, MFGs naturally lead to a coupled system of two partial differential equations (PDEs for short), a forward Fokker-Planck equation and a backward Hamilton-Jacobi-Bellman equation.
The latter system of PDEs has closed form solutions in very few cases only. Therefore, numerical simulation are crucial in order to address applications. The present mini-course will be devoted to numerical methods that can be used to approximate the systems of PDEs.
The numerical schemes that will be presented rely basically on monotone approximations of the Hamiltonian and on a suitable weak formulation of the Fokker-Planck equation.
These schemes have several important features:

- The discrete problem has the same structure as the continous one, so existence, energy estimates, and possibly uniqueness can be obtained with the same kind of arguments

- Monotonicity guarantees the stability of the scheme: it is robust in the deterministic limit

- convergence to classical or weak solutions can be proved

Finally, there are particular cases named variational MFGS in which the system of PDEs can be seen as the optimality conditions of some optimal control problem driven by a PDE. In such cases, augmented Lagrangian methods can be used for solving the discrete nonlinear system. The mini-course will be orgamized as follows

1. Introduction to the system of PDEs and its interpretation. Uniqueness of classical solutions.

2. Monotone finite difference schemes

3. Examples of applications

4. Variational MFG and related algorithms for solving the discrete system of nonlinear equations[-]

Recently, an important research activity on mean field games (MFGs for short) has been initiated by the pioneering works of Lasry and Lions: it aims at studying the asymptotic behavior of stochastic differential games (Nash equilibria) as the number $n$ of agents tends to infinity. The field is now rapidly growing in several directions, including stochastic optimal control, analysis of PDEs, calculus of variations, numerical analysis and computing, and the potential applications to economics and social sciences are numerous.
In the limit when $n \to +\infty$, a given agent feels the presence of the others through the statistical distribution of the states. Assuming that the perturbations of a single agent's strategy does not influence the statistical states distribution, the latter acts as a parameter in the control problem to be solved by each agent. When the dynamics of the agents are independent stochastic processes, MFGs naturally lead to a coupled system of two partial differential equations (PDEs for short), a forward Fokker-Planck equation and a backward Hamilton-Jacobi-Bellman equation.
The latter system of PDEs has closed form solutions in very few cases only. Therefore, numerical simulation are crucial in order to address applications. The present mini-course will be devoted to numerical methods that can be used to approximate the systems of PDEs.
The numerical schemes that will be presented rely basically on monotone approximations of the Hamiltonian and on a suitable weak formulation of the Fokker-Planck equation.
These schemes have several important features:

- The discrete problem has the same structure as the continous one, so existence, energy estimates, and possibly uniqueness can be obtained with the same kind of arguments

- Monotonicity guarantees the stability of the scheme: it is robust in the deterministic limit

- convergence to classical or weak solutions can be proved

Finally, there are particular cases named variational MFGS in which the system of PDEs can be seen as the optimality conditions of some optimal control problem driven by a PDE. In such cases, augmented Lagrangian methods can be used for solving the discrete nonlinear system. The mini-course will be orgamized as follows

1. Introduction to the system of PDEs and its interpretation. Uniqueness of classical solutions.

2. Monotone finite difference schemes

3. Examples of applications

4. Variational MFG and related algorithms for solving the discrete system of nonlinear equations[-]

Recently, an important research activity on mean field games (MFGs for short) has been initiated by the pioneering works of Lasry and Lions: it aims at studying the asymptotic behavior of stochastic differential games (Nash equilibria) as the number $n$ of agents tends to infinity. The field is now rapidly growing in several directions, including stochastic optimal control, analysis of PDEs, calculus of variations, numerical analysis and computing, and the potential applications to economics and social sciences are numerous.
In the limit when $n \to +\infty$, a given agent feels the presence of the others through the statistical distribution of the states. Assuming that the perturbations of a single agent's strategy does not influence the statistical states distribution, the latter acts as a parameter in the control problem to be solved by each agent. When the dynamics of the agents are independent stochastic processes, MFGs naturally lead to a coupled system of two partial differential equations (PDEs for short), a forward Fokker-Planck equation and a backward Hamilton-Jacobi-Bellman equation.
The latter system of PDEs has closed form solutions in very few cases only. Therefore, numerical simulation are crucial in order to address applications. The present mini-course will be devoted to numerical methods that can be used to approximate the systems of PDEs.
The numerical schemes that will be presented rely basically on monotone approximations of the Hamiltonian and on a suitable weak formulation of the Fokker-Planck equation.
These schemes have several important features:

- The discrete problem has the same structure as the continous one, so existence, energy estimates, and possibly uniqueness can be obtained with the same kind of arguments

- Monotonicity guarantees the stability of the scheme: it is robust in the deterministic limit

- convergence to classical or weak solutions can be proved

Finally, there are particular cases named variational MFGS in which the system of PDEs can be seen as the optimality conditions of some optimal control problem driven by a PDE. In such cases, augmented Lagrangian methods can be used for solving the discrete nonlinear system. The mini-course will be orgamized as follows

1. Introduction to the system of PDEs and its interpretation. Uniqueness of classical solutions.

2. Monotone finite difference schemes

3. Examples of applications

4. Variational MFG and related algorithms for solving the discrete system of nonlinear equations[-]

The aim of the talk is to introduce a nonlinear Discrete Duality Finite Volume scheme to approximate the solutions of drift-diffusion equations. The scheme is built to preserve at the discrete level even on severely distorted meshes the energy / energy dissipation relation. This relation is of paramount importance to capture the long-time behavior of the problem in an accurate way. To enforce it, the linear convection diffusion equation is rewritten in a nonlinear form before being discretized. This is a joint work with Clément Cancès (Lille) and Stella Krell (Nice).[-]

We present a Godunov type numerical scheme for a class of scalar conservation laws with nonlocal flux arising for example in traffic flow modeling. The scheme delivers more accurate solutions than the widely used Lax-Friedrichs type scheme and also allows to show well-posedness of the model. In a second step, we consider the extension of the non-local traffic flow model to road networks by defining appropriate conditions at junctions. Based on the proposed numerical scheme we show some properties of the approximate solution and provide several numerical examples.[-]

Numerical approximation of the Boltzmann equation is a challenging problem due to its high-dimensional, nonlocal, and nonlinear collision integral. Over the past decade, the Fourier-Galerkin spectral method has become a popular deterministic method for solving the Boltzmann equation, manifested by its high accuracy and potential of being further accelerated by the fast Fourier transform. Albeit its practical success, the stability of the method is only recently proved by Filbet, F. & Mouhot, C. in [Trans.Amer.Math.Soc. 363, no. 4 (2011): 1947-1980.] by utilizing the”spreading” property of the collision operator. In this work, we provide anew proof based on a careful L2 estimate of the negative part of the solution. We also discuss the applicability of the result to various initial data, including both continuous and discontinuous functions. This is joint work with Kunlun Qi and Tong Yang.[-]

We consider the inverse problem of recovering an unknown parameter from a finite set of indirect measurements. We start with reviewing the formulation of the Bayesian approach to inverse problems. In this approach the data and the unknown parameter are modelled as random variables, the distribution of the data is given and the unknown is assumed to be drawn from a given prior distribution. The solution, called the posterior distribution, is the probability distribution of the unknown given the data, obtained through the Bayes rule. We will talk about the conditions under which this formulation leads to well-posedness of the inverse problem at the level of probability distributions. We then discuss the connection of the Bayesian approach to inverse problems with the variational regularization. This will also help us to study the properties of the modes of the posterior distribution as point estimators for the unknown parameter. We will also briefly talk about the Markov chain Monte Carlo methods in this context.[-]

We explore a direct method allowing to solve numerically inverse type problems for hyperbolic type equations. We first consider the reconstruction of the full solution of the equation posed in $\Omega \times (0, T )$ - $\Omega$ a bounded subset of $\mathbb{R}^N$ - from a partial distributed observation. We employ a least-squares technic and minimize the $L^2$-norm of the distance from the observation to any solution. Taking the hyperbolic equation as the main constraint of the problem, the optimality conditions are reduced to a mixed formulation involving both the state to reconstruct and a Lagrange multiplier. Under usual geometric optic conditions, we show the well-posedness of this mixed formulation (in particular the inf-sup condition) and then introduce a numerical approximation based on space-time finite elements discretization. We show the strong convergence of the approximation and then discussed several examples for $N = 1$ and $N = 2$. The reconstruction of both the state and the source term is also discussed, as well as the boundary case. The parabolic case - more delicate as it requires the use of appropriate weights - will be also addressed. Joint works with Nicolae Cîndea and Diego Araujo de Souza.[-]