Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.28335

First-Order Mean Field Games with Time-Measurable and $C ^{1,1}$ Hamiltonians: Analysis and Approximation

Elisabetta Carlini·Valentina Coscetti·Francisco J. Silva
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce and analyze a numerical framework for a class of first-order, non-local Mean Field Game (MFG) systems with two sources of low regularity: the time-dependent data are merely measurable, and the Hamiltonian is only of class $C^{1,1}$ with respect to the momentum variable. The proposed method combines a semi-Lagrangian approximation of the Hamilton--Jacobi--Bellman equation with a Lagrange--Galerkin discretization of the continuity equation. Temporal measurability is handled by averaging the data over the time-grid intervals and using the stability theory of $L^1$-viscosity solutions. The limited regularity of the Hamiltonian is addressed through arguments from nonsmooth analysis, based in particular on Clarke's generalized differential calculus. We prove that the discrete solutions converge, up to some subsequence, to a solution of the MFG system. As a consequence, the numerical approximation also provides a constructive existence result. Under a monotonicity assumption on the coupling terms, we show that the solution to the MFG system is unique, implying the convergence of the whole sequence of discrete solutions. Finally, numerical experiments in one and two spatial dimensions illustrate the robustness of the method, including a linear--quadratic example with a running cost that is discontinuous in time and for which we compute an exact solution.

Explore related subjects

math.NAcs.NAmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elisabetta Carlini, Valentina Coscetti, Francisco J. Silva. 2026-10-20. First-Order Mean Field Games with Time-Measurable and $C ^{1,1}$ Hamiltonians: Analysis and Approximation. https://arxiv.org/abs/2610.28335

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Perturbed saddle-point problems in $\mathrm{L}^p$ with non-regular loads

In this work, we develop the continuous and discrete solvability analysis for perturbed saddle-point problems in Banach spaces with forcing terms regularised by means of a projector constructed using the adjoint of a weighted Clément quasi-interpolation. We take as driving example the linearised Poisson--Boltzmann equation (an advection-diffusion-reaction problem) in mixed form. We use perturbation arguments on the continuous and discrete levels and then derive a priori estimates that remain valid when the load that appears on the right-hand side of the "second" equation is in $\mathrm{H}^{-1}$. Further, we show a supercloseness result and {analyse convergence} of an adequate adaptation of Stenberg postprocessing for mixed advection equations with non-regular data. We provide numerical results that illustrate the convergence of the proposed scheme.

math.NA↗
arXiv2026

Born-Preconditioned Learning for Iterative Neural PDE Solvers

Simulating high-frequency waves in spatially varying media remains challenging for both classical iterative methods and neural PDE solvers. We propose Neural Preconditioned Born Series (NPBS), a framework for learning iterative neural PDE solvers. Our guiding idea is to use a simple reference preconditioner to help learn a more effective neural preconditioner. Building on the Convergent Born Series (CBS), NPBS feeds a preconditioned residual to a neural network that predicts a solution update. We train the network to reduce the preconditioned residual after each update. The same reference preconditioner is used for the network input and the loss, giving a metric-matched training objective. Experiments on heterogeneous Helmholtz problems show reduced iteration counts across neural architectures and larger gains at higher wavenumbers. Within a Krylov solver, NPBS achieves the lowest wall-clock time in the evaluated solver comparison. The framework also extends naturally to three-dimensional problems. The same metric-matched formulation also improves convergence on convection-diffusion-reaction systems and Newton linear systems for nonlinear PDEs, indicating that NPBS provides a general framework for learning neural preconditioners.

math.NA↗
arXiv2026

Flexible GMRES converges in two phases

We derive a sharp upper bound on the residuals produced by the flexible GMRES (FGMRES) method. The bound shows that FGMRES exhibits two phases of convergence depending on the residual tolerance of the inner preconditioner. For small tolerances, the convergence of FGMRES is practically geometric with a constant rate throughout, while for looser tolerances the two-phase behavior becomes more pronounced. We also show that the derived bound cannot be improved and construct an example for which it becomes an equality.

math.NA↗