Searcharxiv⌕ Search

arXiv subjects

Lorenzo Pareschi

Publications and source records attributed to Lorenzo Pareschi.

At least 19 recordsLinked to original sources

Structure and asymptotic preserving deep neural surrogates for uncertainty quantification in multiscale kinetic equations

The high dimensionality of kinetic equations with stochastic parameters poses major computational challenges for uncertainty quantification (UQ). Traditional Monte Carlo (MC) sampling methods, while widely used, suffer from slow convergence and high variance, which become increasingly severe as the dimensionality of the parameter space grows. To accelerate MC sampling, we adopt a multiscale control variates strategy that leverages low-fidelity solutions from simplified kinetic models to reduce variance. To further improve sampling efficiency and preserve the underlying physics, we introduce surrogate models based on structure and asymptotic preserving neural networks (SAPNNs). These deep neural networks are specifically designed to satisfy key physical properties, including positivity, conservation laws, entropy dissipation, and asymptotic limits. By training the SAPNNs on low-fidelity models and enriching them with selected high-fidelity samples from the full Boltzmann equation, our method achieves significant variance reduction while maintaining physical consistency and asymptotic accuracy. The proposed methodology enables efficient large-scale prediction in kinetic UQ and is validated across both homogeneous and nonhomogeneous multiscale regimes. Numerical results demonstrate improved accuracy and computational efficiency compared to standard MC techniques.

math.NA↗

Micro-Macro Tensor Neural Surrogates for Uncertainty Quantification in Collisional Plasma

Plasma kinetic equations exhibit pronounced sensitivity to microscopic perturbations in model parameters and data, making reliable and efficient uncertainty quantification (UQ) essential for predictive simulations. However, the cost of uncertainty sampling, the high-dimensional phase space, and multiscale stiffness pose severe challenges to both computational efficiency and error control in traditional numerical methods. These aspects are further emphasized in presence of collisions where the high-dimensional nonlocal collision integrations and conservation properties pose severe constraints. To overcome this, we present a variance-reduced Monte Carlo framework for UQ in the Vlasov--Poisson--Landau (VPL) system, in which neural network surrogates replace the multiple costly evaluations of the Landau collision term. The method couples a high-fidelity, asymptotic-preserving VPL solver with inexpensive, strongly correlated surrogates based on the Vlasov--Poisson--Fokker--Planck (VPFP) and Euler--Poisson (EP) equations. For the surrogate models, we introduce a generalization of the separable physics-informed neural network (SPINN), developing a class of tensor neural networks based on an anisotropic micro-macro decomposition, to reduce velocity-moment costs, model complexity, and the curse of dimensionality. To further increase correlation with VPL, we calibrate the VPFP model and design an asymptotic-preserving SPINN whose small- and large-Knudsen limits recover the EP and VP systems, respectively. Numerical experiments show substantial variance reduction over standard Monte Carlo, accurate statistics with far fewer high-fidelity samples, and lower wall-clock time, while maintaining robustness to stochastic dimension.

cs.LG↗

A Realizability-Based Kinetic-Fluid Domain Decomposition Method for Single-Temperature Gas Mixtures

This paper introduces a domain-adaptive numerical method for multi-species kinetic models that relax toward a single-temperature and single-velocity hydrodynamic limit. To this end, we derive moment realizability matrices for this regime. In this way the ideas of Levermore, Morokoff, and Nadiga are extended to non-equilibrium mixtures in which inter-species and intra-species collisions occur at comparable rates, so that all species relax to a common velocity and a common temperature. The realizability conditions are used as an indicator to divide the computational domain, at each time step, into macroscopic and kinetic regions. In the kinetic regions, where the continuum description fails (e.g., across strong shocks, non-equilibrium interfaces, or kinetic boundary layers), the method solves the multi-species kinetic equations. Close to local thermodynamic equilibrium, the Euler equations of the mixture are solved instead. Confining the kinetic computations to the non-equilibrium regions reduces the simulation time, while the results remain close to those of the full kinetic solver. The method is discretized on Cartesian grids with high-order schemes in space and time. The kinetic equations are integrated with an Asymptotic-Preserving Implicit-Explicit (IMEX) scheme, so that a consistent discretization of the single-velocity, single-temperature Euler system of the mixture is recovered when the Knudsen number goes to zero. To the best of our knowledge, this is the first realizability-based adaptive spatial domain decomposition method for gas mixtures in this single-velocity, single-temperature setting.

math.NA↗

Realizability-Based Kinetic-Fluid Domain Decomposition for Multitemperature Gas Mixtures on Unstructured Meshes

We present a dynamic domain decomposition method for gas mixtures described by a multi-species BGK model in the regime where collisions between particles of the same species are dominant. In this regime the hydrodynamic limit is a system of Euler equations in which every species keeps its own velocity and temperature, the species being coupled through momentum and energy exchange terms. To decide locally whether this multi-velocity, multi-temperature Euler description is accurate, we extend the moment realizability criterion of Levermore, Morokoff and Nadiga: for each species, a realizability matrix is derived from the Chapman--Enskog expansion of the kinetic model, and its zeroth- and first-order approximations are compared. The indicator involves only macroscopic quantities and is evaluated species by species, so that in the same cell one species may be described by the Euler equations and another one by the kinetic equation. The kinetic solver is therefore used only where, and for the species for which, the indicator detects non-equilibrium effects, such as across shocks or near obstacles in rarefied flows. Both solvers are discretized on unstructured triangular meshes with second-order accuracy in space and time. The kinetic equation is integrated by an asymptotic-preserving IMEX Runge--Kutta scheme, whose limit for vanishing Knudsen number is a consistent discretization of the multi-velocity, multi-temperature Euler system. In the numerical tests the hybrid solution stays close to the kinetic one, while the computational time is reduced by a factor between about three and almost five.

math.NA↗

Full-horizon magnetic control of the Vlasov--Poisson system for plasma confinement

We study the full-horizon control of a two-dimensional Vlasov--Poisson system through an externally imposed magnetic field. The control is represented by time-dependent coefficients associated with smooth, spatially localized basis functions, and is designed to steer selected position and velocity moments of the distribution function while limiting particle dispersion and the control effort. Starting from the kinetic constrained optimization problem, we derive the continuous first-order optimality conditions, including a backward Vlasov equation, an elliptic adjoint equation, and the variational inequality associated with bounded controls. We then project this system onto a particle--grid representation and identify the resulting particle adjoints and control gradient. The full-horizon field is then computed on a reduced particle ensemble, initialized by an instantaneous control, and subsequently applied to a larger set of particles. Numerical experiments indicate that the instantaneous control field already provides an effective baseline, while the full-horizon correction can further reduce the relative thermal energy near the boundaries and improve confinement over the prescribed time interval.

math.NA↗

An IMEX multi-level domain-decomposition method for the Boltzmann equation on unstructured meshes

We introduce a dynamically adaptive multi-level method for the multiscale Boltzmann equation on unstructured meshes, coupling the compressible Euler, Navier-Stokes, and full Boltzmann descriptions within a single asymptotic-preserving IMEX framework. Unlike standard domain-decomposition approaches, where independent solvers exchange data only through interface conditions, the three models form a unified multiregime scheme. They share the same globally stiffly accurate IMEX Runge-Kutta discretization and are synchronized at every internal stage through kinetic-to-fluid moment projections and fluid-to-kinetic lifting. This stage-wise coupling maintains temporal consistency across model interfaces, while the asymptotic-preserving structure ensures compatibility with the fluid limit as the Knudsen number becomes small. The active description is selected in each cell through moment-realizability indicators derived from successive Chapman-Enskog approximations. The hierarchy uses Euler in near-equilibrium regions, Navier-Stokes where first-order nonequilibrium corrections are sufficient, and the full Boltzmann equation where a kinetic description is required. Using Navier-Stokes as the intermediate level avoids evolving a velocity distribution in mildly nonequilibrium regions, which is particularly advantageous on unstructured meshes, where kinetic transport dominates the cost. The spatial discretization combines finite-volume WENO reconstruction on triangular meshes with a conservative fast spectral method for the Boltzmann collision operator. Numerical experiments show that the method closely reproduces the full Boltzmann reference while significantly reducing the computational cost. These results suggest that tightly coupled AP model hierarchies are a viable alternative to interface-based domain decomposition for deterministic kinetic simulations in complex geometries.

math.NA↗

A relaxation system for the low-Mach limit of kinetic equations: Stability and higher order asymptotic preserving scheme

This work introduces a hyperbolic relaxation system designed for the simulation of kinetic equations in the low-Mach number limit. The methodology is built upon a micro-macro decomposition of the scaled BGK model, which reformulates the kinetic distribution function into a coupled system consisting of a macroscopic equilibrium part and a microscopic non-equilibrium remainder. By projecting the microscopic deviations onto a set of orthogonal polynomials, we derive a closed moment relaxation system. The resulting system is a version of Grad's 13 moment system with a linear hyperbolic part and a relaxation adapted to the incompressible limit. We prove the model's structural stability in the incompressible Navier-Stokes limit. Moreover, we develop a high order Asymptotic-Preserving (AP) numerical framework using Implicit-Explicit (IMEX) Runge Kutta schemes for temporal accuracy and finite difference WENO reconstructions as well as central difference approximations for high order spatial resolution. The proposed scheme ensures uniform stability and consistency across different physical regimes, automatically degenerating into a consistent high order discretization of the incompressible thermal Navier-Stokes limit as the scaling parameter vanishes. Numerical experiments in one and two dimensions corroborate the theoretical findings, demonstrating significant reductions in computational cost and robust performance across a wide range of Knudsen and Mach numbers.

math.NA↗

A fast spectral particle method for the Landau equation

We propose a fast deterministic particle method for the spatially homogeneous Landau equation. The method combines a particle representation of the solution with a Fourier approximation of the nonlinear collision flux. Nonuniform fast Fourier transforms are used to reconstruct the density from the particles and to evaluate the flux and density at the particle locations, while the convolutional structure of the flux enables its efficient computation by FFTs. For a fixed transform tolerance, the cost per time step is $\mathcal{O}(N+M^d\log M)$, where $N$ is the number of particles and $M$ the number of Fourier modes per velocity dimension. We establish a consistency estimate for the reconstructed velocity field on regions where the reference density is bounded away from zero. The estimate separates the spectral truncation error from the particle-density reconstruction error, showing how the latter can dominate for sufficiently smooth densities. Two-dimensional numerical experiments with Maxwellian interactions illustrate the accuracy and efficiency of the method, its sensitivity to particle and spectral resolution, and the effects of filtering. Comparisons with a direct blob implementation demonstrate improved accuracy at a strongly reduced computational cost.

math.NA↗

Control variates with neural surrogates for uncertainty quantification in kinetic equations

Efficient uncertainty quantification for kinetic equations with random inputs is challenging because it requires repeated simulations of high-dimensional models, such as the Boltzmann, Landau, and related collisional equations, whose computational cost can quickly become prohibitive. Multifidelity control variates address this difficulty by coupling a small number of high-fidelity simulations with many evaluations of lower-complexity reduced models. In this work, we analyze the case in which the reduced model is replaced by a neural surrogate rather than evaluated through a classical numerical scheme. We show that the resulting estimator remains unbiased and that the change in the optimal variance induced by the neural approximation is controlled by the error between the exact low-fidelity observable and its neural approximation. This estimate is then combined with residual stability estimates for inhomogeneous Fokker--Planck and Bhatnagar--Gross--Krook surrogates. We also extend the analysis to several control variates and to an asymptotic-preserving (AP) hierarchy containing the limiting Euler observable. In the fluid limit, the optimal hierarchical variance converges to the variance associated with the limiting Euler control, while the contribution of the intermediate kinetic correction vanishes. Numerical tests based on micro--macro neural surrogates illustrate the predicted variance stability and the behavior of the AP hierarchy.

math.NA↗

High-Order Asymptotic-Preserving Schemes for Kinetic Equations from Rarefied to Incompressible Regimes

This work introduces a novel high-order numerical framework for solving kinetic equations, designed to remain uniformly valid across all regimes of the mean free path, spanning from the rarefied kinetic scale to the incompressible hydrodynamic limit. The method is built upon a micro-macro decomposition, which reformulates the underlying kinetic equation into a coupled system consisting of a macroscopic part, representing the fluid-dynamic evolution, and a microscopic part, describing the non-equilibrium deviations. The proposed framework ensures high-order temporal accuracy through the use of Implicit-Explicit Runge-Kutta methods, which provide stability and efficiency in stiff regimes, while spatial resolution is enhanced by combining finite-difference WENO reconstructions with high-order central difference approximations. A key feature of the proposed methodology is its Asymptotic-Preserving (AP) property. We demonstrate that, in the appropriate asymptotic limit as the mean free path tends to zero, the scheme consistently reduces to a high-order finite-difference formulation of the incompressible Navier-Stokes equations. To support the theoretical findings, a set of numerical experiments are performed on one- and two-dimensional benchmark problems, which confirm the accuracy, stability, and versatility of the method across different flow regimes.

math.NA↗

Superlinear drift in consensus-based optimization with condensation phenomena

Consensus-based optimization (CBO) is a class of metaheuristic algorithms designed for global optimization problems. In the many-particle limit, classical CBO dynamics can be rigorously connected to mean-field equations that ensure convergence toward global minimizers under suitable conditions. In this work, we draw inspiration from recent extensions of the Kaniadakis--Quarati model for indistinguishable bosons to develop a novel CBO method governed by a system of SDEs with superlinear drift and nonconstant diffusion. The resulting mean-field formulation in one dimension exhibits condensation-like phenomena, including finite-time blow-up and loss of $L^2$-regularity. To avoid the curse of dimensionality a marginal based formulation which permits to leverage the one-dimensional results to multiple dimensions is proposed. We support our approach with numerical experiments that highlight both its consistency and potential performance improvements compared to classical CBO methods.

math.OC↗

Collective Annealing by Switching Temperatures: a Boltzmann-type description

The design of effective cooling strategies is a crucial component in simulated annealing algorithms based on the Metropolis method. Traditionally, this is achieved through inverse logarithmic decays of the temperature to ensure convergence to global minima. In this work, we propose Collective Annealing by Switching Temperatures ({CAST}), a novel collective simulated annealing dynamic in which agents interact to learn an adaptive cooling schedule. Inspired by the particle-swapping mechanism of parallel tempering, we introduce a Boltzmann-type framework in which particles exchange temperatures through stochastic binary interactions. Under suitable conditions on the interaction parameters, this process induces a monotone decrease of the expected average temperature in the system. Numerical results indicate that the proposed approach can improve convergence speed over classical simulated annealing on multimodal benchmark problems, especially in regimes where adaptive exploration is important.

math.OC↗

How opinions shape epidemics: a graphon-based kinetic approach

Understanding the mutual influence between social behavior and physical health is crucial for designing effective epidemic mitigation strategies. Individual interactions drive the evolution of opinions, which in turn shape how infectious diseases are perceived and consequently how they spread within a population, for instance through the adoption or rejection of preventive measures. At the same time, the distribution and dynamics of physical contacts play a fundamental role in determining transmission patterns. To this end, we develop a mathematical framework to analyze the coupled dynamics of opinion formation, disease transmission, and physical contacts by employing graphon-based networks, which capture heterogeneous and large-scale connectivity patterns typical of realistic social structures. The epidemic compartmental model further incorporates a kinetic description of microscopic level physical contacts, allowing for a consistent multiscale representation of interaction patterns. Starting from a microscopic description governed by interpersonal compromise and intrinsic self-thinking processes, we derive a kinetic compartmental epidemic model on graphons via a mean-field limit. This formulation allows us to investigate the joint evolution of the disease state and the opinion distribution, with a particular focus on the role of social networks and physical contacts. Numerical experiments demonstrate that the graphon-kinetic approach provides a comprehensive representation of the coupled opinion-epidemic dynamics, revealing new possibilities for controlling disease spread by shaping population opinion patterns.

physics.soc-ph↗

Multi-Order Monte Carlo IMEX hierarchies for uncertainty quantification in multiscale hyperbolic systems

We introduce a novel Multi-Order Monte Carlo approach for uncertainty quantification in the context of multiscale time-dependent partial differential equations. The new framework leverages Implicit-Explicit Runge-Kutta time integrators to satisfy the asymptotic-preserving property across different discretization orders of accuracy. In contrast to traditional Multi-Level Monte Carlo methods, which require costly hierarchical re-meshing, our method constructs a multi-order hierarchy by varying both spatial and temporal discretization orders within the Monte Carlo framework. This enables efficient variance reduction while naturally adapting to the multiple scales inherent in the problem ensuring asymptotic consistency. The proposed method is particularly well-suited for hyperbolic systems with stiff relaxation, kinetic equations, and low Mach number flows, where standard Multi-Level Monte Carlo techniques often encounter computational challenges. Numerical experiments demonstrate that the novel Multi-Order Monte Carlo approach achieves substantial reduction of both error and variance while maintaining asymptotic consistency in the asymptotic limit.

math.NA↗

Two-Time-Scale Learning Dynamics: A Population View of Neural Network Training

Population-based learning paradigms, including evolutionary strategies, Population-Based Training (PBT), and recent model-merging methods, combine fast within-model optimisation with slower population-level adaptation. Despite their empirical success, a general mathematical description of the resulting collective training dynamics remains incomplete. We introduce a theoretical framework for neural network training based on two-time-scale population dynamics. We model a population of neural networks as an interacting agent system in which network parameters evolve through fast noisy gradient updates of SGD/Langevin type, while hyperparameters evolve through slower selection--mutation dynamics. We prove the large-population limit for the joint distribution of parameters and hyperparameters and, under strong time-scale separation, derive a selection--mutation equation for the hyperparameter density. For each fixed hyperparameter, the fast parameter dynamics relaxes to a Boltzmann--Gibbs measure, inducing an effective fitness for the slow evolution. The averaged dynamics connects population-based learning with bilevel optimisation and classical replicator--mutator models, yields conditions under which the population mean moves toward the fittest hyperparameter, and clarifies the role of noise and diversity in balancing optimisation and exploration. Numerical experiments illustrate both the large-population regime and the reduced two-time-scale dynamics, and indicate that access to the effective fitness, either in closed form or through population-level estimation, can improve population-level updates.

cs.LG↗

Asymptotic preserving methods for the low mach limit in discrete velocity models approximating kinetic equations

We consider a Lattice Boltzmann type discrete velocity model in the low Mach number scaling and develop a corresponding numerical scheme that remains uniformly valid across all regimes of the mean free path, from the kinetic to the hydrodynamic scale. The proposed framework ensures high order temporal accuracy through the use of Implicit Explicit Runge Kutta methods, which provide stability and efficiency in stiff regimes, while spatial resolution is enhanced by combining finite difference WENO reconstructions with high order central difference approximations. In the appropriate asymptotic limit, the scheme reduces to a high order finite difference formulation of the incompressible Navier Stokes equations, thereby guaranteeing physical consistency of the numerical approximation with the limit model. To corroborate the theoretical findings, a set of numerical experiments is performed on two dimensional benchmark problems, which confirm the accuracy, stability, and versatility of the method across different flow regimes.

math.NA↗

High-Order Asymptotic-Preserving IMEX schemes for an ES-BGK model for Gas Mixtures

In this work we construct a high-order Asymptotic-Preserving (AP) Implicit-Explicit (IMEX) scheme for the ES-BGK model for gas mixtures introduced in [Brull, Commun. Math. Sci., 2015]. The time discretization is based on the IMEX strategy proposed in [Filbet, Jin, J. Sci. Comput., 2011] for the single-species BGK model and is here extended to the multi-species ES-BGK setting. The resulting method is fully explicit, uniformly stable with respect to the Knudsen number and, in the fluid regime, it reduces to a consistent and high-order accurate solver for the limiting macroscopic equations of the mixture. The IMEX structure removes the stiffness associated with the relaxation term so that the time step is constrained only by a hyperbolic CFL condition. The full solver couples a high-order space and velocity discretization that includes third-order time integration, a CWENO3 finite-volume reconstruction in space, exact conservation of macroscopic moments in the discrete velocity space, and a multithreaded implementation. The proposed approach can handle an arbitrary number of species. Its accuracy and robustness are demonstrated on a set of multidimensional kinetic tests for gas mixtures, where the AP property and the correct asymptotics are numerically verified across different regimes.

math.NA↗

Augmented data and neural networks for robust epidemic forecasting: application to COVID-19 in Italy

In this work, we propose a data augmentation strategy aimed at improving the training phase of neural networks and, consequently, the accuracy of their predictions. Our approach relies on generating synthetic data through a suitable compartmental model combined with the incorporation of uncertainty. The available data are then used to calibrate the model, which is further integrated with deep learning techniques to produce additional synthetic data for training. The results show that neural networks trained on these augmented datasets exhibit significantly improved predictive performance. We focus in particular on two different neural network architectures: Physics-Informed Neural Networks (PINNs) and Nonlinear Autoregressive (NAR) models. The NAR approach proves especially effective for short-term forecasting, providing accurate quantitative estimates by directly learning the dynamics from data and avoiding the additional computational cost of embedding physical constraints into the training. In contrast, PINNs yield less accurate quantitative predictions but capture the qualitative long-term behavior of the system, making them more suitable for exploring broader dynamical trends. Numerical simulations of the second phase of the COVID-19 pandemic in the Lombardy region (Italy) validate the effectiveness of the proposed approach.

math.NA↗