In this talk, we begin with the nonlinear Schrödinger equation (NLSE) with different low regularity potentials and nonlinearities arising from modeling and simulation for quantum physics and chemistry, nonlinear/quantum optics, and quantum information and computation, etc. Optimal error bounds for time-splitting methods and exponential wave integrators are established for the NSLE under the proper regularity assumption on its solution determined by the low regularity potential and nonlinearity. Then we propose a novel symmetric and explicit Gautschi-type exponential wave integrator (sEWI) for the NLSE with low regularity potential and nonlinearity, and establish its optimal error estimates under various regularity assumptions on potential and nonlinearity. Extensions to the NLSE with singular potentials and nonlinearities are presented. Finally, extensions to other dispersive PDEs with low regularity potential and nonlinearity are discussed. 

This talk is based on joint works with Remi Carles, Yue Feng, Bo Lin, Ying Ma, Chunmei Su, Qinglin Tang and Chushan Wang.

Gradient Random Walk methods are particle-based techniques originally developed for the simulation of reaction–diffusion systems, in which particles evolve to represent the spatial derivatives of the solution. Inspired by vortex methods for the Navier–Stokes equations, these approaches attracted considerable interest in the 1990s because of several appealing features: they operate without a computational grid, adapt naturally by concentrating particles in regions of steep gradients, and can significantly reduce statistical variance compared with classical Random Walk schemes.

In this talk, we revisit this framework and show how its underlying ideas can be extended beyond reaction–diffusion systems to hyperbolic conservation laws. We first formulate a classical Monte Carlo approach for relaxation approximations of hyperbolic problems. We then introduce a new particle dynamics based on the evolution of spatial derivatives, leading to a gradient-based representation of the solution. When coupled with an asymptotic-preserving splitting strategy, this construction yields a new class of Gradient-Based Monte Carlo methods specifically designed for hyperbolic equations. We will present the main analytical and computational ideas behind the method and illustrate how the gradient formulation enhances adaptivity, reduces statistical fluctuations, and improves the representation of sharp solution features.

In the talk I will review stochastic particle approximations of Boltzmann-like equations and present a novel quantitative error analysis. The convergence result is based on a coupling tailored for the collisional dynamics and on Wasserstein concentration inequalities. I will also discuss extensions to particle-based methods in optimization and sampling. Joint work with Lorenzo Pareschi.

Numerous physical, chemical, biological, and social dynamic processes are characterised by convergence to long-time equilibria. These are often described as PDEs of kinetic type, whereby `position' and `velocity' are independent variables. These may also arise when modelling multi-agent interacting processes of particles, individuals, etc. In many important cases the diffusion/dissipation required to arrive to such equilibria is explicitly present in some of the spatial directions only, that is there exist evolution PDEs with degenerate diffusion yet converging to equilibrium states as time goes to infinity. This, somewhat counter-intuitive at first, state of affairs suggests that decay to equilibrium is due to finer hidden structure, which allows for the transport terms to also `propagate dissipation’  into the spatial directions where no dissipation appears explicitly in the PDE model. Villani coined the term ‘hypocoercivity' to describe this phenomenon in his celebrated 2009 AMS Memoir, in which he presented abstract sufficient conditions for this property for general classes of PDEs. The question of preserving hypocoercivity structures is highly relevant also in the context of numerical methods for kinetic PDEs, since the trend to equilibrium is often non-monotone and, typical numerical methods are not designed specifically for `long-time' simulations. Taking as a representative example the inhomogeneous (degenerate) Fokker-Planck equation, I will present a framework on how to design numerical methods that provably preserve the same hypocoercivity structures as the equation itself. Of key importance in the construction is the treatment of lack of sufficiently high regularity of standard Galerkin/finite element spaces and how this is circumvented by careful definition of consistent stabilisation mechanisms, thereby, arriving naturally to the proof of hypocoercivity of the numerical solution in appropriate exponentially weighted function spaces. Time-permitting, some comments on the computational complexity of the new class of methods for full kinetic models will be given. I plan to conclude with a series of numerical experiments showcasing the practicality of the proposed numerical methodology.

Fractional differential equations arise in many applications to model systems with memory effects. Their nonlocal nature, however, prevents the direct use of standard adaptive ODE and DAE solvers. In this talk, we present a general framework that transforms a broad class of fractional differential equations into enlarged systems of ordinary differential equations by approximating the fractional kernel as a sum of exponentials.

The resulting systems are typically very large and stiff. We show how their special arrow-type Jacobian structure can be exploited to solve the associated linear systems with computational complexity that grows only linearly with the number of auxiliary variables. This makes it possible to employ existing efficient adaptive stiff integrators, such as Radau5 and DASSL, without modifying their numerical core.

We discuss both existing and newly developed sum-of-exponentials approximations of the fractional kernel and investigate parameter choices that lead to efficient, practical implementations. Numerical experiments demonstrate the accuracy and efficiency of the proposed approach on representative test problems. Finally, we illustrate how widely available stiff ODE solvers can be turned into effective tools for the numerical solution of fractional differential equations through this reformulation.

Many numerical methods relying on particle approximation most prominently optimization, Monte-Carlo, high-dimensional ODE integration methods, or filtering methods. In this talk we investigate their kinetic and mean field limits. The later have been used successfully to investigate convergence and stability properties. In this talk we aim to cover Metropolis Monte Carlo methods, Ensemble Kalman Filter methods, and consensus-based optimization methods. Numerical examples illustrate the theoretical findings. 

In this talk, I will review the development of fast Fourier spectral methods for a broad class of nonlinear Boltzmann equations, including models with general collision kernels, multispecies interactions, and quantum collisions, highlighting the pioneering contributions of Professor Lorenzo Pareschi that have shaped this area of research. Finally, I will present recent advances in extending these methods to kinetic models arising in fusion reaction systems. 

The study of dynamical systems defined on networks (graphs) has a long history of results and applications. Early work linked graph spectra and Laplacian operators to diffusion andstability analyses; the Kuramoto model and subsequent reductions (e.g., Ott–Antonsen) catalyzed rigorous study of synchronization in coupled oscillators. The emergence of complex-network models (e.g. Watts–Strogatz, Barabási–Albert models) and epidemic-network studies highlighted how topology shapes collective dynamics and thresholds. Methods for stability and control, notably the master stability function, clarified when and how networks synchronize or desynchronize. More recently, graph limit theory (graphons) provided a principled passage from discrete networks to nonlocal continuum equations, enabling mean-field descriptions and rigorous convergence results for large dense graphs. Complementary frameworks (graphexes, sparse limits) extend these ideas to sparse regimes. These advances support contemporary work connecting continuum limits to graph neural networks, reservoir computing, neuroscience, ecology, and epidemic modeling. We will review some of these applications and highlight several open challenges, including inferring graphons from data, extending continuum techniques to sparse and heterogeneous graphs, and translating theoretical limits into practical tools for the control and learning of large-scale networks.

This work was developed in collaboration with G. Aletti (UniMI), G. Patanè (IMATI.CNR), A. Marta (UniMI), and M. Calabrò (PoliMI).

We are interested in the development of hydrodynamic equations from kinetic models, including the evolution of entropy. It turns out that it is possible to derive from kinetic equations the structure of symmetric hyperbolic thermodynamically compatible (SHTC) models proposed by Godunov-Romenski and used by Dumbser and coworkers. This derivation connects the entropy dissipation provided by the SHTC model with non equilibrium effects in kinetic theory. 

Another development in the same line concerns the derivation of Baer-Nunziato like models for two phase flows from kinetic equations.

Joint work with: Thomas Rey and Tommaso Tenna

We present a Multilevel Kinetic-Diffusion Monte Carlo (ML-KDMC) method for the simulation of kinetic Boltzmann transport equations with a BGK collision operator, with particular motivation from neutral-particle transport in the plasma edge of nuclear fusion reactors. The underlying Kinetic-Diffusion Monte Carlo method remains accurate in both low- and high-collisional regimes while avoiding the prohibitive cost growth typically associated with the diffusive limit. We show that embedding KDMC in a Multilevel Monte Carlo framework, based on a hierarchy of increasingly large time steps, further reduces the computational cost. A central challenge in fusion applications is the accurate estimation of moments of the particle distribution through event scoring along particle trajectories. Since velocity information is lost during the diffusive step of KDMC, this traditionally requires dedicated estimators. We demonstrate that such estimators can be avoided by reinterpreting KDMC as a distribution-composition hybrid fluid-kinetic method.

This work is joint with Emil Loevbak, Bert Mortier, Pieterjan Robbe, and Zhirui Tang.

The BGK equation was formulated to be a numerically tractable model of the Boltzmann equation. More than 70 years after its publication, and in spite of the enormous increase in computational power since then, it is still being used and attracts quite some attention from the mathematical community. It is phenomenological in the sense that it preserves many of the properties of the Boltzmann equation, but there is no direct connection with the underlaying particle systems. The BGK has been obtained as the limit of random particle systems, but here I will show how the BGK equation arises from a deterministic, reversible particle system, a modification of the hard sphere dynamics. This leads to a hard sphere version of the BGK equation, but the particle system can be modified so as to yield the usual BGK equation in the limit. In the talk I will not attempt to present any proof, but the results are illustrated with numerical simulations.