The key ideas

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, D^k. The shape of these elements can be arbitrary although we will mostly consider cases where they are d-dimensional simplexes.