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 Ω
. 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.
- Discontinuous Galerkin Method
- Riemann Solver
- Scalar Wave Equation
- Discontinuous Galerkin Scheme
- Internal Choice
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.