Convergence rate for the approximation of the limit law of weakly interacting particles: Application to the burgers equation

77Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

In this paper we construct a stochastic particle method for the Burgers equation with a monotone initial condition; we prove that the convergence rate is O(1/√N + √Δt) for the L1(ℝ × Ω) norm of the error. To obtain that result, we link the PDE and the algorithm to a system of weakly interacting stochastic particles; the difficulty of the analysis comes from the discontinuity of the interaction kernel, which is equal to the Heaviside function. In a previous paper we showed how the algorithm and the result extend to the case of nonmonotone initial conditions for the Burgers equation. We also treated the case of nonlinear PDE's related to particle systems with Lipschitz interaction kernels. Our next objective is to adapt our methodology to the (more difficult) case of the two-dimensional inviscid Navier-Stokes equation.

Cite

CITATION STYLE

APA

Bossy, M., & Talay, D. (1996). Convergence rate for the approximation of the limit law of weakly interacting particles: Application to the burgers equation. Annals of Applied Probability, 6(3), 818–861. https://doi.org/10.1214/aoap/1034968229

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free