An optimal variance estimate in stochastic homogenization of discrete elliptic equations
Abstract
We consider a discrete elliptic equation on the d-dimensional lattice Zd with random coefficients A of the simplest type: they are identically distributed and independent from edge to edge. On scales large w.r.t. the lattice spacing (i.e., unity), the solution operator is known to behave like the solution operator of a (continuous) elliptic equation with constant deterministic coefficients. This symmetric ``homogenized'' matrix A hom=a hom Id is characterized by · A hom=(+∇φ )· A(+∇φ) for any direction ∈ Rd, where the random field φ (the ``corrector'') is the unique solution of -∇*· A(+∇φ)=0 such that φ(0)=0, ∇φ is stationary and ∇φ=0, · denoting the ensemble average (or expectation). It is known (``by ergodicity'') that the above ensemble average of the energy density E=(+∇φ)· A(+∇φ), which is a stationary random field, can be recovered by a system average. We quantify this by proving that the variance of a spatial average of E on length scales L satisfies the optimal estimate, that is, var[Σ EηL] L-d, where the averaging function [i.e., ΣηL=1, supp(ηL)⊂\|x| L\] has to be smooth in the sense that |∇ηL| L-1-d. In two space dimensions (i.e., d=2), there is a logarithmic correction. This estimate is optimal since it shows that smooth averages of the energy density E decay in L as if E would be independent from edge to edge (which it is not for d>1). This result is of practical significance, since it allows to estimate the dominant error when numerically computing a hom.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.