SearcharxivSearch

arXiv · 1806.01564

Strong and weak convergence rates of finite element method for stochastic partial differential equation with non-sided Lipschitz coefficient

Abstract

Strong and weak approximation errors of a spatial finite element method are analyzed for stochastic partial differential equations(SPDEs) with one-sided Lipschitz coefficients, including the stochastic Allen--Cahn equation, driven by additive noise. In order to give the strong convergence rate of the finite element method, we present an appropriate decomposition and some a priori estimates of the discrete stochastic convolution. To the best of our knowledge, there has been no essentially sharp weak convergence rate of spatial approximation for parabolic SPDEs with non-globally Lipschitz coefficients. To investigate the weak error, we first regularize the original equation by the splitting technique and derive the regularity estimates of the corresponding regularized Kolmogorov equation. Meanwhile, we present the regularity estimate in Malliavin sense and the refined estimate of the finite element method. Combining the regularity estimates of regularized Kolmogorov equation with Malliavin integration by parts formula, the weak convergence rate is shown to be twice the strong convergence rate.

Explore related subjects

Keep this discovery

BibTeXRIS

Jianbo Cui, Jialin Hong. 2018-06-05. Strong and weak convergence rates of finite element method for stochastic partial differential equation with non-sided Lipschitz coefficient. https://arxiv.org/abs/1806.01564

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