An Introduction to the Gradient Discretisation Method
We show that three classical examples of schemes for the approximation of linear elliptic problems can be cast in a common framework, called the gradient discretisation method (GDM). An error estimate is then obtained by the extension to this framework of the second Strang lemma, which is completed by a second inequality showing that the conditions which are sufficient for the convergence of the method are also necessary.
- 2.P. Ciarlet, The Finite Element Method, Part I, ed. by P.G. Ciarlet, J.-L. Lions. Handbook of Numerical Analysis, vol. III (North-Holland, Amsterdam, 1991)Google Scholar
- 4.J. Droniou, R. Eymard, T. Gallouët, C. Guichard, R. Herbin, The Gradient Discretisation Method. Mathématiques et Applications (Springer, Berlin, 2017)Google Scholar
- 5.R. Eymard, T. Gallouët, R. Herbin, Finite volume methods, in Techniques of Scientific Computing, Part III, ed. by P.G. Ciarlet, J.-L. Lions. Handbook of Numerical Analysis, vol. VII (North-Holland, Amsterdam, 2000), pp. 713–1020Google Scholar
- 6.R. Eymard, C. Guichard, R. Herbin, Small-stencil 3d schemes for diffusive flows in porous media. M2AN 46, 265–290 (2012)Google Scholar
- 7.G. Strang, Variational crimes in the finite element method, in The Mathematical Foundations of the Finite Element Method with Applications to Partial Differential Equations (Proceedings of a Symposium, University of Maryland, Baltimore, MD, 1972) (Academic, New York, 1972), pp. 689–710Google Scholar