Revision as of 10:00, 12 April 2017 edit Cyclotourist (talk \| contribs) 86 edits →Mimetic finite difference method and nodal mimetic finite difference method ← Previous edit		Revision as of 10:00, 12 April 2017 edit undo Cyclotourist (talk \| contribs) 86 edits →Discontinuous Galerkin method Next edit →
Line 134: === Discontinuous Galerkin method === The Discontinuous Galerkin method consists in approximating problems by a piecewise polynomial function, without requirements on the jumps from an element to the other. <ref>'''D. A. Di Pietro and A. Ern.''' Mathematical aspects of discontinuous Galerkin methods, volume 69 of Mathématiques & Applications (Berlin) [Mathematics & Applications]. Springer, Heidelberg, 2012.</ref>. It is plugged in the GDM framework by including in the discrete gradient a jump term, acting as the regularization of the gradient in the distribution sense. === Mimetic finite difference method and nodal mimetic finite difference method ===

Gradient discretisation method: Difference between revisions