SearcharxivSearch

arXiv · 1507.06102

Modulation Equation for SPDEs in unbounded domains with space-time white noise -- Linear Theory

Abstract

We study the approximation of SPDEs on the whole real line near a change of stability via modulation or amplitude equations, which acts as a replacement for the lack of random invariant manifolds on extended domains. Due to the unboundedness of the underlying domain a whole band of infinitely many eigenfunctions changes stability. Thus we expect not only a slow motion in time, but also a slow spatial modulation of the dominant modes, which is described by the modulation equation. As a first step towards a full theory of modulation equations for nonlinear SPDEs on unbounded domains, we focus, in the results presented here, on the linear theory for one particular example, the Swift-Hohenberg equation. These linear results are one of the key technical tools to carry over the deterministic approximation results to the stochastic case with additive forcing. One technical problem for establishing error estimates rises from the spatially translation invariant nature of space-time white noise on unbounded domains, which implies that at any time we can expect the error to be always very large somewhere in space.

Explore related subjects

Keep this discovery

BibTeXRIS

Luigi Amedeo Bianchi, Dirk Blömker. 2016-04-26. Modulation Equation for SPDEs in unbounded domains with space-time white noise -- Linear Theory. https://doi.org/10.1016/j.spa.2016.04.024

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