Weak convergence rates for an explicit full-discretization of stochastic Allen-Cahn equation with additive noise

11/21/2019 ∙ by Meng Cai, et al. ∙ 0

We discretize the stochastic Allen-Cahn equation with additive noise by means of a spectral Galerkin method in space and a tamed version of the exponential Euler method in time. The resulting error bounds are analyzed for the spatio-temporal full discretization in both strong and weak senses. Different from existing works, we develop a new and direct approach for the weak error analysis, which does not rely on the associated Kolmogorov equation. It turns out that the obtained weak convergence rates are, in both spatial and temporal direction, essentially twice as high as the strong convergence rates. Also, it is revealed how the weak convergence rates depend on the regularity of the noise. Numerical experiments are finally reported to confirm the theoretical conclusion.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.