An efficient algorithm for solving elliptic problems on percolation clusters

07/31/2019

∙

by   Chenlin Gu, et al.

∙

0

∙

share

We present an efficient algorithm to solve elliptic Dirichlet problems defined on the cluster of Z^d supercritical Bernoulli percolation, as a generalization of the iterative method proposed by S. Armstrong, A. Hannukainen, T. Kuusi and J.-C. Mourrat. We also explore the two-scale expansion on the infinite cluster of percolation, and use it to give a rigorous analysis of the algorithm.