A two-grid Adaptive Finite Element Method for the Dirichlet Boundary Control Problem Governed by Stokes Equation
Thirupathi Gudi
Department of Mathematics, Indian Institute of Science, Bangalore - 560012, India
[email protected] and Ramesh Ch. Sau
Department of Mathematics, Chinese University of Hong Kong, Hong Kong
[email protected]
Abstract.
In this article, we derive a posteriori error estimates for the Dirichlet boundary control problem governed by Stokes equation. An energy-based method has been deployed to solve the Dirichlet boundary control problem. We employ an inf-sup stable finite element discretization scheme by using elements(in the fine mesh) for the velocity and control variable and elements(in the coarse mesh) for the pressure variable. We derive an a posteriori error estimator for the state, adjoint state, and control error. The control error estimator generalizes the standard residual type estimator of the unconstrained Dirichlet boundary control problems, by additional terms at the contact boundary addressing the non-linearity. We prove the reliability and efficiency of the estimator. Theoretical results are illustrated by some numerical experiments.
Key words and phrases:
PDE-constrained optimization; Dirichlet boundary control problem; Finite element method; Error bounds; Stokes equation
1991 Mathematics Subject Classification:
65N30; 65N15; 65N12; 65K10
1. Introduction
The study of the optimal control problems governed by partial differential equations has been a major research area in applied mathematics and its allied areas. The optimal control problem consists of finding an optimal control variable that minimizes a cost functional subject to a partial differential equation satisfied by the optimal control and an optimal state. There are many results on the finite element analysis of optimal control problems, see for example [21, 5, 24, 4]. In an optimal control problem, the control can act on the system through either a boundary
condition or through an interior force. In the latter case, the control is distributed
and in the former case, the control is said to be the boundary control. The choice of the boundary condition leads to several types of boundary controls e.g., Dirichlet, Neumann or Robin boundary control. We refer to [21, 28, 24, 9, 12] for the work related to distributed control and to [5, 4, 9, 12] for the work on Neumann boundary control problem.
The Dirichlet boundary control problems are important in application areas, but the problems can
be difficult to analyze mathematically because in some cases the control itself solves some PDE and in other cases the physical domain has a non-smooth boundary. The study of Dirichlet control problems posed on polygonal
domains can be traced back to [6], where a control constrained problem governed
by a semilinear elliptic equation posed in a convex polygonal domain is studied.
There are various approaches proposed in the literature. One of the popular approach is to seek control from the -space. In this case, the state equation has to be understood in a ultra weak sense, since the Dirichlet boundary condition is only in . This ultra weak formulation is easy to implement
and usually results in optimal controls with low regularity. Especially, when the problem is posed on a convex
polygonal domain, the control vanishes on the corners and is thus continuous. This is because, it is determined
by the normal derivative of the adjoint state, whereas in a nonconvex polygonal domain the control may have singularity around the corner point, for more details one can see [1]. An other approach, as in [7], is the Robin boundary penalization which transforms the
Dirichlet control problem into a Robin boundary control problem.
One other popular approach is to find controls from the energy space, i.e., we refer [30] for this approach. In [30],
the Steklov-Poincaré operator was used to define the cost functional with the help of a harmonic extension of the given boundary data. The Steklov-Poincaré operator transforms the Dirichlet data into a Neumann data by using harmonic extension of the Dirichlet data;
but this type of abstract operator may cause some difficulties in numerical implementation. A boundary element method for this problem is proposed and analyzed in [29].
Given any in the Sobolev space , we can construct a function in the Sobolev space that is harmonic in and agrees with on the boundary . This function is called a harmonic extension of . The norm of in can be equivalently written as the norm of the gradient of in , i.e., This relation suggests that we can penalize the control in the space by adding the term to the cost functional. Therefore, we consider the following optimization problem:
The paper [10] proposed a novel method for the Dirichlet boundary control problem using the above cost functional. The method is based on the energy space, where the control belongs to the Sobolev space . This avoids the use of the Steklov-Poincaré operator and makes the method computationally efficient. The paper [10] only considered the unconstrained case, while the constrained case was analyzed in [19]. The paper [26] presented a similar method based on the energy space. The paper [33] obtained a sharp convergence rate for the energy space method.
The literature on Stokes Dirichlet control problem considers two types of control. One is the tangential control, i.e., the control acts only in the tangential direction of the boundary (see [17]). The paper [17] used a hybridized discontinuous Galerkin (HDG) method to solve a tangential Dirichlet boundary control problem with an penalty on the boundary control, without any constraints on the control. The other is the zero flux control, which means the control has no normal component to the boundary (i.e., ) [18]. The paper [18] studied two different boundary control regularization terms in the cost functionals: the norm and the energy space seminorm. The zero flux condition is a natural consequence of the incompressibility condition and the Dirichlet boundary condition in the PDE. Therefore, the authors either chose the tangential control as the first option or imposed the zero flux condition as a constraint in the space as the second option. Many papers on Navier-Stokes Dirichlet control problem also used either tangential control or zero flux control, for example, see [15, 22]. The zero flux condition on the control affects the regularity of the control as discussed in [18]. To address this issue, we introduced the Stokes equation with mixed boundary conditions and the control acts only on the Dirichlet boundary. Our control is more general and has both tangential and normal components. We also added constraints on the control. As a result, the optimal control satisfies a simplified Signorini problem.
In this article, we propose, analyze, and test a new a posteriori error estimator for the control error. In order to derive and analyze the error estimator for the control variable, we adopt the framework presented
in [27] for Signorini problem, because the control satisfies the Signorini problem. The discrete
problem consists of a discrete variational inequality for the approximate control variable and the estimator is designed for controlling its energy error. The estimator reduces
to the standard residual estimator for elliptic problem, if no contact occurs. The contributions by the estimator addressing the nonlinearity are related to the contact stresses, the
complementarity condition.
We prove reliability and efficiency of the estimator and ensuring the equivalence with the error up to oscillation terms.
A key ingredient of this approach is the so-called Galerkin functional. It is a modification of the residual with
respect to the corresponding linear problem with the help of a suitable approximation of the Lagrange multiplier and thus, may be seen as the residual of a linear auxiliary problem. The correction by the Lagrange multiplier is crucial for sharpness of the upper bounds in the actual contact regions. The theoretical results are
corroborated by a variety of numerical tests
The rest of the article is organized as follows. In Section
2, we formulate the Dirichlet boundary
control problem with pointwise control constraints. Therein, we discuss the well-posedness of the model problem and present the optimality system.
In Section 3, we define the discrete
control problem and present the discrete optimality system. In Section 4, we derive a posteriori error estimates with the help of some reconstruction solution. Section
5 is devoted to the numerical experiments.
2. Continuous Problem
We proceed over the precise formulation of the optimization problem in brief in this section. We need the following definitions and notations before we can begin the analysis:
2.1. Notation
Let be a bounded polygonal domain, with
boundary consists of three non-overlapping open subsets and with . The one-dimensional measure of is positive. We denote any function and any space in bold notation can be understood in the vector form e.g.,
and The norm and inner product on those spaces are defined component wise. Here and throughout, the norm is denoted by
and denotes the standard norm
on the Sobolev space , see for example [11].
The trace of a vector valued function is defined to be where is the
trace operator. Let and are two functions, we say that iff and almost everywhere in
2.2. Dirichlet Control Problem
We consider the following constrained Dirichlet boundary control problem(in energy form [10, Section 2]) governed by the Stokes equation
(2.1)
subject to,
(2.2)
with the control comes from the following constrained set
The interior force the regularization parameter and and the space The constant vectors , and satisfying and . Furthermore whenever is non empty, we assume for consistency that and so that, the admissible set is nonempty.
A proof of the existence of the unique solution of the control problem (2.1) can be found in [20, Theorem 2.2]. The following proposition states the first-order optimality system, a details can be found in [20, Proposition 2.3].
Proposition 2.1.
There exists a unique solution for the
Dirichlet control problem and there exists an adjoint state satisfying
(2.3a)
(2.3b)
(2.3c)
(2.3d)
(2.3e)
(2.3f)
where
, and the matrix product when and
Remark 2.2.
It is not hard to show from the equation (2.3f), that the optimal control is the weak solution of the following simplified Signorini problem:
further, the following holds for almost every :
where
3. Discrete Problem
In this section, we discuss the discrete control problem before this we need to define some notations.
Let be a shape-regular triangulation of the domain into triangles such that see [2, 11]. Also let be a refinement of by connecting all the midpoints of Denote the set of all interior edges of by The set of all Dirichlet, Neumann and Contact boundary edges of are denoted by and respectively and define A typical triangle is denoted by and its
diameter by . Set . The length of any edge will be denoted by . Let denote the set of all the vertices of the triangles in . The set of vertices on and are denoted by and
Also, in the problem setting, we require the jump definitions of scalar, vector valued functions and tensors. Let us define a broken Sobolev space
For any , there are two triangles and such that . Let
be the unit normal of pointing from to and let (cf. Fig.3.1). For any , we define
the jump of on an edge by
where
Figure 3.1. Here and are the two neighboring triangles that share the edge with initial node
and end node and unit normal . The orientation of equals the outer normal of , and hence, points into .
For we define the jump of on by
Similarly, for tensors , the jump on are defined by
For notational convenience, we also define the jump on the boundary faces by modifying them appropriately. We use the definition of jump by understanding that (similarly,
and ).
Define the discrete space for velocity by
and the discrete space for pressure is
and the discrete control space by
where is the space of polynomials of degree less
than or equal to one on the triangle . The discrete
admissible set of controls is defined by
It is easy to check that Throughout the article, we assume that denotes a generic
positive constant that is independent of the mesh parameter . A proof of the following proposition on the existence and uniqueness of the solution of discrete problem can be found in [20, Proposition 3.1].
Proposition 3.1(Discrete Optimality System).
There exists unique
satisfying the following:
(3.1a)
(3.1b)
(3.1c)
(3.1d)
(3.1e)
4. A posteriori Error Analysis
This section is devoted to a posteriori error analysis.
Define reconstructions , and by
(4.1a)
(4.1b)
(4.1c)
(4.1d)
(4.1e)
The well-posedness of the above system (4.1) follows from the facts that
the right-hand side of (4.1a) is a bounded linear functional on , the bilinear forms and are continuous, is elliptic and is inf-sup stable, and hence the system (4.1a)-(4.1b) has a unique solution [16, pp. 81] . Similarly, the system (4.1c)-(4.1d) is well-posed.
Using the fact that
and applying Cauchy-Schwarz inequality in (4.9), we obtain
(4.10)
In the above, we have used the fact that , and Poincaré inequality. Using the estimates of from Theorem 4.1 in (4.10) we obtain the desired result.
∎
In the next theorem we state the estimate of pressure and adjoint pressure the proof can be easily derived by using the inf-sup condition.
Theorem 4.4(Error estimate of pressure and adjoint pressure).
There holds,
and
Combining all the above results, Theorem 4.1-4.4, we obtain the following theorem:
Theorem 4.5.
There holds
Before going to derive the a posteriori error estimator we need to define some preliminary definitions which are given in the following:
Let be a node and be the node patch of and define Denote be the union of all sides of and union of interior sides of are denoted by Given any we subdivide the intersections between and in the three following sets:
We define the discrete contact stress by clearly it is a vector quantity so the sign of this quantity would be in the sense of componentwise. We classify the nodes on as follows.
We classify the actual contact nodes
with in two different categories. At so-called full-contact nodes if the discrete solution satisfies on which means that the conditions of actual contact are satisfied. The
remaining actual contact nodes with are called semi-contact nodes and the set is denoted by
Similarly, we classify the actual contact nodes
with in two different categories. At so-called full-contact nodes if the discrete solution satisfies on which means that the conditions of actual contact are satisfied. The
remaining actual contact nodes with are called semi-contact nodes and the set is denoted by
Also, we define
It is clear that
We define the residual by the following:
Also, for the a posteriori estimator we need to define the the Lagrange multiplier by the following:
Here, denotes the duality pairing between and its dual. Clearly, for all
Define the discrete Lagrange multiplier by the following:
It is clear that, for all and
In order to investigate further, we use the partition of unity and integration by parts
where standard basis of and is the Lagrange basis at node . This motivates the representation
Now for the a posteriori estimator we replace the residual by a Galerkin functional, whose abstract definition is given by
(4.11)
for all where is an approximation of and it depends on the discrete solution, data and reflects the properties of details can be found in [14]. We call it quasi-discrete contact force
density.
By using the partition of unity we have the following definition of for all :
(4.12)
and it adjusts the local contributions so that, on one hand, the Galerkin functional is
prepared for the derivation of an upper bound, and on the other hand, tries to maximize
the cancellation within
For semi-contact nodes we define
where The constant is the nodal value of the discrete contact force density obtained by lumping the boundary mass matrix and is defined below.
Sign of is the following:
i) For with then
ii) For with then
iii) For then
For full-contact nodes we define
where,
We need to specify the choices of for semi- and full-contact nodes.
For full-contact nodes we use
(4.13)
and for full-contact nodes we use
(4.14)
This choice is important for the derivation of the upper bound, see for instance (LABEL:fourth_term) and (LABEL:sixth_term).
For semi-contact nodes we set
(4.15)
where is a strict subset of
Now we are ready to derive the a posteriori error estimators.
Theorem 4.6(A posteriori error estimator).
It holds,
where the estimators are defined as
and
where, and be the identity matrix. and the set is a strict subset of
The a posteriori error analysis in [25, Theorem 3.1] and [3, Section 7] gives the following error estimators of state and adjoint state variables:
(4.17)
(4.18)
We denote the right hand side of (4) by and the right hand side of (4) by The splitting and yields Thus we have estimates for all the last four terms of (4). Therefore we only need to estimate Estimator for the control variable needs some special care.
To find an upper bound of the term
we choose in
(4.11)
(4.19)
Applying the Young’s inequality in (4.19), we get the following estimates:
From the equation (4.22) it is clear that the error in control and contact force densities are bounded by the dual norm of the Galerkin functional and the duality pairing between the contact force densities and the controls.
First, we estimate the term Using the definition of in (4.11), with , we obtain
(4.23)
Here, we set for Dirichlet and Neumann nodes. We exploited for all
non-contact nodes and we inserted the definition
of Inserting definition of and in (4.23), we get
(4.24)
where and
For all nodes we choose the constants
(4.25)
The mean value (4.25) satisfies the following approximation properties:
can be found in [31, Lemma 3.1, Proposition 4.2]. For Dirichlet and Neumann nodes we have at least one edge , where the
test function is zero, therefore we can deduce directly from
the Poincaré-Friedrichs inequality. The above approximation properties hold also for the
constants defined in (4.14), (4.13) and (4.15) see [31, Lemma 3.1, Proposition 4.2].
Using the above estimates and applying the Cauchy-Schwarz inequality in (4) we arrive at
Now, we need to find the upper bound of the term We can write
(4.28)
From the equation (4.1e), we have for all taking we have Thus it is enough to estimate the term From the definition of the quasi discrete contact force density (4.12)-(4.15), we have
(4.29)
We need to bound each term in the right hand side of (4).
First term:
where In the above we exploit and is a constant independent of if is always a fixed fraction of
Second term:
A similar arguments from the first term we have
where
Third term: For full contact nodes we have on which implies on and therefore As further we have
Hence,
Fourth term:
Similar to the third term for we have
and and hence
Therefore
Fifth term:
Here we have used the fact that is piecewise constant on each edge. Since we have and using the definition of from (4.14) we get
Hence,
Sixth term:
Similar to the fourth term for we have and using the definition of from (4.13) we get
Hence,
Using the all the above estimates from First term to Sixth term, in the right hand side of the equation (4), we obtain
(4.30)
Substituting (4.27), (4.28), and (4.30) in the right hand side of (4.22), we obtain the following upper bound of control error:
(4.31)
Denote the right hand side of (4) to be Thus substituting the estimates (4), (4), and (4) in (4), we prove Theorem 4.6.
∎
Remark 4.7.
The term reminds of a complementarity condition. In fact, for a semi-contact node would be a complementarity condition with respect to the quasi-discrete contact force density if was replaced by . Thus we refer to and as complementarity residual and call contact
stress residual. The contributions are localized to semi-contact nodes and nodes which are not actually in contact. In the unconstrained case, we have
and has contributions from all potential contact nodes such that is a residual
error estimator for linear elliptic boundary value problems where the potential contact boundary is replaced by a Neumann boundary with zero Neumann data.
Theorem 4.8(Local Efficiency).
Let be the set of two triangles sharing the edge Then, it hold
(4.32)
(4.33)
Further, for any Neumann boundary edge , it hold
In the contact zone, for
(4.34)
for
(4.35)
for
(4.36)
where oscillation of a given function is defined by
and similarly, we define the oscillation,
Proof.
The local efficiencies in the above theorem can be deduced by the standard bubble function techniques in [32], except the terms (4), (4), and (4). First, we will prove the efficiency (4). We make use of the relation
between the Galerkin functional and the quantity of interest which here is the boundary stress. It directly follows from the definition of the Galerkin functional (4.11), (2.3f) and (4.1e) that
(4.37)
Let be an arbitrary but fixed node. In the following denotes a side
which belongs to . We take the corresponding side bubble function
Test the function in the equation (4.23), we get
(4.38)
If the side is not contained in any patch of semi- or full-contact nodes , the
two last terms are zero and we can proceed similar to the case of (4.32) and (4.33).
Otherwise, in order to get rid of the last two terms, we replace by a suitable function
such that for all semi- and full-contact nodes. The value of
for a semi-contact node depends on which is a strict subset of compare (4.15). If consists of two intervals we choose the inner third of containing as
Figure 4.1. Subgrid of boundary patch
For example
in Fig. 4.1, the dark blue region is for . A side has two nodes .
We denote the sides of the subgrid containing by and the middle part by , see
Fig. 4.1.
For the function we make the following ansatz
(4.39)
where and are side bubble functions to and . The coefficients are determined so that and for full-contact or semi-contact nodes. As is not a full-contact node there is at least one contribution in the right hand side of the first condition. Inserting the ansatz (4.39) in the aforementioned conditions,
we get a solvable system of three equations with three coefficients (degrees of freedom) . At this point the special choice of
as mean value on for semi-contact nodes becomes important because
the choice
as mean value over the whole patch would lead to a
contradiction of the conditions. In the second condition would be replaced by and
the condition for all of the side would imply
such that the first condition could not be fulfilled.
As we assumed that the mesh is made of simplices, is constant on . Consequently, implies and it follows from the first condition
(4.40)
Putting together (4.40), (4.38) with test function instead of and exploiting
the conditions for all contact nodes we end up with
(4.41)
where In the last line of (4.41) we used the properties of the bubble
functions on the subgrid and the fact that is a fixed portion of so that
for a mesh-independent constant . We divide by leading
to
(4.42)
By means of the triangle inequality, the shape-regularity, and the upper bounds (4.37)
and (4.32) of and we get
(4.43)
Similarly, one can derive
(4.44)
Adding (4) and (4), we get the desired result (4).
Now we turn back to the terms (4) and (4).
The proof of both (4) and (4) proceeds similarly so we will give a sketch of the proof of (4) here and details can be found in[27, Sec. 5.2]. To prove (4), we derive a lower bound of the local error in terms of the local contributions of If or for all neighbouring nodes of we
have . Therefore, we assume and for at least one
node on . Let be a node which fulfills for all
neighboring nodes of . Due to we have As we consider
boundary meshes of triangles and intervals the discrete functions are piecewise linear.
Using Taylor series expansion of about we get
(4.45)
where is an edge containing the nodes and and is the unit tangential vector pointing from to The following estimate of (4.45) follows from [27, Sec. 5.2]:
Since, for all , we can conclude that
(4.46)
Now,
Applying Cauchy-Schwarz inequality, (4), (4.32) and (4.33) we obtain
Thus, one can obtain the upper bound of Hence, for we have
The aim of the given section is to numerically illustrate the theoretical results derived in Sections 3 and 4, respectively. We conduct two experiments with two model problems, one is a smooth solution on square mesh the other is a non-smooth solution on a non-convex domain. We construct the model problems with known solutions. The numerical experiments are performed on two model problems using MATLAB(version R2021a) software. For the computational simplicity, we slightly modify the cost functional , denoted by , by
(5.1)
subject to PDE,
(5.2)
the set of controls is given by,
where the space consists of functions with vanishing trace on The function is given, and . Then the minimization problem reads: Find
satisfies (5.2) such that
The corresponding discrete optimality system is given by
(5.3)
where,
and The set is defined by
The discrete control space . We solve the above discrete optimality (5.3) system using primal-dual active set strategy [23, Section 2].
To illustrate the primal-dual active set strategy algorithm, let us define some notations. Let the dimension of and be denoted by and , respectively. Also, let the dimension of discrete pressure space to be Let and denote the set of vertices on and the set of vertices interior to in the fine mesh , respectively. The active and inactive sets corresponding to the bilateral constraints are
where is the iterate of and is the Lagrange multiplier. We denote by , an identity matrix of size . Moreover, denotes the set of all interior nodes in . Let are basis functions of and Also, let are basis function of We define the following matrices and vectors:
Now the primal-dual active set algorithm for the Dirichlet boundary control problem (5.1) reads as:
Step 1.:
Initialize and set .
Step 2.:
Set the active and inactive sets ().
Step 3.:
Solve
Step 4.:
Stop using the criterion and or for , or set and return to Step 2.
In each of our model problems, we compute the error and estimator, which are defined as follows:
For the adaptive algorithm, we use the following paradigm:
First, we compute the discrete solutions () using the above-described primal-dual active set algorithm. Then in the second step using the discrete solution, we compute the error estimator (Estimator = ) over each element. We use the Dörlfer marking technique [13] with bulk parameter for the mark step. Then the marked elements are refined using the newest vertex bisection algorithm [8] to obtain a new mesh and the algorithm is repeated. The convergence rate for Estimator is defined as follows:
for , where and denotes the estimator and number of degrees of freedom at th level respectively. Similarly, one can define the rate of convergence for Error.
Example 5.1.
In this example we consider the optimal control problem (5.1) with the computational domain and . We choose the constants and The state and adjoint state variables are given by
and
We choose and such that and The data of the problem are chosen such that .
We have used the above-described primal-dual active set algorithm to solve the optimal control problem. Figure 5.1(A) and Figure 5.1(B) show the coarse and refine meshes respectively. Figure 5.1(C) shows the convergence of error and estimator in terms of the number of degrees of freedom. It is clear from Figure 5.1(C), that the Estimator and the Error show the optimal rate of convergence. Here the optimal rate of convergence means the rate of convergence is with respect to the number of degrees of freedom().
(a)Coarse mesh
(b)Refined mesh
(c)Convergence history (unit square domain)
Figure 5.1.
Example 5.2.
In this example we consider the optimal control problem (5.1) with the L-shaped domain , and the exact solutions
where
and and . The adjoint variables are considered the same as in Example 5.1. The data of the problem is chosen such that . The constants and
This problem is defined on the L-shaped domain, and the derivative of the solution has a singularity at the origin. It is well known that for this problem the uniform refinements will not provide an optimal convergence rate. We have a similar observation from Figure 5.2, for uniform refinements convergence rate with respect to the number of degrees of freedom () is Hence, one can use the adaptive algorithm to improve the convergence rate. Figure 5.3(A) and Figure 5.3(B) show the adaptive coarse and refined meshes respectively. Figure 5.3(C) shows the adaptive convergence of error and estimator in terms of the number of degrees of freedom(). We see that the convergence rate has been improved from (Figure 5.2) to (Figure 5.3(C)). Thus the optimal convergence is achieved using the adaptive algorithm for the error in energy norm in the state and adjoint state velocity, control approximation, in norm of pressure and adjoint pressure variables. Hence, the optimal convergence for the a posteriori
estimator(Estimator) and the total error(Error), which are defined in (5.5) and (5.6). Here, the optimal convergence means the rate of convergence is with respect to the number of degrees of freedom().
Figure 5.2. Convergence history on uniform mesh (L-shape domain).
(a)Adaptive coarse mesh
(b)Adaptive refine mesh
(c)Convergence history(L-shape domain)
Figure 5.3.
6. Conclusions
In this article, we propose, analyze, and test an a posteriori error estimator for the Dirichlet boundary control problem governed by Stokes equation. We develop an inf-sup stable finite element discretization scheme by using elements(in the fine mesh) for the velocity and control variable and elements(in the coarse mesh) for the pressure variable. The optimal control satisfies a bilateral Signorini contact problem, thus the discrete optimality system consists of a discrete variational inequality for the approximate control variable. We derive and analyze the error estimator for the control variable and the estimator is designed for controlling its energy error. The estimator reduces to the standard residual estimator for elliptic problem, if no contact occurs. The contributions by the estimator addressing the nonlinearity are related to the contact stresses and the complementarity condition.
We prove the reliability and efficiency of the estimator and ensure the equivalence with the error up to oscillation terms. Our numerical experiments confirm the theoretical results.
References
Apel et al. [2015]
T. Apel, M. Mateos, J. Pfefferer, and A. Rösch.
On the regularity of the solutions of Dirichlet optimal control
problems in polygonal domains.
SIAM J. Control Optim., 53(6):3620–3641,
2015.
Brenner and Scott [2008]
S. C. Brenner and L. R. Scott.
The mathematical theory of finite element methods.
Texts in Applied Mathematics. Springer, New York, third edition,
2008.
Carstensen et al. [2012]
C. Carstensen, M. Eigel, R. H. W. Hoppe, and C. Löbhard.
A review of unified a posteriori finite element error control.
Numer. Math. Theory Methods Appl., 5(4):509–558, 2012.
Casas and Dhamo [2012]
E. Casas and V. Dhamo.
Error estimates for the numerical approximation of Neumann control
problems governed by a class of quasilinear elliptic equations.
Comput. Optim. Appl., 52(3):719–756,
2012.
Casas and Mateos [2008]
E. Casas and M. Mateos.
Error estimates for the numerical approximation of Neumann control
problems.
Comput. Optim. Appl., 39(3):265–295,
2008.
Casas and Raymond [2006]
E. Casas and J.-P. Raymond.
Error estimates for the numerical approximation of Dirichlet
boundary control for semilinear elliptic equations.
SIAM J. Control Optim., 45(5):1586–1611,
2006.
Casas et al. [2009]
E. Casas, M. Mateos, and J.-P. Raymond.
Penalization of Dirichlet optimal control problems.
ESAIM Control Optim. Calc. Var., 15(4):782–809, 2009.
Chen and Zhang [2010]
L. Chen and C. Zhang.
A coarsening algorithm on adaptive grids by newest vertex bisection
and its applications.
J. Comput. Math., 28(6):767–789, 2010.
Chowdhury et al. [2015]
S. Chowdhury, T. Gudi, and A. K. Nandakumaran.
A framework for the error analysis of discontinuous finite element
methods for elliptic optimal control problems and applications to
IP methods.
Numer. Funct. Anal. Optim., 36(11):1388–1419, 2015.
Chowdhury et al. [2017]
S. Chowdhury, T. Gudi, and A. K. Nandakumaran.
Error bounds for a Dirichlet boundary control problem based on
energy spaces.
Math. Comp., 86(305):1103–1126, 2017.
Ciarlet [1978]
P. G. Ciarlet.
The finite element method for elliptic problems.
North-Holland Publishing Co., Amsterdam-New York-Oxford, 1978.
Studies in Mathematics and its Applications, Vol. 4.
Dond et al. [2019]
A. K. Dond, T. Gudi, and R. C. Sau.
An error analysis of discontinuous finite element methods for the
optimal control problems governed by Stokes equation.
Numer. Funct. Anal. Optim., 40(4):421–460, 2019.
Dörfler [1996]
W. Dörfler.
A convergent adaptive algorithm for poisson’s equation.
SIAM Journal on Numerical Analysis, 33(3):1106–1124, 1996.
Fierro and Veeser [2003]
F. Fierro and A. Veeser.
A posteriori error estimators for regularized total variation of
characteristic functions.
SIAM J. Numer. Anal., 41(6):2032–2055,
2003.
Fursikov et al. [1998]
A. V. Fursikov, M. D. Gunzburger, and L. S. Hou.
Optimal Dirichlet control and inhomogeneous boundary value problems
for the unsteady Navier-Stokes equations.
In Control and partial differential equations
(Marseille-Luminy, 1997), volume 4 of ESAIM Proc., pages 97–116.
Soc. Math. Appl. Indust., Paris, 1998.
Girault and Raviart [1979]
V. Girault and P.-A. Raviart.
Finite element approximation of the Navier-Stokes
equations.
Lecture Notes in Mathematics. Springer-Verlag, Berlin-New York, 1979.
Gong et al. [2020a]
W. Gong, W. Hu, M. Mateos, J. R. Singler, and Y. Zhang.
Analysis of a hybridizable discontinuous Galerkin scheme for the
tangential control of the Stokes system.
ESAIM Math. Model. Numer. Anal., 54(6):2229–2264, 2020a.
Gong et al. [2020b]
W. Gong, M. Mateos, J. R. Singler, and Y. Zhang.
Analysis and approximations of Dirichlet boundary control of
Stokes flows in the energy space.
https://arxiv.org/abs/2011.08221., 2020b.
Gudi and Sau [2020]
T. Gudi and R. C. Sau.
Finite element analysis of the constrained Dirichlet boundary
control problem governed by the diffusion problem.
ESAIM Control Optim. Calc. Var., 26:Paper No. 78,
19, 2020.
Gudi and Sau [2023]
T. Gudi and R. C. Sau.
A two level finite element method for Stokes constrained
Dirichlet boundary control problem.
Comput. Math. Appl., 129:126–135, 2023.
Günther and Hinze [2011]
A. Günther and M. Hinze.
Elliptic control problems with gradient constraints—variational
discrete versus piecewise constant controls.
Comput. Optim. Appl., 49(3):549–566,
2011.
Gunzburger et al. [1991]
M. D. Gunzburger, L. S. Hou, and T. P. Svobodny.
Analysis and finite element approximation of optimal control problems
for the stationary Navier-Stokes equations with Dirichlet controls.
RAIRO Modél. Math. Anal. Numér., 25(6):711–748, 1991.
Hintermüller et al. [2002]
M. Hintermüller, K. Ito, and K. Kunisch.
The primal-dual active set strategy as a semismooth newton method.
SIAM Journal on Optimization, 13(3):865–888, 2002.
Hinze [2005]
M. Hinze.
A variational discretization concept in control constrained
optimization: the linear-quadratic case.
Comput. Optim. Appl., 30(1):45–61, 2005.
Houston et al. [2005]
P. Houston, D. Schötzau, and T. P. Wihler.
Energy norm a posteriori error estimation for mixed discontinuous
Galerkin approximations of the Stokes problem.
J. Sci. Comput., 22/23:347–370, 2005.
Karkulik [2020]
M. Karkulik.
A finite element method for elliptic Dirichlet boundary control
problems.
Comput. Methods Appl. Math., 20(4):827–843, 2020.
Krause et al. [2015]
R. Krause, A. Veeser, and M. Walloth.
An efficient and reliable residual-type a posteriori error estimator
for the Signorini problem.
Numer. Math., 130(1):151–197, 2015.
Meyer and Rösch [2004]
C. Meyer and A. Rösch.
Superconvergence properties of optimal control problems.
SIAM J. Control Optim., 43(3):970–985,
2004.
Of et al. [2010]
G. Of, T. X. Phan, and O. Steinbach.
Boundary element methods for Dirichlet boundary control problems.
Math. Methods Appl. Sci., 33(18):2187–2205, 2010.
Of et al. [2015]
G. Of, T. X. Phan, and O. Steinbach.
An energy space finite element approach for elliptic Dirichlet
boundary control problems.
Numer. Math., 129(4):723–748, 2015.
Veeser and Verfürth [2009]
A. Veeser and R. Verfürth.
Explicit upper bounds for dual norms of residuals.
SIAM J. Numer. Anal., 47(3):2387–2405,
2009.
Verfürth [1995]
R. Verfürth.
A Review of A Posteriori Error Estimation and Adaptive Mesh
Refinement Techniques.
Wiley-Teubner, Chichester, 1995.
Winkler [2020]
M. Winkler.
Error estimates for variational normal derivatives and Dirichlet
control problems with energy regularization.
Numer. Math., 144(2):413–445, 2020.