While we initially strive to stay away from complex notation a few fundamentals are needed. We consider problems posed on the physical domain Ω with boundary ∂Ω and assume that this domain is well approximated by the computational domain Ω h . This is a space filling triangulation composed of a collection of K geometry-conforming nonoverlapping elements, Dk. The shape of these elements can be arbitrary although we will mostly consider cases where they are d-dimensional simplexes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). The key ideas. In: Nodal Discontinuous Galerkin Methods. Texts in Applied Mathematics, vol 54. Springer, New York, NY. https://doi.org/10.1007/978-0-387-72067-8_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-72067-8_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-72065-4
Online ISBN: 978-0-387-72067-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)