SearcharxivSearch

arXiv · 1810.06448

Orders of convergence in the averaging principle for SPDEs: the case of a stochastically forced slow component

Abstract

This article is devoted to the analysis of semilinear, parabolic, Stochastic Partial Differential Equations, with slow and fast time scales. Asymptotically, an averaging principle holds: the slow component converges to the solution of another semilinear, parabolic, SPDE, where the nonlinearity is averaged with respect to the invariant distribution of the fast process. We exhibit orders of convergence, in both strong and weak senses, in two relevant situations, depending on the spatial regularity of the fast process and on the covariance of the Wiener noise in the slow equation. In a very regular case, strong and weak orders are equal to $\frac12$ and $1$. In a less regular case, the weak order is also twice the strong order. This study extends previous results concerning weak rates of convergence, where either no stochastic forcing term was included in the slow equation, or the covariance of the noise was extremely regular. An efficient numerical scheme, based on Heterogeneous Multiscale Methods, is briefly discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

Charles-Edouard Bréhier. 2018-10-15. Orders of convergence in the averaging principle for SPDEs: the case of a stochastically forced slow component. https://arxiv.org/abs/1810.06448

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