Discontinuous Galerkin approximations for an optimal control problem of three-dimensional Navier-Stokes-Voigt equations
Cung The Anh, Tran Minh Nguyet

TL;DR
This paper develops and analyzes a fully discrete discontinuous Galerkin scheme combined with finite element methods for optimal control of 3D Navier-Stokes-Voigt equations, providing error estimates for control approximations.
Contribution
It introduces a novel fully discrete scheme for the optimal control problem of Navier-Stokes-Voigt equations with proven error bounds.
Findings
Error estimates of order $O(\sqrt{ au}+h)$ for control approximations.
Convergence of the discrete controls to the continuous optimal controls.
Validation of the scheme's effectiveness for 3D Navier-Stokes-Voigt control problems.
Abstract
We analyze a fully discrete scheme based on the discontinuous (in time) Galerkin approach, which is combined with conforming finite element subspaces in space, for the distributed optimal control problem of the three-dimensional Navier-Stokes-Voigt equations with a quadratic objective functional and box control constraints. The space-time error estimates of order , where and are respectively the time and space discretization parameters, are proved for the difference between the locally optimal controls and their discrete approximations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Advanced Mathematical Modeling in Engineering · Stability and Controllability of Differential Equations
Discontinuous Galerkin approximations for an optimal control problem of three-dimensional Navier-Stokes-Voigt equations
Cung The Anh*♮* and Tran Minh Nguyet
Cung The Anh Department of Mathematics, Hanoi National University of Education 136 Xuan Thuy, Cau Giay, Hanoi, Vietnam
Tran Minh Nguyet Department of Mathematics, Thang Long University Nghiem Xuan Yem, Hoang Mai, Hanoi, Vietnam
Abstract.
We analyze a fully discrete scheme based on the discontinuous (in time) Galerkin approach, which is combined with conforming finite element subspaces in space, for the distributed optimal control problem of the three-dimensional Navier-Stokes-Voigt equations with a quadratic objective functional and box control constraints. The space-time error estimates of order , where and are respectively the time and space discretization parameters, are proved for the difference between the locally optimal controls and their discrete approximations.
Key words and phrases:
Navier-Stokes-Voigt equations; optimal control; convergence; a priori error estimates; discontinuous Galerkin methods
2010 Mathematics Subject Classification:
49J20; 49K20; 35Q35; 65N30
♮ Corresponding author: [email protected]
1. Introduction
Let be an open bounded domain in with boundary . We denote the space-time cylinder by , where is given. In this paper we prove some error estimates for the numerical approximation of a distributed optimal control problem governed by the evolution Navier-Stokes-Voigt equations with pointwise control constraints. More precisely, we consider the following problem
[TABLE]
where
[TABLE]
and is the set of admissible controls defined for given real constants , by
[TABLE]
Here the free variables - state and control - have to fulfill the following 3D Navier-Stokes-Voigt (sometimes written Voight) equations
[TABLE]
In system (1.1), is the velocity, is the initial velocity, is the pressure, is the kinematic viscosity coefficient, and is the length-scale parameter characterizing the elasticity of the fluid.
To study the above optimal control problem we assume that
- •
The domain is an open bounded subset of with boundary
- •
The initial value is a given function in . The desired states have to satisfy and
- •
The coefficients are non-negative real numbers, where at least one of them is positive to get a non-trivial objective functional. The regularization parameter , which measures the cost of the control, is also a positive number.
The Navier-Stokes-Voigt equations was introduced by Oskolkov in [29] as a model of motion of certain linear viscoelastic incompressible fluids. This system was also proposed by Cao, Lunasin and Titi in [6] as a regularization, for small values of , of the 3D Navier-Stokes equations for the sake of direct numerical simulations. The presence of the regularizing term in (1.1) has two important consequences. First, it leads to the global well-posedness of (1.1) both forward and backward in time, even in the case of three dimensions. Second, it changes the parabolic character of the limit Navier-Stokes equations, so the Navier-Stokes-Voigt system behaves like a damped hyperbolic system. In fact, the Navier-Stokes-Voigt system is perhaps the newest model in the the so-called -models in fluid mechanics (see e.g. [26]), but it has attractive advantage over other -models in that one does not need to impose any additional artificial boundary condition (besides the Dirichlet boundary conditions) to get the global well-posedness. We also refer the reader to [17] for an interesting application of the Navier-Stokes-Voigt equations in image inpainting.
In the past years, the existence and long-time behavior of solutions to the Navier-Stokes-Voigt equations has attracted the attention of many mathematicians. In bounded domains or unbounded domains satisfying the Poincaré inequality, there are many results on the existence and long-time behavior of solutions in terms of existence of attractors, see e.g. [4, 13, 15, 18, 27, 30, 37]. In the whole space, the existence and time decay rates of solutions have been studied in [5, 28, 38]. However, to the best of our knowledge, there are few works on optimal control problems of Navier-Stokes-Voigt equations, except two recent works [2, 3] where the quadratic optimal control and time optimal control problems with distributed controls were investigated. In this paper we continue studying a numerical scheme for the distributed optimal control problem of this system in both time and space variables.
Since the pioneering work [1] in 1990 of Abergel and Temam, optimal control problems for Navier-Stokes equations have been studied by many authors in the last three decades. The analysis of these control problems is well understood, see e.g. [20, 25, 33, 35, 36] and references therein, where various aspects including first and second order necessary conditions are developed and analyzed. To the contrary, numerical analysis of such optimal control problems is quite limited. This is due to the fact that the restricted regularity of solutions of the evolutionary Navier-Stokes equations, as well as the divergence free condition, and the convective nature of the adjoint equation of the first order necessary condition, pose significant difficulties when analyzing numerical schemes. Standard techniques developed for the numerical analysis of the uncontrolled Navier-Stokes equations cannot be directly applied in the optimal control setting. Furthermore, the presence of control constraints, create many additional difficulties and hence require special techniques involving both first and second order necessary and sufficient conditions. In the literature not many contributions to numerical analysis for control problems with time-dependent Navier-Stokes equations can be found. In [21, 22] Gunzburger and Manservisi presente a numerical approach to control of the instationary Navier-Stokes equations using the first discretize then optimize approach. The first optimize then discretize approach applied to the same problem class is discussed by Hinze in [23]. Deckelnick and Hinze provide numerical analysis for a general class of control problems with the instationary Navier-Stokes system in [16].
In [7] Casas and Chrysafinos proposed a numerical scheme which is based on the discontinuous time-stepping Galerkin scheme for the piecewise constant time discretization combined with standard conforming finite element subspaces for the discretization in space. They presented space-time error estimates of order , under suitable regularity assumptions on the data, when the controls are discretized by piecewise constants in space and time. Two parameters and are associated to the numerical scheme (here and , indicating the size of the grids in time and space) and they were needed to satisfy the usual technical assumption in order to prove that the discrete equation has a unique solution, and the estimate was optimal in norms for the state and adjoint. The key idea of [7] was to utilize ideas from [11] developed for the stationary Navier-Stokes equations, together with a detailed error analysis of the uncontrolled state and adjoint equations of the underlying scheme. Later in [8], Casas and Chrysafinos continued their work in [7] in the sense that error estimates in of order and with depending on the regularity of the target and the initial velocity were proved. We also refer the interested reader to [9, 10] for some very close related results.
In this paper following the general lines of the approach in [7, 12] we will study a numerical scheme for the optimal control problem of 3D Navier-Stokes-Voigt equations based on the discontinuous time-stepping Galerkin scheme for the piecewise constant time combined with standard conforming finite element subspaces for the discretization in space. It is noticed that in [2] we proved the existence of optimal solutions and established the first and second order optimality conditions for problem , where the admissible set is an arbitrary non-empty, convex, closed subset in . Our main result in the present paper is to derive space-time error estimates under suitable regularity assumptions on the data together with a detailed error analysis of the uncontrolled state and adjoint equations of the underlying scheme. Here the presence of control constraints prevents a direct analysis of the system of state and adjoint state equations. To overcome this difficulty, as in [7], we need to use the second order conditions for optimality. The box control constraint assumption ensures that the set of discrete control designed in the paper is convex and closed, which implies that the discrete control problem has a solution. Besides, in our work, since the solution of the Navier-Stokes-Voigt equations is more regular, we are able to prove the uniqueness of the discrete equation without the widely used technical assumption as in [7], and we obtain that the order of error estimates is instead of as in [7]. It is noticed that, under the assumption as in [7], these two orders of errors are the same. To prove the main results, we modify the techniques used in [7, 12] with appropriate adjusts while contributing project operators from the spaces of states and pressure terms to the respective discrete spaces. Because of some technical reasons as in [7], the pressure terms must belong to the space , so we need to assume that the initial state is in instead of as in [2], that is, we consider the strong solutions. It is worthy noticing that, by using a variational discretization in [24], Casas and Chrysafinos can also prove error estimates (in ) of order for the distributed optimal control problem of 2D Navier-Stokes equations in [8]. The proof of such an error estimates for the variational discretization of the optimal control problem will be the goal of a forthcoming paper currently in preparation.
The paper is organized as follows. In Section 2, for convenience of the reader, we recall some auxiliary results on the existence and unique of weak and strong solutions to the system (1.1). We also restate the optimality conditions of the optimal control problem obtained in [2], however, in this paper these results are transferred into the box control constraint case. The main results of the paper are presented in Section 3, where we analyze the discrete state equations, the discrete adjoint state equations, and we prove the convergence of the discrete control problem and derive the space-time error estimates.
2. Preliminaries and auxiliary results
2.1. Function spaces and inequalities for the nonlinear terms
Let be an open bounded domain in with boundary . For convenience, we set
[TABLE]
[TABLE]
We denote by the dual spaces of . Define
[TABLE]
[TABLE]
and the associated norms
Set
[TABLE]
and denote by and the closure of in and , respectively. Then are Hilbert spaces with scalar products respectively.
Let be a real Banach space with the norm . We denote by the standard Banach space of all functions from to , endowed with the norm
[TABLE]
When is a Banach space with the dual space , we will use for the norm in , for the duality pairing between and . In this case, is also a Banach space, with the dual space being , where . The pairing between and is
[TABLE]
To deal with the time derivative in the state equation, we introduce the common space of functions whose time derivatives exist as abstract functions
[TABLE]
endowed with the norm
[TABLE]
When is a Hilbert space, and are also Hilbert spaces. We will use the following embedding results:
[TABLE]
We now define the bilinear and trilinear forms and by
[TABLE]
It is easy to check that if then . Hence
[TABLE]
We also define an operator by Denote by the domain of , . We have The norm in is defined by
Lemma 2.1**.**
[TABLE]
2.2. Existence and uniqueness of solutions to the Navier-Stokes-Voigt equations
Definition 2.1**.**
Let be given. A pair is called a weak solution to the system (1.1) on the interval if it fulfills
[TABLE]
Remark 2.1**.**
It is clear that if satisfies (2.2) then satisfies equations
[TABLE]
Conversely, if satisfies (2.3) then there exists a unique such that (2.2) holds.**
Theorem 2.1**.**
[4]** For any and given, problem (2.3) has a unique weak solution belonging to . Furthermore, if then
[TABLE]
where is a constant depending on .
The existence of strong solutions to problem (1.1) is given by the following theorem.
Theorem 2.2**.**
If and then the unique weak solution of (1.1) belongs to . Moreover, if then
[TABLE]
where is a constant depending on .
Proof.
The proof is standard by using the Galerkin method, so we only present here some a priori estimates. Taking in the first equation of (2.3), then integrating from [math] to we get
[TABLE]
Here we have used the identity . The right-hand side can be estimated by
[TABLE]
where depends only on . By integrating by parts, we get from (2.6) that
[TABLE]
So, belongs to and
[TABLE]
Now, taking in the first equation of (2.3), then integrating from [math] to we have
[TABLE]
We have
[TABLE]
From inequality (2.1) and the fact that we deduce that
[TABLE]
Using the estimates above, (2.8) leads to
[TABLE]
Thus we obtain and
[TABLE]
Now, taking in the first equation of (2.3), then integrating from [math] to we have
[TABLE]
Using the same arguments as in (2.9) and (2.10) we get
[TABLE]
From these estimates and (2.7), (2.12) we obtain
[TABLE]
This means that . Using this estimate and (2.11) we get that
[TABLE]
The conclusion that and that is bounded in by a constant depending on are direct consequences of the regular properties of the equation ∎
Denote by the control-to-state mapping:
[TABLE]
From now on, for convenience, we sometimes write as a functional of control variable as follows .
Theorem 2.3**.**
If and in the space , then from the sequence we can extract a subsequence, denoted in the same way, such that in the space .
Proof.
It follows from Theorem 2.2 that the sequence is bounded in the space . Hence we can extract a subsequence converging weakly to some . Then we can easily pass to the limit in (2.3) to show that . ∎
2.3. Optimality conditions
Now, we restate the results obtained in [2] when the set of admissible controls is the box .
Theorem 2.4**.**
The mapping is of class . If we set , then are respectively the unique solutions of the following equations:
[TABLE]
[TABLE]
Furthermore, if then
[TABLE]
where is a constant depending on .
Theorem 2.5**.**
The cost functional is of class . The first and second order derivatives of are given by
[TABLE]
where is a weak solution of the following system
[TABLE]
Remark 2.2**.**
- i.
A triplet is called a weak solution to the system (2.14) on the interval if for every , it fulfills
[TABLE]
- ii.
If is a weak solution of the system (2.14) then for every , satisfies the following equations
[TABLE]
Conversely, if satisfies (2.16) then there exists a unique pair such that (2.15) holds for every .
- iii.
The system (2.14) has a unique weak solution . One can prove that this solution belongs to the space Furthermore, if then
[TABLE]
where is a constant depending on .
Theorem 2.6**.**
Let be a local optimal control with associated state . Then
[TABLE]
where is the adjoint state, i.e. is the unique weak solution of the following system on the interval
[TABLE]
To state the second-order optimality conditions we define the cone of critical directions as follows
[TABLE]
[TABLE]
The following theorem gives the second-order necessary and sufficient optimality conditions.
Theorem 2.7**.**
If be a local solution of problem then
[TABLE]
Conversely, if satisfies
[TABLE]
then there exist and such that
[TABLE]
3. Numerical approximation of the optimal control problem
Let be a family of triangulation of , defined in the standard way. To each element , we denote by and the diameter of the set and diameter of the largest ball contained in . Define the size of the mesh by , i.e. We also assume that the following standard regularity assumptions on the triangulation hold:
- (i)
There exist two positive constants such that and for every and for every
- (ii)
Set and denote by and its interior and its boundary, respectively. We assume that the vertices of placed on the boundary are points of .
Since is convex, from the last assumption we have that is also convex. Moreover, we assume that
[TABLE]
On the mesh we consider two finite dimensional spaces and formed by piecewise polynomials in and vanishing in We make the following assumptions on these spaces:
- (A1)
If then
[TABLE]
- (A2)
If then
[TABLE]
- (A3)
The subspaces and satisfy the inf-sup condition: such that
[TABLE]
where is defined by
[TABLE]
These assumptions are satisfied by the usual finite elements considered in the discretization of Navier-Stokes equations, see [19, Chapter 2].
We also consider a subspace of defined by
[TABLE]
and set
[TABLE]
Now, we consider the discretization in time. Let be a partition of interval . We denote We make the following assumption:
[TABLE]
Given a triangulation of and a grid of points of , we set . We consider the subspace of functions that are piecewise constant in time
[TABLE]
We seek for the discrete controls in the space . An element of this space can be written in the form
[TABLE]
where and are the characteristic functions of and , respectively. Therefore, the dimension of is , where is the number of elements in . In we consider the convex subset
[TABLE]
For each given sequence , we define a function by
[TABLE]
We denote by the set of all functions that are defined by this way.
Now, we consider the numerical discretization of the state equations (2.2). We will use a discontinuous time-stepping Galerkin method, with piecewise constants in time and conforming finite element spaces in space. For , the discrete state equation is given by
[TABLE]
where and is defined in Definition 3.1.
We will prove later that for every , problem (3.2) has a unique solution . Now we can define the discrete control problem as follows
[TABLE]
with
[TABLE]
where satisfies the following condition
[TABLE]
The outline of this section is as follows. In Subsection 3.1, we analyze the discrete state equations (3.2). Then we study the discrete adjoint state equations in Subsection 3.2. Finally, we prove the convergence of solutions to problem and derive the error estimates for the discretization in the last subsection.
3.1. Analysis of the discrete state equations
By a standard argument, using the identify and Brouwer’s fixed-point theorem, one can easily prove that system (3.2) has at least one solution. In this subsection, we will prove that the solution is unique. According to an abstract approximation result (see [19]), for given , , the following problems have unique solutions.
[TABLE]
Here, These results allow us to give the following definition.
Definition 3.1**.**
We define operators
[TABLE]
[TABLE]
We also define by for
Obviously, there exists a constant depending only on such that . Using Theorem 1.1 in [19, Chapter 2], we can easily get the following lemma from assumptions .
Lemma 3.1**.**
For every , , we have
[TABLE]
where is a constant independent of .
Lemma 3.2**.**
There exists a constant independent of such that for every we have
[TABLE]
Proof.
We have
[TABLE]
∎
Lemma 3.3**.**
Let be the unique solution of (2.3). We consider the following system
[TABLE]
where
[TABLE]
This system has a unique solution . Moreover, we have the following properties:
- (1)
* is bounded in * 2. (2)
There exists a constant independent of such that
[TABLE]
[TABLE]
Proof.
The existence and uniqueness of the solution is easily proved by using the Lax-Milgram theorem. We are going to prove the boundedness of . Taking in (3.3) we have
[TABLE]
It follows from Hölder’s inequality that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
In the last estimate, we have used the fact that by Poincaré’s inequality, since . Summarizing the last three estimates leads to
[TABLE]
Combining (3.6) with (3.7), (3.8), (3.9) gives
[TABLE]
Summarizing these estimates from to ( is an arbitrary integer in the set ) we obtain
[TABLE]
which gives the first statement. To prove the second statement, we set
[TABLE]
Since , (3.3) gives
[TABLE]
Replacing by and using the definition of yield
[TABLE]
Taking we have
[TABLE]
Therefore,
[TABLE]
Adding these inequalities for , and noticing that , we have
[TABLE]
This implies that, for every
[TABLE]
by Lemma 3.2. Now, we are going to estimate . We have . Then,
[TABLE]
[TABLE]
for every . This estimate combining with Lemma 3.2, (3.12) imply (3.4). Finally, we prove (3.5). Assume that for some Then
[TABLE]
The first term can be estimated as follows
[TABLE]
This combining with (3.4) implies (3.5).
∎
Theorem 3.1**.**
For every given , (3.2) has a unique solution . Moreover, there exists a constant independent of such that
[TABLE]
[TABLE]
where is the unique solution of (2.3).
Proof.
Set where is the solution of (3.3). Replacing by in (3.2) gives
[TABLE]
Using (3.3) we have
[TABLE]
Combining with (2.2) we get
[TABLE]
Therefore,
[TABLE]
Setting we obtain
[TABLE]
After some algebraic computations we get for every that
[TABLE]
Hence, we get from (3.16) that
[TABLE]
Since and is bounded in , we have
[TABLE]
Putting all these estimates in (3.17) we obtain
[TABLE]
Adding these inequalities for , and noticing that , we get
[TABLE]
Using the discrete Gronwall inequality we have, for every ,
[TABLE]
This together with (3.4) imply (3.14). By a similar argument as in the proof of (3.5) we get (3.15) from (3.14).
To finish the proof, we have to prove the uniqueness of a solution to (3.2). Assume that are two solutions of (3.2). Setting , then we need to prove that . Subtracting (3.2) for and taking we get
[TABLE]
Here, we have used the fact that
[TABLE]
It follows from (3.15) that , where is a constant depending only on . Hence, we can get from (3.18) that
[TABLE]
Hence,
[TABLE]
Adding these estimates for , and noticing that , we get
[TABLE]
Using once again the discrete Gronwall inequality we conclude that ∎
Remark 3.1**.**
According to the proof above, the constants in (3.14) and (3.15) are dependent on , . However, by using Theorem 2.1 and (3.10) we see that if then these constants depend only on , not on .**
Corollary 3.1**.**
Assume that . Denote by the unique solution of (2.3) and by the unique solution of (3.2) corresponding to the control . Then there exists a constant such that
[TABLE]
Moreover, if and in as then
[TABLE]
[TABLE]
Proof.
We have
[TABLE]
From (3.15), (2.5) and Remark 3.1 we have
[TABLE]
In addition, the control-to-state mapping is of class , so we can use mean value theorem, (2.13), and (2.4) to get (3.19).
Next, we are going to prove (3.20). We have
[TABLE]
Since in as we get the boundedness of the sequence in the space . Then, from (3.22) we get that the second term in the right-hand side of (3.23) tends to [math] as . By Theorem 2.3, we can extract from sequence a subsequence denoted in the same way such that
[TABLE]
Since the embedding is compact, we get
[TABLE]
and (3.20) is proved. It follows from (3.24) that in . On the other hand, since is compactly embedded in , then we have
[TABLE]
This together with (3.14) imply (3.21). The proof is complete. ∎
Theorem 3.2**.**
The mapping defined by , the solution of (3.2), is of class . Moreover, is the unique solution of the following problem
[TABLE]
where we have set
Proof.
We consider the mapping defined by , where
[TABLE]
We can easily check that is of class and for an arbitrary we have
[TABLE]
where is defined by
[TABLE]
On the other hand, for every . The proof is a consequence of the implicit function; we need to prove that is an isomorphism for every . Since and are spaces with the same finite dimension, we only need to prove that is injective. Suppose that for some , then (3.26) implies that . Using (3.27) with we have
[TABLE]
Hence,
[TABLE]
Here, the constant depends on and . Again, by using the discrete Gronwall inequality and noticing that , we obtain . ∎
3.2. Analysis of the discrete adjoint state equations
It follows from Theorem 3.2 and the chain rule that the functional is of class , and its derivative is given by
[TABLE]
where and is the solution of (3.25).
To study the discrete adjoint state equation, we are going to introduce the space . For each given sequence , we define a function by
[TABLE]
We denote by the set of all functions that are defined by this way.
Now, we consider the discrete adjoint state equation:
Find such that
[TABLE]
In this system, first we compute from the last equation in (3.28), then we descend in until . We can prove the existence and uniqueness of a solution to (3.28) by a similar way that we did for the system (3.2). Now, we are going to check that (3.28) is actually the discrete adjoint state equation. Indeed, it follows from (3.25) and (3.28) that
[TABLE]
Here, we have used the fact that . Hence,
[TABLE]
The next theorem gives us the error estimates when approximating the adjoint state equation.
Theorem 3.3**.**
Given , let be the solution of (2.2), be the unique weak solution of (2.14), be the associated discrete state, solution of (3.2), and be the associated discrete adjoint state, solution of (3.28). Then is bounded in and there exists a constant independent of such that
[TABLE]
Proof.
Define the operator by
[TABLE]
where is given in Definition 3.1. Analogously to Lemma 3.2 we have
[TABLE]
for every . Set
[TABLE]
From (3.30) we have
[TABLE]
Also we have . Since , it follows from (2.14) and (3.28) that
[TABLE]
Here, we have used the fact that . Now, replacing by , by and taking into account that
[TABLE]
we obtain
[TABLE]
Hence,
[TABLE]
The right-hand side of (3.32) can be estimated as follows
[TABLE]
[TABLE]
[TABLE]
For the last term in the right-hand side of (3.32), we first see that
[TABLE]
The first two terms in (LABEL:ADE6) can be treated analogously as in (3.33). For the last we have
[TABLE]
From (3.32)-(3.35) we get that
[TABLE]
Set , , then (3.36) gives
[TABLE]
Adding this inequality from to we have
[TABLE]
Using the discrete Gronwall inequality we have, for every ,
[TABLE]
Hence,
[TABLE]
Now, we are going to estimate . Set
[TABLE]
Replacing by in the last equation in (3.28) we have
[TABLE]
Replacing by , by and notice that , we get
[TABLE]
This implies that
[TABLE]
Hence,
[TABLE]
This combining with (3.14), (3.31), (3.37) imply that
[TABLE]
We have
[TABLE]
for every Since we get
[TABLE]
Now, assume that , then
[TABLE]
Analogously as in the last paragraph in the proof of Lemma 3.3 we have
[TABLE]
then we get (3.29). ∎
Remark 3.2**.**
According to the proof above, the constant in (3.29) depends on , . However, we see that if then this constant depends only on , not on .**
Corollary 3.2**.**
Assume that . Let be the solution of (2.15) and be the solution of the discrete equation (3.28) corresponding to the control . Then there exists a constant such that
[TABLE]
Proof.
From (3.29) we have
[TABLE]
where depends on . Setting , then from (2.16) we get
[TABLE]
Taking and using the following identities
[TABLE]
[TABLE]
we obtain
[TABLE]
Integrating from to then integrating by parts yields
[TABLE]
Using again (2.16) we have
[TABLE]
Therefore,
[TABLE]
where is a constant depending only on . Hence, we get from (3.40) that
[TABLE]
since . In addition, we have
[TABLE]
[TABLE]
Therefore,
[TABLE]
This implies that
[TABLE]
by using the Gronwall inequality. Combining this with (3.39) we get (3.38). ∎
3.3. Convergence of the discrete control problem and error estimates
Since is a continuous and coercive function on a non-empty convex closed subset of a finite-dimensional space, it is easy to see that problem has at least one solution. By the similar arguments as in [7, Sections 4.3 and 4.4], we get the following theorems.
The first theorem shows the convergence of these discrete solutions to a solution of problem . The proof of this theorem is exactly that of Theorem 4.13 in [7].
Theorem 3.4**.**
Denote by a global solution of problem . Then the sequence is bounded in and there exist subsequences, denoted in the same way, weakly convergent in the space . If is one of the limit points, i.e. , then is a solution of problem . Moreover, we have
[TABLE]
In general, it is not correct to claim that the sequence is bounded in , because is only defined in . We will prove that is bounded in by a constant independent of . Then, we take an arbitrary element in the space and extend every to by setting for every . By (3.1), the sequence is bounded in and every weak limit point of a subsequence is a solution of , regardless of the choice of .
The next theorem, whose proof is the same that of Theorem 4.15 in [7], is important from a practical point of view because it states that every strict local minimum of problem can be approximated by local minima of problems .
Theorem 3.5**.**
If is a strict local minimum of then there exists a sequence of local minima of problems such that (3.41) holds.
We now denote by a locally optimal control of the problem , and for every , denotes a local solution of such that (see Theorems 3.4 and 3.5). Each element is extended to by setting for . We will also denote by and the state and adjoint state associated to , and by and the discrete state and adjoint state associated to .
We are ready to give space-time error estimates for the discretization.
Theorem 3.6**.**
Suppose that (2.20) holds. Then there exists a constant independent of such that
[TABLE]
Proof.
The estimates (3.43) and (3.44) are an immediate consequence of (3.42), (3.19), and (3.38). We only have to prove (3.42). To this end, we proceed by contradiction and assume that it is false. This implies that
[TABLE]
therefore, there exists a sequence of such that
[TABLE]
Now, arguing exactly as in [7, Section 4.4] and using the second-order optimality conditions, we will obtain a contradiction for this sequence. ∎
Remark 3.3**.**
The error order in the two last estimates in the above theorem looks a bit different from those (of order ) in [7]. The reason is that we do not require the technical condition as in [7], so the error should contain both and . It is obvious that if then these orders of errors are the same.**
Acknowledgements. This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 101.02-2018.303.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. Abergel and R. Temam, On some control problems in fluid mechanics, Theor. Comput. Fluid Dyn. 1 (1990), 303-325.
- 2[2] C.T. Anh and T.M. Nguyet, Optimal control of the instationary 3D Navier-Stokes-Voigt equations, Numer. Funct. Anal. Optim. 37 (2016), 415-439.
- 3[3] C.T. Anh and T.M. Nguyet, Time optimal control of the unsteady 3D Navier-Stokes-Voigt equations, Appl. Math. Optim. 79 (2019), 397-426.
- 4[4] C.T. Anh and P.T. Trang, Pull-back attractors for three-dimensional Navier-Stokes-Voigt equations in some unbounded domains, Proc. Roy. Soc. Edinburgh Sect. A 143 (2013), 223-251.
- 5[5] C.T. Anh and P.T. Trang, Decay rate of solutions to the 3D Navier-Stokes-Voigt equations in H m superscript 𝐻 𝑚 H^{m} space, Appl. Math. Lett. 61 (2016), 1-7.
- 6[6] Y. Cao, E. M. Lunasin and E.S. Titi, Global well-posedness of the three-dimensional viscous and inviscid simplified Bardina turbulence models, Commun. Math. Sci. 4 (2006), 823-848.
- 7[7] E. Casas and K. Chrysafinos, A discontinuous Galerkin time-stepping scheme for the velocity tracking problem, SIAM J. Numer. Anal. 50 (2012), 2281-2306.
- 8[8] E. Casas and K. Chrysafinos, Error estimates for the discretization of the velocity tracking problem, Numer. Math. 130 (2015), 615-643.
