Next Article in Journal
Explosivity and Time-Varying Granger Causality: Evidence from the Bubble Contagion Effect of COVID-19-Induced Uncertainty on Manufacturing Job Postings in the United States
Next Article in Special Issue
Numerical Formulation of Anisotropic Elastoplastic Behavior Coupled with Damage Model in Forming Processes
Previous Article in Journal
A Hierarchical Bayesian Model for Inferring and Decision Making in Multi-Dimensional Volatile Binary Environments
Previous Article in Special Issue
The Effect of Diameter and Position of Transverse Cylindrical Vortex Generators on Heat Transfer Improvement in a Wavy Channel
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Analysis of Fourier Finite Volume Element Method for Dirichlet Boundary Optimal Control Problems Governed by Elliptic PDEs on Complex Connected Domains

School of Mathematical Sciences, Jiangsu Provincial Key Laboratory for Numerical Simulation of Large Scale Complex Systems, Nanjing Normal University, Nanjing 210023, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(24), 4779; https://doi.org/10.3390/math10244779
Submission received: 10 November 2022 / Revised: 9 December 2022 / Accepted: 12 December 2022 / Published: 15 December 2022

Abstract

:
In this research, we investigate an optimal control problem governed by elliptic PDEs with Dirichlet boundary conditions on complex connected domains, which can be utilized to model the cooling process of concrete dam pouring. A new convergence result for two-dimensional Dirichlet boundary control is proven with the Fourier finite volume element method. The Lagrange multiplier approach is employed to find the optimality systems of the Dirichlet boundary optimal control problem. The discrete optimal control problem is then obtained by applying the Fourier finite volume element method based on Galerkin variational formulation for optimality systems, that is, using Fourier expansion in the azimuthal direction and the finite volume element method in the radial direction, respectively. In this way, the original two-dimensional problem is reduced to a sequence of one-dimensional problems, with the Dirichlet boundary acting as an interval endpoint at which a quadratic interpolation scheme can be implemented. The convergence order of state, adjoint state, and Dirichlet boundary control are therefore proved. The effectiveness of the method is demonstrated numerically, and numerical data is provided to support the theoretical analysis.

1. Introduction

Partial differential equations are commonly used to describe two-dimensional plane stable field equations like steady concentration distributions, stable temperature distributions, electrostatic field equations, steady current field equations without rotation, and steady flow equations without rotation [1,2,3,4]. The optimal control problems governed by elliptic partial differential equations also play an important role in physical engineering, biological engineering, and social sciences areas, see [5,6,7,8,9,10]. Since the 1970s, the numerical approximation methods for optimal control problems have all received increasing attention. The main research methods are the finite difference method [11], finite element method [12,13,14,15], finite volume element method [16], and spectral method [17,18,19].
The optimal control problem [6,7] is a mathematical problem in which the minimum value of an objective function is determined under differential equation constraints. Finding a numerical solution is essential because it is challenging to find an analytical solution to a problem of this nature. In this paper, we look at a Dirichlet boundary optimal control problem on a complex connected domain that is governed by elliptic equations. The form is as follows:
min u U a d J y , u : = 1 2 y y d L 2 Ω 2 + α 2 u L 2 Ω 1 2 ,
subject to
Δ y = f , in Ω , y = u , on Ω 1 , y n 2 = 0 , on Ω 2 .
The set Ω R 2 denotes a bounded complex connected domain with boundary Γ = Ω 1 Ω 2 . Equation (2) is a state equation, y is the state variable, u Ω 1 is the Dirichlet boundary control variable, α > 0 is a regularization parameter, and y d H 1 Ω , f H 1 Ω . n 2 is the outer unit normal of the boundary Ω 2 . U a d is the admissible control set which is assumed to be of box type
u U a d : = u H 1 / 2 Ω 1 : u a u u b
with u a < u b denoting constants. The domain is shown as Figure 1.
This optimal Dirichlet boundary control problem can be used to describe the cooling process of concrete dam pouring [20]. Ω 1 is the pipe boundary on which the cold water enters and is therefore a Dirichlet boundary control condition. Ω indicates the region where the cold water acts, and y d is the ideal state; the goal is to control the temperature of the cold water so that the temperature y Ω is infinitely close to y d . Note that there is no heat exchange on Ω 2 and hence a homogeneous Neumann boundary condition.
Dirichlet boundary control problems are more challenging than Neumann control or distributed control problems in general, both theoretically and numerically. However, the Dirichlet situation is attracting an increasing number of researchers. For example, the semilinear elliptic Dirichlet boundary control problem with pointwise control constraints in a convex, polygonal, open domain is studied and the 1 1 / p convergence order of control is derived in [21]. The authors in [22] considered Dirichlet boundary control problems posed on smooth domains and obtained that the error order of control is h | l n h | 1 / 2 . Based on a mixed variation scheme, the authors in [23] used a mixed finite element method to approximate the optimal control problem posed on both polygonal and general smooth domains. The authors in [24] used local mesh refinement toward the boundary by standard finite element discretizations and arrived second-order convergence. [25] also derived second-order convergence for elliptic Dirichlet boundary control but in finite dimensional control space. Numerical analysis for elliptic control problems can be found in [21,26,27,28]. For more details, one may refer to [12,29,30] and the references therein. In addition, for finite element approximations of distributed and Neumann boundary optimal control problems one can see [31,32,33,34,35], and for other numerical methods, one may refer to [36,37,38,39].
The finite volume element method (FVEM) is a discretization technique for partial differential equations. It is widely employed in the numerical approximation of some problems for partial differential equations because of its local conservative property and other appealing properties, such as robustness with unstructured meshes. For instance, the authors in [40] analyzed the spatially semidiscrete piecewise linear finite volume element method for parabolic equations in a convex polygonal domain in the plane. Two-grid finite volume element discretization techniques were presented for the two-dimensional second-order nonself-adjoint and indefinite linear elliptic problems and the two-dimensional second-order nonlinear elliptic problems in [41]. A priori error estimates for a semidiscrete piecewise linear finite volume element approximation to a second-order wave equation in a two-dimensional convex polygonal domain is discussed in [42]. More applications of the finite volume element method can be referred to [43,44,45,46,47,48,49,50] and the references therein.
The combination of the finite volume element method with other numerical methods can generate competitive numerical methods for solving partial differential equation problems. For example, an immersed finite volume element method was used to solve the elliptic interface problems in [51]. A one-parameter family of discontinuous Galerkin finite volume element methods was applied to approximate the solution of a class of second-order linear elliptic problems in [52]. The Fourier finite volume element method was employed to study two-dimensional quasigeostrophic equations on a sphere in [53]. The authors in [54] utilized the Fourier finite volume element method to give the numerical experiments of two classes of Dirichlet and distributed optimal control problems driven by elliptic PDEs on complex connected domains. The main concept behind the Fourier finite volume element approach is to employ the finite volume element method in the radial direction while applying the Fourier expansion in the azimuthal direction. In the radial direction, choose linear finite element and piecewise constant function spaces for the trial and test function spaces, respectively. The control for the variational inequality is generated employing a variational discretization technique (see [55]). As a result, the two-dimensional optimal control problem can be simplified to a sequence of one-dimension problems. A desired result can be obtained by this procedure.
Generally, the Dirichlet boundary optimal control problem is typically challenging to achieve a high order in two-dimensional environments. The purpose of this article is to provide a related theoretical explanation of this problem, as a prior work on numerical simulation [54] demonstrates that the Fourier finite element approach can reduce the error order of Dirichlet boundary control on complex connected domains. In addition, it is worth noting that, in contrast to [25], the Dirichlet boundary control space in this work possesses infinite dimensions.
To the best of our knowledge, this is the first study to estimate the convergence order of the Dirichlet boundary control problem using the Fourier finite volume element approach on complex connected domains. The error of Dirichlet boundary control consists of two parts: The Fourier truncation error and the one-dimensional finite volume element error. The Fourier finite volume element approach is applied to reduce a two-dimensional optimal control problem to a group of one-dimensional problems, with the Dirichlet boundary acting as an interval endpoint at which a quadratic interpolation scheme can be implemented so that Dirichlet boundary control can be reached to higher order convergence. It is pointed out here that this proving method can also be extended to the parabolic problem.
The outline for this paper is provided below. In Section 2, we deduce the optimal control problem and corresponding optimality conditions. In order to solve the elliptic problem, the Fourier finite volume element method is introduced in Section 3. In Section 4, the Fourier finite volume element method is used to demonstrate the convergence order of the Dirichlet boundary control. A few examples are given in Section 5 to help illustrate the theoretical analysis. Some recommendations are made toward the end of Section 6.

2. Optimality System

For m 0 and 1 s , applying the standard notation W m , s for Sobolev space on Ω with | | · | | m , s , Ω and denoting by H m Ω with norm | | · | | m , Ω and seminorm | · | m , Ω for s = 2 . That is,
W m , s Ω : = v L s Ω , | D α v L s Ω , α Z + n , α m ,
and
v W m , s Ω = α m Ω D α v s d x 1 s , v W m , s Ω = α = m Ω D α v s d x 1 s ,
where D α v denotes the α -th order weak derivative of v.
We use · , · for the L 2 Ω -inner product, · , · Ω 1 for the L 2 Ω 1 -inner product, · , · Q for the L 2 Q -inner product, · , · Γ 1 for the L 2 Γ 1 -inner product, and · , · I for the L 2 I -inner product.
Let Y : = v H 1 Ω , v | Ω 1 = u and V : = v H 1 Ω , v | Ω 1 = 0 ; the weak formulation of the state Equation (2) reads: find y Y such that
a y , v = f , v , v V ,
where the bilinear form a · , · is given by
a y , v = Ω y · v d x .
Then, the optimal control problem (1) and (2) can be described as: Find y , u Y × U a d
P min u U a d J y , u : = 1 2 y y d L 2 Ω 2 + α 2 u L 2 Ω 1 2 , s . t . a y , v = f , v , v V .
Suppose that y ¯ , u ¯ is the optimal solution. This is due to the fact that the control problem is strictly convex and satisfies the existence and uniqueness requirements of the solution in the constrained state Equation (2). Then, using the Lagrange multiplier method [5,7] to construct Lagrange function
L y , u , p = J y , u Ω Δ y f p d x Ω 1 y u p d s Ω 2 y n 2 p d s .
We take the  Fréchet  derivative with respect to the state  y and choose a special  p u , such that
L y y u , u , p = 0 .
The adjoint state equation can be obtained as follows:
Δ p = y ¯ y d , in Ω , p = 0 , on Ω 1 , p n 2 = 0 , on Ω 2 .
The weak form of the adjoint state equation reads:
a p , v = y ¯ y d , v , v V .
We take the Fréchet derivative with respect to u. Then, the variation inequality, that is, the optimality condition is obtained:
α u ¯ p ¯ n 1 , u u ¯ Ω 1 0 , u U a d ,
where p ¯ is the solution of adjoint state Equation (6) and n 1 is the outer unit normal of the boundary Ω 1 .
That is, the necessary and sufficient condition for control u ¯ U a d to be optimal is that it satisfies the variation inequality (8).                                                                                                                                                         
Taken together, the following theorem holds.
Theorem 1 
([56]). Assuming that the objective functional is in the form of (1), the optimal control of the problem P exists and is unique, and the control u U a d is determined by the solution { y ¯ , p ¯ , u ¯ } of the optimality system, that is,
a y ¯ , v = f , v , v V ,
a p ¯ , w = y ¯ y d , w , w V ,
α u ¯ p ¯ n 1 , u u ¯ Ω 1 0 , u U a d .
If y H 2 Ω and p H 2 Ω , then the optimality systems (9) can be written by
Δ y ¯ = f , Δ p ¯ = y ¯ y d , in Ω , y ¯ = u ¯ , p ¯ = 0 , on Ω 1 , y ¯ n 2 = 0 , p ¯ n 2 = 0 , on Ω 2 , Ω 1 α u ¯ p ¯ n 1 u u ¯ d s 0 , u U a d .
The variation inequality (8) is equivalent to
u ¯ = P U a d 1 α p ¯ n 1 | Ω 1 ,
and the action of the orthogonal projection P U a d : H 1 / 2 Ω 1 U a d is given by
P U a d g x = max u a , min g x , u b .
Then, the optimality system (9) can be written as
a y ¯ , v = f , v , v V ,
a p ¯ , w = y ¯ y d , w , w V ,
u ¯ = P U a d 1 α p ¯ n 1 | Ω 1 .

3. Fourier Finite Volume Element Method

3.1. Polar Coordinates Transform

Given the definition of the arbitrary bounded annular domain
Ω = x 1 , x 2 : g 1 x 1 , x 2 x 1 2 + x 2 2 g 2 x 1 , x 2 ,
where g 1 and g 2 are the functions defined on Ω ¯ satisfying
Ω 1 = x 1 , x 2 : x 1 2 + x 2 2 = g 1 x 1 , x 2 , Ω 2 = x 1 , x 2 : x 1 2 + x 2 2 = g 2 x 1 , x 2 ,
let x 1 = r c o s θ and x 2 = r s i n θ , then, in the polar coordinates r , θ ,
Ω 1 Γ 1 : r = R 1 θ , Ω 2 Γ 2 : r = R 2 θ , θ 0 , 2 π ,
x 1 = c o s θ r s i n θ r θ , x 2 = s i n θ r + c o s θ r θ .
The Laplacian operator Δ in the polar coordinates is
Δ = 2 r 2 + 1 r r + 1 r 2 2 θ 2 ,
and
n 1 = cos θ + R 1 θ R 1 θ sin θ 1 + R 1 θ R 1 θ 2 , sin θ R 1 θ R 1 θ cos θ 1 + R 1 θ R 1 θ 2 , n 2 = cos θ + R 2 θ R 2 θ sin θ 1 + R 2 θ R 2 θ 2 , sin θ R 2 θ R 2 θ cos θ 1 + R 2 θ R 2 θ 2 ,
y x 1 , x 2 n 1 = y x 1 , x 2 x 1 , y x 1 , x 2 x 2 · n 1 = y r cos θ , r sin θ r R 1 θ R 1 2 θ y r cos θ , r sin θ θ 1 + R 1 θ R 1 θ 2 ,
where n 1 denotes the outer unit normal of the boundary Γ 1 .
Assumption A1. 
There exist positive constants γ 1 , γ 2 , γ 3 and γ 4 such that
0 < γ 1 R 1 ( θ ) < R 2 ( θ ) γ 2 < ,
R 1 ( θ ) γ 3 < , R 2 ( θ ) γ 4 < .
Setting y : = y r , θ , f : = f r , θ , y d : = y d r , θ , on the boundary u = u θ | Γ 1 . The form of (2) in polar coordinates is
2 y r 2 + 1 r y r + 1 r 2 2 y θ 2 = f , in Q , y = u , on Γ 1 , y r R 2 θ R 2 2 θ y θ 1 + R 2 θ R 2 θ 2 = 0 , on Γ 2 ,
where Q = R 1 θ , R 2 θ × 0 , 2 π .
Remark 1. 
The boundary condition on Γ 2 of (11) can be written as y r = 0 , R 2 θ R 2 2 θ y θ = 0 , the derivation process will be given later.
Let Y f : = v H 1 Q , v | Γ 1 = u θ , U a d f : = u H 1 / 2 Γ 1 : u a u u b , V f : = v H 1 Q , v | Γ 1 = 0 . Define that
v L 2 ( Q ) = v , v Q 1 2 : = 0 2 π R 1 θ R 2 θ r v r , θ 2 d r d θ 1 2 , v V f ,
u L 2 ( Γ 1 ) = u , u Γ 1 1 2 : = 0 2 π R 1 θ u R 1 θ , θ 2 d θ 1 2 , u U a d f .
Obviously, there holds that v r , θ L 2 ( Q ) = v x 1 , x 2 L 2 ( Ω ) , u R 1 θ , θ L 2 ( Γ 1 ) = u x 1 , x 2 L 2 ( Ω 1 ) .
In the polar coordinates, the optimal control problem (4) can be redescribed as: Find y , u Y f × U a d f such that
P r , θ min u U a d f J y , u : = 1 2 y y d L 2 Q 2 + α 2 u L 2 Γ 1 2 , s . t . A y , v = f , v Q , v V f ,
where the bilinear form A · , · and f , v Q are given by
A y , v = Q r y r v r d r d θ Q 1 r 2 y θ 2 v d r d θ ,
f , v Q = Q f v r d r d θ ,
respectively.
The optimality system (9) can be written as
A y ¯ , v = f , v Q , v V f ,
A p ¯ , w = y ¯ y d , w Q , w V f ,
α u ¯ R 1 θ 2 + R 1 2 θ + p ¯ r R 1 θ R 1 2 θ p ¯ θ R 1 θ , u u ¯ Γ 1 0 , u U a d f .

3.2. Fourier Expansion and Truncation

Since the solution y r , θ of (11) is periodic in θ , it can be written as:
y r , θ = | m | = 0 y m r e i m θ ,
where y m r = 1 2 π 0 2 π y r , θ e i m θ d θ .
Taking an truncation [57] to (14),
y f r , θ = | m | = 0 M y m r e i m θ .
Substitute (15) into (11), we can obtain
2 y f r 2 + 1 r y f r + 1 r 2 2 y f θ 2 = f f , in Q , y f = u f , on Γ 1 , y f r = 0 , R 2 θ R 2 2 θ y f θ = 0 , on Γ 2 ,
with f f = | m | = 0 M f m r e i m θ and u f = | m | = 0 M u m r e i m θ .
The optimal control problem P can be redescribed as: Find y f , u f Y f × U a d f such that
P f min u f U a d m J y f , u f : = 1 2 y f y d f L 2 Q 2 + α 2 u f L 2 Γ 1 2 , s . t . A y f , v f = f f , v f Q , v f V f ,
where y d f = | m | = 0 M y d m r e i m θ .
Obviously, (16) can be rewritten as:
d 2 y m d r 2 + 1 r d y m d r m 2 r 2 y m = f m , in Q , y m = u m , on Γ 1 , d y m d r = 0 , R 2 θ R 2 2 θ y m = 0 , on Γ 2 ,
where m = 0 , ± 1 , ± 2 , , ± M .
We now give the process of deriving the boundary conditions on Γ 2 of (11), (16) and (18):
Proof. 
The initial form of the boundary condition on Ω 2 of the Cartesian coordinate system is
y n 2 = 0 , on Ω 2 .
After a polar coordinate transformation, it becomes
y r R 2 θ R 2 2 θ y θ 1 + R 2 θ R 2 θ 2 = 0 , on Γ 2 .
According to Assumption 1, it is the equivalent to
y r R 2 θ R 2 2 θ y θ = 0 , on Γ 2 .
Expanded and truncated by Fourier series, then, we have
y f r R 2 θ R 2 2 θ y f θ = 0 , on Γ 2 ,
namely
| m | = 0 M d y m d r i m R 2 θ R 2 2 θ y m e i m θ = 0 , on Γ 2 .
According to the orthogonality of the trigonometric system and Assumption 1, we derive
0 = 2 π γ 4 γ 2 0 2 π e i m θ e i n θ d θ 0 2 π R 2 θ R 2 2 θ e i m θ e i n θ d θ 2 π γ 4 γ 1 0 2 π e i m θ e i n θ d θ = 0 , n m ,
then, we have
0 2 π d y m d r i m R 2 θ R 2 2 θ y m e i m θ e i m θ d θ = 0 2 π d y m d r i m R 2 θ R 2 2 θ y m d θ = 0 , on Γ 2 .
From R 2 ( 2 π ) = R 2 ( 0 ) 0 , we get
d y m d r = 0 , R 2 θ R 2 2 θ y m = 0 , on Γ 2 .
Thus, we have
y f r = 0 , R 2 θ R 2 2 θ y f θ = 0 , on Γ 2 ,
and
y r = 0 , R 2 θ R 2 2 θ y θ = 0 , on Γ 2 .
   □
Correspondingly, the adjoint state equation of (18) is
d 2 p m d r 2 + 1 r d p m d r m 2 r 2 p m = f m , in Q , p m = 0 , on Γ 1 , d p m d r = 0 , R 2 θ R 2 2 θ p m = 0 , on Γ 2 ,
where m = 0 , ± 1 , ± 2 , , ± M .
The weak forms of (18) and (19) are as follows:
A m y ¯ m , v m = f m , v m Q , v m V f ,
A m p ¯ m , w m = y ¯ m y d m , w m Q , w m V f ,
where f m , v m , w m , p m , y d m are defined like y m with m = 0 , ± 1 , ± 2 , , ± M and the bilinear form A m · , · is given by
A m y m , v m = Q r d y m d r d v m d r d r d θ + Q m 2 r y m v m d r d θ .
From the above, θ 0 , 2 π , and y m r = 1 2 π 0 2 π y r , θ e i m θ d θ . Consider the Fourier interpolation at point θ k = 2 π · k M ( k = 1 , 2 , 3 , · · · , M ) :
y m r = 1 2 π 0 2 π y r , θ e i m θ d θ 1 M k = 1 M y m r , θ k e i m θ k ,
where M is the number of grid lines in the θ direction. It applies to f m , y d m , v m , w m , p m , u m .
Denoting y m k r = y m r , θ k , correspondingly, (15) becomes
y f τ = | m | = 0 M 1 M k = 1 M y m k r e i m θ k e i m θ ,
where y f τ is the approximation of y f and the definition of f f τ and y d f τ are similar.

3.3. Finite Volume Element Method

For any fixed k = 1 , 2 , · · · , M , Γ 1 = R 1 θ × ( 0 , 2 π ) becomes to Γ 1 k = R 1 θ k , Γ 2 = R 2 θ × ( 0 , 2 π ) to Γ 2 k = R 2 θ k , and I = R 1 θ , R 2 θ to I k = R 1 θ k , R 2 θ k . Let Y m k : = v H 1 I k , v = u m k o n Γ 1 k , U a d m k : = u H 1 / 2 Γ 1 k : u a u u b , V m k : = v H 1 I k , v = 0 o n Γ 1 k , and Y f τ : = k = 1 M Y m k , U a d f τ : = k = 1 M U a d m k , V f τ : = k = 1 M V m k . Define some norms and seminorm as follows:
v L 2 I k = v , v I k 1 2 : = R 1 θ k R 2 θ k r v 2 d r 1 2 , v V m k ,
v H 1 I k = v r , v r I k 1 2 : = R 1 θ k R 2 θ k r v r 2 d r 1 2 , v V m k ,
respectively, and v H 1 I k 2 = v L 2 I k 2 + v H 1 I k 2 , v V m k .
u L 2 Γ 1 k = u , u Γ 1 k 1 2 : = R 1 θ k u R 1 θ k , θ k 2 1 2 , u U a d m k .
It is easy to prove that these norms are well defined. There holds:
v f τ L 2 Q , τ = 1 M k = 1 M v L 2 I k 2 1 2 , v f τ Y f τ ,
u f τ L 2 Γ 1 , τ = 1 M k = 1 M u L 2 Γ 1 k 2 1 2 , u f τ U a d f τ .
The corresponding discrete norms are defined as follows:
v h L 2 I k = v h , v h I k 1 2 : = i = 1 N r i 1 θ k r i θ k r v h 2 d r 1 2 , v h Y m k h ,
u h L 2 Γ 1 k = u h , u h Γ 1 k 1 2 : = R 1 θ k u h | R 1 θ k , θ k 2 1 2 , u h U a d m k .
There holds:
v f h L 2 Q , τ = 1 M k = 1 M v h L 2 I k 2 1 2 , v f h Y f τ h ,
u f h L 2 Γ 1 , τ = 1 M k = 1 M u h L 2 Γ 1 k 2 1 2 , u f h U a d h .
The definition of discrete functions and discrete spaces will be given later.
The cost functional with state Equation (18) becomes an optimal control problem over a one-dimensional fixed interval. From (18), it can be inferred that:
d 2 y m k d r 2 + 1 r d y m k d r m 2 r 2 y m k = f m k , in I k = R 1 θ k , R 2 θ k , y m k = u m k , on Γ 1 k , d y m k d r = 0 , R 2 θ k R 2 2 θ k y m k = 0 , on Γ 2 k ,
where m = 0 , ± 1 , ± 2 , , ± M .
The optimality system can be rewritten as:
A m k y ¯ m k , v m k = f m k , v m k I k , v m k V m k ,
A m k p ¯ m k , w m k = y ¯ m k y d m k , w m k I k , w m k V m k ,
α u ¯ m k R 1 θ k 2 + R 1 2 θ k + d p ¯ m k d r R 1 θ k , u m k u ¯ m k Γ 1 k 0 , u m k U a d m k ,
where the bilinear form A m k · , · is given by
A m k y m k , v m k = I k r d y m k d r d v m k d r d r + m 2 I k 1 r y m k v m k d r .
The optimal control problem P f can be redescribed as: Find y f τ , u f τ Y f τ × U a d f τ such that
P f τ min u f τ U a d f τ J y f τ , u f τ : = 1 2 y f τ y d f τ L 2 Q , τ 2 + α 2 u f τ L 2 Γ 1 , τ 2 , s . t . A f τ y f τ , v f τ = f f τ , v f τ Q , τ , v f τ V f τ ,
where y f τ : = | m | = 0 M 1 M k = 1 M y m k r e i m θ k e i m θ , the definition of u f τ , y d f τ , v f τ , f f τ are similar.
For the purpose of finite volume element approximation of (24a), discretizing the interval R 1 θ k , R 2 θ k into a grid T h with nodes
R 1 θ k = r 0 θ k < r 1 θ k < r 2 θ k < < r N 1 θ k < r N θ k = R 2 θ k .
Denoting the mesh size h i θ k = r i θ k r i 1 θ k , and writing I k i = r i 1 θ k , r i θ k . Placing a dual grid T h * with nodes
R 1 θ k = r 0 θ k < r 1 / 2 θ k < r 3 / 2 θ k < < r N 1 / 2 θ k < r N θ k = R 2 θ k ,
write I k i * = r i 1 / 2 θ k , r i + 1 / 2 θ k , I k 0 * = r 0 θ k , r 1 / 2 θ k and I k N * = r N 1 / 2 θ k , r N θ k .
Typical basis function ϕ i r on I k i and ψ j r on I k j * are shown below
ϕ i r = 1 h i 1 r r i θ k , r i 1 θ k r r i θ k , 1 h i + 1 1 r r i θ k , r i θ k r r i + 1 θ k , 0 . e l s e w h e r e .
ψ j r = 1 , r I j * , 0 . r I j * .
Now, let Y m k h be the standard linear finite element space defined on the T h :
Y m k h = v C I k : v | I k is piecewise linear function for all I k T h
and its dual volume element space Y m k h *
Y m k h * = v L 2 I k : v | I k * is piecewise constant function for all I k * T h * .
Obviously, Y m k h = s p a n { ϕ j r } j = 0 N and Y m k h * = s p a n { ψ j r } j = 0 N .
Two interpolation projection operators Π h : Y m k Y m k h and Π h * : Y m k Y m k h * are defined and satisfy Π h * Y m k h = Y m k h * ,
Π h y m k = i = 0 N y m k , i ϕ i r , Π h * v m k = j = 0 N v m k , j ψ j r ,
where y m k , i = y m k r i θ k and v m k , j = v m k r j θ k . Denoting y m k h : = y m k h u m k , the finite volume element approximation corresponding to the state equation in problem P m k is defined by the function y m k h Y m k h such that
A m k y m k h , Π h * v m k = f m k , Π h * v m k I k , y m k h | Γ 1 k = u m k , Π h * v m k Y m k h * ,
where
A m k y m k h , ψ j r = r j 1 / 2 θ k r j + 1 / 2 θ k r d y m k h d r d ψ j r d r d r + m 2 r j 1 / 2 θ k r j + 1 / 2 θ k 1 r y m k h d r = r j 1 / 2 θ k y m k , j y m k , j 1 h j r j + 1 / 2 θ k y m k , j + 1 y m k , j h j + 1 + m 2 ln r j + 1 / 2 θ k ln r j 1 / 2 θ k y m k , j = r j 1 / 2 θ k h j y m k , j 1 r j + 1 / 2 θ k h j + 1 y m k , j + 1 + r j 1 / 2 θ k h j r j + 1 / 2 θ k h j + 1 + m 2 ln r j + 1 / 2 θ k ln r j 1 / 2 θ k y m k , j . f m k , ψ j r I k = r j 1 / 2 θ k r j + 1 / 2 θ k f m k r r d r .
The formulation (28) is reduced to the linear system
K m k y m k h = f m k ,
the elements of K m k with
a j , j = r j 1 / 2 θ k h j + r j + 1 / 2 θ k h j + 1 + m 2 ln r j + 1 / 2 θ k ln r j 1 / 2 θ k , j = 1 , 2 , , N 1 , a 0 , 0 = r 1 / 2 θ k h 1 + m 2 ln r 1 / 2 θ k ln r 0 θ k , a N , N = r N 1 / 2 θ k h N + m 2 ln r N θ k ln r N 1 / 2 θ k , a j , j 1 = r j 1 / 2 θ k h j , j = 1 , 2 , , N , a j , j + 1 = r j + 1 / 2 θ k h j + 1 , j = 0 , 1 , 2 , , N 1 ,
where y m k h = y m k , 0 h , y m k , 1 h , , y m k , N h T , f m k = f m k , 0 , f m k , 1 , , f m k , N T . The numerical solution of the Equation (23) is obtained by solving this linear system.
Now, the optimality system is:
A m k y ¯ m k h , Π h * v m k = f m k , Π h * v m k I k , Π h * v m k Y m k h * ,
A m k p ¯ m k h , Π h * w m k = y ¯ m k h y d m k , Π h * w m k I k , Π h * w m k Y m k h * ,
α u ¯ m k R 1 θ k 2 + R 1 2 θ k + d p ¯ m k h d r R 1 θ k , u m k u ¯ m k Γ 1 k 0 , u m k U a d m k .
Let Y f τ h : = k = 1 M Y m k h , Y f τ h * : = k = 1 M Y m k h * . The semidiscrete optimal control problem can be described as: Find y f τ h , u f τ Y f τ h × U a d f τ such that
P f τ h min u f τ U a d f τ J y f τ h , u f τ : = 1 2 y f τ h y d f τ L 2 Q , τ 2 + α 2 u f τ L 2 Γ 1 , τ 2 , s . t . A f τ y f τ h , Π h * v f τ = f f τ , Π h * v f τ Q , τ , Π h * v f τ Y f τ h * ,
where y f τ h : = | m | = 0 M 1 M k = 1 M y m k h e i m θ k e i m θ , A f τ y f τ h , Π h * v f τ : = | m | = 0 M ( 1 M k = 1 M ( A m k ( y ¯ m k h , Π h * v m k ) ) e i m θ k ) e i m θ .
Last, the variational discretization method is used to discretize u m k , denoting u h : = u m k h , y h : = y m k h u m k h ; then, the optimality system is
A m k y ¯ h , Π h * v m k = f m k , Π h * v m k I k , Π h * v m k Y m k h * ,
A m k p ¯ h , Π h * w m k = y ¯ h y d m k , Π h * w m k I k , Π h * w m k Y m k h * ,
α u ¯ h R 1 θ k 2 + R 1 2 θ k + d p ¯ h d r R 1 θ k , u h u ¯ h Γ 1 k 0 , u h U a d m k .
The full-discrete optimal control problem can be described as: Find y f h , u f h Y f k h × U a d h such that
P f h min u f h U a d h J h y f h , u f h : = 1 2 y f h y d f τ L 2 Q , τ 2 + α 2 u f h L 2 Γ 1 , τ 2 , s . t . A f τ y f h , Π h * v f τ = f f τ , Π h * v f τ Q , τ , Π h * v f τ Y f k h * ,
where U a d h : = U a d f k , y f h : = | m | = 0 M 1 M k = 1 M y h e i m θ k e i m θ and the definition of p f h , u f h are similar.
Theorem 2. 
The discrete optimal control of the problem P f h exists and is unique, and the control u f h U a d h is determined by the solution   y ¯ f h , p ¯ f h , u ¯ f h   of the optimality system, that is,
A f τ y ¯ f h , Π h * v f τ = f f τ , Π h * v f τ Q , τ , Π h * v f τ Y f τ h * ,
A f k p ¯ f h , Π h * w f τ = y ¯ f h y d f τ , Π h * w f τ Q , τ , Π h * w f τ Y f τ h * ,
α u ¯ f h R 1 θ k 2 + R 1 2 θ k + p ¯ f h r R 1 θ k , u f h u ¯ f h Γ 1 , τ 0 , u f h U a d h .

4. A Priori Error Estimates

In this section, the error estimate between continuous optimal control problem P and discrete optimal control problem P f h are obtained.
Here and in what follows, we use “ a b ” to denote that there exists a positive generic constant C, which is independent of M and h, such that “ a C b ”. “ a b ” means that “ a b a ”.
Before giving the main result, some Lemmas need to be listed.
Lemma 1 
([17]). For arbitrary v H l ( ( 0 , 2 π ) ) , l 1 2 ,
v v f τ M l | v | l ,
where v f τ = | m | = 0 M 1 M k = 1 M v m k r e i m θ k e i m θ .
From the results of [16], we can derive the next two Lemmas similarly.
Lemma 2. 
It holds
A m k y m k h , Π h * v m k h y m k h H 1 I k v m k h H 1 I k , y m k h , v m k h Y m k h .
A m k y m k h , Π h * y m k h y m k h H 1 I k 2 , y m k h Y m k h .
Lemma 3. 
It holds
y m k h , Π h * v m k h I k = v m k h , Π h * y m k h I k , y m k h , v m k h Y m k h .
A m k y m k h , Π h * v m k h = A m k v m k h , Π h * y m k h , y m k h , v m k h Y m k h .
Set y m k h = y m k h , Π h * y m k h L 2 I k 1 / 2 , then · is equivalent to · I k on Y m k h , that is
y m k h L 2 I k y m k h y m k h L 2 I k , y m k h Y m k h .
Lemma 4. 
Let y ¯ m k H 2 I k be the solution of Equation (23) and y ¯ m k h Y m k h be the solution of Equation (28); then, the following estimate holds:
y ¯ m k y ¯ m k h H 1 I k h y ¯ m k H 2 I k .
The proof refers to [16].
Lemma 5 
([58]). Let y ¯ m k h Y m k h be the solution of Equation (28), and y ¯ m k be the solution of Equation (23) with y ¯ m k Y m k H 2 I k , and y ¯ m k H 2 I k , f m k H 1 I k ; then, the following estimate holds:
y ¯ m k y ¯ m k h L 2 I k h 2 y ¯ m k H 2 I k + f m k H 1 I k .
The proof refers to Theorem 3.5 in [58].
Remark 2. 
Similarly, for p ¯ m k h Y m k h and p ¯ m k Y m k H 2 I k as the solution of corresponding adjoint state equation of (28) and (23), respectively, and y d m k H 1 I k , it holds
p ¯ m k p ¯ m k h L 2 I k h 2 p ¯ m k H 2 I k + y ¯ m k y d m k H 1 I k .
Lemma 6 
([7]). Let y ¯ m k , u ¯ m k , p ¯ m k Y m k × U a d m k × V m k be the solutions of (24), ( y ¯ h , u ¯ h , p ¯ h ) Y m k h × U a d m k × Y m k h be the solutions of (32) and y ¯ m k h , p ¯ m k h Y m k h × Y m k h be the solution of (30), respectively. Then, the following estimates hold
R 1 θ k d p ¯ h d r d p ¯ m k d r , u ¯ m k u ¯ h Γ 1 k y ¯ m k h y ¯ h L 2 I k 2 + y ¯ m k h y ¯ m k L 2 I k 2 ,
α c 0 u ¯ m k u ¯ h L 2 Γ 1 k 2 + y ¯ m k h y ¯ h L 2 I k 2 u ¯ m k u ¯ h L 2 Γ 1 k d p ¯ m k d r d p ¯ m k h d r L 2 Γ 1 k + y ¯ m k y ¯ m k h L 2 I k 2 ,
where c 0 = min k = 1 , 2 , 3 , , L R 1 θ k 2 + R 1 2 θ k .
Proof. 
We first show (44). Using Π h * p ¯ m k h and Π h * p ¯ h time the state equations about y ¯ m k h and y ¯ h , Π h * y ¯ m k h and Π h * y ¯ h time the adjoint state equations about p ¯ m k h and p ¯ h and integrate on interval I k , respectively, we can obtion that
A m k y ¯ m k h , Π h * p ¯ m k h = f m k , Π h * p ¯ m k h I k , A m k p ¯ m k h , Π h * y ¯ m k h = y ¯ m k y d m k , Π h * y ¯ m k h I k d p ¯ m k h d r , u ¯ m k R 1 θ k Γ 1 k ,
A m k y ¯ m k h , Π h * p ¯ h = f m k , Π h * p ¯ h I k , A m k p ¯ h , Π h * y ¯ m k h = y ¯ h y d m k , Π h * y ¯ m k h I k d p ¯ h d r , u ¯ m k R 1 θ k Γ 1 k ,
A m k y ¯ h , Π h * p ¯ m k h = f m k , Π h * p ¯ m k h I k , A m k p ¯ m k h , Π h * y ¯ h = y ¯ m k y d m k , Π h * y ¯ h I k d p ¯ m k h d r , u ¯ h R 1 θ k Γ 1 k ,
A m k y ¯ h , Π h * p ¯ h = f m k , Π h * p ¯ h I k , A m k p ¯ h , Π h * y ¯ h = y ¯ h y d m k , Π h * y ¯ h I k d p ¯ h d r , u ¯ h R 1 θ k Γ 1 k .
From Lemma 3 and the above four formulas, it can be deduced that
f m k , Π h * p ¯ m k h I k y ¯ m k y d m k , Π h * y ¯ m k h I k + d p ¯ m k h d r , u ¯ m k R 1 θ k Γ 1 k = 0 , f m k , Π h * p ¯ h I k y ¯ h y d m k , Π h * y ¯ m k h I k + d p ¯ h d r , u ¯ m k R 1 θ k Γ 1 k = 0 ,
f m k , Π h * p ¯ m k h I k y ¯ m k y d m k , Π h * y ¯ h I k + d p ¯ m k h d r , u ¯ h R 1 θ k Γ 1 k = 0 , f m k , Π h * p ¯ h I k y ¯ h y d m k , Π h * y ¯ h I k + d p ¯ h d r , u ¯ h R 1 θ k Γ 1 k = 0 .
Then, from the above two formulas, we have
f m k , Π h * p ¯ m k h p ¯ h I k y ¯ m k y ¯ h , Π h * y ¯ m k h I k + d p ¯ m k h d r d p ¯ h d r , u ¯ m k R 1 θ k Γ 1 k = 0 , f m k , Π h * p ¯ m k h p ¯ h I k y ¯ m k y ¯ h , Π h * y ¯ h I k + d p ¯ m k h d r d p ¯ h d r , u ¯ h R 1 θ k Γ 1 k = 0 .
Subtracting the two equations in (52), we can derive that
y ¯ m k y ¯ h , Π h * y ¯ m k h y ¯ h I k + d p ¯ h d r d p ¯ m k h d r , u ¯ m k u ¯ h R 1 θ k Γ 1 k = 0 .
Hence, using Young’s inequality and the definition of · , we have
R 1 θ k d p ¯ h d r d p ¯ m k h d r , u ¯ m k u ¯ h Γ 1 k = y ¯ h y ¯ m k , Π h * y ¯ m k h y ¯ h I k = y ¯ h y ¯ m k h , Π h * y ¯ m k h y ¯ h I k + y ¯ m k h y ¯ m k , Π h * y ¯ m k h y ¯ h I k ε · c Π h * y ¯ m k h y ¯ h L 2 ( I k ) 2 + C ( ε ) y ¯ m k y ¯ m k h L 2 ( I k ) 2 y ¯ h y ¯ m k h 2 ε · c Π h * y ¯ m k h y ¯ h L 2 ( I k ) 2 + C ( ε ) y ¯ m k y ¯ m k h L 2 ( I k ) 2 y ¯ h y ¯ m k h L 2 ( I k ) 2 ,
where c > 0 is a bounded constant. Let ε 0 , we complete the proof of (44).
Next, we show (45). Let u m k = u ¯ h in (24c) and u h = u ¯ m k in (32c), respectively. Then, adding the two inequalities, we obtain
α R 1 θ k 2 + R 1 2 θ k u ¯ m k u ¯ h L 2 Γ 1 k 2 R 1 θ k d p ¯ h d r d p ¯ m k d r , u ¯ m k u ¯ h Γ 1 k .
According to (44) and Cauchy inequality, we get
R 1 θ k d p ¯ h d r d p ¯ m k d r , u ¯ m k u ¯ h Γ 1 k = R 1 θ k d p ¯ h d r d p ¯ m k h d r , u ¯ m k u ¯ h Γ 1 k + R 1 θ k d p ¯ m k h d r d p ¯ m k d r , u ¯ m k u ¯ h Γ 1 k y ¯ m k y ¯ m k h L 2 ( I k ) 2 y ¯ h y ¯ m k h L 2 ( I k ) 2 + u ¯ m k u ¯ h L 2 Γ 1 k d p ¯ m k h d r d p ¯ m k d r L 2 Γ 1 k .
Combining (55) and (56), we complete the proof.    □
Lemma 7. 
Let the conditions of Lemma 6 be fulfilled, also, p ¯ m k H 2 + β I k , 1 2 < β < 1 . Then, there holds
d p ¯ m k d r d p ¯ m k h d r L 2 Γ 1 k h 2 .
Proof. 
For any fixed k = 1 , 2 , 3 , , M , R 1 θ k is a fixed point. From the Sobolev embedding theorem [16]: H 2 + β I k C 2 I ¯ k for 1 2 < β < 1 . Then, using quadratic interpolation scheme, we have
d p ¯ m k h d r R 1 θ k = 3 p ¯ m k R 1 θ k 4 p ¯ m k R 1 θ k + h + p ¯ m k R 1 θ k + 2 h 2 h ,
by the Taylor expansion,
d p ¯ m k d r d p ¯ m k h d r L 2 Γ 1 k = d p ¯ m k d r R 1 θ k d p ¯ m k h d r R 1 θ k h 2 .
   □
Remark 3. 
Based on the regularity of the right-hand side of the adjoint Equation (24b), we assume that p ¯ m k H 2 + β I k , 1 2 < β < 1 is reasonable.
Proof. 
Since f m k H 1 I k , we have y ¯ m k H 2 ( I k ) . From y ¯ m k y d m k H 1 ( I k ) and elliptic regularity, it implies that p ¯ H 3 ( I ) V m k H 2 + β ( I k ) V m k , 1 2 < β < 1 , using the trace theorem with this together, and the relation of u ¯ m k and p ¯ m k , we obtain u ¯ m k H 1 ( I k ) H 1 2 ( I k ) , which combining with f m k H 1 I k in turns gives y ¯ m k H 2 ( I k ) Y m k .    □
Lemma 8. 
Let y ¯ m k , p ¯ m k Y m k × V m k be the solutions of (24) and y ¯ h , a n d p ¯ h Y m k h × Y m k h be the solution of (32), respectively. Then, there holds
p ¯ m k p ¯ h L 2 I k y ¯ m k y ¯ h L 2 I k + p ¯ m k p ¯ m k h L 2 I k .
Proof. 
Combined with (30b) and (32b), then
A m k p ¯ m k h p ¯ h , Π h * w = y ¯ m k y ¯ h , Π h * w I k , w Y m k h .
Taking w = p ¯ m k h p ¯ h in (58) to get
A m k p ¯ m k h p ¯ h , Π h * p ¯ m k p ¯ h = y ¯ m k y ¯ h , Π h * p ¯ m k h p ¯ h I k , w Y m k h .
By Lemma 2 and Young’s inequality,
A m k p ¯ m k h p ¯ h , Π h * p ¯ m k h p ¯ h p ¯ m k h p ¯ h H 1 I k 2 p ¯ m k h p ¯ h L 2 I k 2 ,
y ¯ m k y ¯ h , Π h * p ¯ m k h p ¯ h I k 1 2 y ¯ m k y ¯ h 2 + 1 2 p ¯ m k h p ¯ h 2 y ¯ m k y ¯ h L 2 I k 2 + p ¯ m k h p ¯ h L 2 I k 2 ,
which, together with the triangle inequality, leads to the estimate (57).    □
Based on the above Lemmas, we can immediately obtain the following main results of optimal error estimates.
Theorem 3. 
Let y ¯ , p ¯ , u ¯ H 2 Ω Y × H 2 + β Ω V × U a d and y ¯ f h , p ¯ f h , u ¯ f h H 2 Q Y f k h × H 2 + β Q Y f k h × U a d h , 1 2 < β < 1 be the solutions of the problems P and P f h respectively. Then we have
u ¯ u ¯ f h L 2 Ω 1 M 1 2 + M h 2 ,
y ¯ y ¯ f h L 2 Ω M 1 2 + M h 2 ,
p ¯ p ¯ f h L 2 Ω M 1 2 + M h 2 .
Proof. 
Combined with the above Lemmas, there holds:
u ¯ u ¯ f h L 2 Ω 1 u ¯ u ¯ f τ L 2 Γ 1 + u ¯ f τ u ¯ f h L 2 Γ 1 M 1 2 u ¯ H 1 2 Γ 1 + | m | = 0 M 1 M k = 1 M u ¯ m k u ¯ h e i m θ k L 2 Γ 1 M 1 2 + | m | = 0 M 1 M k = 1 M d p ¯ m k d r d p ¯ m k h d r e i m θ k L 2 Γ 1 + | m | = 0 M 1 M k = 1 M y ¯ m k y ¯ m k h e i m θ k L 2 Q M 1 2 + M h 2 ,
y ¯ y ¯ f h L 2 Ω y ¯ y ¯ f τ L 2 Q + y ¯ f τ y ¯ f h L 2 Q M 1 2 y ¯ H 1 2 I k + | m | = 0 M 1 M k = 1 M y ¯ m k y ¯ h e i m θ k L 2 Q M 1 2 + | m | = 0 M 1 M k = 1 M y ¯ m k y ¯ m k h e i m θ k L 2 Q M 1 2 + 1 M | m | = 0 M k = 1 M h 2 M 1 2 + M h 2 ,
p ¯ p ¯ f h L 2 Ω p ¯ p ¯ f τ L 2 Q + p ¯ f τ p ¯ f h L 2 Q M 1 2 p ¯ H 1 2 I k + | m | = 0 M 1 M k = 1 M p ¯ m k p ¯ h e i m θ k L 2 Q M 1 2 + | m | = 0 M 1 M k = 1 M y ¯ m k y ¯ h e i m θ k L 2 Q + | m | = 0 M 1 M k = 1 M p ¯ m k p ¯ m k h e i m θ k L 2 Q M 1 2 + 1 M | m | = 0 M k = 1 M h 2 + 1 M | m | = 0 M k = 1 M h 2 M 1 2 + M h 2 ,
where M can be controlled artificially so as not to affect the error order.    □

5. Numerical Experiments

In this section, numerical experiments are presented for the Fourier finite volume element method to confirm the theoretical results. The numbers of grid points are N + 1 and L in the radial and azimuthal direction, respectively. So the total number of computational nodes is N L = N + 1 × L . Here, fixed M = L = 64 . In the numerical experiments, L 2 and L norms are defined as follows (see [59]):
E 2 = 1 N L i = 1 N L u f h i u e x a i 2 , E 2 b = 1 L i = 1 L u f h i u e x a i 2 ,
E = max { u f h i u e x a i , i = 1 , 2 , , N L } , E b = max { u f h i u e x a i , i = 1 , 2 , , L } .
For the error functional, the experimental order of convergence is defined by
Order = log E h 1 log E h 2 log h 1 log h 2 .
The Algorithm 1 is as follows:    
Algorithm 1: Algorithm for the solution of optimal control problem.
 1:
Provide an initial u 0 of the control function u;
 2:
Solve the equation of state in y using the above u 0 ;
 3:
Solve the adjoint equation for p, being known y and y d ;
 4:
Compute the new control function u 1 using the above p;
 5:
If | u 0 u 1 | 1.0 × 10 10 , setting u f h = u 1 , else setting u 0 = u 1 and goto step 2;
 6:
Take the last computed control function u f h to compute the y f h and p f h .

5.1. Experiment 1

The first experiment is an unconstrained problem defined on the domain Ω = { 1 < x 1 2 + x 2 2 < 2 } with
f = π 2 16 + 1 r 2 sin π 4 r sin θ π 4 r cos π 4 r sin θ , y d = sin π 4 r sin θ 2 α π 4 1 π r 2 cos π 2 r sin θ 1 2 r sin π 4 r sin θ .
The optimal solution is given by
y = sin π 4 r sin θ , p = α 2 π cos π 2 r sin θ , u = 2 2 sin θ ,
where α = 1.3 is selected.
The corresponding numerical results of grid refinement analysis for experiment 1 are presented in Table 1, which contains the error and convergence order of the control u, the state y and the adjoint state p in the sense of both L 2 -norm and L -norm. Figure 2 depicts the convergence orders by slopes. It is apparent that the second order convergence rates of u , y , p are achieved with this methods.
The numerical solution u f h versus exact solution u with N = 64 is shown in Figure 3a, and the error of control u is plotted in Figure 3b. Figure 4, Figure 5 and Figure 6 show the numerical solution and the exact solution for the state and adjoint the error between them, respectively. From Figure 6, we find that both errors are of the scale of 10 4 at N = 64 , which indicates that the numerical method has a good approximation.

5.2. Experiment 2

The second experiment is an constrained control problem defined on the Ω = { 1 < x 1 2 + x 2 2 < 2 } with
f = 1 α 5 r 2 3 max 0 , sin θ , y d = 1 α r 2 4 α r 3 r 2 + 5 α + 3 max 0 , sin θ ,
the optimal solution is given by
y = 1 α r 2 4 r + 5 max 0 , sin θ , p = r 2 4 r + 3 max 0 , sin θ , u = 2 α max 0 , sin θ ,
where α = 1.3 is selected.
Table 2 presents the error and convergence order of the control u, the state y, and the adjoint state p in the sense of both L 2 -norm and L -norm, the corresponding profiles of their convergence order are shown in Figure 7. From them, we derive that the convergence order of these three variables are second.
Figure 8a,c describe the profile of the exact and numerical solution of control u, while Figure 8b,d display its numerical error with N = 64 and N = 128 , respectively. From this figure, we can also observe that the convergence order is second. The numerical solution and the exact solution of the state and adjoint are presented in Figure 9, Figure 10 and Figure 11 and error between them is showed in Figure 11. Figure 12 depicts the continuous Dirichlet boundary control u and discrete Dirichlet boundary control u f h together with their active sets, it is clear to see that the discrete active set is approximate to active set. These numerical results demonstrate the efficiency of our proposed method.

6. Concluding Remarks

This research explored an optimal control problem on a complex connected domain governed by elliptic PDEs with Dirichlet boundary conditions. First, the optimality system for the optimal control problem is determined. Then, using the Fourier finite volume element approach to convert this problem into polar coordinates and discretize the optimal control problem. Next, the convergence order of the Dirichlet boundary control, the state, and the adjoint state are proven. This error estimate contains two components: The Fourier truncation error and the one-dimensional finite volume element error. Finally, numerical experiments are shown to back up the theoretical findings.

Author Contributions

Conceptualization, L.X.; Methodology, Z.Z.; Formal analysis, M.S.; Investigation, M.S.; Data curation, L.X.; Supervision, Z.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the National Natural Science Foundation of China grant number 11971241, the first author also funded by Postgraduate Research and Practice Innovation Program in Jiangsu Province grant number KYCX21-1317.

Data Availability Statement

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Han, Q.; Lin, F. Elliptic Partial Differential Equations; American Mathematical Soc.: Providence, RI, USA, 2011; Volume 1. [Google Scholar]
  2. Nirenberg, L. On elliptic partial differential equations. In Il Principio di Minimo e sue Applicazioni alle Equazioni Funzionali; Springer: Berlin/Heidelberg, Germany, 2011; pp. 1–48. [Google Scholar]
  3. Boureghda, A. Solution of an ice melting problem using a fixed domain method with a moving boundary. Bull. Math. Soc. Sci. Math. Roum. 2019, 62, 341–353. [Google Scholar]
  4. Gefen, A.; Weihs, D. Computer Methods in Biomechanics and Biomedical Engineering: Proceedings of the 14th International Symposium CMBBE, Tel Aviv, Israel, 2016; Springer: Cham, Switzerland, 2018. [Google Scholar] [CrossRef]
  5. Tröltzsch, F. Optimal Control of Partial Differential Equations: Theory, Methods, and Applications; American Mathematical Soc.: Providence, RI, USA, 2010; Volume 112. [Google Scholar]
  6. Lions, J.L. Optimal Control of Systems Governed by Partial Differential Equations; Springer: Berlin/Heidelberg, Germany, 1971. [Google Scholar]
  7. Hinze, M.; Pinnau, R.; Ulbrich, M.; Ulbrich, S. Optimization with PDE Constraints; Springer: Berlin/Heidelberg, Germany, 2008; Volume 23. [Google Scholar]
  8. Zamani, N.; Chuang, J. Optimal control of current in a cathodic protection system: A numerical investigation. Optim. Control Appl. Methods 1987, 8, 339–350. [Google Scholar] [CrossRef]
  9. Zhong, W.; Zhong, X. Elliptic partial differential equation and optimal control. Numer. Methods Partial Differ. Equ. 1992, 8, 149–169. [Google Scholar]
  10. Yousept, I. Optimal control of quasilinear H(curl)-elliptic partial differential equations in magnetostatic field problems. SIAM J. Control Optim. 2013, 51, 3624–3651. [Google Scholar] [CrossRef]
  11. Khursheed, A. The Finite Element Method in Charged Particle Optics; Springer: Boston, MA, USA, 1999. [Google Scholar]
  12. French, D.A.; Thomas King, J. Approximation of an elliptic control problem by the finite element method. Numer. Funct. Anal. Optim. 1991, 12, 299–314. [Google Scholar] [CrossRef]
  13. Yan, M.; Gong, W.; Yan, N. Finite element methods for elliptic optimal control problems with boundary observations. Appl. Numer. Math. 2015, 90, 190–207. [Google Scholar] [CrossRef]
  14. Christof, C.; Vexler, B. New regularity results and finite element error estimates for a class of parabolic optimal control problems with pointwise state constraints. ESAIM Control Optim. Calc. Var. 2021, 27, 4. [Google Scholar] [CrossRef]
  15. Liu, J.; Zhou, Z. Finite element approximation of time fractional optimal control problem with integral state constraint. AIMS Math. 2021, 6, 979–997. [Google Scholar] [CrossRef]
  16. Li, R.; Chen, Z.; Wu, W. Generalized Difference Methods for Differential Equations: Numerical Analysis of Finite Volume Methods; CRC Press: New York, NY, USA, 2000. [Google Scholar]
  17. Shen, J.; Tang, T.; Wang, L. Spectral Methods: Algorithms, Analysis and Applications; Springer: Berlin/Heidelberg, Germany, 2011; Volume 41. [Google Scholar]
  18. Pfeiffer, H.P.; Kidder, L.E.; Scheel, M.A.; Teukolsky, S.A. A multidomain spectral method for solving elliptic equations. Comput. Phys. Commun. 2003, 152, 253–273. [Google Scholar] [CrossRef] [Green Version]
  19. Tao, Z.Z.; Sun, B. Galerkin spectral method for elliptic optimal control problem with L2-norm control constraint. Discret. Contin. Dyn. Syst.-B 2022, 27, 4121. [Google Scholar] [CrossRef]
  20. Chen, R. On optimal boundary control of a class of system governed by parabolic partial differential equation. Sci. China Ser. A-Math. Phys. Astron. Technol. Sci. 1982, 25, 1205–1218. [Google Scholar]
  21. Casas, E.; Raymond, J.P. Error estimates for the numerical approximation of Dirichlet boundary control for semilinear elliptic equations. SIAM J. Control Optim. 2006, 45, 1586–1611. [Google Scholar] [CrossRef]
  22. Deckelnick, K.; Günther, A.; Hinze, M. Finite element approximation of Dirichlet boundary control for elliptic PDEs on two-and three-dimensional curved domains. SIAM J. Control Optim. 2009, 48, 2798–2819. [Google Scholar] [CrossRef]
  23. Gong, W.; Yan, N. Mixed finite element method for Dirichlet boundary control problem governed by elliptic PDEs. SIAM J. Control Optim. 2011, 49, 984–1014. [Google Scholar] [CrossRef]
  24. Pfefferer, J.; Winkler, M. Finite element error estimates for normal derivatives on boundary concentrated meshes. SIAM J. Control Optim. 2019, 57, 2043–2073. [Google Scholar] [CrossRef] [Green Version]
  25. Vexler, B. Finite element approximation of elliptic Dirichlet optimal control problems. Numer. Funct. Anal. Optim. 2007, 28, 957–973. [Google Scholar] [CrossRef]
  26. May, S.; Rannacher, R.; Vexler, B. Error analysis for a finite element approximation of elliptic Dirichlet boundary control problems. SIAM J. Control Optim. 2013, 51, 2585–2611. [Google Scholar] [CrossRef]
  27. Chang, L.; Gong, W.; Yan, N. Weak boundary penalization for Dirichlet boundary control problems governed by elliptic equations. J. Math. Anal. Appl. 2017, 453, 529–557. [Google Scholar] [CrossRef]
  28. Hu, W.; Shen, J.; Singler, J.R.; Zhang, Y.; Zheng, X. A superconvergent hybridizable discontinuous Galerkin method for Dirichlet boundary control of elliptic PDEs. Numer. Math. 2020, 144, 375–411. [Google Scholar] [CrossRef] [Green Version]
  29. Geveci, T. On the approximation of the solution of an optimal control problem governed by an elliptic equation. RAIRO. Anal. Numérique 1979, 13, 313–328. [Google Scholar] [CrossRef] [Green Version]
  30. Karkulik, M. A finite element method for elliptic Dirichlet boundary control problems. Comput. Methods Appl. Math. 2020, 20, 827–843. [Google Scholar] [CrossRef]
  31. Hinze, M.; Matthes, U. A note on variational discretization of elliptic Neumann boundary control. Control Cybern. 2009, 38, 577–591. [Google Scholar]
  32. Casas, E.; Dhamo, V. Error estimates for the numerical approximation of Neumann control problems governed by a class of quasilinear elliptic equations. Comput. Optim. Appl. 2012, 52, 719–756. [Google Scholar] [CrossRef]
  33. Gunzburger, M.D.; Lee, H.C.; Lee, J. Error estimates of stochastic optimal Neumann boundary control problems. SIAM J. Numer. Anal. 2011, 49, 1532–1552. [Google Scholar] [CrossRef]
  34. Krumbiegel, K.; Meyer, C.; Rösch, A. A priori error analysis for linear quadratic elliptic Neumann boundary control problems with control and state constraints. SIAM J. Control Optim. 2010, 48, 5108–5142. [Google Scholar] [CrossRef]
  35. Brenner, S.; Oh, M.; Sung, L.Y. P1 finite element methods for an elliptic state-constrained distributed optimal control problem with Neumann boundary conditions. Results Appl. Math. 2020, 8, 100090. [Google Scholar] [CrossRef]
  36. Akman, T.; Yücel, H.; Karasözen, B. A priori error analysis of the upwind symmetric interior penalty Galerkin (SIPG) method for the optimal control problems governed by unsteady convection diffusion equations. Comput. Optim. Appl. 2014, 57, 703–729. [Google Scholar] [CrossRef]
  37. Luo, X.; Chen, Y.; Huang, Y.; Hou, T. Some error estimates of finite volume element method for parabolic optimal control problems. Optim. Control Appl. Methods 2014, 35, 145–165. [Google Scholar] [CrossRef]
  38. Chen, Y.; Yi, N.; Liu, W. A Legendre–Galerkin spectral method for optimal control problems governed by elliptic equations. SIAM J. Numer. Anal. 2008, 46, 2254–2275. [Google Scholar] [CrossRef]
  39. Ravindran, S.S. Penalization of Dirichlet Boundary Control for Nonstationary Magneto-Hydrodynamics. SIAM J. Control Optim. 2020, 58, 2354–2382. [Google Scholar] [CrossRef]
  40. Chatzipantelidis, P.; Lazarov, R.; Thomée, V. Error estimates for a finite volume element method for parabolic equations in convex polygonal domains. Numer. Methods Partial. Differ. Equ. Int. J. 2004, 20, 650–674. [Google Scholar] [CrossRef]
  41. Bi, C.; Ginting, V. Two-grid finite volume element method for linear and nonlinear elliptic problems. Numer. Math. 2007, 108, 177–198. [Google Scholar] [CrossRef]
  42. Kumar, S.; Nataraj, N.; Pani, A.K. Finite volume element method for second order hyperbolic equations. Int. J. Numer. Anal. Model. 2008, 5, 132–151. [Google Scholar]
  43. Luo, X.; Chen, Y.; Huang, Y. Some Error Estimates of Finite Volume Element Approximation for Elliptic Optimal Control Problems. Int. J. Numer. Anal. Model. 2013, 10, 697–711. [Google Scholar]
  44. Cai, Z.; McCormick, S. On the accuracy of the finite volume element method for diffusion equations on composite grids. SIAM J. Numer. Anal. 1990, 27, 636–655. [Google Scholar] [CrossRef]
  45. Ewing, R.; Lazarov, R.; Lin, Y. Finite volume element approximations of nonlocal reactive flows in porous media. Numer. Methods Partial. Differ. Equ. Int. J. 2000, 16, 285–311. [Google Scholar] [CrossRef]
  46. Karaa, S.; Mustapha, K.; Pani, A.K. Finite volume element method for two-dimensional fractional subdiffusion problems. IMA J. Numer. Anal. 2017, 37, 945–964. [Google Scholar] [CrossRef]
  47. Li, R.; Gao, Y.; Chen, J.; Zhang, L.; He, X.; Chen, Z. Discontinuous finite volume element method for a coupled Navier-Stokes-Cahn-Hilliard phase field model. Adv. Comput. Math. 2020, 46, 1–35. [Google Scholar] [CrossRef]
  48. Lin, Y.; Liu, J.; Yang, M. Finite volume element methods: An overview on recent developments. Int. J. Numer. Anal. Model. Ser. B 2013, 4, 14–34. [Google Scholar]
  49. Gan, X.; Xu, D. An efficient symmetric finite volume element method for second-order variable coefficient parabolic integro-differential equations. Comput. Appl. Math. 2020, 39, 1–24. [Google Scholar] [CrossRef]
  50. Lou, Y.; Chen, C.; Xue, G. Two-grid finite volume element method combined with Crank-Nicolson scheme for semilinear parabolic equations. Adv. Appl. Math. Mech. 2021, 13, 892–913. [Google Scholar]
  51. Ewing, R.E.; Li, Z.; Lin, T.; Lin, Y. The immersed finite volume element methods for the elliptic interface problems. Math. Comput. Simul. 1999, 50, 63–76. [Google Scholar] [CrossRef]
  52. Kumar, S.; Nataraj, N.; Pani, A.K. Discontinuous Galerkin finite volume element methods for second-order linear elliptic problems. Numer. Methods Partial. Differ. Equ. Int. J. 2009, 25, 1402–1424. [Google Scholar] [CrossRef]
  53. Wang, Q.; Zhang, Z.; Li, Z. A Fourier finite volume element method for solving two-dimensional quasi-geostrophic equations on a sphere. Appl. Numer. Math. 2013, 71, 1–13. [Google Scholar]
  54. Lin, X.; Su, M.; Zhang, Z. Fourier Finite Volume Element Method for Two Classes of Optimal Control Problems Governed by Elliptic PDEs on Complex Connected Domain. Numer. Funct. Anal. Optim. 2020, 41, 379–412. [Google Scholar] [CrossRef]
  55. Hinze, M. A variational discretization concept in control constrained optimization: The linear-quadratic case. Comput. Optim. Appl. 2005, 30, 45–61. [Google Scholar] [CrossRef] [Green Version]
  56. Chen, R. Optimal boundary control of parabolic system on doubly connected region in new space. Sci. China (Sci. Sin.) Ser. A 1995, 8, 933–944. [Google Scholar]
  57. Djellab, N. Résolution Numérique de Problèmes D’équations aux Dérivées Partielles Issus de la Biologie et la Médecine. Ph.D. Thesis, Ferhat ABBAS University, Setif, Algeria, 2022. [Google Scholar]
  58. Ewing, R.E.; Lin, T.; Lin, Y. On the accuracy of the finite volume element method based on piecewise linear polynomials. SIAM J. Numer. Anal. 2002, 39, 1865–1888. [Google Scholar] [CrossRef] [Green Version]
  59. Qiu, Z.; Zeng, Z.; Mei, H.; Li, L.; Yao, L.; Zhang, L. A Fourier–Legendre spectral element method in polar coordinates. J. Comput. Phys. 2012, 231, 666–675. [Google Scholar] [CrossRef]
Figure 1. Domain.
Figure 1. Domain.
Mathematics 10 04779 g001
Figure 2. Convergence orders of u f h u, y f h y, and p f h p in different norms.
Figure 2. Convergence orders of u f h u, y f h y, and p f h p in different norms.
Mathematics 10 04779 g002
Figure 3. The numerical solution u f h versus exact solution u (a), error u f h u (b) for experiment 1 with N = 64 .
Figure 3. The numerical solution u f h versus exact solution u (a), error u f h u (b) for experiment 1 with N = 64 .
Mathematics 10 04779 g003
Figure 4. Numerical solution y f h (a) and exact solution y (b) with N = 64 .
Figure 4. Numerical solution y f h (a) and exact solution y (b) with N = 64 .
Mathematics 10 04779 g004
Figure 5. Numerical solution p f h (a) and exact solution p (b) with N = 64 .
Figure 5. Numerical solution p f h (a) and exact solution p (b) with N = 64 .
Mathematics 10 04779 g005
Figure 6. Error for state y (a) and adjoint state p (b) with N = 64 .
Figure 6. Error for state y (a) and adjoint state p (b) with N = 64 .
Mathematics 10 04779 g006
Figure 7. Convergence orders of u f h u, y f h y, and p f h p in different norms.
Figure 7. Convergence orders of u f h u, y f h y, and p f h p in different norms.
Mathematics 10 04779 g007
Figure 8. The numerical solution u f h versus exact solution u (a,c), error u f h u (b,d) for experiment 2.
Figure 8. The numerical solution u f h versus exact solution u (a,c), error u f h u (b,d) for experiment 2.
Mathematics 10 04779 g008
Figure 9. Numerical solution y f h (a) and exact solution y (b) with N = 64 .
Figure 9. Numerical solution y f h (a) and exact solution y (b) with N = 64 .
Mathematics 10 04779 g009
Figure 10. Numerical solution p f h (a) and exact solution p (b) with N = 64 .
Figure 10. Numerical solution p f h (a) and exact solution p (b) with N = 64 .
Mathematics 10 04779 g010
Figure 11. Error for state y (a) and adjoint state p (b) with N = 64 .
Figure 11. Error for state y (a) and adjoint state p (b) with N = 64 .
Mathematics 10 04779 g011
Figure 12. Discrete active set and active set of Dirichlet boundary control u.
Figure 12. Discrete active set and active set of Dirichlet boundary control u.
Mathematics 10 04779 g012
Table 1. Error of control u, state y, and adjoint state p for experiment 1 with fixed L.
Table 1. Error of control u, state y, and adjoint state p for experiment 1 with fixed L.
(a) L 2 -norm
N | | u f h u | | L 2 Ω 1 Order | | y f h y | | L 2 Ω Order | | p f h p | | L 2 Ω Order
8 1.2641 × 10 2 1.0022 × 10 2 6.1839 × 10 3
16 2.9821 × 10 3 2.12 2.3802 × 10 3 2.11 1.4400 × 10 3 2.15
32 7.2104 × 10 4 2.07 5.7755 × 10 4 2.06 3.4628 × 10 4 2.08
64 1.7706 × 10 4 2.04 1.4208 × 10 4 2.03 8.4826 × 10 5 2.04
128 4.3852 × 10 5 2.02 3.5227 × 10 5 2.02 2.0988 × 10 5 2.02
256 1.0914 × 10 5 2.01 8.7656 × 10 6 2.01 5.2182 × 10 6 2.01
512 2.7245 × 10 6 2.00 2.1842 × 10 6 2.01 1.3001 × 10 6 2.01
(b) L -norm
N | | u f h u | | L Ω 1 Order | | y f h y | | L Ω Order | | p f h p | | L Ω Order
8 1.7877 × 10 2 1.6492 × 10 2 1.1750 × 10 2
16 4.2173 × 10 3 2.12 4.0400 × 10 3 2.04 2.8245 × 10 3 2.08
32 1.0197 × 10 3 2.07 9.9734 × 10 4 2.03 6.9079 × 10 4 2.04
64 2.5040 × 10 4 2.04 2.4758 × 10 4 2.01 1.7070 × 10 4 2.02
128 6.2016 × 10 5 2.02 6.1673 × 10 5 2.01 4.2423 × 10 5 2.01
256 1.5435 × 10 5 2.01 1.5383 × 10 5 2.00 1.0571 × 10 5 2.01
512 3.8531 × 10 6 2.00 3.8379 × 10 6 2.00 2.6369 × 10 6 2.00
Table 2. Error of control u, state y and adjoint state p for experiment 2 with fixed L.
Table 2. Error of control u, state y and adjoint state p for experiment 2 with fixed L.
(a) L 2 -norm
N | | u f h u | | L 2 Ω 1 Order | | y f h y | | L 2 Ω Order | | p f h p | | L 2 Ω Order
8 1.8638 × 10 3 7.5762 × 10 4 1.4328 × 10 3
16 4.6715 × 10 4 1.99 2.0419 × 10 4 1.86 3.4342 × 10 4 2.09
32 1.1707 × 10 4 2.00 5.2882 × 10 5 1.93 8.4040 × 10 5 2.04
64 2.9414 × 10 5 1.99 1.3358 × 10 5 1.98 2.0831 × 10 5 2.02
128 7.5096 × 10 6 1.96 3.2515 × 10 6 2.05 5.2401 × 10 6 1.99
256 2.0341 × 10 6 1.85 7.1071 × 10 7 2.29 1.3680 × 10 6 1.92
(b) L -norm
N | | u f h u | | L Ω 1 Order | | y f h y | | L Ω Order | | p f h p | | L Ω Order
8 3.7278 × 10 3 2.9252 × 10 3 4.4435 × 10 3
16 9.3417 × 10 4 2.00 8.2853 × 10 4 1.77 1.1098 × 10 3 2.00
32 2.3401 × 10 4 2.00 2.2003 × 10 4 1.88 2.7740 × 10 4 2.00
64 5.8703 × 10 5 1.99 5.6482 × 10 5 1.95 6.9430 × 10 5 2.00
128 1.4881 × 10 5 1.97 1.4089 × 10 5 2.00 1.7464 × 10 5 1.99
256 3.9240 × 10 6 1.90 3.3027 × 10 6 2.13 4.4741 × 10 6 1.95
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Su, M.; Xie, L.; Zhang, Z. Numerical Analysis of Fourier Finite Volume Element Method for Dirichlet Boundary Optimal Control Problems Governed by Elliptic PDEs on Complex Connected Domains. Mathematics 2022, 10, 4779. https://doi.org/10.3390/math10244779

AMA Style

Su M, Xie L, Zhang Z. Numerical Analysis of Fourier Finite Volume Element Method for Dirichlet Boundary Optimal Control Problems Governed by Elliptic PDEs on Complex Connected Domains. Mathematics. 2022; 10(24):4779. https://doi.org/10.3390/math10244779

Chicago/Turabian Style

Su, Mengya, Liuqing Xie, and Zhiyue Zhang. 2022. "Numerical Analysis of Fourier Finite Volume Element Method for Dirichlet Boundary Optimal Control Problems Governed by Elliptic PDEs on Complex Connected Domains" Mathematics 10, no. 24: 4779. https://doi.org/10.3390/math10244779

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop