SearcharxivSearch

arXiv · 1802.06372

Strong convergence rates of semi-discrete splitting approximations for stochastic Allen--Cahn equation

Abstract

This article analyzes an explicit temporal splitting numerical scheme for the stochastic Allen-Cahn equation driven by additive noise, in a bounded spatial domain with smooth boundary in dimension $d\le 3$. The splitting strategy is combined with an exponential Euler scheme of an auxiliary problem. When $d=1$ and the driving noise is a space-time white noise, we first show some a priori estimates of this splitting scheme. Using the monotonicity of the drift nonlinearity, we then prove that under very mild assumptions on the initial data, this scheme achieves the optimal strong convergence rate $\OO(\delta t^{\frac 14})$. When $d\le 3$ and the driving noise possesses some regularity in space, we study exponential integrability properties of the exact and numerical solutions. Finally, in dimension $d=1$, these properties are used to prove that the splitting scheme has a strong convergence rate $\OO(\delta t)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Charles-Edouard Bréhier, Jianbo Cui, Jialin Hong. 2018-02-18. Strong convergence rates of semi-discrete splitting approximations for stochastic Allen--Cahn equation. https://arxiv.org/abs/1802.06372

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR