Since the inception of discontinuous Galerkin (DG) methods for elliptic problems, there has existed a question of whether DG methods can be made more computationally efficient than continuous Galerkin (CG) methods. Fewer degrees of freedom, approximation properties for elliptic problems together with the number of optimization techniques, such as staticcondensation,availablewithinCGframeworkmadeitchallengingforDGmethodstobe
Sergey Yakovlev, David Moxey, Robert M. Kirby, Spe