SearcharxivSearch

arXiv · 1603.00661

Elliptic boundary value problems with Gaussian white noise loads

Abstract

Linear second order elliptic boundary value problems (BVP) on bounded Lipschitz domains are studied in the case of Gaussian white noise loads. Especially, Neumann and Robin BVPs are considered. The main obstacle for applying the usual variational approach is that the Gaussian white noise has irregular realizations. In particular, the corresponding Neumann boundary values are not well-defined in the ordinary sense. In this work, the BVP is reformulated by replacing the continuity of the boundary trace mapping with measurability. Instead of using variational methods alone, the reformulation of the BVP derives also from Cameron-Martin space techniques. The reformulation essentially returns the study of irregular white noise loads to study of $L^2$-loads. Admissibility of the reformulation is demonstrated by showing that usual finite element approximations of the BVP with discretized white noise loads converge to the solution of the reformulated problem. For Neumann and Robin BVPs, the finite dimensional approximations have been utilized before. However, here also the infinite-dimensional limit is considered.

Explore related subjects

Keep this discovery

BibTeXRIS

Sari Lasanen, Lassi Roininen, Janne M. J. Huttunen. 2016-03-02. Elliptic boundary value problems with Gaussian white noise loads. https://arxiv.org/abs/1603.00661

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