# Mathematics of Computation

Published by the American Mathematical Society, the Mathematics of Computation (MCOM) is devoted to research articles of the highest quality in all areas of pure and applied mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.98.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

## A stochastic particle method for the McKean-Vlasov and the Burgers equationHTML articles powered by AMS MathViewer

by Mireille Bossy and Denis Talay
Math. Comp. 66 (1997), 157-192 Request permission

## Abstract:

In this paper we introduce and analyze a stochastic particle method for the McKean-Vlasov and the Burgers equation; the construction and error analysis are based upon the theory of the propagation of chaos for interacting particle systems. Our objective is three-fold. First, we consider a McKean-Vlasov equation in $[0,T]\times \mathbb {R}$ with sufficiently smooth kernels, and the PDEs giving the distribution function and the density of the measure $\mu _t$, the solution to the McKean-Vlasov equation. The simulation of the stochastic system with $N$ particles provides a discrete measure which approximates $\mu _{k\delta t}$ for each time $k\delta t$ (where $\delta t$ is a discretization step of the time interval $[0,T]$). An integration (resp. smoothing) of this discrete measure provides approximations of the distribution function (resp. density) of $\mu _{k\delta t}$. We show that the convergence rate is ${\mathcal O}\left (1/\sqrt {N}+\sqrt {\delta t}\right )$ for the approximation in $L^1(\Omega \times \mathbb {R})$ of the cumulative distribution function at time $T$, and of order ${\mathcal O}\left (\varepsilon ^2 + \frac {1}{\varepsilon } \left (\frac {1}{\sqrt {N}}+ \sqrt {\delta t}\right )\right )$ for the approximation in $L^1(\Omega \times \mathbb {R})$ of the density at time $T$ ($\Omega$ is the underlying probability space, $\varepsilon$ is a smoothing parameter). Our second objective is to show that our particle method can be modified to solve the Burgers equation with a nonmonotonic initial condition, without modifying the convergence rate ${\mathcal O}\left (1/\sqrt {N}+\sqrt {\delta t}\right )$. This part extends earlier work of ours, where we have limited ourselves to monotonic initial conditions. Finally, we present numerical experiments which confirm our theoretical estimates and illustrate the numerical efficiency of the method when the viscosity coefficient is very small.
References
Similar Articles
• Mireille Bossy
• Affiliation: INRIA, 2004 Route des Lucioles, B.P. 93, 06902 Sophia-Antipolis Cedex, France
• Email: Mireille.Bossy@sophia.inria.fr
• Denis Talay
• Affiliation: INRIA, 2004 Route des Lucioles, B.P. 93, 06902 Sophia-Antipolis Cedex, France
• MR Author ID: 170370
• Email: Denis.Talay@sophia.inria.fr
• Received by editor(s): January 11, 1995
• Received by editor(s) in revised form: May 15, 1995, and November 6, 1995