Uniform estimate of an iterative method for elliptic problems with rapidly oscillating coefficients

Abstract

We study the iterative algorithm proposed by S. Armstrong, A. Hannukainen, T. Kuusi, J.-C. Mourrat to solve elliptic equations in divergence form with stochastic stationary coefficients. Such equations display rapidly oscillating coefficients and thus usually require very expensive numerical calculations, while this iterative method is comparatively easy to compute. In this article, we strengthen the estimate for the contraction factor achieved by one iteration of the algorithm. We obtain an estimate that holds uniformly over the initial function in the iteration, and which grows only logarithmically with the size of the domain.

arXiv comment32 pages, 3 figures

References in corpus (9)

• Generalized Multiscale Finite Element Methods (GMsFEM)
• An optimal error estimate in stochastic homogenization of discrete elliptic equations
• An optimal variance estimate in stochastic homogenization of discrete elliptic equations
• Polyharmonic homogenization, rough polyharmonic splines and sparse super-localization
• The additive structure of elliptic homogenization
• Lipschitz regularity for elliptic equations with random coefficients
• An optimal quantitative two-scale expansion in stochastic homogenization of discrete elliptic equations
• Mesoscopic higher regularity and subadditivity in elliptic homogenization
• An informal introduction to quantitative stochastic homogenization