Convergence of adaptive discontinuous Galerkin methods (corrected version of [Math. Comp. 87 (2018), no. 314, 2611–2640])

by   Christian Kreuzer, et al.

We develop a general convergence theory for adaptive discontinuous Galerkin methods for elliptic PDEs covering the popular SIPG, NIPG and LDG schemes as well as all practically relevant marking strategies. Another key feature of the presented result is, that it holds for penalty parameters only necessary for the standard analysis of the respective scheme. The analysis is based on a quasi interpolation into a newly developed limit space of the adaptively created non-conforming discrete spaces, which enables to generalise the basic convergence result for conforming adaptive finite element methods by Morin, Siebert, and Veeser [A basic convergence result for conforming adaptive finite elements, Math. Models Methods Appl. Sci., 2008, 18(5), 707–737].



There are no comments yet.


page 1

page 2

page 3

page 4


Convergence of an adaptive C^0-interior penalty Galerkin method for the biharmonic problem

We develop a basic convergence analysis for an adaptive C^0IPG method fo...

Implementation of hp-adaptive discontinuous finite element methods in Dune-Fem

In this paper we describe generic algorithms and data structures for the...

Convergence and optimality of an adaptive modified weak Galerkin finite element method

An adaptive modified weak Galerkin method (AmWG) for an elliptic problem...

Adaptive refinement with locally linearly independent LR B-splines: Theory and applications

In this paper we describe an adaptive refinement strategy for LR B-splin...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.