DeepAI AI Chat
Log In Sign Up

An efficient algorithm for solving elliptic problems on percolation clusters

07/31/2019
by   Chenlin Gu, et al.
Cole Normale Suprieure
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/17/2020

A Mann iterative regularization method for elliptic Cauchy problems

We investigate the Cauchy problem for linear elliptic operators with C^∞...
01/18/2023

Dirichlet-Neumann learning algorithm for solving elliptic interface problems

Non-overlapping domain decomposition methods are natural for solving int...
11/29/2020

An iterative method for solving elliptic Cauchy problems

We investigate the Cauchy problem for elliptic operators with C^∞-coeffi...
11/04/2016

QBF Solving by Counterexample-guided Expansion

We introduce a novel generalization of Counterexample-Guided Inductive S...
04/19/2021

Regularity for quasilinear vectorial elliptic systems through an iterative scheme with numerical applications

We consider an iterative procedure to solve quasilinear elliptic systems...
09/06/2013

Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

We provide an elementary proof of a simple, efficient algorithm for comp...
09/07/2020

A Fast Parametric Ellipse Algorithm

This paper describes a 2-D graphics algorithm that uses shifts and adds ...