A priori and a posteriori error estimates for a virtual element spectral analysis for the elasticity equations

# A priori and a posteriori error estimates for a virtual element spectral analysis for the elasticity equations

David Mora Departamento de Matemática, Universidad del Bío-Bío, Casilla 5-C, Concepción, Chile. Centro de Investigación en Ingeniería Matemática (CIMA), Universidad de Concepción, Concepción, Chile. Gonzalo Rivera Departamento de Ciencias Exactas, Universidad de Los Lagos, Casilla 933, Osorno, Chile.
July 3, 2019July 3, 2019
July 3, 2019July 3, 2019
###### Abstract

We present a priori and a posteriori error analysis of a Virtual Element Method (VEM) to approximate the vibration frequencies and modes of an elastic solid. We analyze a variational formulation relying only on the solid displacement and propose an -conforming discretization by means of VEM. Under standard assumptions on the computational domain, we show that the resulting scheme provides a correct approximation of the spectrum and prove an optimal order error estimate for the eigenfunctions and a double order for the eigenvalues. Since, the VEM has the advantage of using general polygonal meshes, which allows implementing efficiently mesh refinement strategies, we also introduce a residual-type a posteriori error estimator and prove its reliability and efficiency. We use the corresponding error estimator to drive an adaptive scheme. Finally, we report the results of a couple of numerical tests that allow us to assess the performance of this approach.

###### keywords:
virtual element method, elasticity equations, eigenvalue problem, a priori error estimates, a posteriori error analysis, polygonal meshes
###### Msc:
65N25, 65N30, 70J30, 76M25.
journal:

## 1 Introduction

We analyze in this paper a Virtual Element Method for an eigenvalue problem arising in linear elasticity. The Virtual Element Method (VEM), recently introduced in BBCMMR2013 (); BBMR2014 (), is a generalization of the Finite Element Method, which is characterized by the capability of dealing with very general polygonal/polyhedral meshes. In recent years, the interest in numerical methods that can make use of general polygonal/polyhedral meshes for the numerical solution of partial differential equations has undergone a significant growth; this because of the high flexibility that this kind of meshes allow in the treatment of complex geometries. Among the large number of papers on this subject, we cite as a minimal sample BLMbook2014 (); CGH14 (); DPECMAME2015 (); DPECRAS2015 (); ST04 (); TPPM10 ().

Although VEM is very recent, it has been applied to a large number of problems; for instance, to Stokes, Brinkman, Cahn-Hilliard, plates bending, advection-diffusion, Helmholtz, parabolic, and hyperbolic problems have been introduced in ABMV2014 (); ABSV2016 (); BLV-M2AN (); BMR2016 (); BM12 (); BBBPS2016 (); CG16 (); CGS17 (); ChM-camwa (); PPR15 (); vacca1 (); V-m3as18 (); vacca2 (). Regarding VEM for linear and non-linear elasticity we mention BBM (); BLM2015 (); Paulino-VEM (); WRR2016 (), for spectral problems BMRR (); GVXX (); MRR2015 (); MRV (), whereas a posteriori error analysis for VEM have been developed in BMm2as (); BeBo2017 (); CGPS (); MRR2 ().

The numerical approximation of eigenvalue problems for partial differential equations is object of great interest from both, the practical and theoretical points of view, since they appear in many applications. We refer to Boffi (); BGG2012 () and the references therein for the state of the art in this subject area. In particular, this paper focus on the approximation by VEM of the vibration frequencies and modes of an elastic solid. One motivation for considering this problem is that it constitutes a stepping stone towards the more challenging goal of devising virtual element spectral approximations for coupled systems involving fluid-structure interaction, which arises in many engineering problems (see BGHRS2008 () for a thorough discussion on this topic). Among the existing techniques to solve this problem, various finite element methods have been proposed and analyzed in different frameworks for instance in the following references BO (); BHPR2001 (); Hernadez2009 (); MMR2013 ().

On the other hand, in numerical computations it is important to use adaptive mesh refinement strategies based on a posteriori error indicators. For instance, they guarantee achieving errors below a tolerance with a reasonable computer cost in presence of singular solutions. Several approaches have been considered to construct error estimators based on the residual equations (see ATO (); Verfurth () and the references therein). Due to the large flexibility of the meshes to which the VEM is applied, mesh adaptivity becomes an appealing feature since mesh refinement strategies can be implemented very efficiently. However, the design and analysis of a posteriori error bounds for the VEM is a challenging task. References BMm2as (); BeBo2017 (); CGPS (); MRR2 () are the only a posteriori error analyses for VEM currently available in the literature. In BMm2as (), a posteriori error bounds for the -conforming VEM for the two-dimensional Poisson problem are proposed. In BeBo2017 () a residual-based a posteriori error estimator for the VEM discretization of the Poisson problem with discontinuous diffusivity coefficient has been introduced and analyzed. Moreover, in CGPS (), a posteriori error bounds are introduced for the -conforming VEM for the discretization of second order linear elliptic reaction-convection-diffusion problems with non-constant coefficients in two and three dimensions. Finally, in MRR2 () a posteriori error analysis of a virtual element method for the Steklov eigenvalue problem has been developed.

The aim of this paper is to introduce and analyze an -VEM that applies to general polygonal meshes, made by possibly non-convex elements, for the two-dimensional eigenvalue problem for the linear elasticity equations. We begin with a variational formulation of the spectral problem relying only on the solid displacement. Then, we propose a discretization by means of VEM, which is based on equiv () in order to construct a proper -projection operator, which is used to approximate the bilinear form on the right hand side of the spectral problem. Then, we use the so-called Babuška–Osborn abstract spectral approximation theory (see BO ()) to deal with the continuous and discrete solutions operators which appear as the solution of the continuous and discrete source problems and whose spectra are related with the solutions of the spectral problem. Under rather mild assumptions on the polygonal meshes, we establish that the resulting VEM scheme provides a correct approximation of the spectrum and prove optimal-order error estimates for the eigenfunctions and a double order for the eigenvalues. The second goal of this paper is to introduce and analyze an a posteriori error estimator of residual type for the virtual element approximation of the eigenvalue problem. Since normal fluxes of the VEM solution are not computable, they will be replaced in the estimators by a proper projection. We prove that the error estimator is equivalent to the error and use the corresponding indicator to drive an adaptive scheme. In addition, in this work we address the issue of comparing the proposed a posteriori error estimator with the standard residual estimator for a finite element method.

The outline of this article is as follows: We introduce in Section 2 the variational formulation of the spectral problem, define a solution operator and establish its spectral characterization. In Section 3, we introduce the virtual element discrete formulation, describe the spectrum of a discrete solution operator and establish some auxiliary results. In Section 4, we prove that the numerical scheme provides a correct spectral approximation and establish optimal order error estimates for the eigenvalues and eigenfunctions using the standard theory for compact operators. In Section 5, we establish an error estimate for the eigenfunctions in the -norm, which will be useful in the a posteriori error analysis. In Section 6, we define the a posteriori error estimator and proved its reliability and efficiency. Finally, in Section 7, we report a set of numerical tests that allow us to assess the convergence properties of the method, to confirm that it is not polluted with spurious modes and to check that the experimental rates of convergence agree with the theoretical ones. Moreover, we have also made a comparison between the proposed estimator and the standard residual error estimator for a finite element method,

Throughout the article, is a generic Lipschitz bounded domain of with boundary , we will use standard notations for Sobolev spaces, norms and seminorms. Finally, we employ to denote a generic null vector and to denote generic constants independent of the discretization parameters , which may take different values at different occurrences.

## 2 The spectral problem

We assume that an isotropic and linearly elastic solid occupies a bounded and connected Lipschitz domain . We assume that the boundary of the solid admits a disjoint partition , the structure being fixed on and free of stress on . We denote by the outward unit normal vector to the boundary . Let us consider the eigenvalue problem for the linear elasticity equation in with mixed boundary conditions, written in the variational form:

###### Problem 1.

Find , , such that

 ∫Ωσ(w):ε(v)=λ∫Ωϱw⋅v∀v∈V,

where is the solid displacement and is the corresponding vibration frequency; is the density of the material, which we assume a strictly positive constant. The constitutive equation relating the Cauchy stress tensor and the displacement field is given by

 σ(w)=Cε(w) in Ω,

with being the standard strain tensor and the elasticity operator, which we assume given by Hooke’s law, i.e.,

 Cτ:=2μSτ+λStr(τ)I,

where and are the Lamé coefficients, which we assume constant.

We introduce the following bounded bilinear forms:

 a(w,v) :=∫ΩCε(w):ε(v),w,v∈V, b(w,v) :=∫Ωϱw⋅v,w,v∈V.

Then, the eigenvalue problem above can be rewritten as follows:

###### Problem 2.

Find , , such that

 a(w,v)=λb(w,v)∀v∈V.

It is easy to check (as a consequence of the Korn inequality) that for all . Then, the bilinear form is -elliptic.

Next, we define the corresponding solution operator:

 T:V ⟶V, f ⟼Tf:=u,

where is the unique solution of the following source problem:

 a(u,v)=b(f,v)∀v∈V. (2.1)

Thus, the linear operator is well defined and bounded. Notice that solves Problem 2 if and only if is an eigenpair of , i.e, if and only if

 Tw=μw with μ:=1λ.

Moreover, it is easy to check that is self-adjoint with respect to the inner product in .

The following is an additional regularity result for the solution of problem (2.1) and consequently, for the eigenfunctions of .

###### Lemma 2.1.

There exists such that the following results hold:

• for all and for all , the solution of problem (2.1) satisfies with and there exists such that

 ∥u∥1+r1,Ω≤C∥f∥0,Ω.
• if is an eigenfunction of Problem 2 with eigenvalue , for all , and there exists (depending on ) such that

 ∥w∥1+r,Ω≤C∥w∥0,Ω.
###### Proof.

The proof follows from the regularity result for the classical elasticity problem (cf. G2 ()). ∎

Hence, because of the compact inclusion , is a compact operator. Therefore, we have the following spectral characterization result.

###### Theorem 2.1.

The spectrum of satisfies , where is a sequence of real positive eigenvalues which converges to . The multiplicity of each eigenvalue is finite and their corresponding eigenspaces lie in .

## 3 Virtual elements discretization

We begin this section, by recalling the mesh construction and the shape regularity assumptions to introduce the discrete virtual element space. Then, we will introduce a virtual element discretization of Problem 2 and provide a spectral characterization of the resulting discrete eigenvalue problem. Let be a sequence of decompositions of into polygons . Let denote the diameter of the element and . In what follows, we denote by the number of vertices of , and by a generic edge of .

For the analysis, we will make the following assumptions as in BMRR (): there exists a positive real number such that, for every and every ,

• the ratio between the shortest edge and the diameter of is larger than ;

• is star-shaped with respect to every point of a ball of radius .

Moreover, for any subset and nonnegative integer , we indicate by the space of polynomials of degree up to defined on .

To continue the construction of the discrete scheme, we need some preliminary definitions. First, we split the bilinear forms and , introduced in the previous section as follows:

 a(u,v) =

with

 aE(u,v) := ∫ECε(u):ε(v)∀u,v∈[H1(Ω)]2, bE(u,v) := ∫Eϱu⋅v∀u,v∈[H1(Ω)]2.

Now, we consider a simple polygon and, for , we define

 B∂E:={vh∈[C0(∂E)]2:vh|ℓ∈[Pk(ℓ)]2  ∀ℓ⊂∂E}.

We then consider the following finite dimensional space:

 WEh:={vh∈[H1(E)]2:Δvh∈[Pk(E)]2andvh|∂E∈B∂E}.

The following set of linear operators are well defined for all :

• : The (vector) values of at the vertices.

• , for : The edge moments for on each edge of .

• , for : The internal moments for on each element .

Now we define the projector for each as the solution of

 (3.1)

where for all ,

 ⟨⟨rh,sh⟩⟩:=1NENE∑i=1rh(vi)⋅sh(vi),vi= vertices of E,1≤i≤NE.

We note that the second equation in (3.1) is needed for the problem to be well-posed.

Now, we introduce our local virtual space:

where the space denote the polynomials in that are orthogonal to . We observe that, since , the operator is well defined on and computable only on the basis of the output values of the operators in , and . We note that it can be proved, see equiv (); BBCMMR2013 (); BBMRm3as2016 () that the set of linear operators , and constitutes a set of degrees of freedom for the local virtual space . Moreover, it is easy to check that . This will guarantee the good approximation properties for the space.

Additionally, we have that the standard -projector operator can be computed from the set of degrees freedom. In fact, for all , the function is defined by:

 ∫Ep⋅ΠE0vh=⎧⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎨⎪ ⎪ ⎪ ⎪ ⎪ ⎪⎩∫Ep⋅ΠEεvh,∀p∈[Pk(E)]2/[Pk−2(E)]2,∫Ep⋅vh,∀p∈[Pk−2(E)]2.

We can now present the global virtual space: for every decomposition of into simple polygons .

 Vh:={vh∈V:vh|E∈VEh,∀E∈Th}.

In agreement with the local choice of the degrees of freedom, in we choose the following degrees of freedom:

• : the (vector) values of at the vertices of .

• , for : The edge moments on each edge .

• , for : The internal moments on each element .

On the other hand, let and be symmetric positive definite bilinear forms chosen as to satisfy

 c0aE(vh,vh)≤SEε(vh,vh)≤c1aE(vh,vh)∀vh∈VEh  with ΠEεvh=0, (3.2) ~c0bE(vh,vh)≤SE0(vh,vh)≤~c1bE(vh,vh)∀vh∈VEh, (3.3)

for some positive constants , , and depending only on the constant that appears in assumptions and . Then, we introduce on each element the local (and computable) bilinear forms

 aEh(uh,vh):=aE(ΠEεuh,ΠEεvh)+SEε(uh−ΠEεuh,vh−ΠEεvh)uh,vh∈VEh, (3.4) bEh(uh,vh):=bE(ΠE0uh,ΠE0vh)+SE0(uh−ΠE0uh,vh−ΠE0vh)uh,vh∈VEh. (3.5)

Now, we define in a natural way

 ah(uh,vh)=∑E∈ThaEh(uh,vh),bh(uh,vh):=∑E∈ThbEh(uh,vh)uh,vh∈Vh.

The construction of and guarantees the usual consistency and stability properties of VEM, as noted in the proposition below. Since the proof is simple and follows standard arguments in the Virtual Element literature, it is omitted (see BBCMMR2013 ()).

###### Proposition 3.1.

The local bilinear forms and on each element satisfy

• Consistency: for all and for all we have that

 aEh(p,vh) =aE(p,vh)∀p∈[Pk(E)]2,∀vh∈VEh; (3.6) bEh(p,vh) =bE(p,vh)∀p∈[Pk(E)]2,∀vh∈VEh. (3.7)
• Stability: there exist positive constants , , and , independent of and , such that

 α∗aE(vh,vh) ≤aEh(vh,vh)≤α∗aE(vh,vh)∀vh∈VEh,∀E∈Th, (3.8) β∗bE(vh,vh) ≤bEh(vh,vh)≤β∗bE(vh,vh)∀vh∈VEh,∀E∈Th. (3.9)

Now, we are in a position to write the virtual element discretization of Problem 2.

###### Problem 3.

Find , , such that

 ah(wh,vh)=λhbh(wh,vh)∀vh∈Vh.

We observe that by virtue of (3.8), the bilinear form is bounded. Moreover, as is shown in the following lemma, it is also uniformly elliptic.

###### Lemma 3.1.

There exists a constant , independent of , such that

 ah(vh,vh)≥β∥vh∥21,Ω∀vh∈Vh.
###### Proof.

Thanks to (3.8), it is easy to check that the above inequality holds with . ∎

The next step is to introduce the discrete version of operator :

 Th:Vh ⟶Vh, fh ⟼Thfh:=uh,

where is the solution of the corresponding discrete source problem:

 ah(uh,vh)=bh(fh,vh)∀vh∈Vh. (3.10)

We deduce from Lemma 3.1, (3.8)–(3.9) and the Lax-Milgram Theorem, that the linear operator is well defined and bounded uniformly with respect to .

Once more, as in the continuous case, solves Problem 3 if and only if is an eigenpair of , i.e, if and only if

 Thuh=μhuh with μh:=1λh.

Moreover, it is easy to check that is self-adjoint with respect to and .

As a consequence, we have the following spectral characterization of the discrete solution operator.

###### Theorem 3.1.

The spectrum of consists of eigenvalues repeated according to their respective multiplicities. All of them are real and positive.

## 4 Spectral approximation and error estimates

To prove that provides a correct spectral approximation of , we will resort to the classical theory for compact operators (see BO ()). With this aim, we recall the following approximation result which is derived by interpolation between Sobolev spaces (see for instance (GR, , Theorem I.1.4) from the analogous result for integer values of . In its turn, the result for integer values is stated in (BBCMMR2013, , Proposition 4.2) and follows from the classical Scott-Dupont theory (see BS-2008 ()):

###### Lemma 4.1.

Assume and are satisfied. There exists a constant , such that for every with , there exists , such that

 ∥v−vΠ∥0,E+hE⏐v−vΠ⏐1,E≤Ch1+tE|v|1+t,E.

The classical theory for compact operators, is based on the convergence in norm of to as . However, the operator is not well defined for any , since the definition of bilinear form in (3.3) needs the degrees of freedom and in particular the pointwise values of . To circumvent this drawback, we introduce the projector with range , which is defined by the relation

 b(Phu−u,vh)=0∀vh∈Vh. (4.1)

In our case, the bilinear form correspond to the inner product. Thus, . Moreover,

 ∥u−Phu∥0,Ω=infvh∈Vh∥u−vh∥0,Ω. (4.2)

For the analysis we introduce the following broken seminorm:

 |v|21,h,Ω:=∑E∈Th|v|21,E, (4.3)

which is well defined for every such that for all polygon .

Now, we define . Notice that and the eigenfunctions of and coincide. Furthermore, we have the following result.

###### Lemma 4.2.

There exists such that, for all , if and , then

 ∥(T−ˆTh)f∥1,Ω ≤C(h(||f−fI∥0,Ω+∥f−fπ∥0,Ω)+∥u−uI∥1,Ω+|u−uπ|1,h,Ω),

for all , for all such that and for all such that .

###### Proof.

Let , for we have that

 ∥(T−ˆTh)f∥1,Ω≤∥u−uI∥1,Ω+∥uI−uh∥1,Ω. (4.4)

Now, if we define , thanks to Lemma 3.1, the definition of (cf (3.4)) and those of and , we have

 β∥vh∥21,Ω ≤ah(vh,vh)=ah(uh,vh)−ah(uI,vh)=bh(Phf,wh)−∑E∈ThaEh(uI,vh) =bh(Phf,vh)−b(f,vh)T1−∑E∈Th[aEh(uI−uπ,vh)+aE(uπ−u,vh)]T2,

where we have used the consistency property (3.6) to derive the last equality. We now bound each term , with a constant .

The term can be bounded as follows: Let such that Lemma 4.1 holds true, then by (4.1), we have

 T1 ≤C⎛⎝∑E∈Th∥Phf−fπ∥20,E⎞⎠1/2⎛⎝∑E∈Th∥vh−vπh∥20,E⎞⎠1/2 ≤C∥Phf−fπ∥0,Ω⎛⎝∑E∈Thh2E|vh|21,E⎞⎠1/2 ≤Ch(∥Phf−f∥0,Ω+∥f−fπ∥0,Ω)||vh||1,Ω ≤Ch(||f−fI∥0,Ω+∥f−fπ∥0,Ω)||vh||1,Ω

where we have used the definitions of and , the consistency and stability properties (3.7) and (3.9), respectively, together with Cauchy-Schwarz inequality, Lemma 4.1 and (4.2).

To bound , we first use the stability property (3.8), Cauchy-Schwarz inequality again and adding and subtracting to obtain

 T2 ≤C∑E∈Th(|u−uI|1,E+2|u−uπ|1,E)|vh|1,E.

Therefore, by combining the above bounds, we obtain

 β∥vh∥1,Ω ≤C(h||f−fI∥0,Ω+h∥f−fπ∥0,Ω+∥u−uI∥1,Ω+|u−uπ|1,h,Ω).

Hence, the proof follows from the above estimate and (4.4). ∎

The next step is to find appropriate term that can be used in the above lemma. Thus, we have the following result.

###### Lemma 4.3.

Assume and are satisfied. Then, for every with , there exists and a constant , such that

 ∥v−vI∥0,E+hE⏐v−vI⏐1,E≤Ch1+tE|v|1+t,E.
###### Proof.

The proof is identical to that of Theorem 11 from CGPS () (in the 2D case), but using the following estimate

 ∥v−vc∥0,T+h|v−vc|1,T≤ˆCClemh1+t∥v∥1+t,˜T,

instead of estimate (4.2) of Theorem 11 from CGPS (), where is an adequate Clément interpolant of degree of (see (MRR2015, , Proposition 4.2)). ∎

Now, we are in a position to conclude that converges in norm to as goes to zero.

###### Corollary 4.1.

There exist independent of and (as in Lemma 2.1(i)), such that

 ∥(T−ˆTh)f∥1,Ω≤Chr1∥f∥1,Ω∀f∈V.
###### Proof.

The result follows from Lemmas 4.14.3 and Lemma 2.1. ∎

As a direct consequence of Corollary 4.1, standard results about spectral approximation (see K (), for instance) show that isolated parts of are approximated by isolated parts of and therefore by . More precisely, let be an isolated eigenvalue of with multiplicity and let be its associated eigenspace. Then, there exist eigenvalues of (repeated according to their respective multiplicities) which converge to . Let be the direct sum of their corresponding associated eigenspaces.

We recall the definition of the gap between two closed subspaces and of :

where

 δ(X,Y):=supx∈X: ∥x∥1,Ω=1δ(x,Y),with δ(x,Y):=infy∈Y∥x−y∥1,Ω.

The following error estimates for the approximation of eigenvalues and eigenfunctions hold true.

###### Theorem 4.1.

There exists a strictly positive constant such that

 ˆδ(E,Eh) ≤Cγh, ∣∣μ−μ(i)h∣∣ ≤Cγh,i=1,…,m,

where

 γh:=supf∈E: ∥f∥1,Ω=1∥∥(T−ˆTh)f∥∥1,Ω.
###### Proof.

As a consequence of Corollary 4.1, converges in norm to as goes to zero. Then, the proof follows as a direct consequence of Theorems 7.1 and 7.3 from BO (). ∎

The theorem above yields error estimates depending on . The next step is to show an optimal-order estimate for this term.

###### Theorem 4.2.

There exist and , independent of , such that

 ∥(T−ˆTh)f∥1,Ω≤Chmin{r,k}∥f∥1,Ω∀f∈E,

and consequently,

###### Proof.

The proof is identical to that of Corollary 4.1, but using now the additional regularity from Lemma 2.1(ii). ∎

The error estimate for the eigenvalue of leads to an analogous estimate for the approximation of the eigenvalue of Problem 2 by means of the discrete eigenvalues , , of Problem 3. However, the order of convergence in Theorem 4.1 is not optimal for and, hence, not optimal for either. Our next goal is to improve this order.

###### Theorem 4.3.

There exists independent of such that

 ∣∣λ−λ(i)h∣∣≤Ch2min{r,k},i=1,…,m.
###### Proof.

Let be an eigenfunction corresponding to one of the eigenvalues with . According to Theorem 4.1, there exists eigenpair of Problem 2 such that

 ∥w−wh∥1,Ω≤Cγh. (4.5)

From the symmetry of the bilinear forms and the facts that for all (cf. Problem 2) and for all (cf. Problem 3), we have

 a(w−wh,w−wh)−λb(w−wh,w−wh) =a(wh,wh)−λb(wh,wh) =a(wh,wh)−ah(wh,wh)+λ(i)h[bh(wh,wh)−b(wh,wh)] +(λ(i)h−λ)b(wh,wh),

thus, we obtain the following identity:

 (λ(i)h−λ)b(wh,wh) =a(w−wh,w−wh)−λb(w−wh,w−wh) +ah(wh,wh)−a(wh,wh)+λ(i)h[b(wh,wh)−bh(wh,wh)]. (4.6)

The next step is to bound each term on the right hand side above. The first and the second ones are easily bounded using the Cauchy-Schwarz inequality and (4.5):

 |a(w−wh,w−wh)−λb(w−wh,w−wh)| ≤C∥w−wh∥21,Ω≤Cγ2h. (4.7)

For the third term, let such that . From the definition of (cf (3.4)), adding and subtracting and using the consistency property (cf (3.6)) we obtain

 |ah(wh,wh)−a(wh,wh)| =∑E∈Th[aEh(wh,wh)−aE(wh,wh)] ≤C∑E∈Th|wh−wπ|21,E≤C∑E∈Th(|w−wh|21,E+|w−wπ|21,E).

Then, from the last inequality, Lemma 4.1 and (4.5),we obtain

 |ah(wh,wh)−a(wh,wh)|≤Cγ2h. (4.8)

For the fourth term, repeating similar arguments to the previous case, but using the consistency property (cf (3.7)) we have

 |bh(wh,wh)−b(wh,wh)| ≤C∑E∈Th∥wh−wπ∥20,E≤C∑E∈Th(∥w−wh∥20,E+∥w−wπ∥20,E).

Then, from the last inequality, Lemma 4.1 and (4.5), we have

 |bh(wh,wh)−b(wh,wh)| ≤Cγ2h. (4.9)

On the other hand, from the Korn’s inequality and Lemma 3.1, together with the fact that as goes to zero, we have that