Skip to content
Publicly Available Published by De Gruyter June 14, 2022

Some Estimates for Virtual Element Methods in Three Dimensions

  • Jianguo Huang ORCID logo EMAIL logo and Yue Yu

Abstract

Some estimates on virtual element methods (VEMs), including inverse inequalities, norm equivalence, and interpolation error estimates, are developed for star-shaped polyhedral meshes whose faces admit virtual regular and quasi-uniform triangulations. This mesh regularity covers the usual ones used for theoretical analysis of VEMs, and the proofs are carried out in a straightforward way.

MSC 2010: 65N30; 65N15

1 Introduction

The virtual element method (VEM) was first proposed and analyzed in [2] and has been further studied in [1, 4]. It can be viewed as a generalization of the standard finite element method, allowing for polytopal meshes and suitable for handling partial differential equations on complex geometric domains or the ones associated with high-regularity admissible spaces [12, 14, 15].

Inverse inequalities and the norm equivalence between the continuous and discrete norms of a virtual element function play fundamental roles in VEM analysis. Such results were stated, implied or analyzed in [2, 6, 8] for star-shaped polygonal meshes and in [12, 14] for meshes admitting a virtual quasi-uniform and regular triangulation in two dimensions. The construction of conforming VEMs for three- and arbitrarily-dimensional problems can be found in [5, 3, 15]; a delicate analysis for meshes with small edges or faces is established in [10].

Inspired by the assumption of virtual triangulations in [11, 12], we are interested in establishing the above fundamental estimates for three-dimensional VEMs, under the following assumptions on a family of meshes 𝒯 h :

  1. Each polyhedron K is star-shaped with a ball B K contained in K and the aspect ratio h K / ρ K is uniformly bounded, where h K is the diameter of K and ρ K is the radius of B K .

  2. For each face F K , there exists a “virtual triangulation” 𝒯 F of F such that 𝒯 F is uniformly shape regular and quasi-uniform. The corresponding mesh size of 𝒯 F is uniformly proportional to h K . Each edge of F is a side of a certain triangle in 𝒯 F .

The outcome of our study in this paper is twofold. First, we all know that the spatial domain for a real-world mathematical physical problem is mostly three-dimensional, so it is valuable to develop those fundamental estimates in this case independently in a straightforward way without resorting to subtle recursive arguments as in [15]. In fact, our analysis relies only on a function decomposition technique of [14], the arguments in [12], and some existing estimates in [10]. Second, the above conditions are different from the ones in [15] in three dimensions.

We end this section by introducing some notation and symbols. For a bounded Lipschitz domain D, the symbol ( , ) D denotes the L 2 -inner product on D, 0 , D denotes the L 2 -norm, and | | s , D is the H s ( D ) -seminorm. For all integers k 0 , k ( D ) is the set of polynomials of total degree less than or equal to k on D. Moreover, for any two quantities a and b, “ a b ” indicates “ a C b ” with the hidden constant C independent of the mesh size h K , and “ a b ” abbreviates “ a b a ”.

2 Virtual Element Spaces

2.1 The Virtual Element Spaces on Polygonal Faces

Let F be a polygon embedded in 3 , which is treated as a two-dimensional submanifold using local coordinates ( s , t ) on the face as shown in Figure 1. The boundary of the polygon is oriented in a cyclic order as a 1 , , a n . Let e = a 1 a 2 ¯ be the first edge, and let n e and t e be the normal vector and tangential vector, respectively. Then we can define a local coordinate system with a 1 being the original point by using these two vectors. In what follows, we use the subscript “F” to indicate the locally defined symbols.

The virtual element method for two-dimensional problems was first introduced and analyzed in [2], where the virtual element spaces are defined by

V k ( F ) = { v H 1 ( F ) C 0 ( F ) : Δ F v k - 2 ( F ) , v | e k ( e ) , e F } .

To present the degrees of freedom (DoFs), we introduce a scaled monomial 𝕄 r ( D ) on a d-dimensional domain D:

𝕄 r ( D ) := { ( 𝐱 - 𝐱 D h D ) 𝐬 : | 𝐬 | r } ,

where h D is the diameter of D, 𝐱 D is the centroid of D, and r is a non-negative integer. For the multi-index 𝐬 d , we follow the usual notation

𝐱 𝐬 = x 1 s 1 x d s d , | 𝐬 | = s 1 + + s d .

Conventionally, 𝕄 r ( D ) = { 0 } for r - 1 . For example, with the help of the local coordinates we can represent the scaled monomials of degree r 1 as

m F , 1 = 1 , m F , 2 = s - s F h F , m F , 3 = t - t F h F ,

where ( s F , t F ) and h F are the barycenter and the diameter of F, respectively.

The local dual space is

𝒳 k , k - 2 ( F ) = span { χ a , χ e k - 2 , χ F k - 2 } ,

where the DoFs are the functional vectors as follows:

  1. χ a are the values at the vertices of F:

    χ a i ( v ) = v ( a i ) , a i  is a vertex of  F .

  2. χ e k - 2 are the moments on edges of F up to degree k - 2 :

    χ e ( v ) = | e | - 1 ( m e , v ) e , m e 𝕄 k - 2 ( e ) , e F .

  3. χ F k - 2 are the moments on F up to degree k - 2 :

    χ F ( v ) = | F | - 1 ( m F , v ) K , m F 𝕄 k - 2 ( F ) .

Figure 1 
                  Local coordinate system of a face or polygon embedded in 
                        
                           
                              
                                 ℝ
                                 3
                              
                           
                           
                           {\mathbb{R}^{3}}
                        
                     .
Figure 1

Local coordinate system of a face or polygon embedded in 3 .

To ensure the computability of the L 2 projector Π k , F 0 , we first introduce the lifting virtual element space defined by

V ~ k ( F ) = { v H 1 ( F ) C 0 ( F ) : Δ F v k ( F ) , v | e k ( e ) , e F }

in which the functions are uniquely determined by the previous DoFs together with the additional moments on F:

χ F ( v ) = | F | - 1 ( m F , v ) F , m F 𝕄 k ( F ) 𝕄 k - 2 ( F ) .

To remove the redundant DoFs of the third type, Ahmad, Alsaedi, Brezzi, Marini and Russo [1] modified the lifting virtual element space to a local enhancement space

W k ( F ) = { v V ~ k ( F ) : ( v , m F ) F = ( Π k , F v , m F ) F , m F 𝕄 k ( F ) 𝕄 k - 2 ( F ) } ,

where for a VEM function v V ~ k ( F ) the elliptic projection Π k , F v is the solution of the following problem:

(2.1) { ( F Π k , F v , F p ) F = ( F v , F p ) F for all  p k ( F ) , P 0 ( Π k , F v ) = P 0 ( v ) := { F v d s for  k = 1 , F v d σ for  k 2 .

An integration by parts shows that the redundant moments are not involved in the computation of the right-hand side of the first equation in (2.1).

2.2 The Virtual Element Spaces on Polyhedral Elements

The three-dimensional virtual element spaces can be introduced as the two-dimensional case recursively, where the boundary spaces are given by the virtual element spaces on polygonal faces instead of the polynomial spaces [5]. Let K be a polyhedral element. We consider the first virtual element space

V k ( K ) = { v H 1 ( K ) C 0 ( K ) : Δ v k - 2 ( K ) , v | F W k ( F ) , F K } ,

with the DoFs given as follows:

  1. χ p are the values at the vertices of K:

    χ p i ( v ) = v ( p i ) , p i  is a vertex of  K .

  2. χ e k - 2 are the moments on edges of K up to degree k - 2 :

    χ e ( v ) = | e | - 1 ( m e , v ) e , m e 𝕄 k - 2 ( e ) , e F , F K .

  3. χ F k - 2 are the moments on faces of K up to degree k - 2 :

    χ F ( v ) = | F | - 1 ( m F , v ) F , m F 𝕄 k - 2 ( F ) , F K .

  4. χ K k - 2 are the moments on K up to degree k - 2 :

    χ K ( v ) = | K | - 1 ( m K , v ) K , m K 𝕄 k - 2 ( K ) .

To ensure the computability of the L 2 projector Π k 0 , one can also introduce the enhanced space (see [5])

(2.2) W k ( K ) = { w V ~ k ( K ) : ( w - Π k w , m K ) K = 0 , m K 𝕄 k ( K ) 𝕄 k - 2 ( K ) } ,

where the lifting space is

V ~ k ( K ) = { w H 1 ( K ) C 0 ( K ) : Δ w k ( K ) , w | F W k ( F ) , F K } ,

and the elliptic projection Π k w for w V ~ k ( K ) is defined by

(2.3) { ( Π k w , p ) K = ( w , p ) K for all  p k ( K ) , P 0 ( Π k w ) = P 0 ( w ) := { K w d σ for  k = 1 , K w d x for  k 2 .

Similarly, the integration by parts shows that the elliptic projection is uniquely determined by the previous DoFs.

3 Some Basic Estimates in VEM Analysis

In this section, we always assume that the polyhedron K under discussion satisfies assumptions (A1) and (A2). Thus, according to the standard Dupont–Scott theory [9], for all v H ( K ) ( 0 k ), there exists a certain q - 1 ( K ) such that

(3.1) | v - q | m , K h K - m | v | , K , m .

The following are the well-known scaled Poincaré–Friedrichs inequalities in three dimensions [7]:

v 0 , K h K | v | 1 , K + h K - 3 / 2 | K v d x | for all  v H 1 ( K ) ,
v 0 , K h K | v | 1 , K + h K - 1 / 2 | K v d σ | for all  v H 1 ( K ) .

We collect some existing results for later requirement.

Lemma 3.1 ([10]).

We have the following results:

  1. There holds

    (3.2) v 0 , K ε h K 1 / 2 | v | 1 , K + C ( ε ) h K - 1 / 2 v 0 , K for all  v H 1 ( K ) ,

    where ε > 0 is any given constant.

  2. There holds the scaled trace estimate

    (3.3) | v | 1 / 2 , K h K 1 / 2 | v | 1 , K for all  v H 1 ( K ) .

In addition, for a function v H 1 / 2 ( K ) , there exists a function v ~ H 1 ( K ) such that

(3.4) v ~ | K = v | K 𝑎𝑛𝑑 | v ~ | 1 , K | v | 1 / 2 , K .

Lemma 3.2 ([12]).

Let g = α g α m α be a polynomial on K with coefficient vector g = ( g α ) . Then the following norm equivalence holds:

h K 3 / 2 𝐠 2 g 0 , K .

Lemma 3.3 ([14]).

For all v H 1 ( K ) with Δ v P k - 2 ( K ) , there exists a polynomial p P k ( K ) such that Δ p = Δ v and there hold the estimates

| p | 1 , K h K Δ v 0 , K | v | 1 , K , | p | 1 , K h K - 1 v 0 , K , p 0 , K v 0 , K .

We mention that the last two lemmas are given in two dimensions in the respective references, but their proofs can be adapted and show the results in three dimensions.

4 Main Results

In this section, we always assume that the polyhedron K under discussion satisfies assumptions (A1) and (A2).

4.1 Inverse Inequalities

Based on Lemma 3.3, we are able to develop inverse inequalities for the three-dimensional conforming VEMs.

Theorem 4.1.

There holds

| v | 1 , K h K - 1 v 0 , K for all  v V k ( K ) W k ( K ) .

Proof.

It suffices to prove the result for v V k ( K ) . Let p k ( K ) be the polynomial given by Lemma 3.3 admitting the estimate | p | 1 , K h K - 1 v 0 , K . Then, in view of the function decomposition v = ( v - p ) + p and the triangle inequality, we have to show that the estimate | v - p | 1 , K h K - 1 v - p 0 , K holds. In other words, without loss of generality, we can additionally assume that Δ v = 0 in K.

Let v ~ be the function given in the inverse trace inequality in (3.4). Then the principle of energy minimization for harmonic functions and (3.3) yield

| v | 1 , K | v ~ | 1 , K | v | 1 / 2 , K h K 1 / 2 | v | 1 , K .

For F K , by the inverse inequalities for two-dimensional VEM functions [12], we have that

| v | 1 , F h F - 1 v 0 , F ,

which along with the previous inequality and the scaled trace inequality (3.2) implies

| v | 1 , K h K - 1 / 2 v 0 , K ε | v | 1 , K + C ( ε ) h K - 1 v 0 , K .

The proof is completed by absorbing ε | v | 1 , K . ∎

4.2 Norm Equivalence

With the help of the inverse inequalities, we can prove the following norm equivalence as in [12, 14].

Theorem 4.2.

For all v V k ( K ) W k ( K ) , there hold

(4.1) h K - 1 v 0 , K h K 1 / 2 𝝌 ( v ) 2 ,
(4.2) | v - Π k v | 1 , K h K 1 / 2 𝝌 ( v - Π k v ) 2 ,

where 𝛘 ( v ) means the DoF vector of a VEM function v on K.

Proof.

In what follows, we assume that v V k ( K ) . The proof for v W k ( K ) can be carried out in the same way as in [12, Corollary 4.6].

Step 1. We first consider the lower bound of (4.1):

h K 1 / 2 𝝌 ( v ) 2 h K - 1 v 0 , K for all  v V k ( K ) .

The DoFs are grouped into two categories: 𝝌 K ( ) are DoFs associated with the boundary of K and 𝝌 K ( ) are moments in K. The restriction of v to the boundary is a two-dimensional virtual element function on each face of K . According to the norm equivalence for two-dimensional VEM functions [12], we have, for all F K ,

(4.3) 𝝌 F ( v ) 2 h F - 1 v 0 , F ,

where 𝝌 F is the DoF vector associated with the boundary face F of K. Applying the trace inequality (3.2) and the inverse inequality in Theorem 4.1 results in

h F 1 / 2 𝝌 F ( v ) 2 h F - 1 / 2 v 0 , F h F - 1 / 2 ( h K 1 / 2 | v | 1 , K + h K - 1 / 2 v 0 , K ) h K - 1 v 0 , K .

For the DoFs of interior moments, the Cauchy–Schwarz inequality leads to

h K 1 / 2 𝝌 K ( v ) 2 h K - 1 v 0 , K .

Step 2. We next establish the upper bound of (4.2):

(4.4) | v | 1 , K h K 1 / 2 𝝌 ( v ) 2 .

The proof turns out to be technical. As is done in [12], every v H 1 ( K ) admits an H 1 -orthogonal decomposition v = v 1 + v 2 , where

v 1 H 1 ( K ) , v 1 | K = v | K , Δ v 1 = 0  in  K ,
v 2 H 0 1 ( K ) , Δ v 2 = Δ v  in  K .

For the harmonic part v 1 , the arguments in the proof of Theorem 4.1 lead to the existence of some v ~ 1 such that v ~ 1 | K = v | K and

(4.5) | v 1 | 1 , K | v ~ 1 | 1 , K h K - 1 / 2 v 0 , K h K 1 / 2 𝝌 ( v ) 2 ,

with the norm equivalence (4.3) in the last step. Hence, by the Poincaré–Friedrichs inequality,

(4.6) v 1 0 , K h K | v 1 | 1 , K + h K 1 / 2 v 0 , K h K 3 / 2 𝝌 ( v ) 2 .

For the second part v 2 , let g = Δ v = Δ v 2 . Then an integration by parts shows

(4.7) | v 2 | 1 , K 2 = ( Δ v 2 , v 2 ) K = ( g , v 2 ) K = ( g , v ) K - ( g , v 1 ) K .

Expand g in the basis m α , i.e., g = α g α m α , and denote 𝐠 = ( g α ) . In view of the Cauchy–Schwarz inequality and the norm equivalence for g in Lemma 3.2, one has

( g , v ) K = | K | α g α χ α ( v ) h K 3 / 2 Δ v 0 , K 𝝌 ( v ) 2 .

An upper bound of | v 2 | 1 , K is then obtained by substituting the above estimate into (4.7) and using the inverse inequality for polynomials:

| v 2 | 1 , K 2 h K 3 / 2 Δ v 0 , K 𝝌 ( v ) 2 + Δ v 0 , K v 1 0 , K
h K 3 / 2 Δ v 0 , K 𝝌 ( v ) 2
h K 1 / 2 | v 2 | 1 , K 𝝌 ( v ) 2 .

This and the upper bound for v 1 and Lemma 3.3 lead to

(4.8) | v 2 | 1 , K h K 1 / 2 𝝌 ( v ) 2 .

Equation (4.4) follows from (4.5) and (4.8). Moreover, since v 2 H 0 1 ( K ) , the Poincaré–Friedrichs inequality and (4.8) show

v 2 0 , K h K | v 2 | 1 , K h K 3 / 2 𝝌 ( v ) 2 .

Together with (4.6), this proves the upper bound of (4.1).

Step 3. Noting the constraint in (2.3) and the Poincaré–Friedrichs inequality, we obtain

h K 1 / 2 𝝌 ( v - Π k v ) 2 h K - 1 v - Π k v 0 , K | v | 1 , K .

The proof is complete. ∎

4.3 Interpolation Error Estimates

The interpolation operator I K : H 1 ( K ) C 0 ( K ) V k ( K ) or W k ( K ) is defined by the condition that v and I K v have the same degrees of freedom:

χ i ( I K v ) = χ i ( v ) for all  χ i 𝝌 .

As a by-product of the last two theorems, we can obtain the optimal error estimates for the interpolation operator I K .

Theorem 4.3.

For all K T h and for all v H k + 1 ( K ) with k 1 , there holds

v - I K v 0 , K + h K | v - I K v | 1 , K h K k + 1 | v | k + 1 , K .

Proof.

According to the norm equivalence in Theorem 4.2 and the definition of the interpolation operator, one has

I K v 0 , K h K 3 / 2 𝝌 ( I K v ) 2 = h K 3 / 2 𝝌 ( v ) 2 .

For the values at the vertices of K of v H 2 ( K ) , the Sobolev inequality gives

| χ p i ( v ) | = | v ( p i ) | v , K h K - 3 / 2 v 0 , K + h K - 1 / 2 | v | 1 , K + h K 1 / 2 | v | 2 , K .

The Cauchy–Schwarz inequality and the trace inequality to the remaining moments lead for all v H 2 ( K ) to

𝝌 ( v ) 2 h K - 3 / 2 v 0 , K + h K - 1 / 2 | v | 1 , K + h K 1 / 2 | v | 2 , K ,

and hence to

I K v 0 , K v 0 , K + h K | v | 1 , K + h K 2 | v | 2 , K .

By the Dupont–Scott theory in (3.1), there exists a polynomial p k ( K ) such that

| v - p | , K h K k + 1 - | v | k + 1 , K .

This and the triangle inequality show

v - I K v 0 , K v - p 0 , K + I K ( v - p ) 0 , K
v - p 0 , K + h K | v - p | 1 , K + h K 2 | v - p | 2 , K
h K k + 1 | v | k + 1 , K .

Similarly, with the inverse inequality in Theorem 4.1, we obtain

| v - I K v | 1 , K | v - p | 1 , K + | I K ( v - p ) | 1 , K
| v - p | 1 , K + h K - 1 I K ( v - p ) 0 , K
| v - p | 1 , K + h K - 1 v - I K v 0 , K + h K - 1 v - p 0 , K
h K k | v | k + 1 , K .

The theorem is proved. ∎

5 Numerical Experiment

5.1 The Reaction-Diffusion Problems

Let Ω 3 be a polyhedral domain and let Γ denote a subset of its boundary consisting of faces. We consider the following model problem:

(5.1) { - Δ u + α u = f in  Ω , u = g D on  Γ , 𝐧 u = g N on  Γ = Ω Γ ,

where α 0 is a constant, f L 2 ( Ω ) and g N L 2 ( Γ ) are the applied load and Neumann boundary data, respectively, and g D H 1 / 2 ( Γ ) is the data function for the Dirichlet boundary condition.

Introduce the following spaces:

H Γ 1 ( Ω ) = { v H 1 ( Ω ) : v | Γ = g D } , H Γ , 0 1 ( Ω ) = { v H 1 ( Ω ) : v | Γ = 0 } .

The continuous variational problem of (5.1) is to find u H Γ 1 ( Ω ) such that

(5.2) a ( u , v ) = ( f , v ) for all  v V := H Γ , 0 1 ( Ω ) ,

where

a ( u , v ) = Ω u v d x + α Ω u v d x , ( f , v ) = Ω f v d x + Γ g N v d σ .

It is clear that the bilinear form a ( , ) is bounded and coercive over V, and for a given polyhedral mesh 𝒯 h it can be decomposed as

a ( v , w ) = K 𝒯 h a K ( v , w ) for all  v , w V ,

where

a K ( u , v ) := K u v d x + α K u v d x .

5.2 Consistent and Non-consistent VEMs in the Lowest-Order Case

We only conduct the numerical experiment for the lowest-order case k = 1 . For the ease of the presentation, we assume that Γ = Ω , and the Dirichlet boundary condition is homogeneous, i.e., g D = 0 .

In the context of VEMs, a computable approximate bilinear form a h K ( , ) is often constructed in order to satisfy the following conditions [2]:

  1. k-consistency: For all p 1 ( K ) and for all v h U h ( K ) ,

    (5.3) a h K ( p , v h ) = a K ( p , v h ) .

  2. Stability: There exist two positive constants α * and α * , independent of h K and K, such that

    α * a K ( v h , v h ) a h K ( v h , v h ) α * a K ( v h , v h ) for all  v h U h ( K ) ,

    where U h ( K ) is a local virtual element space under discussion, a K ( , ) is the local bilinear form of the continuous problem and a h K ( , ) is a computable approximate bilinear form.

To this end, we first define a local H 1 -elliptic projection operator Π 1 as in (2.3). For simplicity, we also write Π 1 for the related elementwise defined global operator. In view of the consistency condition (5.3), a natural construction of the bilinear form is

a h c , K ( v , w ) = ( Π 1 v , Π 1 w ) K + α ( Π 1 0 v , Π 1 0 w ) K + S K ( v - Π 1 v , w - Π 1 w )

for all v , w W 1 ( K ) (see [1, 5]). The stabilization term in the implementation is realized as

(5.4) S K ( v - Π 1 v , w - Π 1 w ) := h K ( 1 + α h K 2 ) 𝝌 ( v - Π 1 v ) 𝝌 ( w - Π 1 w ) .

In what follows, denote by W 1 , h a finite-dimensional subspace of V, produced by combining all W 1 ( K ) for K 𝒯 h in a standard way [5]. The consistent VEM proposed in [5] is to find u h W 1 , h such that

(5.5) a h c ( u h , v h ) = f h , v h for all  v h W 1 , h ,

where

a h c ( u h , v h ) := K 𝒯 h a h c , K ( u h , v h )

and , is the duality pairing between W 1 , h and W 1 , h . A computable approximation of the right-hand side is given by

(5.6) f h , v h := K 𝒯 h K f Π 1 v h d x .

On the other hand, following the ideas in [13] for solving two-dimensional reaction-diffusion problems, we suggest a non-consistent VEM for solving (5.2), which is related to the approximate bilinear form

a h K ( v , w ) = ( Π 1 v , Π 1 w ) K + α ( Π 1 v , Π 1 w ) K + S K ( v - Π 1 v , w - Π 1 w )

for all v , w V 1 ( K ) . It is called the non-consistent bilinear form since the condition (5.3) is no longer valid. The corresponding VEM is: Find u h V 1 , h such that

(5.7) a h ( u h , v h ) = f h , v h for all  v h V 1 , h ,

where V 1 , h is the global version of V 1 ( K ) , and

a h ( u h , v h ) := K 𝒯 h a h K ( u h , v h ) .

It is remarked that the notation , also applies to V 1 , h . The stabilization term and the approximation of the right-hand side are the same as in (5.4) and (5.6) for the consistent VEM.

We denote by u h W and u h V the VEM solutions to the methods (5.5) and (5.7), respectively. An interesting fact is that these two methods lead to the same linear system with the degrees of freedom as an unknown vector, due to the relation that Π 1 w = Π 1 0 w for a function w W 1 ( K ) . In fact, for k = 1 the constraint in (2.2) gives

( Π 1 0 w - Π 1 w , p ) K = ( w - Π 1 w , p ) K = 0 for all  p 1 ( K ) ,

which implies Π 1 w - Π 1 0 w = 0 by noting Π 1 w - Π 1 0 w 1 ( K ) . In addition, if w belongs to V 1 ( K ) W 1 ( K ) , we can also show that Π 1 w is computable with respect to the DoFs of w. In fact, by integration by parts and using the properties that w | F W 1 ( F ) and Π 1 , F w = Π 1 , F 0 w for all w W 1 ( F ) , the right-hand sides of the first equation and the constraint in (2.3) can be computed respectively as

( w , p ) K = F K F ( p 𝐧 F ) w d σ
= F K F ( p 𝐧 F ) Π 1 , F 0 w d σ
= F K F ( p 𝐧 F ) Π 1 , F w d σ

and

K w d σ = F K F w d σ = F K F Π 1 , F w d σ ,

where 𝐧 F is the unit outward normal to F K .

With the help of the estimates established beforehand under the mesh assumptions (A1) and (A2), we may apply the tricky but similar arguments in [13] to derive the optimal error estimates for both methods in H 1 and L 2 norms:

(5.8) | u - u h | 1 , Ω h ( | u | 2 , Ω + f 0 , Ω ) ,
(5.9) u - u h 0 , Ω h 2 ( | u | 2 , Ω + f 0 , Ω ) ,

where u h = u h W or u h V . We omit the details for brevity.

5.3 Numerical Example

We only need to consider the implementation of the non-consistent VEM since the two methods lead to the same linear system with the DoFs as an unknown vector, i.e., 𝝌 ( u h W ) = 𝝌 ( u h V ) . But u h W u h V by noting that the virtual element spaces W 1 , h and V 1 , h have different nodal basis functions. Considering that the VEM solution u h is not explicitly known inside the polygonal elements, as in [6, 5], we will evaluate the errors by comparing the exact solution u with the elliptic projection Π 1 u h . In this way, the discrete H 1 and L 2 errors are quantified by

ErrH1 = ( K 𝒯 h | u - Π 1 u h | 1 , K 2 ) 1 / 2 , ErrL2 = ( K 𝒯 h u - Π 1 u h 0 , K 2 ) 1 / 2 .

Example 5.1.

Let α = 1 . The domain Ω is taken as the unit cube ( 0 , 1 ) 3 with the Neumann boundary condition imposed on x = 0 . The right-hand side f and the boundary conditions are chosen in such a way that the exact solution is u ( x , y , z ) = sin ( 2 x y ) cos ( z ) .

We solve the problem on two different kinds of meshes. One is the uniform triangulation shown in Figure a and the other is the CVT polyhedral mesh displayed in Figure b. The CVT meshes refer to the Centroidal Voronoi Tessellations, which are obtained from a set of seeds that coincide with barycenters of the resulting Voronoi cells. We generate such meshes via a standard Lloyd algorithm by extending the idea in the MATLAB toolbox PolyMesher introduced in [16] to a cuboid.

Generally speaking, h is proportional to N - 1 / 3 , where N is the total number of elements in the mesh. The convergence rate with respect to h is estimated by assuming Err ( h ) = c h α , and by computing a least squares fit to this log-linear relation. As observed in Figure 3, for the two types of discretizations, the VEM performs the linear (resp. quadratic) convergence order in the H 1 (resp. L 2 ) norm, which is consistent with the theoretical prediction in (5.8) and (5.9).

Figure 2

Two types of discretizations.

(a) 
                     Tetrahedral mesh.
(a)

Tetrahedral mesh.

(b) 
                     CVT mesh.
(b)

CVT mesh.

Figure 3

Convergence rates in L 2 and H 1 norms.

(a) 
                     Tetrahedral mesh.
(a)

Tetrahedral mesh.

(b) 
                     CVT mesh.
(b)

CVT mesh.

Award Identifier / Grant number: 12071289

Funding statement: The work of J. Huang was partially supported by NSFC (Grant No. 12071289).

Acknowledgements

The authors would like to thank two anonymous referees for their valuable comments and suggestions which helped to improve an early version of the paper.

References

[1] B. Ahmad, A. Alsaedi, F. Brezzi, L. D. Marini and A. Russo, Equivalent projectors for virtual element methods, Comput. Math. Appl. 66 (2013), 376–391. 10.1016/j.camwa.2013.05.015Search in Google Scholar

[2] L. Beirão Da Veiga, F. Brezzi, A. Cangiani, G. Manzini, L. D. Marini and A. Russo, Basic principles of virtual element methods, Math. Models Methods Appl. Sci. 23 (2013), 199–214. 10.1142/S0218202512500492Search in Google Scholar

[3] L. Beirão Da Veiga, F. Brezzi, F. Dassi, L. D. Marini and A. Russo, Serendipity virtual elements for general elliptic equations in three dimensions, Chin. Ann. Math. Ser. B 39 (2018), 315–334. 10.1007/s11401-018-1066-4Search in Google Scholar

[4] L. Beirão Da Veiga, F. Brezzi, L. D. Marini and A. Russo, The Hitchhiker’s guide to the virtual element method, Math. Models Meth. Appl. Sci. 24 (2014), 1541–1573. 10.1142/S021820251440003XSearch in Google Scholar

[5] L. Beirão Da Veiga, F. Dassi and A. Russo, High-order virtual element method on polyhedral meshes, Comput. Math. Appl. 74 (2017), 1110–1122. 10.1016/j.camwa.2017.03.021Search in Google Scholar

[6] L. Beirão Da Veiga, C. Lovadina and A. Russo, Stability analysis for the virtual element method, Math. Models Methods Appl. Sci. 27 (2017), 2557–2594. 10.1142/S021820251750052XSearch in Google Scholar

[7] S. C. Brenner, Poincaré-Friedrichs inequalities for piecewise H 1 functions, SIAM J. Numer. Anal. 41 (2003), 306–324. 10.1137/S0036142902401311Search in Google Scholar

[8] S. C. Brenner, Q. Guan and L. Sung, Some estimates for virtual element methods, Comput. Methods Appl. Math. 17 (2017), 553–574. 10.1515/cmam-2017-0008Search in Google Scholar

[9] S. C. Brenner and L. R. Scott, The Mathematical Theory of Finite Element Methods, 3rd ed., Springer, New York, 2008. 10.1007/978-0-387-75934-0Search in Google Scholar

[10] S. C. Brenner and L. Sung, Virtual element methods on meshes with small edges or faces, Math. Models Methods Appl. Sci. 28 (2018), 1291–1336. 10.1142/S0218202518500355Search in Google Scholar

[11] F. Brezzi, A. Buffa and K. Lipnikov, Mimetic finite differences for elliptic problems, M2AN Math. Model. Numer. Anal. 43 (2009), 277–295. 10.1051/m2an:2008046Search in Google Scholar

[12] L. Chen and J. Huang, Some error analysis on virtual element methods, Calcolo 55 (2018), Article ID 5. 10.1007/s10092-018-0249-4Search in Google Scholar

[13] F. Feng, J. Huang and Y. Yu, A non-consistent virtual element method for reaction diffusion equations, East Asian J. Appl. Math. 10 (2021), 786–799. 10.4208/eajam.150320.110520Search in Google Scholar

[14] J. Huang and Y. Yu, A medius error analysis for nonconforming virtual element methods for Poisson and biharmonic equations, J. Comput. Appl. Math. 386 (2021), Article ID 113229. 10.1016/j.cam.2020.113229Search in Google Scholar

[15] X. Huang, H m -conforming virtual elements in arbitrary dimension, preprint (2021), https://arxiv.org/abs/2105.12973. Search in Google Scholar

[16] C. Talischi, G. H. Paulino, A. Pereira and I. F. M. Menezes, Polymesher: A general-purpose mesh generator for polygonal elements written in Matlab, Struct. Multidiscip. Optim. 45 (2012), 309–328. 10.1007/s00158-011-0706-zSearch in Google Scholar

Received: 2022-03-13
Accepted: 2022-03-13
Published Online: 2022-06-14
Published in Print: 2023-01-01

© 2022 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 30.4.2024 from https://www.degruyter.com/document/doi/10.1515/cmam-2022-0062/html
Scroll to top button