This article describes an implementation of the Local Discontinuous Galerkin (LDG) method applied to a general elliptic boundary value problem in 2D. The implementation takes advantage of some intrinsic properties of the method, in particular, the use of non conforming meshes with an arbitrary but fixed number of hanging nodes and polynomial approximations with variable degree. A detailed description of efficient data structures yielding a fast assembly of the linear system in its mixed formulation is presented. This implementation can be used as a model for hp adaptive codes.

Full document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document
Back to Top

Document information

Published on 01/10/10
Accepted on 01/10/10
Submitted on 01/10/10

Volume 26, Issue 4, 2010
Licence: CC BY-NC-SA license

Document Score


Views 16
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?