Virtual Element Discretization of Optimal Control Problem Governed by Brinkman Equations ()
1. Introduction
In this paper we consider virtual element discretization of the following optimal control problem: find
satisfying
(1.1)
subject to
(1.2)
where
is the objective functional,
is the desired state,
is the regularization parameter, and
is a bounded domain in
with the boundary
. We suppose that the
is a uniformly symmetric positive definite tensor, i.e. there exist two positive constants
such that
The admissible control set
is defined by
The quantities
are constant vectors and the inequality
is understood componentwise.
Flow control problems have important applications in aerospace, chemical engineering and so on. The Brinkman equations can be viewed as a parameter-dependent combination of the Darcy and the Stokes equations [1] . In the past decades, developing numerical methods for optimal control model governed by Brinkman equations has become a hot topic. For example, a discontinuous finite volume method for the approximation of distributed optimal control problems governed by the Brinkman equations was derived in [2] . In [3] the author investigated adaptive hybridizable discontinuous Galerkin methods for the gradient-velocity-pressure formulation of Brinkman equations and extended to solve the Brinkman optimal control problem. In [4] the author studied an optimal control problem constrained by the unsteady Stokes-Brinkman equation involving random data. For more models, we can refer to [5] [6] .
The virtual element method (VEM), first introduced in [7] , is regarded as an extension of finite element method. Unlike finite element method, the VEM has the advantages including: it can deal with highly general polygonal/polyhedral meshes; the basis function needn’t to be explicit expression, etc. VEM has been widely applied to approximate various PDEs [8] [9] [10] [11] [12] . There are many crucial literatures about the VEM framework for Brinkman problems. A mixed virtual element method for the Brinkamn equations was discussed in [13] . In [14] , the divergence free virtual element space in [11] was extended to solve the Brinkman equations. In [15] , the authors presented two stable virtual element methods for the Brinkman equations.
For the literature on the application of virtual element method to optimal control problem, we can refer to [16] and [17] . The authors study the virtual element discrete scheme of the elliptic optimal control problem and give a priori and a posteriori error analysis. There is still a gap in combination of the virtual element method and optimal control problem governed by Brinkman equations. Thus, in this paper, we aim to apply the VEM to approximate optimal control problem governed by Brinkman equations with pointwise control constraint. By making use of the virtual element projection operators the virtual element discrete scheme of the optimal control problem is developed, where the piecewise
projection of the discrete state is used in the cost functional to guarantee the computability of the discrete adjoint state equation. Then, we derive a priori error estimates for state, adjoint state and control variables in
and
norm. Finally numerical experiments on three polygonal meshes are given to verify the theoretical findings.
The structure of this paper is as follows. In Section 2, we give the continuous first order optimality condition of problem (1.1)-(1.2). Then, some basic concepts about VEM are introduced. In Section 3, we derive the virtual element discrete scheme for (1.1)-(1.2) and the discrete first order optimality condition. In Section 4, a priori error estimates of the state, adjoint state and control variables are proved. In Section 5, we show numerical results to verify the theoretical results.
Throughout this paper, for an open bounded domain K, we will denote scale and vector Sobolev space by
and
equipped with seminorm
and norm
, while
will denote the
or
inner product for scale and vector.
2. Preliminaries
In this section, we firstly recall the continuous first order optimality condition for problem (1.1)-(1.2). Then we introduce the definitions of virtual element space and two projection operators.
We consider the spaces:
We endow the space
with the norm
and the space Q with
-norm.
Then the weak formulation of the optimal control problem (1.1)-(1.2) is given by seeking
satisfying
s.t.
where
Additionally, we introduce the kernel:
Following [14] , we can obtain that:
·
and
are continuous, i.e.
·
is coercive on the kernel
, i.e.
·
satisfies the inf-sup condition, i.e.
We introduce the following Lagrangian functional:
Then the following continue first order optimality condition can be obtained by computing the derivatives of
with respect to
:
(2.1)
(2.2)
(2.3)
where
is the adjoint state variable. Following [18] , the variational inequality (2.3) is equivalent to
where
denotes the projection onto the admissible set
.
Let
be a sequence of decompositions of
into general polygonal elements K with
Assumption 2.1. We assume that there exists two positive constants c and
such that, every
satisfies the following assumptions:
(A1) Each element K is star-shaped with respect to a ball of radius
,
(A2) The distance
between any two points of each element K satisfies
.
The bilinear forms
and
, the norms
and
, can be decomposed into local contributions, i.e.:
and
Definition 2.1. For all
, we define the energy projection operator
:
as follows:
It obviously holds
for all
.
Definition 2.2. For all
, we define the
projection operator
:
as follows:
For
, we define the following spaces:
·
: the set of polynomials on K of degree
, usually,
,
·
,
·
,
·
is the
-orthogonal complement to
.
In [14] the following local virtual element space was introduced
where
and
denotes the polynomials in
that are
-orthogonal to all polynomials in
.
For the pressure space we adopt the finite-dimensional space
Then we define the global virtual element spaces:
and
We remark that the above spaces have the following relation
This implies an exactly divergence-free discrete velocity.
Lemma 2.3. (See [8] )There exists a positive constant C such that, for all
and all smooth enough functions
defined on K, it holds:
3. Virtual Element Approximation
The virtual element discrete scheme of (1.2) can be defined as follows:
where
Here,
and
are symmetric stabilizing bilinear forms satisfying
where
and
are positive constants independent of h. One can refer to [14] for the example of construction of
and
. Moreover, the bilinear form
satisfies:
· Consistency:
· Stability:
Here,
and
are two positive constants independent of h. By the stability of
and the coercive of
, we obtain that the bilinear form
is coercive, i.e.:
(3.1)
Next, the bilinear
satisfies the inf-sup condition [14] .
Lemma 3.1. Given the discrete spaces
and
, there exists a positive constant
independent of h with
Then the virtual element approximation of optimal control problem (1.1)-(1.2) is to find
such that
subject to
(3.2)
Here the control variable is implicitly discretized (see [19] ), and the minimization problem is defined on infinite dimensional set
, instead of virtual element space. In order to balance the convergence rates of state and control variables, in the discrete state equation we adopt the
projection
.
We introduce the following Lagrangian functional:
Then the following discrete first order optimality condition can be obtained by computing the derivatives of
with respect to
:
(3.3)
(3.4)
(3.5)
4. A Priori Error Estimates
Lemma 4.1. (See [20] )For the state equation, there exists a positive constant C, the state variables admit the following estimates
To achieve a priori error estimates, we introduce some auxiliary problems:
,
(4.1)
(4.2)
(4.3)
Additionally, we introduce the discrete kernel:
Lemma 4.2. (See [14] ) Let
with
. Under the Assumption (2.1) on the decomposition
, there exist
such that
where C is a positive constant independent of h.
Lemma 4.3. Let
and
be the solutions (2.1) and (4.1), respectively. Under the Assumption 2.1, we have the following estimates
Proof. Note that
is the virtual element approximation of
. We observe that, if
is the velocity solution to Equation (2.1), then it is also the solution to the following problem: find
, such that
Analogously, if
is the velocity solution to Equation (4.1), then it is also the solution to problem: find
, such that
Therefore, by using the same techniques of Theorem 4.6 and Theorem 4.7 in [11] , we can derive the first and second estimate in this lemma. Now we just give the proof of the last one.
Let
be the solution to the dual problem
(4.4)
From Lemma 4.1 we know that
satisfies the regularity bound
and consequently for any interpolation
as in Lemma 4.2, we have
Because of
, we obtain that the discrete velocity solution of state equation is divergence-free. Thus, we get
. Further, multiplying (4.4) by
and integrating leads to
(4.5)
We label these as
and
, respectively, and bound them separately.
Firstly, we can bound
as follows
Due to
the estimate of term
follows
For the inconsistency term
we have
Note that
and
Then applying the Cauchy-Schwarz inequality [21] , the following conclusion can be drawn
Finally, the definition and estimate of the
projection operator leads to the estimate of
Here, the estimate of
is derived as follows:
Inserting above bounds into (4.5) yields the third estimate.
For the adjoint state variables, we have the following results.
Lemma 4.4. Let
and
be the solutions (2.2) and (4.2), respectively. Under the Assumption 2.1, we have the following estimates
Proof. Note that
is the virtual element approximation of
. In a similar way to state variables, the Equation (2.2) can be rewritten as: finding
, such that
while, the Equation (4.2) can be rewritten as: finding
, such that
Then by using the same techniques of Theorem 4.6 and Theorem 4.7 in [11] , we can derive the first and second estimate in this lemma. The last one can be derived by the similar argument to Lemma 4.3.
Theorem 4.5. (A priori error estimate)Suppose that
is the solution of (2.1)-(2.3), and
is the solution of (3.3)-(3.5). Under the Assumption 2.1, we derive
where C is a positive constant independent of h.
Proof. We decompose the errors
and
into
Recalling Lemma 4.3, we know
Moreover, by the governing equations of
and
we have:
,
Setting
and
gives
It follows from (3.1) that
We can deduce
Combining above inequalities leads to
(4.6)
and
(4.7)
Next we estimate
. Based on Lemma 3.1, we get
By the triangle inequality, it holds
(4.8)
In a similar way, from Lemma 4.4, we have
By the governing equations of
and
we have:
,
Choosing
and
, we obtain
Further, it follows that
This implies
Combining above inequalities gives
(4.9)
and
(4.10)
Using Lemma 3.1, we can derive
By the triangle inequality, we have
(4.11)
Since the estimates of state and adjoint state variables both depend on the estimate of control variable, now it remains to estimate
. Define
We can prove that
(4.12)
Note that
Using (4.1), we can derive:
,
Let
and
, then we obtain
(4.13)
Using (4.3), we can obtain:
,
Taking
and
yields
(4.14)
According to (4.13)-(4.14) and the property of the
projection, we deduce
Therefore, from (4.12), it follows
This shows
(4.15)
Note that
(4.16)
By Lemma 2.3, we have
. We decompose the error
into
Applying Lemma 4.4 yields
By governing equations of
and
we have:
Setting
and
, we obtain
It can be deduced immediately by (3.1)
Then we can derive
Using the triangle inequality leads to
(4.17)
Combining (4.15), (4.16) and (4.17) results in
Inserting above estimate into the estimates of state and adjoint state yields the final results.
5. Numerical Results
In this section, we present an example on domain
to validate the performance of our error analysis presented in this paper.
For the convergence test we consider the following two sequences of meshes that are shown in Figure 1. The first sequence of meshes (labeled Distorted square) is the distorted square mesh. The second sequence of meshes (labeled Lloyd) is obtained by the Voronoi mesh generator (see [22] ).
Example 5.1. Consider the optimal control problem (1.1)-(1.2) on the square domain
. Let
,
,
,
. The exact solutions are chosen to be
The control variable is given
.
and
can be determined from the exact solutions
.
In Tables 1-3, we show the numerical results about the state variables
, the adjoint state variables
and the control variable
on three different meshes. We can observe that the convergence rate is consistent with the previous theoretical analysis. In the following tables, NE is the number of mesh elements. We observe that both errors have optimal convergence rates, which satisfies the
![]()
Table 1. Errors and convergence rates of state variables on two meshes.
![]()
Table 2. Errors and convergence rates of adjoint state variables on two meshes.
![]()
Table 3. Errors and convergence rates of control variable on two meshes.
conclusion in Theorem 4.5.
Acknowledgements
The author would like to thank editor and referees for their valuable advices for the improvement of this article.