A Priori Error Analysis for NCVEM Discretization of Elliptic Optimal Control Problem

Abstract

In this paper, we propose the nonconforming virtual element method (NCVEM) discretization for the pointwise control constraint optimal control problem governed by elliptic equations. Based on the NCVEM approximation of state equation and the variational discretization of control variables, we construct a virtual element discrete scheme. For the state, adjoint state and control variable, we obtain the corresponding prior estimate in H1 and L2 norms. Finally, some numerical experiments are carried out to support the theoretical results.

Share and Cite:

Wang, S. and Liu, S. (2024) A Priori Error Analysis for NCVEM Discretization of Elliptic Optimal Control Problem. Engineering, 16, 83-101. doi: 10.4236/eng.2024.164008.

1. Introduction

The main purpose of this paper is to discuss the prior error analysis of the NCVEM discretization for the elliptic optimal control problem. Consider the following optimal control problems with state constrained:

min z Z a d J ( q , z ) : = 1 2 Ω ( q q d ) 2 d x + γ 2 Ω z 2 d s (1.1)

subject to

{ Δ q = f + z in Ω , q = 0 on Ω , (1.2)

where J ( q , z ) is the objective functional, q is the state variable, q d is the desired state and γ is a positive constant parameter. The aim of the control is to make the state variable q as close as to the desired state q d . Ω is a bounded polygon on R2. The admissible set of the control is given by

Z a d = { z L 2 ( Ω ) : z a z ( x ) z b a .e . in Ω with z a , z b and z a z b } .

The above state constrained optimal control models perform an increasingly important role in many science and engineering fields. For this reason,the research on optimal control problems becomes meaningful. Different types of optimal control problems are solved by finite elements method (FEM) [1] [2] , discontinuous Galerkin method [3] , spectral method [4] so on. In [5] error estimates of approximate local optimal control for semi-linear elliptic equation with finite many state constraints were given. In [6] A control vector was used instead of a control function to establish a high order error estimate for similar Settings. In [7] , these results were generalized to a less regular setting for the states and the convergence of FEM approximations for semilinear distribution and boundary control problems was obtained. In [8] , a discretization concept was investigated, which used the relationship between adjoint state and control to discretized control variables. They discretized the equation of state using linear FEM and proved the convergence of the equation of state on L2 norm. On the other hand, for the optimal control problems of elliptic equations, Stokes equations and parabolic equations, the corresponding posteriori error estimates of the conforming FEM were given in [9] [10] [11] .

The basic driving force of the VEM comes from the processing of arbitrarily shaped polygons [12] . The traditional meaning of finite element or finite difference requires discretization of physical entities with significant geometric features to solve, which to some extent loses the “macro” description of entity geometric information. However, in practical engineering requirements, more and more calculations involve dealing with specific geometric structures, such as the deformation of non convex polygons and the contact of complex structures. Compared to the FEM, the VEM also requires discretization of the geometric space, approximating the actual problem by forming and solving a system of linear equations. The difference lies in: 1) The approximation function used in the finite element method is an explicit polynomial function; In the VEM, in addition to polynomial functions, approximate functions also have functions that are continuous polynomials at the boundary of the element and satisfy certain conditions inside the element (such as polynomials after Laplace operation). These functions are not explicitly expressed in the element domain; 2) In the FEM, the degrees of freedom are all values of approximate functions. The VEM avoids calculating the values of approximate functions inside the element when forming a stiffness matrix by defining reasonable degrees of freedom; 3) The stiffness matrix of the finite element method only contains one term, while the stiffness matrix of the virtual element method includes the coordination matrix and the stability matrix to ensure the convergence of the calculation.

Due to these advantages of VEM, the VEM for solving various partial differential equations has been proposed and developed, such as linear elasticity [13] , Stokes or Navier-Stokes equations [14] [15] , Cahn-Hilliard equations [16] , and so on. Back to the NCVEM proposed in this paper. The NCVEM was first introduced for elliptic problems in [17] . In the past years, it has been successfully used to solve different models [18] - [23] . But so far, NCVEM has not been used to solve the elliptic optimal control problem. In this paper, NCVEM is introduced to approach the elliptic optimal control problem with pointwise control constraints. Based on NCVEM approximation (through VEM projection operator), a VEM discrete scheme is constructed. Then we obtain the corresponding priori estimate for three variables in H1 and L2 norms.

Throughout this paper, for an open bounded domain ω in Ω, standard notation | | s , ω and s , ω denote seminorm and norm, respectively, in the Sobolev space H s ( ω ) . when m = 0 , L P ( ω ) = W 0, p ( ω ) ( , ) 0, ω and 0, ω denote the inner product and the norm of L p ( ω ) . When ω is the whole domain Ω, the subscript can be omitted. Let P k ( E ) denote the space of polynomials of degree at most K 0 on E. Usually, P 1 ( E ) = 0 .

The aim of this paper is to construct a NCVEM for constrained optimal control problems. The rest of this paper is as follows. In the next section, we introduce some preliminaries knowledge about VEM. Then, the continuous first-order optimality system of elliptic optimal control problem are introduced. In Section 3, we derive the VEM discrete scheme, discrete first-order optimality condition. Then the priori error estimates are derived both for three variables in H1 and L2 norm. In Section 4, we show a numerical example to verify our theoretical analysis. Finally, we make some summaries in Section 5.

2. Preliminaries Knowledge

In this section, we mainly introduce local projection operators and the definitions of virtual element space.

Fristly, suppose T h is a family of decompositions of the domain Ω divided into star-shaped polygons E. For any E T h , h = max E T h h E and h E = d i a m ( E ) The set of edges s of T h is denoted by S h , which is subdivided into the set of boundary edges S h b d r y : = { s S h : s Ω } and the set of internal edges S h i n t = S h S h b d r y . Finally, h s denote the length of the edge s.

Before introducing the virtual element space, we first make the following assumptions about the grid.

Assumption 2.1 (See [24] ) (mesh regularity) We assume that there exists a real number ρ > 0 such that, for every E T h satisfies the following two assumptions.

1) Every element E is star-shaped with respect to a circle with a radius ρ h E ρ h E ;

2) Every edge s of E has length h s ρ h E ;

Next we give the definition of the projection operator.

Definition 2.1 (See [24] ) Define the L2 projection operator Π 1 0 : L 2 ( E ) P 1 ( E ) as follows:

( Π 1 0 w h w h , q ) 0, E = 0 w h L 2 ( E ) , q P 1 ( E ) . (2.1)

Definition 2.2 (See [24] ) Define the H1 projection operator Π 1 : H 1 ( E ) P 1 ( E ) as follows:

( ( Π 1 w h w h ) , p ) 0, E = 0 w h H 1 ( E ) , p P 1 ( E )

plus

E ( w h Π 1 w h ) d s = 0.

A finite dimensional function space W h H 1 ( T h ) , where

H 1 ( T h ) : = { w L 2 ( Ω ) : w | E H 1 ( E ) E T h } (2.2)

(not necessarily a subspace of H 0 1 ( Ω ) )

We denote by M l * the set of scaled polynomials

M l * ( E ) : = { ( x x E h E ) s with s d , | s | = l } ,

The global virtual element space in each case is constructed from [18] as a subspace of an infinite dimensional space W, defined differently for the VEM and NCVEM. For the VEM we simply take W = H 0 1 ( Ω ) . For the NCVEM, we introduce the subspace H k 1, n c ( T h ) of the nonconforming broken Sobolev space H 1 ( T h ) defined in (3.1), by imposing certain weak inter-element continuity requirements such that

W : = H k 1 ( T h ) = { w H 1 ( T h ) : s w n s q d s = 0 , q P k 1 ( s ) , s S h } .

The jump operator across a mesh interface s S h is defined as follows for v H 1 ( T h ) .

If s S h i n t , w = w + n s + + w n s there exist E + and E such that S E + E . Denote by w ± the trace of w | E ± on s from within E ± and by n s ± the unit outward normal on s from E ± .

If s S h b d r y , w = w n s , w representing the trace of v from within the element E, having s as an interface and n s is the unit outward normal on s from E.

The modified virtual element space from is defined as

W h : = { W h W : W h | E , E T h }

where

W h E : = { w h V h E : ( w h Π 1 w h , q ) E = 0 , q M 1 * ( E ) M 0 * ( E ) }

V h E : = { w h H 1 ( E ) : Δ w h P 1 ( E ) and w h n P 0 ( s ) , s E } .

We can see that the space W h is not a subspace of H 0 1 ( Ω ) , so we need to define a discrete norm

| w | 1, h = ( E T h | w | 1, E 2 ) 1 / 2 , w W h

Similar to reference [18] , we define the degrees of freedom as

1 h e e w p d s , p P 0 ( e ) , e E (2.3)

1 | E | E w p d x , p P 1 ( E ) . (2.4)

Using the above degrees of freedom (2.3) and (2.4), projection Π 1 0 and Π 1 are exactly computable.

Next we introduce the continuous first-order optimality system

Theorem 2.1 Let ( y , u ) be the the solution of (1.1) and (1.2). Then the following first-order optimality system holds

{ Δ q = f + z , in Ω , q = 0, on Γ ,

and

{ Δ r = q q d , in Ω , r = 0, on Γ ,

where p is called the adjoint state variable and

Ω ( γ z + r ) ( w z ) d x 0, w Z a d . (2.5)

Let

R z a d ( z ) = max { z a , min { z , z b } } (2.6)

denotes the pointwise projection onto the admissible set Z a d . Similar to the discussion in Becker et al. [25] , (2.6) is equivalent to

Z = R Z a d ( 1 γ p ) .

Let B ( q , v ) = ( q , v ) . Then the bilinear form of the continuous first-order system reads:

( B ( q , v ) = ( f + z , v ) , v H 0 1 ( Ω ) , B ( r , v ) = ( q q d , v ) , v H 0 1 ( Ω ) , ( γ z + r , w z ) 0, v Z a d . (2.7)

From classical Scott-Dupont theory [26] we first introduce a local estimate.

Lemma 2.1 For any w H s ( Ω ) , there is a piecewise polynomial w π 1 ( T h ) satisfying

| w w π | m , K C h K s m | w | s , E , E T h , (2.8)

where 0 m s 2

For any function w H 0 1 ( Ω ) , using degrees of freedom (2.3) and (2.4) we can define the interpolation I h w W h . We denote by φ i the ith degrees of freedom given by (2.3) and (2.4), where i = 1, , N E and N E is the number of degrees of freedom (2.3) and (2.4). Then we have

φ i ( I h w ) = φ i ( w ) , i = 1, , N E

From [23] the following lemma provides the interpolation error estimation of the nonconforming virtual element

Lemma 2.2 For any w H 0 1 ( Ω ) H s ( Ω ) and 1 s 2 , we have

w I h w E + h E | w I h w | 1, E C h E s | w | s , E , E T h . (2.9)

3. Virtual Element Approximation

3.1. Virtual Element Discrete Scheme for State Equation

The bilinear form of the state equation is as follows

B ( q , w ) = ( f + z , w ) = : L ( w ) , w H 0 1 ( Ω ) .

The corresponding virtual element discrete scheme of (1.2) can be defined by

B h ( q h ( z ) , w h ) = L h ( w h ) , w h W h ,

where

{ B h ( q h ( z ) , w h ) : = E T h B h E ( q h ( z ) , w h ) = E T h ( B E ( Π 1 q h ( z ) , Π 1 w h ) + S E ( q h ( z ) Π 1 q h ( z ) , w h Π 1 w h ) ) , L h ( w h ) : = E T h ( f + z , Π 1 0 w h ) 0, E .

There are many choices for S E , and following [12] we take the simple choice

S E ( q h ( z ) Π 1 q h ( z ) , v h Π 1 w h ) = y = 1 N E dof y ( q h ( z ) Π 1 q h ( z ) ) dof y ( w h Π 1 w h )

such that it satisfies the following property:

α * B E ( w h , w h ) S E ( w h , w h ) α * B E ( w h , w h ) , w h W h E with Π 1 0 w h = 0.

Here N E is the number of degrees of freedom on the element E and denotes the dof y ( r h ( z ) Π 1 0 q h ( z ) ) value of the yth local degree of freedom defining q h ( z ) Π 1 q h ( z ) in W h E .

We define consistency and stability as follows:

Definition 3.1 see ( [23] )

- Consistency: For all p 1 ( E ) and for all w h W h E

B h E ( r , w h ) = E w Π 0 0 w h d x . (3.1)

- Stability: There exist positive constants α * and α * independent of h and the mesh element E such that

α * B E ( w h , w h ) B h E ( w h , w h ) α * B E ( w h , w h ) , w h W h E . (3.2)

Lemma 3.1 See ( [23] ) The Discrete bilinear form B h E satisfies the polynomial consistency property and the stability property. Then, we obtain B h is coercive.

The virtual element approximation of control problem (1.1)-(1.2) is to find ( q h , z h ) W h × Z a d such that

min z h Z a d J ( Π 1 0 q h , z h ) : = 1 2 E T h E ( Π 1 0 q h q d ) 2 d x + γ 2 Ω z h 2 d x (3.3)

subject to

B h ( q h , w h ) = E T h ( f + z h , Π 1 0 w h ) 0 , E , w h W h . (3.4)

In [27] , it also showed that (3.3) and (3.4) has a unique solution ( q h , z h ) and that ( q h , z h ) is the solution of (3.3) and (3.4) if and only if there is a co-state r h W h such that ( q h , r h , z h ) satisfies the following discrete first-order optimality conditions:

( B h ( q h , v h ) = E T h ( f + z h , Π 1 0 v h ) 0 , E , v h W h , B h ( r h , v h ) = E T h ( q h q d , Π 1 0 v h ) 0 , E , v h W h , E T h ( γ z h + Π 1 0 r h , w h z h ) 0 , E 0 , w h Z a d . (3.5)

3.2. A Priori Error Estimate

Lemma 3.2 see ( [28] )) There exists a positive constant C such that, for all E T h and all smooth enough functions w defined on E, it holds:

v Π 1 0 v p , E C h E t p | v | p , E , p , t , p t 2, v Π 1 v p , E C h E t p | w | t , E , p , r , p t 2, t 1. (3.6)

To derive a priori error estimate we need to introduce the following auxiliary problems:

( B h ( q h ( z ) , v h ) = E T h ( f + z , Π 1 0 v h ) 0 , E , v h W h , B h ( r h ( q ) , v h ) = E T h ( q q d , Π 1 0 v h ) 0 , E , v h W h , B h ( r h ( z ) , v h ) = E T h ( q h ( z ) q d , Π 1 0 v h ) 0 , E , v h W h . (3.7)

We make the following data assumption:

Assumption 3.1 (Data assumption) We assume the solution ( z , q , r ) of the optimal control problem and ( f , q d ) satisfy:

f , z , q d H 1 ( T h ) , q , r H 2 ( T h ) .

Then we have the following estimates.

Note that W h H 0 1 ( Ω ) , from integration by parts, we get

E T h B E ( q , v h ) = E T h k Δ q v h d x + E T h E q n k v h d s , q H 2 ( Ω ) , v h W h

The consistency error is

N h ( y , w h ) = E T h E y n k w h d s = e S h e y n e [ w h ] d s , w h V h (3.8)

Similar to the theoretical analysis in Xiao et al. [23] , we have

| N h ( q , v h ) | C h | q | 2 | v h | 1, h , v h W h . (3.9)

Theorem 3.1 Suppose that ( q , r ) is the solution of (2.7), and ( q h ( z ) , r h ( q ) ) is the solution of auxiliary problem (3.7), under Assumpiton 2.1 and assumption 3.1 we have

q q h ( z ) 1, h + r r h ( z ) 1, h C h

Proof:

q q h ( z ) = q I h q + I h q q h ( z ) = ξ h + θ h , (3.10)

where ξ h = q I h q and θ h = I h q q h ( z )

From the coercivity of B h ( , )

α * | θ h | 1 , h 2 B h ( θ h , θ h ) = B h ( I h q , θ h ) B h ( q h ( z ) , θ h ) = K T h B h K ( I h q , θ h ) E T h ( f + z , Π 1 0 θ h ) 0 , E = K T h ( B h K ( I h q q π , θ h ) + B h K ( q π , θ h ) ) E T h ( f + z , Π 1 0 θ h ) 0 , E = K T h ( B h K ( I h q q π , θ h ) + B K ( q π , θ h ) + B h K ( q π , θ h ) B K ( q π , θ h ) ) E T h ( f + z , Π 1 0 θ h ) 0 , E

= K T h ( B h K ( I h q q π , θ h ) + B K ( q π q , θ h ) ) + B h ( q π , θ h ) B ( q π , θ h ) + B ( q , θ h ) E T h ( f + z , Π 1 0 θ h ) 0 , E = K T h ( B h K ( I h q q π , θ h ) + B K ( q π q , θ h ) ) ( B ( q π , θ h ) B h ( q π , θ h ) + E T h ( f + z , Π 1 0 θ h ) 0 , E ( f + z , θ h ) 0 , Ω ) + B ( q , θ h ) ( f + z , θ h ) 0 , Ω .

(3.11)

Using formula (2.8), interpolation estimates (2.9) and stability property of a h ( , ) , we get

K T h ( B h K ( I h q q π , θ h ) + B K ( q π q , θ h ) ) C K T h ( ( I h q q π ) K θ h K + ( q π q ) K θ h K ) C K T h ( h K | q | 2 , K θ h K + h K | q | 2 , K θ h K ) C h | q | 2 | θ h | 1 , h . (3.12)

By the consistency and the stability of y π , we obtain

| B ( q π , θ h ) B h ( q π , θ h ) | = | K τ h ( K q π θ h d x K 0 0 q π 0 0 θ h d x ) | = | K τ h K ( I 0 0 ) θ h q π d x | = | K T h K ( I 0 0 ) θ h ( I 0 0 ) ( q π ) d x | C h | θ h | 1 , h q 2 . (3.13)

Then, by the minkowski inequality and the property of the L2 projection, we get

| K T h ( f + z , Π 1 0 θ h ) ( f + z , θ ) | E T h f + z Π 1 0 θ h θ h ( f + z ) Π 1 0 θ h θ h C h | θ h | 1, h ( f + z ) (3.14)

By integration by parts, we write

B ( q , θ h ) ( f + z , θ h ) = K T h K q n K θ h d s = e E h e q n e [ θ h ] d s .

Furthermore, from (3.9) we have

B ( q , θ h ) ( f + z , θ h ) C h | z | 2 | θ h | 1, h . (3.15)

By substituting (3.12), (3.13), (3.14) and (3.15) into (3.11), we have

α * | θ h | 1, h 2 C h ( | z | 2 + | f | 1 ) | θ h | 1, h ,

| θ h | 1, h C h ( | z | 2 + | f | 1 ) . (3.16)

From Lemma 2.2 (2.9) we get

| q I h q | 1, h C h | z | 2 . (3.17)

By combining (3.16) and (3.17), we have

q q h ( z ) 1, h C h (3.18)

By repeating the proof procedure of (3.18), we can get

r r h ( q ) 1, h C h

,

Similar to the discussion in Theorem 3.1 and theoretical analysis in Andrea et al. [18] we have the L2 error estimates between solution of (2.7) and the solution of auxiliary problem (3.7)

Lemma 3.3 see ( [18] ) Suppose that ( q , r ) is the solution of (2.7), and ( q h ( z ) , r h ( q ) ) is the solution of auxiliary problem (3.7), under Assumpiton 2.1 and assumption 3.1 we have

q q h ( z ) + r r h ( q ) C h 2

Theorem 3.2 (A priori error estimate) Let ( q , r , z ) and ( q h , r h , z h ) are the solutions of (2.7) and (3.5) respectively. Under the Assumptions 2.1 and 3.1 we derive

z z h + q q h + r r h C h 2

and

q q h 1, h + r r h 1, h C h .

Proof: We decompose the errors q q h and r r h into

q q h = q q h ( z ) + q h ( z ) q h

and

r r h = r r h ( z ) + r h ( z ) r h .

From the discrete first-order optimality system of the optimal control problem (3.5) and auxiliary problems (3.7) we get

B h ( q h ( u ) q h , θ h ) = E T h ( z z h , Π 1 0 θ h ) 0, E .

Let θ h = q h ( u ) q h , and from (3.2) we have

C α * q h ( z ) q h 1 , h 2 B h ( q h ( z ) q h , q h ( u ) q h ) = E T h ( z z h , Π 1 0 ( q h ( u ) q h ) ) 0 , E E T h z z h 0 , E q h ( z ) q h 0 , E z z h q h ( z ) q h 1 , h . (3.19)

then

q h ( z ) q h 1, h C z z h .

By the Lemma 3.2 and Theorem 3.1, we have

q q h ( z ) C h 2 , q q h ( z ) 1, h C h .

Combining these inequalities, we get

q q h C ( h 2 + z z h )

and

q q h 1, h C ( h + z z h ) .

By the Lemma 3.2 and Theorem 3.1, we have

r r h ( q ) C h 2 , r r h ( z ) 1, h C h .

Let v h = r h ( q ) r h ( z ) . From (3.2) we derive

C α * r h ( q ) r h ( z ) 1 , h 2 B h ( r h ( q ) r h ( z ) , r h ( q ) r h ( z ) ) = E T h ( q q h ( z ) , Π 1 0 ( r h ( q ) r h ( z ) ) ) 0 , E E T h q q h ( z ) 0 , E r h ( q ) r h ( z ) q q h ( z ) r h ( q ) r h ( z ) 1 , h . (3.20)

Further we have

r h ( q ) r h ( z ) 1, h C q q h ( z ) C h 2 .

By triangle inequality we derive

r r h ( z ) + h r p h ( z ) 1, h C h 2 . (3.21)

similar to (3.20) we obtain

r h ( z ) r h 1, h C q h ( z ) q h C z z h .

Through the triangle inequality, we can infer

r r h C ( h 2 + z z h )

and

r r h 1, h C ( h + z z h ) .

Because both the estimation of the state and the adjoint state depend on the estimation of the control variables, now we need estimate z z h Define

J ^ h ( z ) ( w z ) : = E T h E ( γ z + Π 1 0 r h ( z ) ) ( w z ) d x .

Then, we can prove that

J ^ h ( w ) ( w z ) J ^ h ( z ) ( w z ) γ v u 2 , (3.22)

J ^ h ( w ) ( w z ) J ^ h ( z ) ( w z ) = E T h E ( γ w + Π 1 0 r h ( w ) γ z Π 1 0 r h ( z ) ) ( w z ) d x = γ E T h E ( w z ) 2 d x + E T h E ( Π 1 0 r h ( w ) Π 1 0 r h ( z ) ) ( w z ) d x = γ Ω ( w z ) 2 d x + E T h E ( Π 1 0 r h ( w ) Π 1 0 r h ( z ) ) ( w z ) d x .

Using (3.7) and the property of the projection of L2 we can deduce

E T h E ( Π 1 0 r h ( w ) Π 1 0 r h ( z ) ) ( w z ) d x = B h ( q h ( w ) q h ( z ) , r h ( w ) r h ( z ) ) = B h ( r h ( w ) , q h ( w ) q h ( z ) ) B h ( r h ( z ) , q h ( w ) q h ( z ) ) = E T h ( q h ( w ) q d , Π 1 0 ( q h ( w ) q h ( z ) ) ) 0 , E E T h ( q h ( z ) q d , Π 1 0 ( q h ( w ) q h ( z ) ) ) 0 , E = E T h ( Π 1 0 ( q h ( w ) q h ( z ) ) , Π 1 0 ( q h ( w ) q h ( z ) ) ) 0.

Then from (3.22) we have

γ z z h 2 E T h E ( γ z + Π 1 0 r h ( z ) ) ( z z h ) d x E T h E ( γ z h + Π 1 0 r h ( z h ) ) ( z z h ) d x = E T h E ( γ u + Π 1 0 r h ( z ) γ z h Π 1 0 r h ( z h ) ) ( z z h ) d x

= ( γ z + r , z z h ) + E T h ( γ z h + Π 1 0 r h ( z h ) , z h z ) 0, E + E T h ( Π 1 0 r h ( z ) r , z z h ) 0, E 0 + 0 + E T h ( Π 1 0 r h ( z ) r , z z h ) 0, E .

This shows

z z h C ( E T h Π 1 0 r h ( z ) r 0, E 2 ) 1 2 .

Note that

Π 1 0 r h ( z ) r 0, E Π 1 0 r h ( z ) Π 1 0 r 0, E + Π 1 0 r r 0, E r h ( z ) r 0, E + Π 1 0 r r 0, E .

Then by Lemma 3.1 and (3.21) we have

z z h C h 2

Inserting the z z h into the q q h and r r h , we obtain the result.

,

Remark 1 (comparison with conforming VEM). The global virtual element space defined differently for the VEM and NCVEM, For the VEM simply take W = H 0 1 ( Ω ) . For NCVEM, we introduce the nonconforming broken Sobolev space H 1 ( T h ) by imposing certain weak inter-element continuity requirements. In contrast to conforming VEM, since W h is not a subset of H 0 1 ( Ω ) in general, the substitution of discrete function W h in the weak formulation leads to a nonconformity error such as (3.15).

4. Numerical Experiments

In this section, we present three different sequences of meshes to validate the performance of our error analysis presented in this paper. Through decomposing the domain into multiple squares, we obtain the first sequence of meshes (labeled square). The second meshes (labeled Lloyd) is given through Voronoi mesh generator [29] . The third sequence (labeled distorted) is to divide the Lloyd meshes into multiple distorted Lloyd meshes. These three sequences of meshes are respectively shown in Figures 1(a)-(c).

Figure 1. Three meshes.

We will confirm the priori error on the three grids by showing the relative errors in L2 and H1 norm between q , r , z and the solution q h , r h , z h given by the NCVEM. We use Q 0 , R 0 , Z 0 to denote the relative errors in the L2 norm between q , r , z and q h , r h , z h . Similarly, we respectively use Q 1 , R 1 to denote the relative errors in the H1 norm between q , r and q h , r h .

Example: The optimal control problem (1.1)-(1.2) is restricted to the unit square Ω = [ 0,1 ] × [ 0,1 ] . Let z a = 1 , z b = 0 , γ = 1 . We chose the following exact solution

q ( x , y ) = 2 sin ( π x ) sin ( π y ) , r ( x , y ) = 100 ( ( x 2 x ) ( x 2 y ) ) , z ( x , y ) = max ( 1 , min ( r , 0 ) ) .

f and y d can be determined from the exact solutions y , p , u .

In Table 1, there different meshes data of size parameter (mesh diameter), number of elements and vertices are shown.

In Figures 2-4, we present the convergence rate curves of the state, adjoint

Table 1. Mesh data for three grid meshes. h represents the mesh size parameter, and E and V represent the number of elements and vertices of the mesh.

Figure 2. Relative errors of state variables in L2 and H1 norm.

Figure 3. Relative errors of adjoint state variables in L2 and H1 norm.

Figure 4. Relative errors of control variables in L2 and H1 norm.

state and control variables in L2 and H1 norm in Tables 2-7, the numerical results about the relative errors and convergence are shown on three different meshes. In Figures 5-7, we present the figure of the solution of three variables in three meshes.

Table 2. Relative errors and convergence rates of state, adjoint state, control variables in L2 norm on Square mesh of Example 4.1.

Table 3. Relative errors and convergence rates of state, adjoint state variables in H1 norm on Square mesh of Example 4.1.

Table 4. Relative errors and convergence rates of state, adjoint state, control variables in L2 norm on Lloyd mesh of Example 4.1.

Table 5. Relative errors and convergence rates of state, adjoint state variables in H1 norm on Lloyd mesh of Example 4.1.

Table 6. Relative errors and convergence rates of state, adjoint state, control variables in L2 norm on Distorted mesh of Example 4.1.

Table 7. Relative errors and convergence rates of state, adjoint state variables in H1 norm on Distorted mesh of Example 4.1.

Figure 5. The solution of state variables in Lloyd meshes.

Figure 6. The solution of adjoint state variables in Lloyd meshes.

Figure 7. The solution of control variables in Lloyd meshes.

5. Conclusions

In this paper, NCVEM is applied to approximate elliptic optimal control problems with pointwise control constraints. The priori error estimates are derived, numerical examples verifies the theoretical results.

In our future work, we will increase the complexity of the elliptic problem, generalize the problem to linear indefinite elliptic problems. And because of the flexibility of the VEM, we will derive a posteriori error estimate for the problem, and derive an adaptive grid algorithm to guide mesh refinement.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Casas, E. (1986) Control of an Elliptic Problem with Pointwise State Constraints. SIAM Journal on Control and Optimization, 24, 1309-1318.
https://doi.org/10.1137/0324078
[2] Lu, Z. and Chen, Y. (2009) L-Error Estimates of Triangular Mixed Finite Element Methods for Optimal Control Problems Governed by Semilinear Elliptic Equations. Numerical Analysis and Applications, 2, 74-86.
https://doi.org/10.1134/S1995423909010078
[3] Liu, W., Ma, H., Tang, T. and Yan, N. (2004) A Posteriori Error Estimates for Discontinuous Galerkin Timestepping Method for Optimal Control Problems Governed by Parabolic Equations. SIAM Journal on Numerical Analysis, 42, 1032-1061.
https://doi.org/10.1137/S0036142902397090
[4] Chen, Y. and Huang, F. (2016) Galerkin Spectral Approximation of Elliptic Optimal Control Problems with H1-Norm State Constraint. Journal of Scientific Computing, 67, 65-83.
https://doi.org/10.1007/s10915-015-0071-y
[5] Casas, E. and Tröltzsch, F. (2002) Error Estimates for the Finite-Element Approximation of a Semilinear Elliptic Control Problem. Control and Cybernetics, 31, 695-712.
[6] Merino, P., Tröltzsch, F. and Vexler, B. (2010) Error Estimates for the Finite Element Approximation of a Semilinear Elliptic Control Problem with State Constraints and Finite Dimensional Control Space. ESAIM: Mathematical Modelling and Numerical Analysis, 44, 167-188.
https://doi.org/10.1051/m2an/2009045
[7] Casas, E. and Raymond, J.-P. (2006) Error Estimates for the Numerical Approximation of Dirichlet Boundary Control for Semilinear Elliptic Equations. SIAM Journal on Control and Optimization, 45, 1586-1611.
https://doi.org/10.1137/050626600
[8] Hinze, M. (2005) A Variational Discretization Concept in Control Constrained Optimization: The Linearquadratic Case. Computational Optimization and Applications, 30, 45-61.
https://doi.org/10.1007/s10589-005-4559-5
[9] Liu W. and Yan, N. (2001) A Posteriori Error Estimates for Distributed Convex Optimal Control Problems. Advances in Computational Mathematics, 15, 285-309.
https://doi.org/10.1023/A:1014239012739
[10] Liu, W. and Yan, N. (2002) A Posteriori Error Estimates for Control Problems Governed by Stokes Equations. SIAM Journal on Numerical Analysis, 40, 1850-1869.
https://doi.org/10.1137/S0036142901384009
[11] Liu, W. and Yan, N. (2003) A Posteriori Error Estimates for Optimal Control Problems Governed by Parabolic Equations. Numerische Mathematik, 93, 497-521.
https://doi.org/10.1007/s002110100380
[12] Beirão da Veiga, L., Brezzi, F., Cangiani, A., Manzini, G., Marini, L.D. and Russo, A. (2013) Basic Principles of Virtual Element Methods. Mathematical Models and Methods in Applied Sciences, 23, 199-214.
https://doi.org/10.1142/S0218202512500492
[13] Da Veiga, L.B., Lovadina, C. and Mora, D. (2015) A Virtual Element Method for Elastic and Inelastic Problems on Polytope Meshes. Computer Methods in Applied Mechanics and Engineering, 295, 327-346.
https://doi.org/10.1016/j.cma.2015.07.013
[14] Chen L. and Wang, F. (2019) A Divergence Free Weak Virtual Element Method for the Stokes Problem on Polytopal Meshes. Journal of Scientific Computing, 78, 864-886.
https://doi.org/10.1007/s10915-018-0796-5
[15] Gatica, G.N., Munar, M. and Sequeira, F.A. (2018) A Mixed Virtual Element Method for the Navier-Stokes Equations. Mathematical Models and Methods in Applied Sciences, 28, 2719-2762.
https://doi.org/10.1142/S0218202518500598
[16] Antonietti, P.F., Da Veiga, L.B., Scacchi, S. and Verani, M. (2016) A C1 Virtual Element Method for the Cahn-Hilliard Equation with Polygonal Meshes. SIAM Journal on Numerical Analysis, 54, 34-56.
https://doi.org/10.1137/15M1008117
[17] de Dios, B.A., Lipnikov, K. and Manzini, G. (2016) The Nonconforming Virtual Element Method. ESAIM: Mathematical Modelling and Numerical Analysis, 50, 879-904.
https://doi.org/10.1051/m2an/2015090
[18] Cangiani, A., Manzini, G. and Sutton, O.J. (2017) Conforming and Nonconforming Virtual Element Methods for Elliptic Problems. IMA Journal of Numerical Analysis, 37, 1317-1354.
https://doi.org/10.1093/imanum/drw036
[19] Liu, X. and Chen, Z. (2019) The Nonconforming Virtual Element Method for the Navier-Stokes Equations. Advances in Computational Mathematics, 45, 51-74.
https://doi.org/10.1007/s10444-018-9602-z
[20] Antonietti, P.F., Manzini, G. and Verani, M. (2018) The Fully Nonconforming Virtual Element Method for Biharmonic Problems. Mathematical Models and Methods in Applied Sciences, 28, 387-407.
https://doi.org/10.1142/S0218202518500100
[21] Zhang, B., Zhao, J., Yang, Y. and Chen, S. (2019) The Nonconforming Virtual Element Method for Elasticity Problems. Journal of Computational Physics, 378, 394-410.
https://doi.org/10.1016/j.jcp.2018.11.004
[22] Gardini, F., Manzini, G. and Vacca, G. (2019) The Nonconforming Virtual Element Method for Eigenvalue Problems. ESAIM: Mathematical Modelling and Numerical Analysis, 53, 749-774.
https://doi.org/10.1051/m2an/2018074
[23] Xiao, L., Zhou, M. and Zhao, J. (2022) The Nonconforming Virtual Element Method for Semilinear Elliptic Problems. Applied Mathematics and Computation, 433, Article 127402.
https://doi.org/10.1016/j.amc.2022.127402
[24] Ahmad, B., Alsaedi, A., Brezzi, F., Marini, L.D. and Russo, A. (2013) Equivalent Projectors for Virtual Element Methods. Computers & Mathematics with Applications, 66, 376-391.
https://doi.org/10.1016/j.camwa.2013.05.015
[25] Becker, R., Kapp, H. and Rannacher, R. (2000) Adaptive Finite Element Methods for Optimal Control of Partial Differential Equations: Basic Concept. SIAM Journal on Control and Optimization, 39, 113-132.
https://doi.org/10.1137/S0363012999351097
[26] Brenner, S.C. and Scott, L.R. (2008) The Mathematical Theory of Finite Element Methods. Springer, New York.
https://doi.org/10.1007/978-0-387-75934-0
[27] Wang, Q. and Zhou, Z. (2022) A Priori and a Posteriori Error Analysis for Virtual Element Discretization of Elliptic Optimal Control Problem. Numerical Algorithms, 90, 989-1015.
https://doi.org/10.1007/s11075-021-01219-1
[28] Beirão da Veiga, L., Brezzi, F., Marini, L.D. and Russo, A. (2016) Virtual Element Method for General Second-Order Elliptic Problems on Polygonal Meshes. Mathematical Models and Methods in Applied Sciences, 26, 729-750.
https://doi.org/10.1142/S0218202516500160
[29] Talischi, C., Paulino, G.H., Pereira, A. and Menezes, I.F. (2012) Polymesher: A General-Purpose Mesh Generator for Polygonal Elements Written in Matlab. Structural and Multidisciplinary Optimization, 45, 309-328.
https://doi.org/10.1007/s00158-011-0706-z

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.