An introduction to the gradient discretisation method

Abstract

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.