Searcharxiv⌕ Search

arXiv subjects

Ahmad Zorkot

Publications and source records attributed to Ahmad Zorkot.

4 recordsLinked to original sources

An adaptive Gaussian splitting scheme for linear Fokker--Planck equations

We develop an adaptive numerical method for linear Fokker--Planck equations on $\mathbb R^d$, based on approximating the evolving probability density by linear combinations of Gaussian functions (LCGs). The method applies to polynomial-type drift fields, without requiring a gradient-flow structure or a stationary distribution. It relies on an operator splitting that separates diffusion and affine drift, for which Gaussian functions can be propagated exactly, from higher-order transport, whose evolution is approximated adaptively by LCGs. Both the number of Gaussian components and their means and covariances are adjusted to meet the prescribed accuracy tolerances. The adaptivity is driven by computable error indicators involving polynomial moments of Gaussians that can be evaluated analytically. We provide a rigorous error analysis that relates the approximation error to the indicators driving adaptivity and illustrate the performance of the scheme in several test cases.

math.NA↗

Newton Methods for Mean Field Games: A Numerical Study

We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this theoretical framework, we develop new numerical discretization techniques, including both a finite difference and a semi-Lagrangian scheme, that enable an effective computational implementation of the infinite-dimensional iterations. The proposed methods are tested on several benchmark problems, and the resulting numerical experiments demonstrate their robustness, accuracy, and efficiency. A comparative analysis between the two schemes and existing approaches from the literature is also presented, highlighting the potential of Newton-based solvers for MFG systems.

math.NA↗

Approximation of deterministic mean field games under polynomial growth conditions on the data

We consider a deterministic mean field games problem in which a typical agent solves an optimal control problem where the dynamics is affine with respect to the control and the cost functional has a growth which is polynomial with respect to the state variable. In this framework, we construct a mean field game problem in discrete time and finite state space that approximates equilibria of the original game. Two numerical examples, solved with the fictitious play method, are presented.

math.OC↗

A Lagrange-Galerkin scheme for first order mean field games systems

In this work, we consider a first order mean field games system with non-local couplings. A Lagrange-Galerkin scheme for the continuity equation, coupled with a semi-Lagrangian scheme for the Hamilton-Jacobi-Bellman equation, is proposed to discretize the mean field games system. The convergence of solutions to the scheme towards a solution to the mean field game system is established in arbitrary space dimensions. The scheme is implemented to approximate two mean field games systems in dimension one and two.

math.AP↗