SearcharxivSearch

arXiv · 1806.11523

Rapid covariance-based sampling of linear SPDE approximations in the multilevel Monte Carlo method

Abstract

The efficient simulation of the mean value of a non-linear functional of the solution to a linear stochastic partial differential equation (SPDE) with additive Gaussian noise is considered. A Galerkin finite element method is employed along with an implicit Euler scheme to arrive at a fully discrete approximation of the mild solution to the equation. A scheme is presented to compute the covariance of this approximation, which allows for rapid sampling in a Monte Carlo method. This is then extended to a multilevel Monte Carlo method, for which a scheme to compute the cross-covariance between the approximations at different levels is presented. In contrast to traditional path-based methods it is not assumed that the Galerkin subspaces at these levels are nested. The computational complexities of the presented schemes are compared to traditional methods and simulations confirm that, under suitable assumptions, the costs of the new schemes are significantly lower.

Explore related subjects

Keep this discovery

BibTeXRIS

Andreas Petersson. 2018-06-29. Rapid covariance-based sampling of linear SPDE approximations in the multilevel Monte Carlo method. https://arxiv.org/abs/1806.11523

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