Issue |
ESAIM: M2AN
Volume 48, Number 3, May-June 2014
|
|
---|---|---|
Page(s) | 753 - 764 | |
DOI | https://doi.org/10.1051/m2an/2013119 | |
Published online | 01 April 2014 |
Convergence analysis of the lowest order weakly penalized adaptive discontinuous Galerkin methods
1 Department of Mathematics, Indian Institute of Science, 56002
Bangalore, India.
gudi@math.iisc.ernet.in
2 Division of Applied Mathematics, Brown University,
Providence, 02912 RI, USA.
JohnnyGuzman@brown.edu
Received:
11
September
2012
Revised:
3
June
2013
In this article, we prove convergence of the weakly penalized adaptive discontinuous Galerkin methods. Unlike other works, we derive the contraction property for various discontinuous Galerkin methods only assuming the stabilizing parameters are large enough to stabilize the method. A central idea in the analysis is to construct an auxiliary solution from the discontinuous Galerkin solution by a simple post processing. Based on the auxiliary solution, we define the adaptive algorithm which guides to the convergence of adaptive discontinuous Galerkin methods.
Mathematics Subject Classification: 65N30 / 65N15
Key words: Contraction / adaptive finite element / discontinuous Galerkin
© EDP Sciences, SMAI 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.