Premium
Discontinuous Galerkin methods
Author(s) -
Cockburn B.
Publication year - 2003
Publication title -
zamm ‐ journal of applied mathematics and mechanics / zeitschrift für angewandte mathematik und mechanik
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 51
eISSN - 1521-4001
pISSN - 0044-2267
DOI - 10.1002/zamm.200310088
Subject(s) - discontinuous galerkin method , parallelizable manifold , classification of discontinuities , mathematics , polygon mesh , galerkin method , diagonal , block (permutation group theory) , computer science , mathematical optimization , algorithm , finite element method , mathematical analysis , geometry , physics , thermodynamics
This paper is a short essay on discontinuous Galerkin methods intended for a very wide audience. We present the discontinuous Galerkin methods and describe and discuss their main features. Since the methods use completely discontinuous approximations, they produce mass matrices that are block‐diagonal. This renders the methods highly parallelizable when applied to hyperbolic problems. Another consequence of the use of discontinuous approximations is that these methods can easily handle irregular meshes with hanging nodes and approximations that have polynomials of different degrees in different elements. They are thus ideal for use with adaptive algorithms. Moreover, the methods are locally conservative (a property highly valued by the computational fluid dynamics community) and, in spite of providing discontinuous approximations, stable, and high‐order accurate. Even more, when applied to non‐linear hyperbolic problems, the discontinuous Galerkin methods are able to capture highly complex solutions presenting discontinuities with high resolution. In this paper, we concentrate on the exposition of the ideas behind the devising of these methods as well as on the mechanisms that allow them to perform so well in such a variety of problems.