Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
A local weighted discontinuous Galerkin gradient discretization method for solving elliptic equations is introduced. The local scheme is based on a coarse grid and successively improves the solution solving a sequence of local elliptic problems in high gradient regions. Using the gradient discretization framework we prove convergence of the scheme for linear and quasilinear equations under minimal regularity assumptions. The error due to artificial boundary conditions is also analyzed, shown to be of higher order and shown to depend only locally on the regularity of the solution. Numerical experiments illustrate our theoretical findings and the local method’s accuracy is compared against the non local approach.