An efficient algorithm for solving elliptic problems on percolation clusters - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

An efficient algorithm for solving elliptic problems on percolation clusters

Résumé

We present an efficient algorithm to solve elliptic Dirichlet problems defined on the cluster of $\mathbb{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.

Dates et versions

hal-03203936 , version 1 (21-04-2021)

Identifiants

Citer

Chenlin Gu. An efficient algorithm for solving elliptic problems on percolation clusters. 2021. ⟨hal-03203936⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More