Discontinuous Galerkin methods
2003-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Discontinuous Galerkin methods
Authors
Published Date
2003-05
Publisher
Type
Abstract
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.
Keywords
Description
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Cockburn, B.. (2003). Discontinuous Galerkin methods. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/3914.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.