Preprint
Article

This version is not peer-reviewed.

Explicit Discrete Solution for Some Optimization Problems and Estimations with Respect to the Exact Solution

Submitted:

22 December 2025

Posted:

23 December 2025

You are already at the latest version

Abstract
We consider two steady state heat conduction systems called, S and Sα, in a multidimensional bounded domain D for the Poisson equation with source energy g. In one system we impose mixed boundary conditions (temperature b on the boundary Γ1, heat flux q on Γ2 and an adiabatic condition on Γ3). In the other system, the condition on Γ1 is replaced by a convective heat flux condition with coefficient α. For each of these systems, we consider three associated optimization problems (Pi) and (P), i = 1, 2, 3 where the variable will be the source energy g, the heat flux q and the environmental temperature b, respectively. In the particular case that D is a rectangle, the explicit continuous optimization variables and the corresponding state of the systems are known. In the present work, by using a finite difference scheme, we obtain the discrete systems (Sh) and (Sh α) and discrete optimization problems (Pih) and (Pihα), i = 1, 2, 3, where h is the space step in the discretization. Explicit discrete solutions are found, and convergence and estimation errors results are proved when h goes to zero and when α goes to infinite. Moreover, some numerical simulations are provided in order to test theoretical results. Finally, we note that the use of a three–point finite–difference approximation for the Neumann or Robin boundary condition at the boundary improves the global order of convergence from O(h) to O(h2).
Keywords: 
;  ;  ;  

1. Introduction

We consider a multidimensional bounded domain Ω R n whose regular boundary Γ consists of three disjoint portions Γ i with m e a s ( Γ i ) > 0 , for i = 1 , 2 , 3 . We define two stationary heat conduction problems ( S ) and ( S α ) with mixed boundary conditions which are given by (1)-(2) and (1)-(3) respectively:
Δ u = g i n Ω ,
u | Γ 1 = b , u n | Γ 2 = q , u n | Γ 3 = 0 ,
u n | Γ 1 = α ( u b ) , u n | Γ 2 = q u n | Γ 3 = 0 ,
where g is the internal energy of the system in Ω , b > 0 the environmental temperature on Γ 1 , q is the heat flux on Γ 2 and α > 0 is the convective heat coefficient on Γ 1 . We assume that: g H = L 2 ( Ω ) , q Q = L 2 ( Γ 2 ) and b B = H 1 / 2 ( Γ 1 ) . These problems can be considered as Stefan’s stationary problems [8,19,20,21,22]. Notice that mixed boundary conditions play an important role in several applications, e.g. heat conduction and electric potential problems [12].
The variational formulation of the elliptic problems (1)-(2) and (1)-(3) can be found in [8,9,10,19]. It can be seen that they have unique solution [20]. In general, the solutions of mixed elliptic boundary problems is not so regular [11] but there are cases in which they are regular [4,15,18]. Other theoretical optimization problems in the subject have been done in [13,25].
We define the optimization problems ( P i ) and ( P i α ) i = 1 , 2 , 3 , associated to the systems ( S ) and ( S α ) , respectively (see [5,9,16,17,24]).
The distributed optimization problems ( P 1 ) and ( P 1 α ) on the constant internal energy g are formulated as:
find g o p R such that J 1 ( g o p ) = min g R J 1 ( g )
find g α o p R such that J 1 α ( g α o p ) = min g R J 1 α ( g )
where J 1 : R R 0 + and J 1 α : R R 0 + are given by
J 1 ( g ) = 1 2 u g z d H 2 + M 1 2 g H 2 , J 1 α ( g ) = 1 2 u α g z d H 2 + M 1 2 g H 2
with M 1 R + and z d R . For each g R , the functions u g and u α g denote the unique solutions to the systems ( S ) and ( S α ) respectively, for data q R , b R .
The boundary optimization problems ( P 2 ) and ( P 2 α ) on the constant heat flux q on Γ 2 are defined as:
find q o p R such that J 2 ( q o p ) = min q R J 2 ( q )
find q α o p R such that J 2 α ( q α o p ) = min q R J 2 α ( q )
where J 2 : R R 0 + and J 2 α : R R 0 + are given by
J 2 ( q ) = 1 2 u q z d H 2 + M 2 2 q Q 2 , J 2 α ( q ) = 1 2 u α q z d H 2 + M 2 2 q Q 2
with M 2 R + and z d R . For each q R , we denote with u q and u α q the unique solutions to the systems ( S ) and ( S α ) respectively, for data g R and b R .
The boundary optimization problems ( P 3 ) and ( P 3 α ) on the constant temperature b in an external neighborhood of Γ 1 are set as
find b o p R such that J 3 ( b o p ) = min b R J 3 ( b )
find b α o p R such that J 3 α ( b α o p ) = min b R J 3 α ( q )
where J 3 : R R 0 + and J 3 α : R R 0 + , given by
J 3 ( b ) = 1 2 u b z d H 2 + M 3 2 b B 2 , J 3 α ( b ) = 1 2 u α b z d H 2 + M 3 2 b B 2
with M 3 R + and z d R . For every b R , the functions u b and u α b are the unique solutions of the systems ( S ) and ( S α ) respectively, for data g R and q R , .
In [6] the explicit solutions to the continuous systems ( S ) and ( S α ) were obtained, as well as the associated optimization problems ( P i ) and ( P i α ) for i = 1 , 2 , 3 , in the particular case when the domain is a rectangle. These explicit solutions provide a benchmark for testing the accuracy of numerical methods.
The goal of this paper is to find the discrete explicit solutions to the systems ( S ) and ( S α ) , through the finite difference method, in a rectangular domain. In addition, we aim to obtain the discrete explicit solutions to the optimization problems ( P i ) and ( P i α ) for i = 1 , 2 , 3 . Taking advantage of the exact explicit solutions, we will estimate the order of convergence of the approximate solutions as a function of the step discretization.
It is worth to mention that there are several articles available in the literature that obtain explicit discrete solutions of some optimization problems [1,2,3]. For example, in [14], exact formulas are derived for the solution of an optimal boundary control problem governed by the one dimensional heat equation where the control function measures the distance of the final state from the target. In [26] a finite element approximation is applied for some kind of parabolic optimal control problems with Neumann boundary conditions. Some numerical experiments are carried out setting a rectangular domain.
This paper is organized as follows: in Section 2 we obtain the discrete explicit solution to the systems ( S ) and ( S α ) by the finite difference method. In Section 3, we obtain explicit discrete solutions to the discrete distributed optimization problems associated to ( P 1 ) and ( P 1 α ) , respectively where the variable is the internal energy g. In Section 4, we define discrete boundary optimization problems where the variable is the heat flux q, associated to ( P 2 ) and ( P 2 α ) , respectively obtaining the discrete explicit solutions. In the same manner, in Section 5, we derive explicit discrete solutions to the discrete boundary optimal control problems associated to ( P 3 ) and ( P 3 α ) , respectively where the optimization variable is b. In all cases, when the step discretization goes to zero, convergence results are obtained estimating also the order of convergence of the approximate solutions. In Section 6, we carry out some numerical simulations in order to illustrate the convergence theoretical results obtained in the previous sections. Finally, in Section 7, we analyze the order of convergence of the discrete systems associated with ( S ) and ( S α ) by considering a modified approximation of the Neumann boundary condition on Γ 2 , which leads to an improved convergence order.

2. Discrete Systems for ( S ) and ( S α )

In this section we obtain the discrete explicit solutions to the systems ( S ) and ( S α ) in a particular domain.
Let us consider a rectangular domain in the plane Ω = ( 0 , x 0 ) × ( 0 , y 0 ) with x 0 > 0 and y 0 > 0 . Its boundaries Γ i for i = 1 , 2 , 3 are defined by:
Γ 1 = { ( 0 , y ) : y ( 0 , y 0 ] } , Γ 2 = { ( x 0 , y ) : y ( 0 , y 0 ] }
and
Γ 3 = { ( x , 0 ) : x [ 0 , x 0 ] } { ( x , y 0 ) : x [ 0 , x 0 ] } .
According to [6] the continuous solutions, in Ω , for the systems ( S ) and ( S α ) defined by (1)-(2) and (1)-(3) are given by:
u ( x , y ) = 1 2 g x 2 + ( g x 0 q ) x + b , ( x , y ) Ω u α ( x , y ) = 1 2 g x 2 + ( g x 0 q ) x + 1 α ( g x 0 q ) + b , ( x , y ) Ω .
As consequence of the symmetry of the domain Ω , the solution u and u α of the systems ( S ) and ( S α ) are independent of the variable y, and therefore we will work with one-dimensional problems.
Given n N , we define:
h = x 0 n ; x i = ( i 1 ) h , for i = 1 , , n + 1 , u i u ( x i , y ) for i = 2 , , n + 1 ,
where, n is the number of subintervals to consider in [ 0 , x 0 ] , h is the constant size of these subintervals, u 1 = b and u i is the approximate value of the function u in ( x i , y ) Ω for i = 2 , , n + 1 .
We apply the classical finite–difference method to the system ( S ) described by equations (1)–(2). Since the boundary condition on Γ 1 prescribes u ( 0 , y ) = b , we immediately obtain u 1 = b .
For the interior nodes, we use the classical centered second–order finite difference approximation:
2 u x 2 ( x i , y ) u ( x i + 1 , y ) 2 u ( x i , y ) + u ( x i 1 , y ) h 2 , i = 2 , 3 , , n ,
and from (1) it follows that
g h 2 = u i + 1 2 u i + u i 1 , i = 2 , 3 , , n .
To incorporate the Neumann boundary condition on Γ 2 , we use a backward finite difference for the first derivative:
u x ( x n + 1 , y ) u ( x n + 1 , y ) u ( x n , y ) h ,
which, using the boundary condition u x ( x n + 1 , y ) = q , leads to
q h = u n + 1 u n .
As a consequence, we obtain the discrete linear system ( S h )
A v ¯ = T ,
where v ¯ = ( u i ) i = 2 , , n + 1 R n is the vector of unknowns, A is the associated tridiagonal coefficient matrix:
A = 2 1 0 0 1 2 1 0 0 0 1 2 1 0 0 0 0 1 2 1 0 0 0 1 2 1 0 0 1 1
and T R n is the vector of independent terms:
T = g h 2 b , g h 2 , , g h 2 , q h t .
The square matrix A is invertible and its inverse matrix is given by
A 1 = 1 1 1 1 1 1 2 2 2 2 1 2 3 3 3 1 2 3 ( n 1 ) n 1 1 2 3 ( n 1 ) n
Then the system ( S h ) has a unique solution:
u 1 = b u i = b + h 2 g ( i 1 ) n i ( i 1 ) 2 ( i 1 ) h q , i = 2 , , n + 1 .
As n = x 0 h , it follows that:
u i = b + ( i 1 ) h ( g x 0 q ) h 2 g i ( i 1 ) 2 , i = 1 , , n + 1 .
Then, the continuous solution u ( x , y ) of system ( S ) can be approximated by the piecewise linear interpolant u h ( x , y ) obtained from the nodal values computed by the finite difference scheme. More precisely, we define
u h ( x , y ) = ( g x 0 q h g i ) x + h 2 g i ( i 1 ) 2 + b , x [ x i , x i + 1 ] , y [ 0 , y 0 ] ,
with i = 1 , , n .
In the following lemma, we give some bounds for the approximate function u h :
Lemma 1. 
a) 
For every ( x i , y ) with i = 1 , , n + 1 , y [ 0 , y 0 ] , we have that:
i) 
if g > 0 then u h ( x i , y ) u ( x i , y ) .
ii) 
if g < 0 , then u h ( x i , y ) u ( x i , y ) .
b) 
The following bounds hold:
u u h H C 1 h , and u x u h x H C 1 ˜ h ,
where C 1 = x 0 | g | 2 15 x 0 y 0 and C 1 ˜ = | g | 1 3 x 0 y 0 .
Proof. 
a)
From functions u and u h , we have that
u ( x i , y ) u h ( x i , y ) = u ( x i , y ) u i = g h 2 ( i 1 ) 2 , i = 1 , , n + 1 .
b)
From the definition of norm in space H and the formulas (13) and (22) for the functions u and u h , respectively, it follows that:
| | u u h | | H 2 = y 0 i = 1 n x i x i + 1 u ( x , y ) u h ( x , y ) 2 d x = 1 120 y 0 h 5 g 2 n 3 1 n 2 + 5 n + 10 2 15 y 0 h 5 g 2 n 3 = 2 15 h 2 g 2 x 0 3 y 0 = C 1 2 h 2 .
The norm | | u x u h x | | H can be computed analogously.
We apply the classical finite–difference method to the system ( S α ) defined by equations (1)–(3) where u α , i u α ( x i , y ) for i = 1 , , n + 1 .
The Robin boundary condition on Γ 1 is approximated by a forward finite–difference scheme, namely,
u α , 2 u α , 1 h = α u α , 1 b .
Moreover, at the interior nodes we use the approximation given in (16), while the Neumann boundary condition at x n + 1 is discretized according to (17).
Then we obtain a linear system ( S h α ) :
A α v ¯ α = T α
where the vector of unknowns v ¯ α R n + 1 is given by v ¯ α = ( u α , i ) i = 1 , n + 1 , the tridiagonal coefficient matrix A α of order n + 1 , is defined as:
A α = ( 1 + α h ) 1 0 0 1 2 1 1 2 1 0 0 0 0 1 1
and
T α = α b h , g h 2 , , g h 2 , q h t R n + 1 .
It can be seen that the square matrix A α is invertible and its inverse matrix is given by
A α 1 = 1 α h 1 1 1 1 1 1 ( 1 + α h ) ( 1 + α h ) ( 1 + α h ) 1 + α h 1 ( 1 + α h ) ( 1 + 2 α h ) ( 1 + 2 α h ) ( 1 + 2 α h ) 1 ( 1 + α h ) ( 1 + 2 α h ) ( 1 + ( n 1 ) α h ) 1 + ( n 1 ) α h 1 ( 1 + α h ) ( 1 + 2 α h ) ( 1 + ( n 1 ) α h ) 1 + n α h
Then the linear system ( S h α ) has a unique solution:
u α , i = ( b + g x 0 q α ) + ( i 1 ) ( g x 0 q ) h g α h g i ( i 1 ) 2 h 2 , i = 1 , , n + 1 .
As a consequence, the continuous solution u α ( x , y ) of the system ( S α ) , can be approximated by the discrete function u h α ( x , y ) in Ω ¯ given by
u h α ( x , y ) = ( g x 0 q h g i ) x + b + g x 0 q α g h α + i 2 i 2 g h 2 ,
for x [ x i , x i + 1 ] , y [ 0 , y 0 ] , i = 1 , , n .
Notice that u α , i u i , when α for each i = 1 , 2 , , n + 1 . In addition, u h α ( x , y ) u h ( x , y ) when α for every ( x , y ) Ω ¯ .
Lemma 2. 
If u α is the solution of ( S α ) and u h α is the function given in (26) for each h, it follows that:
u α u h α H C 1 α h , and u α x u h α x H C 1 ˜ h ,
with C 1 α = | g | x 0 x 0 y 0 2 15 + 2 3 1 α x 0 + 1 α 2 x 0 2 and C 1 ˜ = | g | 1 3 x 0 y 0 .
Proof. 
From the definition of u α and u h α , we have
| | u α u h α | | H 2 = y 0 i = 1 n x i x i + 1 u α ( x , y ) u h α ( x , y ) 2 d x = y 0 g 2 i = 1 n h 5 i 2 4 h 5 i 6 + h 5 20 h 4 3 α + h 4 i α + h 3 α 2 = y 0 g 2 h 5 n 3 1 12 + 1 24 n + 1 120 n 2 + h 4 n 2 α 1 2 + 1 6 n + h 3 n α 2 x 0 y 0 g 2 h 2 2 15 x 0 2 + 2 3 x 0 α + 1 α 2 = C 1 α 2 h 2 .
In addition, the derivatives of the functions u α and u h α are given by:
u α x ( x , y ) = u x ( x , y ) = g x + g x 0 q , ( x , y ) Ω
and
u h α x ( x , y ) = u h x ( x , y ) = g x 0 q h g i , x [ x i , x i + 1 ] , y [ 0 , y 0 ] .
Then, the bound for u α x u h α x H coincides with the bound for u x u h x H , obtained in Lemma 21. □
Remark 1. 
Notice that C 1 α C 1 when α , where C 1 is given in Lemma 21.

3. Distributed Optimization Problem with Variable g

In this section we are going to obtain discrete optimal solutions to the continuous optimization problem ( P 1 ) and ( P 1 α ) in the rectangular domain Ω for the case when the optimization variable is g.

3.1. Discrete Problem ( P 1 h ) Associated to ( P 1 )

Taking into account that b , g , q and the desired state z d are constants in the expression (6), according to [6], the continuous quadratic functional cost for the problem ( P 1 ) is explicitly given by:
J 1 ( g ) = 1 2 x 0 3 y 0 q 2 g 2 x 0 2 q 2 2 15 + M 1 x 0 4 + g x 0 q 5 12 + 2 3 ( b z d ) q x 0 + 1 3 ( b z d ) q x 0 + ( b z d ) 2 q 2 x 0 2 .
Since the function J 1 ( g ) is a polynomial function of the variable g, the analytic expresssion for J 1 ( g ) is given by
J 1 ( g ) = 1 2 x 0 3 y 0 q 2 2 x 0 2 q 2 g 2 15 + M 1 x 0 4 + x 0 q 5 12 + 2 3 ( b z d ) q x 0
Then, the continuous solution to the distributed optimization problem ( P 1 ) is g o p defined by:
g o p = q 3 x 0 5 8 ( b z d ) q x 0 2 15 + M 1 x 0 4
and the continuous optimization state is
u g o p ( x , y ) = 1 2 g o p x 2 + ( g o p x 0 q ) x + b .
We define the discrete distributed optimization problem ( P 1 h ) on the constant internal energy g as
find g h o p R such that J 1 h ( g h o p ) = min g R J 1 h ( g )
where the discrete cost function J 1 h is given by:
J 1 h ( g ) = 1 2 u h z d H 2 + 1 2 M 1 g H 2
with h defined in (14) and u h given in (22).
Taking into account that the variable g is constant it results that:
J 1 h ( g ) = 1 2 y 0 M 1 g 2 x 0 + i = 1 n x i x i + 1 u h ( x , y ) z d 2 d x
and from algebraic work it follows that
J 1 h ( g ) = 1 2 x 0 3 y 0 q 2 { g 2 x 0 2 q 2 2 15 + M 1 x 0 4 + 1 180 h 4 x 0 4 + 1 24 h 3 x 0 3 + 1 36 h 2 x 0 2 5 24 h x 0 + g x 0 q 5 12 + 2 3 ( b z d ) q x 0 + h x 0 1 3 + 1 12 h x 0 h x 0 ( b z d ) q x 0 1 2 + 1 6 h x 0 + 1 3 ( b z d ) q x 0 + ( b z d ) 2 q 2 x 0 2 } .
Lemma 3. 
The following estimate holds
| J 1 ( g ) J 1 h ( g ) | C 2 h
where C 2 = 1 2 x 0 3 y 0 g q | 5 24 g x 0 q + 1 3 1 2 ( b z d ) q x 0 | does not depend on h .
Proof. 
From (27) and (32) we get
J 1 h ( g ) J 1 ( g ) = 1 2 x 0 3 y 0 q 2 { g 2 x 0 2 q 2 1 180 h 4 x 0 4 + 1 24 h 3 x 0 3 + 1 36 h 2 x 0 2 5 24 h x 0 + g h q 1 3 + 1 12 h x 0 ( b z d ) q x 0 1 2 + 1 6 h x 0 } 1 2 x 0 3 y 0 q 2 5 24 g 2 x 0 q 2 + g q 1 3 1 2 ( b z d ) q x 0 h = 1 2 x 0 3 y 0 g q 5 24 g x 0 q + 1 3 1 2 ( b z d ) q x 0 h .
Therefore, we obtain (33).
Since the function J 1 h ( g ) is a polynomial function of the variable g, it is easy to obtain the following analytic expression for the function J 1 h :
J 1 h ( g ) = 1 2 x 0 3 y 0 q 2 { 2 g x 0 2 q 2 2 15 + M 1 x 0 4 + 1 180 h 4 x 0 4 + 1 24 h 3 x 0 3 + 1 36 h 2 x 0 2 5 24 h x 0 + x 0 q 5 12 + 2 3 ( b z d ) q x 0 + h x 0 1 3 + 1 12 h x 0 h x 0 ( b z d ) q x 0 1 2 + 1 6 h x 0 } .
From the optimality condition we obtain the following result:
Lemma 4. 
a) 
The explicit expression for the optimal variable g h o p is given by:
g h o p = q 3 x 0 A 1 + h x 0 A 2 + h 2 x 0 2 A 3 A 4 + A 5 ( h ) ,
where
A 1 = 5 8 b z d q x 0 , A 4 = 2 15 + M 1 x 0 4 , A 2 = 3 ( b z d ) 4 q x 0 1 2 , A 5 ( h ) = h 12 x 0 h 3 15 x 0 3 + h 2 2 x 0 2 + h 3 x 0 5 2 . A 3 = b z d 4 q x 0 1 8 ,
b) 
In addition, the following error estimates hold:
| g o p g h o p | C 3 h ,
J 1 ( g o p ) J 1 h ( g h o p ) C 4 h ,
where C 3 and C 4 do not depend on h.
Proof. 
a)
It follows immediately from the expression of J 1 h ( g ) given by (34).
b)
Rewriting g o p given by (29) as: g o p = q 3 x 0 A 1 A 4 , it follows that:
g h o p g o p = q 3 x 0 A 1 A 5 ( h ) + h x 0 A 2 A 4 + h 2 x 0 2 A 3 A 4 A 4 2 + A 4 A 5 ( h ) q 3 x 0 2 A 2 A 4 + 5 24 A 1 A 4 2 h + o ( h 2 ) ,
and we obtain (37) with C 3 = | C 3 * | where
C 3 * = q 3 x 0 2 A 2 A 4 + 5 24 A 1 A 4 2 .
From the expression for J 1 ( g ) with g = g o p and J 1 h ( g ) with g = g h o p , it results that:
J 1 ( g o p ) J 1 h ( g h o p ) = 1 2 x 0 3 y 0 q 2 [ x 0 2 q 2 A 4 ( g o p 2 g h o p 2 ) 2 3 x 0 q A 1 ( g o p g h o p ) g h o p 2 x 0 2 q 2 A 5 ( h ) + 2 3 g h o p h q A 2 + h x 0 A 3 ] .
By using (37) we get (38) where
C 4 = 1 2 x 0 2 y 0 q 2 2 A 4 C 3 * g o p x 0 3 q 2 + 5 24 g o p 2 x 0 2 q 2 + 2 3 A 1 C 3 * x 0 2 q + 2 3 A 2 g o p x 0 q = 1 2 x 0 2 y 0 q 2 A 1 ( 5 A 1 + 48 A 2 A 4 ) 216 A 4 2 .
Lemma 5. 
Let us consider u g o p the solution of (1)-(2) for g = g o p and u h g h o p the discrete solution defined as in (22) for h > 0 , where g = g h o p is the optimal variable of ( P 1 h ) given by (35). We have that:
a ) u g o p u h g h o p H C 5 h , b ) u g o p x u h g h o p x H C 6 h
where C 5 and C 6 are positive constants independent of the parameter h .
Proof:
a)
From definition of norm in H, we obtain
| | u g o p u h g h o p | | H 2 = y 0 i = 1 n x i x i + 1 u g o p ( x , y ) u h g h o p ( x , y ) 2 d x = y 0 i = 1 n x i x i + 1 1 2 g o p x 2 + x 0 x ( g o p g h o p ) + h g h o p ( i x h i ( i 1 ) 2 ) 2 d x = 1 120 x 0 3 y 0 g o p 2 10 25 x 0 C 3 * g o p + 16 x 0 C 3 * g o p 2 h 2 + o ( h 3 ) .
where C 3 * is given by (39). Therefore it follows that
u g o p u h g h o p H C 5 h ,
with
C 5 = | g o p | 1 120 x 0 3 y 0 10 25 x 0 C 3 * g o p + 16 x 0 C 3 * g o p 2 .
b)
We have that
u g o p x u h g h o p x H 2 = y 0 i = 1 n x i x i + 1 g o p x + h g h o p i + x 0 ( g o p g h o p ) 2 d x = x 0 y 0 6 2 g o p 2 x 0 2 + g o p g h o p ( h 2 + 3 h x 0 4 x 0 2 ) + g h o p 2 ( h 2 3 h x 0 + 2 x 0 2 ) = x 0 y 0 6 2 x 0 2 ( g o p g h o p ) 2 + 3 h x 0 g h o p ( g o p g h o p ) + h 2 g h o p ( g o p + g h o p ) .
Taking into account Lemma 4, we get
u g o p x u h g o p h x H 2 = x 0 y 0 6 g o p 2 2 + 3 x 0 C 3 * g o p + 2 x 0 C 3 * g o p 2 h 2 + o ( h 3 ) .
Then
u g o p x u h g o p h x H C 6 h ,
with
C 6 = | g o p | x 0 y 0 6 2 3 x 0 C 3 * g o p + 2 x 0 C 3 * g o p 2 ,
where C 3 * is given by (39).

3.2. Discrete Problem ( P 1 h α ) Associated to ( P 1 α )

From [6], we know that the continuous quadratic functional cost in (6) for the optimization problem ( P 1 α ) is explicitly given by:
J 1 α ( g ) = J 1 ( g ) + x 0 2 y 0 q 2 2 α g 2 x 0 2 q 2 2 3 + 1 α x 0 + g x 0 q 5 3 2 α x 0 + 2 ( b z d ) q x 0 + 1 + 1 α x 0 2 ( b z d ) q x 0 } ,
where J 1 is defined by (27). Moreover, the continuous optimal distributed variable denoted by g α o p is
g α o p = q 3 x 0 5 8 ( b z d ) q x 0 + 5 2 α x 0 + 3 α 2 x 0 2 3 ( b z d ) α q x 0 2 2 15 + M 1 x 0 4 + 2 3 α x 0 + 1 α 2 x 0 2 .
The continuous associated state is established by:
u α g α o p ( x , y ) = 1 2 g α o p x 2 + ( g α o p x 0 q ) x + 1 α ( g α o p x 0 q ) + b .
Defining the discrete cost function as:
J 1 h α ( g ) = 1 2 u h α z d H 2 + 1 2 M 1 g H 2
where the function u h α is given in (26) we set the following discrete optimization problem ( P 1 h α ) on the constant internal energy g as
find g h α o p R such that J 1 h α ( g h α o p ) = min g R J 1 α h ( g ) .
The discrete cost function J 1 h α is explicitly given by
J 1 h α ( g ) = J 1 α ( g ) + 1 2 x 0 3 y 0 g q h { g x 0 q [ 5 24 + 1 36 h x 0 + 1 24 h 2 x 0 2 + 1 180 h 3 x 0 3 + 1 α x 0 7 6 + 1 3 h x 0 + 1 6 h 2 x 0 2 + 1 α 2 x 0 2 2 + h x 0 ] + 1 3 + 1 12 h x 0 + 1 α x 0 3 2 + 1 6 h x 0 + 2 α 2 x 0 2 + ( b z d ) q x 0 1 2 1 6 h x 0 2 α x 0 } ,
where J 1 α is given by (40).
Lemma 6. 
For g H , h > 0 and α > 0 the following estimate holds
| J 1 h α ( g ) J 1 α ( g ) | C 2 α h
with
C 2 α = 1 2 x 0 3 y 0 | g | | g x 0 q 5 24 7 6 1 α x 0 2 α 2 x 0 2 + 1 3 + 3 2 1 α x 0 + 2 α 2 x 0 2 + ( b z d ) q x 0 1 2 2 α x 0 | ,
a constant independent of h .
Proof. 
It follows immediately from expression (44). □
Remark 2. 
C 2 α C 2 when α , where C 2 is given in Lemma 3.
Lemma 7. 
a) 
The explicit expression for the optimal variable g h α o p is given by:
g h α o p = q 3 x 0 A 1 α + h x 0 A 2 α + h 2 x 0 2 A 3 α A 4 α + A 5 α ( h ) ,
where
A 1 α = 5 8 b z d q x 0 + 1 α x 0 5 2 + 3 α x 0 3 ( b z d ) q x 0 , A 2 α = 3 ( b z d ) 4 q x 0 1 2 + 1 α x 0 9 4 3 α x 0 + 3 ( b z d ) q x 0 , A 3 α = b z d 4 q x 0 1 8 1 4 α x 0 , A 4 α = 2 15 + M 1 x 0 4 + 1 α x 0 2 3 + 1 α x 0 , A 5 α ( h ) = h 12 x 0 h 3 15 x 0 3 + h 2 2 x 0 2 + h 3 x 0 5 2 + h α x 0 2 7 6 + h 3 x 0 + h 2 6 x 0 2 + 1 α x 0 2 + h x 0 .
b) 
In addition, the following error estimates hold:
| g α o p g h α o p | C 3 α h ,
J 1 α ( g α o p ) J 1 h α ( g h α o p ) C 4 α h ,
where C 3 α and C 4 α do not depend on h.
Proof. 
a)
It follows immediately from the fact that
J 1 h α ( g ) = 1 2 x 0 3 y 0 q 2 2 g x 0 2 q 2 A 4 α + A 5 α ( h ) 2 3 x 0 q A 1 α + h x 0 A 2 α + h 2 x 0 2 A 3 α .
b)
Notice that g α o p given by (41) can be rewriten as g α o p = q 3 x 0 A 1 α A 4 α . Then,
g h α o p g α o p = q 3 x 0 A 1 α A 5 α ( h ) + h x 0 A 2 α A 4 α + h 2 x 0 2 A 3 α A 4 α A 4 α 2 + A 4 α A 5 α ( h ) q 3 x 0 2 A 2 α A 4 α + 5 24 A 1 α A 4 α 2 h + o ( h 2 ) .
and we obtain (47) with C 3 α = | C 3 α * | where
C 3 α * = q 3 x 0 2 A 2 α A 4 α + 5 24 + 7 6 α x 0 A 1 α A 4 α 2 .
Following Lemma 4 it is obtained formula (48) with
C 4 α = 1 2 x 0 2 y 0 q 2 | 2 A 4 α C 3 α * g α o p x 0 3 q 2 + 5 24 g α o p 2 x 0 2 q 2 + 7 6 g α o p 2 x 0 α q 2 + 2 3 A 1 α C 3 α * x 0 2 q + 2 3 A 2 α g α o p x 0 q | .
Remark 3. 
When α , we have that A i α A i , where A i and A i α are given by (36) and (46), respectively for i = 1 , 2 , , 5 . As an immediate consequence it follows that, C 3 α C 3 and C 4 α C 4 when α , where C 3 and C 4 are defined in Lemma 4.
Lemma 8. 
Let us consider u α g α o p the function given by (14) for g = g α o p where g α o p is the optimal variable of problem ( P 1 α ) given by (41) and u h α g h α o p the function defined by (26) for h > 0 where g = g h α o p is the optimal variable of ( P 1 h α ) given by (35). We have that:
a ) u α g α o p u h α g h α o p H C 5 α h , b ) u α g α o p x u h α g h α o p x H C 6 α h ,
where C 5 α and C 6 α are positive constants independent of the parameter h .
Proof. 
Working algebraically we can obtain that
C 5 α = | g α o p | { 1 120 x 0 3 y 0 [ 10 25 x 0 C 3 α * g o p + 16 x 0 C 3 α * g o p 2 + 1 α x 0 60 + 120 α x 0 240 C 3 α * α g α o p + 120 C 3 α * x 0 α g α o p 2 140 C 3 α * x 0 g α o p + 80 C 3 α * x 0 2 g α o p 2 ] } 1 / 2 ,
and
C 6 α = | g α o p | x 0 y 0 6 2 3 x 0 C 3 α * g α o p + 2 x 0 C 3 α * g α o p 2 ,
where C 3 α * is given by (49). □
Remark 4. 
C 5 α C 5 and C 6 α C 6 when α where C 5 and C 6 are given in Lemma 5.
Remark 5. 
In [23] the double convergence when ( h , α ) ( 0 , + ) of the optimal control problem ( P 1 h α ) has been studied, obtaining a commutative diagram that relates the continuous and discrete optimal control problems ( P 1 ) , ( P 1 α ) , ( P 1 h ) and ( P 1 h α ) as in the following scheme:
Preprints 191002 i001

4. Boundary Optimization Problem with Variable q

4.1. Discrete Problem ( P 2 h ) Associated to ( P 2 )

Under the same considerations given in Section 3.1 and taking into account formula (9), for a given q Q , we obtain the following quadratic cost function:
J 2 ( q ) = x 0 y 0 2 { q 2 x 0 2 1 3 + M 2 x 0 3 + q x 0 5 12 g x 0 2 ( b z d ) + 2 15 g 2 x 0 4 + ( b z d ) 2 + 2 3 g x 0 2 ( b z d ) } .
Then, the boundary optimal control of the problem ( P 2 ) , called q o p , and the associated continuous optimal state are given by:
q o p = 5 12 g x 0 2 + ( b z d ) 2 x 0 1 3 + M 2 x 0 3 , u q o p ( x , y ) = 1 2 g x 2 + ( g x 0 q o p ) x + b .
Associated to ( P 2 ) , we define the approximate discrete distributed optimal control problem ( P 2 h ) on the constant heat flux q as
find q h o p R such that J 2 h ( q h o p ) = min q R J 2 h ( q )
where the discrete cost function J 2 h is defined by
J 2 h ( q ) = 1 2 u h z d H 2 + 1 2 M 2 q Q 2 ,
where u h is given in (22), h is the spatial step, and z d (the desired state) and the control q are constant. From the definition of norm over Q, it results that:
J 2 h ( q ) = 1 2 y 0 M 2 q 2 x 0 + i = 1 n x i x i + 1 [ u h ( x , y ) z d ] 2 d x
and working algebraically, we get
J 2 h ( q ) = J 2 ( q ) + x 0 y 0 2 { h g x 0 1 3 q x 0 5 24 g x 0 2 1 2 ( b z d ) + h 2 g 1 36 x 0 2 g 1 6 ( b z d ) + 1 12 q x 0 + 1 24 h 3 g 2 x 0 + 1 180 h 4 g 2 } .
Lemma 9. 
Given q Q and h > 0 , we have that
| J 2 h ( q ) J 2 ( q ) | C 7 h ,
where C 7 = 1 2 x 0 2 y 0 | g | 1 3 q x 0 5 24 g x 0 2 1 2 ( b z d ) is a constant independent of h .
proof: It follows immediately from the expression (52) for J 2 h .
Lemma 10. 
Let us consider h > 0 .
a)
The explicit expression for the optimal variable q h o p is given by:
q h o p = q o p B 1 g h 6 B 2 g h 2 24 x 0 ,
with B 1 = B 2 = 1 3 + M 2 x 0 3 1 .
b)
The following error estimates hold:
| q h o p q o p | C 8 h ,
J 2 h ( q h o p ) J 2 ( q o p ) C 9 h ,
where C 8 and C 9 are constants independent of h.
Proof. 
a)
From the expression (52) for J 2 h we have that
J 2 h ( q ) = 1 2 x 0 2 y 0 2 x 0 q 1 3 + M 2 x 0 3 5 12 g x 0 2 ( b z d ) + 1 3 g x 0 h + 1 12 g h 2 .
Therefore
q h o p = 5 12 g x 0 2 + ( b z d ) 1 12 g h 2 1 3 g x 0 h 2 x 0 1 3 + M 2 x 0 3 .
Taking into account that q o p is given by (51), we obtain formula (54).
b)
On one hand, expression (55) is a direct consequence of expression (54) with C 8 = | g B 1 6 | .
On the other hand, taking into account formula (52) for J 2 h it follows that
J 2 h ( q h o p ) J 2 ( q o p ) = J 2 ( q h o p ) J 2 ( q o p ) + x 0 2 y 0 2 h g 1 3 q h o p x 0 5 24 g x 0 2 1 2 ( b z d ) + o ( h 2 ) .
From the definition of J 2 given by (50) and the explicit expression (54) for q h o p we get
J 2 ( q h o p ) J 2 ( q o p ) = x 0 2 y 0 2 { x 0 B 1 ( q h o p 2 q o p 2 ) + ( q h o p q o p ) 5 12 g x 0 2 ( b z d ) } = x 0 2 y 0 2 ( q h o p q o p ) x 0 B 1 ( q h o p + q o p ) 5 12 g x 0 2 ( b z d ) = x 0 2 y 0 12 g h B 1 2 x 0 B 1 q o p + 5 12 g x 0 2 + b z d + o ( h 2 ) .
Taking into account (57) and (58), we obtain the estimate (56) with
C 9 = | g | x 0 2 y 0 2 B 1 6 2 x 0 B 1 q o p + 5 12 g x 0 2 + b z d + 1 3 q o p x 0 5 24 g x 0 2 1 2 ( b z d ) .
Lemma 11. 
Consider u q o p the solution of (1)-(2) for q = q o p and u h q h o p the discrete solution given by (22) for each h > 0 where q = q h o p is the optimal variable of the problem ( P 2 h ) given by (54). Then we have that:
a ) u h q h o p u q o p H C 10 h , b ) u h q h o p x u q o p x H C 11 h ,
where C 10 and C 11 do not depend on the parameter h .
Proof. 
a)
From the definition of u and u h given by (13) and (22), respectively, it follows for i = 1 , , n that
u h q h o p ( x , y ) u q o p ( x , y ) = 1 2 g x 2 ( q h o p q o p + g i h ) x + g i 2 i 2 h 2 , = 1 2 g x 2 + h g x B 1 6 i + h 2 g B 1 24 x x 0 + i ( i 1 ) 2 , x [ x i , x i + 1 ] .
Then
u h q h o p u q o p H 2 = y 0 i = 1 n x i x i + 1 u h q h o p ( x ) u q o p ( x ) 2 d x = x 0 y 0 g 2 [ 1 108 ( B 1 3 ) 2 h 2 x 0 2 + 1 216 h 3 x 0 ( B 1 3 ) 2 + 1 8640 h 4 ( 72 30 B 1 + 5 B 1 2 ) ] .
Therefore, we get formula (59) a) with C 10 = | g ( B 1 3 ) | x 0 x 0 y 0 108 .
b)
In the same manner, we get
u h q h o p x u q o p x H 2 = y 0 i = 1 n x i x i + 1 g x ( q o p h q o p ) h g i 2 d x = y 0 g 2 1 36 ( 12 6 B 1 + B 1 2 ) h 2 x 0 + 1 72 ( B 1 3 ) B 1 h 3 + 1 576 B 1 2 h 4 x 0 .
Then we get (59) b) with
C 11 = | g | 6 x 0 y 0 ( 12 6 B 1 + B 1 2 ) .

4.2. Discrete Problem ( P 2 h α ) Associated to ( P 2 α )

If we suppose that the desired state z d is constant in (9), the quadratic cost function J 2 α for the optimal control problem ( P 2 α ) is explicitly given by:
J 2 α ( q ) = x 0 y 0 2 [ q 2 x 0 2 ( D 1 α + M 2 x 0 3 ) + q x 0 D 2 α g x 0 2 + D 3 α ( b z d ) + D 4 α g 2 x 0 4 + D 5 α ( b z d ) 2 + D 6 α g x 0 2 ( b z d ) ] ,
where
D 1 α = 1 3 + 1 α x 0 + 1 α 2 x 0 2 , D 2 α = 5 12 5 3 α x 0 2 α 2 x 0 2 , D 3 α = 1 2 α x 0 , D 4 α = 2 15 + 2 3 α x 0 + 1 α 2 x 0 2 , D 5 α = 1 , D 6 α = 2 3 + 2 α x 0 .
Then, the continuous boundary optimization control, called q α o p , and the associated state are:
q α o p = D 2 α g x 0 2 + D 3 α ( b z d ) 2 x 0 D 1 α + M 2 x 0 3 , u α q α o p ( x , y ) = 1 2 g x 2 + ( g x 0 q α o p ) x + 1 α ( g x 0 q α o p ) + b .
Remark 6. 
Notice that J 2 α ( q ) J 2 ( q ) for all q Q and q α o p q o p when α .
Defining the discrete cost function as:
J 2 h α ( q ) = 1 2 u h α z d H 2 + 1 2 M 2 q Q 2 ,
where u h α is the solution of ( S h α ) given in (26), we set the following discrete optimization problem ( P 2 h α ) on the constant heat flux q as
find q h α o p R such that J 2 h α ( q h α o p ) = min q R J 2 h α ( g ) .
Working algebraically, the cost function J 2 h α can be written explicitly as:
J 2 h α ( q ) = J 2 α ( q ) + 1 2 x 0 y 0 g h { q x 0 2 3 5 g x 0 3 24 ( b z d ) x 0 2 + 3 x 0 q 2 α 7 g x 0 2 6 α 2 ( b z d ) α + 2 ( q g x 0 ) α 2 + h x 0 2 g 36 ( b z d ) 6 + q x 0 12 + 2 g x 0 + q 6 α + g α 2 + h 2 g x 0 24 + 1 6 α + 1 180 g h 3 } .
Lemma 12. 
For each q Q and h > 0 , we have that:
| J 2 h α ( q ) J 2 α ( q ) | C 7 α h ,
with
C 7 α = 1 2 x 0 2 y 0 g q x 0 3 5 g x 0 2 24 ( b z d ) 2 + 3 q 2 α 7 g x 0 6 α 2 ( b z d ) x 0 α + 2 ( q g x 0 ) x 0 α 2 ,
a constant independent of h .
Proof. 
It follows immediately from expression (65). □
Lemma 13. 
Let us consider h > 0 .
a)
The explicit expression for the optimal control q h o p is given by:
q h α o p = q α o p , B 1 α g h 6 B 2 α g h 2 24 x 0
with
B 1 α = 1 + 9 2 α x 0 + 6 α 2 x 0 2 D 1 α + M 2 x 0 3 1 , B 2 α = 1 2 α x 0 D 1 α + M 2 x 0 3 1 .
b)
The following error estimates hold:
| q h α o p q α o p | C 8 α h ,
J 2 h α ( q h α o p ) J 2 α ( q α o p ) C 9 α h ,
where C 8 α and C 9 α does not depend on h.
Proof. 
a)
From the derivative of the control function J 2 h α given by
J 2 h α ( q ) = J 2 α ( q ) + 1 2 x 0 y 0 g h x 0 2 3 + 3 x 0 2 α + 2 α 2 + h x 0 12 + 1 6 α = x 0 y 0 2 { 2 q x 0 2 D 1 α + M 2 x 0 3 + x 0 D 2 α g x 0 2 + D 3 α ( b z d ) + g h x 0 2 3 + 3 x 0 2 α + 2 α 2 + h x 0 12 + 1 6 α } ,
it follows that
q h α o p = g h x 0 2 3 + 3 x 0 2 α + 2 α 2 g h 2 x 0 12 + 1 6 α x 0 D 2 α g x 0 2 + D 3 α ( b z d ) 2 x 0 2 D 1 α + M 2 x 0 3 .
Working algebraically we get formula (67).
b)
The estimate (68) follows straightforwardly from (67) with
C 8 α = g B 1 α 6 .
From formula (65) we obtain that
J 2 h α ( q h α o p ) J 2 α ( q α o p ) = J 2 α ( q h α o p ) J 2 α ( q α o p ) + 1 2 x 0 y 0 g h ( q h α o p x 0 2 3 5 g x 0 3 24 ( b z d ) x 0 2 + 3 x 0 q h α o p 2 α 7 g x 0 2 6 α 2 ( b z d ) α + 2 ( q h α o p g x 0 ) α 2 ) + o ( h 2 ) .
Moreover taking into account the explicit expression for J 2 α given by (65) and formula (67) it follows that
J 2 α ( q h α o p ) J 2 α ( q α o p ) = x 0 2 y 0 2 q h α o p q α o p [ q h α o p + q α o p x 0 D 1 α + M 2 x 0 3 + D 2 α g x 0 2 + D 3 α ( b z d ) ] = x 0 2 y 0 12 g B 1 α 2 q 1 x 0 D 1 α + M 2 x 0 3 + D 2 α g x 0 2 + D 3 α ( b z d ) + o ( h 2 ) .
Combining (70) and (71) we get estimate (69) with
C 9 α = x 0 2 y 0 2 | g | | B 1 α 6 2 q α o p x 0 D 1 α + M 2 x 0 3 + D 2 α g x 0 2 + D 3 α ( b z d ) + q α o p x 0 3 5 g x 0 2 24 ( b z d ) 2 + 3 q α o p 2 α 7 g x 0 6 α 2 ( b z d ) α x 0 + 2 ( q α o p g x 0 ) α 2 x 0 | .
Lemma 14. 
Let us consider u q α o p the solution of (1) -(3) for q = q α o p and u h q h α o p the discrete solution given in (26) for h > 0 and q = q h α o p . Then we have that:
a ) u h α q h α o p u α q α o p H C 10 α h , b ) u h α q h α o p x u α q α o p x H C 11 α h ,
Proof. 
Similarly to what was done in Lemma 12 it is obtained that
C 10 α = | g | x 0 x 0 y 0 108 B 1 α 2 3 α 2 x 0 2 + 3 α x 0 + 1 + 9 12 α 2 x 0 2 + 6 α x 0 + 1 3 B 1 α 12 α 2 x 0 2 + 9 α x 0 + 2
C 11 α = | g | 6 x 0 y 0 ( 12 6 B 1 α + B 1 α 2 ) .
Remark 7. 
The constants verify that C i α C i , when α , for each i = 7 , , 11 .
Remark 8. 
The double convergence when ( h , α ) ( 0 , + ) of the optimal control of the problem ( P 2 h α ) holds. The relationship of the optimal control problems ( P 2 ) , ( P 2 α ) , ( P 2 h ) and ( P 2 h α ) is given by the following diagram:
Preprints 191002 i002

5. Boundary Optimization Problem with Variable b

5.1. Discrete Problem ( P 3 h ) Associated to ( P 3 )

In this section we consider the boundary optimal control problem ( P 3 ) given by (10). Taking into account expression (12), for a given constant b we get that
J 3 ( b ) = x 0 y 0 2 { b 2 1 + M 3 x 0 + b 2 g x 0 2 3 q x 0 2 z d + 2 g 2 x 0 4 15 5 g q x 0 3 12 + x 0 2 3 ( q 2 2 g z d ) + z d ( z d + q x 0 ) } .
Then the boundary optimal variable of the problem ( P 3 ) , called b o p , and the associated continuous optimal state, are given respectively by:
b o p = g x 0 2 3 + q x 0 2 + z d 1 + M x 0 , u b o p = 1 2 g x 2 + ( g x 0 q ) x + b o p .
We define the discrete optimal control problem ( P 3 h ) on the constant temperature b as
find b h o p R such that J 3 h ( b h o p ) = min b R J 3 h ( b )
where the discrete cost function J 3 h ( b ) is defined as:
J 3 h ( b ) = 1 2 u h z d H 2 + 1 2 M 3 b B 2 ,
where u h is given in (22), h is the spatial step, and z d (the desired state) is constant.
Notice that the cost function J 3 h can be explicitly written as:
J 3 h ( b ) = J 3 ( b ) + x 0 y 0 g 2 { b h x 0 2 + h 6 + h x 0 1 3 q x 0 5 24 g x 0 2 + z d 2 + 1 6 h 2 q x 0 2 + 1 6 g x 0 2 + z d + 1 24 g h 3 x 0 + 1 180 g h 4 } .
Lemma 15. 
Let b R and h > 0 we have that:
| J 3 h ( b ) J 3 ( b ) | C 12 h ,
where
C 12 = 1 2 x 0 2 y 0 | g | b 2 + q x 0 3 5 g x 0 2 24 + z d 2 ,
does not depend on h .
Proof. 
It follows from expression (75) for J 3 h . □
Lemma 16. 
Let us consider h > 0 .
a) 
The explicit expression for the optimal variable b h o p is given by:
b h o p = b o p + E 1 g x 0 h 1 + h 3 x 0 , E 1 = 1 4 1 + M 3 x 0 .
b) 
The following error estimates hold:
| b h o p b o p | C 13 h ,
J 3 h ( b h o p ) J 3 ( b o p ) C 14 h ,
where C 13 and C 14 do not depend on h.
Proof. 
a)
According to (75) we have that
J 3 h ( b ) = J 3 ( b ) x 0 y 0 2 g b h x 0 2 + h 6 .
Then, formula (77) for b h o p follows immediately.
b)
Estimate (78) is a direct consequence of (77) with C 13 = | E 1 g x 0 | .
Moreover, taking into account formulas (73) and (75) for J 3 and J 3 h and formulas (74) and (77) for b o p and b h o p , respectively, it follows that
J 3 h ( b h o p ) J 3 ( b o p ) = J 3 ( b h o p ) J 3 ( b o p ) + x 0 2 y 0 g 2 b h o p 2 + 1 3 q x 0 5 24 g x 0 2 + z d 2 h + o ( h 2 ) .
In addition, the expression J 3 ( b h o p ) J 3 ( b o p ) can be rewritten as
J 3 ( b h o p ) J 3 ( b o p ) = x 0 2 y 0 g 2 E 1 2 b o p 1 + M 3 x 0 + 2 3 g x 0 2 q x 0 2 z d h + o ( h 2 ) .
Therefore it follows estimate (2) with
C 14 = x 0 2 y 0 g 2 E 1 2 b o p 1 + M 3 x 0 + 2 3 g x 0 2 q x 0 2 z d b o p 2 + q x 0 3 5 g x 0 2 24 + z d 2 .
Lemma 17. 
Let us consider u b o p the solution of (1) -(3) for b = b o p and u h b h o p the discrete solution given in (26) for h > 0 and b = b h o p . Then we have that:
a ) u h b h o p u b o p H C 15 h , b ) u h b h o p x u b o p x H C 16 h ,
where C 15 and C 16 are constants that do not depend on h.
Proof. 
Working algebraically it is obtained that
u h b h o p u b o p H 2 = x 0 3 y 0 g 2 2 2 E 1 2 E 1 + 1 6 h 2 + o ( h 3 ) .
Then it is obtained estimate a ) with
C 15 = x 0 | g | x 0 y 0 2 2 E 1 2 E 1 + 1 6 .
In a similar manner we get that estimate b ) holds with
C 16 = | g | x 0 y 0 2 .

5.2. Discrete Problem ( P 3 h α ) Associated to ( P 3 α )

From [6], we know that the continuous quadratic functional cost in (6) for the optimization problem ( P 3 α ) is explicitly given by:
J 3 α ( b ) = J 3 ( b ) + x 0 y 0 2 1 3 α ( q g x 0 ) ( 6 b + 3 q x 0 2 g x 0 2 + 6 z d ) + 1 α 2 ( q g x 0 ) 2
where J 3 is defined by (73). Moreover, the continuous optimal boundary control b α o p is given by
b α o p = b o p g x 0 q α ( 1 + M 3 x 0 ) .
The continuous associated state is established by:
u b α o p ( x , y ) = 1 2 g x 2 + ( g x 0 q ) x + 1 α ( g x 0 q ) + b α o p .
Defining the discrete cost function as:
J 3 h α ( b ) = 1 2 u h α z d H 2 + 1 2 M 3 b B 2
where u h α is the solution of ( S h α ) given in (26), we set the following discrete optimization problem ( P 3 h α ) as
find b h α o p R such that J 3 h α ( b h α o p ) = min b R J 3 h α ( b ) .
Working algebraically lead us to write J 3 h α as follows:
J 3 h α ( b ) = J 3 α ( b ) + 1 2 x 0 y 0 g h { b x 0 2 + 2 α + h 6 + g 5 x 0 3 24 7 x 0 2 6 α 2 x 0 α 2 + q x 0 2 3 + 3 x 0 2 α + 2 α 2 + z d x 0 2 + 2 α + h g x 0 2 36 + x 0 3 α + 1 α 2 + q x 0 12 + 1 6 α + z d 6 + h 2 g x 0 24 + 1 6 α + h 3 g 180 } .
Lemma 18. 
For b B and h > 0 we have that
| J 3 h α ( b ) J 3 α ( b ) | C 12 α h ,
with
C 12 α = x 0 y 0 2 | g | b x 0 2 + 2 α + h 6 + g 5 x 0 3 24 7 x 0 2 6 α 2 x 0 α 2 + q x 0 2 3 + 3 x 0 2 α + 2 α 2 + z d x 0 2 + 2 α .
Proof. 
It arises immediately from (86). □
Lemma 19. 
Let us consider h > 0 .
a) 
The explicit expression for the optimal control b h α o p is given by:
b h α o p = b α o p + E 1 g x 0 h 1 + 4 α x 0 + h 3 x 0 ,
where E 1 is given in (77).
b) 
The following error estimates hold:
| b h α o p b α o p | C 13 α h ,
J 3 h α ( b h α o p ) J 3 α ( b α o p ) C 14 α h ,
where C 13 α and C 14 α do not depend on h.
Proof. 
a)
It follows from the expression J 3 h α given by (86).
b)
The estimate in (89) is obtained immediately from item a ) with
C 13 α = | E 1 | | g | x 0 1 + 4 α x 0 .
Taking into account (86) and (82) it results that
J 3 h α ( b h α o p ) J 3 α ( b α o p ) = J 3 α ( b h α o p ) J 3 α ( b α o p ) + F 1 α h + o ( h 2 ) .
with
F 1 α = 1 2 x 0 2 y 0 g ( b α o p z d ) 1 2 + 2 α x 0 + g x 0 2 5 24 7 6 α x 0 2 α 2 x 0 2 + q x 0 1 3 + 3 2 α x 0 + 2 α 2 x 0 2 .
In addition, from the definition of J 3 α and b h α o p we have that
J 3 α ( b h α o p ) J 3 α ( b α o p ) = J 3 ( b h α o p ) J 3 ( b α o p ) + F 2 α h + o ( h 2 )
with
F 2 α = x 0 2 y 0 g α E 1 ( q + g x 0 ) 1 + 4 α x 0 .
Finally, according to formula (73) for J 3 we get that
J 3 ( b h α o p ) J 3 ( b α o p ) = F 3 α h + o ( h 2 ) ,
with
F 3 α = x 0 2 y 0 g 2 E 1 1 + 4 α x 0 2 b α o p 1 + M 3 x 0 + 2 3 g x 0 2 q x 0 2 z d .
Therefore, estimate (2) holds for
C 14 α = F 1 α + F 2 α + F 3 α .
Lemma 20. 
Let us consider u b α o p the solution of (1) -(3) for b = b α o p and u h b h α o p the discrete solution given in (26) for h > 0 and b = b h α o p . Then we have that:
a ) u h α b h α o p u α b α o p H C 15 α h , b ) u h α b h α o p x u α b α o p x H C 16 α h ,
Proof. 
Similarly to what was done in Lemma 12 it is obtained that
C 15 α = x 0 | g | x 0 y 0 2 A , A = E 1 2 2 + 16 α x 0 + 32 α 2 x 0 2 + E 1 1 8 α x 0 16 α 2 x 0 2 + 1 6 + 1 α x 0 + 2 α 2 x 0 2 , C 16 α = C 16 .
Remark 9. 
The constants obtained in the estimates of the previous lemmas verify that C i α C i , when α for i = 12 , , 16 .
Remark 10. 
The double convergence when ( h , α ) ( 0 , + ) of the optimal control of the problem ( P 3 h α ) holds. The relationship of the optimal control of the problems ( P 3 ) , ( P 3 α ) , ( P 3 h ) and ( P 3 h α ) is given by the following diagram:
Preprints 191002 i003

6. Numerical Results

We will carry out some numerical simulations in order to illustrate the theoretical results obtained in the previous sections for the optimal control problems ( P i h ) and ( P i h α ) for i = 1 , 2 , 3 .
Throughout this section we consider the domain Ω = [ 0 , 1 ] × [ 0 , 1 ] , i.e, x 0 = y 0 = 1 .
Before analyzing the optimal control problems we illustrate the behavior of the continuous state of the systems ( S ) and ( S α ) and the discrete state of the systems ( S h ) and ( S h α ) .
In Figure 1 a) we plot the state of the system u given by (13) and the approximate discrete function u h defined by (22) against the position x for h = 1 / 3 , 1 / 5 , 1 / 10 . As we saw in Lemma 1 for each fixed x, the u h ( x ) increase and get closer to the limit u ( x ) as h decreases. In a similar manner, in Figure 1 b), for α = 50 we obtain the system u α given by (13) and the approximate discrete function u h α defined by (26) against the position x for h = 1 / 3 , 1 / 5 , 1 / 10 . Notice that as h decreases, the functions { u h α } increase and get closer to the limit u α as it was proved in Lemma 2.
In addition in order to visualize the double convergence of u h α u when ( h , α ) ( 0 , ) , in Figure 2 we plot u and u h α for ( h , α ) = ( 1 / 3 , 10 ) , ( 1 / 5 , 50 ) and ( 1 / 10 , 500 ) .

6.1. Control Variable g

In this subsection we obtain some computational examples for the optimal distributed control problems ( P 1 ) , ( P 1 h ) , ( P 1 α ) and ( P 1 h α ) . For each plot we set q = 12 , b = 30 , z d = 40 and M 1 = 1 .
In Figure 3 we plot the continuous quadratic cost function J 1 given by (27) and the discrete cost function J 1 h obtained in (32) against g for h = 1 / 10 , 1 / 50 and 1 / 100 . Notice that as h decreases the function J 1 h = J 1 h ( g ) also decreases to the limit function J 1 = J 1 ( g ) in agreement with Lemma 3. In a similar manner in Figure 3, for α = 50 we obtain the continuous function J 1 α and the discrete functions J 1 h α for h = 1 / 10 , 1 / 50 and 1 / 100 observing the convergence of J 1 h α J 1 α as h decreases to 0. Moreover, Figure 3 shows the double convergence of J 1 h α J 1 when ( h , α ) ( 0 , ) . We illustrate how J 1 h α gets closer to J 1 as the value of h decreases and the value of α increases.
In Figure 3 we plot the continuous optimal control g o p for the problem ( P 1 ) given by (29) and the optimal control g α o p given by (41) for α = 15 , 50 , 100 . Notice that as α increases, g α o p decreases to the limit g o p . In addition, we set different values of n between n = 10 and n = 100 . Recalling that h = x 0 n = 1 n , for each h we obtain the optimal discrete control g h o p to the problem ( P 1 h ) defined by (4) and the optimal discrete control g h α o p to the problem ( P 1 h α ) given by (41) for α = 15 , 50 , 100 . For each α fixed, we have that the discrete solution g h α o p g α o p when h 0 , i.e. n .

6.2. Control Variable q

In this subsection we run some computational examples for the optimal boundary control problems ( P 2 ) , ( P 2 h ) , ( P 2 α ) and ( P 2 h α ) . For each plot we set g = 10 , b = 50 , z d = 40 and M 2 = 1 .
In Figure 4 we plot the continuous quadratic cost function J 2 given by (50) and the discrete cost function J 2 h obtained in (52) against q for h = 1 / 10 , 1 / 25 and 1 / 50 . Observe that as h decreases the function J 2 h = J 2 h ( q ) also decreases to the limit function J 2 = J 2 ( q ) . In a similar way, in Figure 4, for α = 100 we obtain the continuous function J 2 α and the discrete functions J 2 h α for h = 1 / 10 , 1 / 25 and 1 / 50 . The convergences J 2 h J 2 and J 2 h α J 2 α when h 0 are in agreement with Lemmas 9 and 12, respectively.
Moreover, Figure 4 shows the double convergence of J 2 h α J 2 when ( h , α ) ( 0 , ) . We illustrate how J 2 h α gets closer to J 2 as the value of h decreases and the value of α increases.
In Figure 4 we plot the continuous optimal control q o p for the problem ( P 2 ) given by (51) and the optimal control q α o p given by (63) for α = 50 , 100 , 200 . Notice that as α increases, q α o p decreases to the limit q o p . In addition, we set different values of n between n = 10 and n = 100 . Recalling that h = x 0 n = 1 n , for each h we obtain the optimal discrete control q h o p to the problem ( P 2 h ) defined by (54) and the optimal discrete control q h α o p to the problem ( P 2 h α ) given by (67) for α = 50 , 100 , 200 . For each α fixed, we have that the discrete solution q h α o p q α o p when h 0 , i.e. n .

6.3. Control Variable b

In this section we obtain some computational examples for the optimal distributed control problems ( P 3 ) , ( P 3 h ) , ( P 3 α ) and ( P 3 h α ) . For each plot we set q = 12 , g = 10 , z d = 40 and M 3 = 1 .
In Figure 5 we plot the continuous quadratic cost function J 3 given by (73) and the discrete cost function J 3 h obtained in (75) against g for h = 1 / 10 , 1 / 25 and 1 / 100 . Notice that as h decreases the function J 3 h = J 3 h ( b ) also decreases to the limit function J 3 = J 3 ( b ) in agreement with Lemma 15. In a similar manner in Figure 5, for α = 50 we obtain the continuous function J 3 α and the discrete functions J 3 h α for h = 1 / 10 , 1 / 25 and 1 / 100 . Observe the convergence of J 3 h α J 3 α as h 0 . Moreover, Figure 5 shows the double convergence of J 3 h α J 3 when ( h , α ) ( 0 , ) . We illustrate how J 3 h α gets closer to J 3 as the value of h decreases and the value of α increases.
In Figure 5 we plot the continuous optimal control b o p for the problem ( P 3 ) given by (74) and the optimal control b α o p given by (83) for α = 15 , 50 , 100 . Notice that as α increases, b α o p decreases to the limit b o p . In addition, we set different values of n between n = 10 and n = 100 . Recalling that h = x 0 n = 1 n , for each h we obtain the optimal discrete control b h o p to the problem ( P 3 h ) defined by (77) and the optimal discrete control b h α o p to the problem ( P 3 h α ) given by (88) for α = 15 , 50 , 100 . For each α fixed, we have that the discrete solution b h α o p decreases to b α o p when h 0 .

7. Improvement of the Order of Convergence

In this section, we introduce alternative discrete solutions u ˜ h and u ˜ h α associated with the systems ( S ) and ( S α ) , respectively, and analyze the order of convergence of u ˜ h to u and of u ˜ h α to u α as h 0 + . The Neumann boundary condition on Γ 2 is approximated by a three–point backward finite–difference scheme. Moreover, for the discrete solution u ˜ h α , the Robin boundary condition on Γ 1 is approximated by a three–point forward finite–difference scheme. These higher–order boundary approximations lead to an improved order of accuracy.
We consider the system ( S ) defined by equations (1)–(2). From this system, we define the discrete problem ( S ˜ h ) , where u ˜ i approximates u ( x i , y ) , for i = 1 , , n + 1 . Notice that, from the Dirichlet condition on Γ 1 it follows immediately that u ˜ 1 = b .
For the interior nodes, we employ the classical centered second–order finite–difference approximation given in (15), which leads to the discrete system (16) for u ˜ i , i = 2 , . . . , n .
For the Neumann boundary condition on Γ 2 , we use the three–point backward approximation
u x ( x n + 1 , y ) 3 u ( x n + 1 , y ) 4 u ( x n , y ) + u ( x n 1 , y ) 2 h .
Thus, the discrete Neumann condition can be written as
2 q h = 3 u ˜ n + 1 4 u ˜ n + u ˜ n 1 .
In addition, from (16) for i = n , we obtain
g h 2 = u ˜ n + 1 2 u ˜ n + u ˜ n 1 .
Subtracting the two previous equations, it follows that
u ˜ n + u ˜ n + 1 = g h 2 2 q h .
Therefore the system given by (16) together with (95) can be written as
A w ¯ = T *
where w ¯ = ( u ˜ i ) i = 2 , , n + 1 R n is the vector of unknowns, A is the matrix given by (20) and T * R n is the vector of independent terms:
T * = g h 2 b , g h 2 , , g h 2 , q h + g h 2 2 t .
Notice that the system (96) differs from (19) in the last component of the vector of independent terms. Solving the linear system gives
u ˜ i = b + ( i 1 ) h ( g x 0 q ) g h 2 2 ( i 1 ) 2 .
Taking into account that for i = 1 , , n
m ˜ i = u ˜ i + 1 u ˜ i x i + 1 x i = g x 0 q ( 2 i 1 ) g h 2 ,
and
h ˜ i = u ˜ i m ˜ i x i = b + g h 2 2 i ( i 1 ) ,
the linear approximation is given by u ˜ h ( x , y ) = m ˜ i x + h ˜ i , i.e.
u ˜ h ( x , y ) = g x 0 q ( 2 i 1 ) g h 2 x + g h 2 2 i ( i 1 ) + b , x [ x i , x i + 1 ] , i = 1 , , n
In the following lemma, we give some bounds for the approximate function u ˜ h :
Lemma 21. 
The following bounds hold:
u u ˜ h H D 1 h 2 , and u x u ˜ h x H D ˜ 1 h ,
where D 1 = x 0 y 0 120 g and D ˜ 1 = x 0 y 0 12 g .
Proof. 
From the definition of the norm in the space H and using the expressions (13) and (101) for the functions u and u ˜ h , respectively, it follows that
u u ˜ h H 2 = 0 y 0 0 x 0 u ( x , y ) u ˜ h ( x , y ) 2 d x d y = y 0 i = 1 n x i x i + 1 E i 2 ( x ) d x ,
where
E i ( x ) = u ( x , y ) u ˜ h ( x , y ) , x [ x i , x i + 1 ] , y [ 0 , y 0 ] .
Note that, within each subinterval, E i ( x ) depends only on x and the index i, but not on y, since both u and u ˜ h are constant along the y-direction.
A direct computation yields
E i ( x ) = g 2 x 2 + ( 2 i 1 ) h x h 2 i ( i 1 ) = g 2 ( x i h ) ( x ( i 1 ) h ) .
Then
x i x i + 1 E i 2 ( x ) d x = g 2 4 ( x i h ) 5 5 + h 2 ( x i h ) 4 + h 2 3 ( x i h ) 3 x i x i + 1 = g 2 4 h 5 5 h 5 2 + h 5 3 = g 2 120 h 5 .
As a consequence, from (102) it follows that
u u ˜ h H 2 = y 0 g 2 h 5 120 n = x 0 y 0 g 2 120 h 4 ,
and then
u u ˜ h H = x 0 y 0 120 g h 2 .
In addition,
u x u ˜ h x H 2 = 0 y 0 0 x 0 u x ( x , y ) u ˜ h x ( x , y ) 2 d x d y = y 0 i = 1 n x i x i + 1 F i 2 ( x ) d x ,
where
F i ( x ) = u x ( x , y ) u ˜ h x ( x , y ) = g x ( 2 i 1 ) h 2 ,
for x [ x i , x i + 1 ] . Then
x i x i + 1 F i 2 ( x ) d x = x i x i + 1 g 2 x ( 2 i 1 ) h 2 2 d x = g 2 1 3 x ( 2 i 1 ) h 2 3 x i x i + 1 = g 2 1 3 h 3 8 + h 3 8 = g 2 12 h 3 .
Therefore, from (105) we have
u x u ˜ h x H 2 = y 0 g 2 12 n h 3 = x 0 y 0 g 2 12 h 2 ,
and finally
u x u ˜ h x H = x 0 y 0 12 g h .
Remark 11. 
We emphasize that by improving the approximation of the Neumann boundary condition on Γ 2 , the convergence order of the error u u ˜ h H is increased to second order, namely O ( h 2 ) . This enhancement leads to a more accurate numerical approximation while remaining fully consistent with the theoretical convergence results established in [7,13].
Remark 12. 
The linear system (96) obtained by using the three–point backward finite–difference approximation for the Neumann boundary condition on Γ 2 can be equivalently interpreted by introducing a ghost point x n + 2 outside the computational domain and assuming that the discrete differential equation holds at the boundary node x n + 1 . Indeed, assuming that the equation is satisfied at u ˜ n + 1 , we have
g h 2 = u ˜ n + 2 2 u ˜ n + 1 + u ˜ n ,
while the Neumann boundary condition is approximated by
u ˜ n + 2 u ˜ n 2 h = q .
Eliminating the ghost value u ˜ n + 2 from these two expressions yields
u ˜ n + u ˜ n + 1 = q h + g h 2 2 ,
which coincides with the boundary equation obtained in (95). Hence, the three–point backward finite–difference approximation of the Neumann condition is consistent with the ghost–point formulation and leads to the same discrete system.
Analogously to the analysis of system ( S ) , we propose a new discrete approximation u ˜ h α for system ( S α ) and study the order of convergence of u ˜ h α to u α as h 0 + . The associated discrete system ( S ˜ h α ) employs a three–point backward finite–difference approximation for the Neumann boundary condition on Γ 2 and a three–point forward finite–difference approximation for the Robin boundary condition on Γ 1 , leading to improved accuracy.
We consider the system ( S α ) defined by equations (1)–(3) and define u ˜ α , i u α ( x i , y ) .
For the interior nodes, i = 2 , , n , we employ the classical centered second–order finite–difference approximation given in (15):
u ˜ α , i + 1 2 u ˜ α , i + u ˜ α , i 1 = g h 2 .
For the Robin boundary at Γ 1 , we use the three–point forward approximation:
3 u ˜ α , 1 + 4 u ˜ α , 2 u ˜ α , 3 2 h = α ( u ˜ α , 1 b ) .
Combining this expression with the interior equation at i = 2 yields the simplified discrete condition
( 1 + α h ) u ˜ α , 1 + u ˜ α , 2 = α h b g h 2 2 .
For the Neumann boundary at Γ 2 we use the three–point backward approximation:
3 u ˜ α , n + 1 4 u ˜ α , n + u ˜ α , n 1 = 2 q h .
Combining with the interior equation for i = n gives
u ˜ α , n + u ˜ α , n + 1 = q h + g h 2 2 .
The system given by (106), (108) and (110) can be rewritten as
A α w α ¯ = T α *
where w ¯ α = ( u α ˜ i ) i = 1 , , n + 1 R n + 1 is the vector of unknowns, A α is the matrix given by (24) and T α * R n + 1 is the vector of independent terms:
T α * = α b h g h 2 2 , g h 2 , , g h 2 , q h + g h 2 2 t R n + 1 .
It should be noted that only the first and last components of T α * differ from those in T α given by (25).
The solution of the system (111) is given by
u ˜ α , i = b + 1 α g x 0 q + ( i 1 ) h ( g x 0 q ) g 2 ( i 1 ) h 2 , i = 1 , , n + 1 .
We define the linear interpolation on each subinterval [ x i , x i + 1 ] by
u ˜ h α ( x , y ) = m ˜ α , i x + h ˜ α , i , x [ x i , x i + 1 ] , y [ 0 , y 0 ] ,
where
m ˜ α , i = g x 0 q g h i 1 2 , i = 1 , , n ,
h ˜ α , i = b + 1 α ( g x 0 q ) + g h 2 2 ( i 1 ) i , i = 1 , , n .
From the previous expressions, we derive the following lemma.
Lemma 22. 
The following bounds hold:
u α u ˜ h α H D 2 h 2 , u α x u ˜ h α x H D ˜ 2 h ,
where D 2 = x 0 y 0 120 g and D ˜ 2 = x 0 y 0 12 g .
Proof. 
By the definition of the H-norm, and using the expression for u α in (13) as well as the definition of u ˜ h α in (114), it follows that
u α u ˜ h α H 2 = y 0 i = 1 n x i x i + 1 E α , i 2 ( x ) d x ,
where
E α , i ( x ) = u α ( x , y ) u ˜ h α ( x , y )
E α , i ( x ) = g 2 x 2 + g 2 2 i 1 h x g h 2 2 ( i 2 i ) , x [ x i , x i + 1 ]
We can notice that E α , i ( x ) = E i ( x ) where E i ( x ) is given by (103). Therefore, from (104), it follows immediately that
u α u ˜ h α H 2 x 0 y 0 g 2 120 h 4 .
In addition,
u x u ˜ h x H 2 = 0 y 0 0 x 0 u x ( x , y ) u ˜ h x ( x , y ) 2 d x d y = y 0 i = 1 n x i x i + 1 g 2 x ( 2 i 1 ) h 2 2 d x = y 0 g 2 12 h 3 n = x 0 y 0 g 2 12 h 2 .

8. Conclusions

Applying the finite difference method, we have derived the discrete systems ( S h ) and ( S h α ) and the discrete optimization problems ( P i h ) and ( P i h α ) , i = 1 , 2 , 3 where α > 0 is a parameter that represents the heat transfer coefficient on a portion of the boundary of the domain. Explicit discrete solutions have been found and convergence results when the discrete step h goes to zero and when α goes to infinite have been proved. Error estimations have been also obtained as a function of the step h. Some numerical computations have been provided in order to illustrate the theoretical results.
Finally, for the systems ( S ) and ( S α ) , an alternative discretization of the Neumann boundary condition on Γ 2 and of the Robin boundary condition on Γ 1 for ( S α ) has been considered. By modifying the approximation of these boundary conditions, the order of convergence of the numerical solution is improved, leading to a more accurate approximation.

Author Contributions

Conceptualization, D.T.; writing—original draft preparation, J.B. and M.O.; mathematical analysis, J.B., M.O., D.T.; editing—review and editing, J.B., M.O., D.T.; supervision, D.T.; software, M.O.; validation, J.B. and M.O. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding

Acknowledgments

The authors would like to thank the support of project O06-24CI1901 from Universidad Austral, Rosario, Argentina, and project PIP Nº 11220220100532 from CONICET.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. An, X.; He, Z.; Song, X. The explicit solution to the initial-boundary value problem of Gierer–Meinhardt model. Applied Mathematics Letters 2018, 80, 59–63.
  2. Angel, E. Discrete invariant imbedding and elliptic boundary-value problems over irregular regions. Journal of Mathematical Analysis and Applications 1968, 23, 471–484.
  3. Arnal, A.; Monterde, J.; Ugail, H. Explicit polynomial solutions of fourth order linear elliptic partial differential equations for boundary based smooth surface generation. Computer Aided Geometric Design 2011, 28, 382–394.
  4. Azzam, A.; Kreyszig, E. On solutions of elliptic equations satisfying mixed boundary conditions. SIAM Journal on Mathematical Analysis 1982, 13, 254–262.
  5. Barbu, V. Optimal Control of Variational Inequalities; Pitman Advanced Publishing Program: Boston, 1984.
  6. Bollati, J.; Gariboldi, C.M.; Tarzia, D.A. Explicit solutions for distributed, boundary and distributed-boundary elliptic optimal control problems. Journal of Applied Mathematics and Computing 2020, 64, 283–311.
  7. Casas, E.; Mateos, M. Uniform convergence of the FEM. Application to state constrained control problems. Comput. Appl. Math. 2002, 21, 67–100.
  8. Garguichevich, G.; Tarzia, D.A. The steady-state two-phase Stefan problem with an internal energy and some related problems. Atti Sem. Mat. Univ. Modena 1991, 39, 615–634.
  9. Gariboldi, C.M.; Tarzia, D.A. Convergence of distributed optimal controls on the internal energy in mixed elliptic problems when the heat transfer coefficient goes to infinity. Applied Mathematics & Optimization 2003, 47, 213–230.
  10. Gariboldi, C.M.; Tarzia, D.A. Convergence of boundary optimal control problems with restrictions in mixed elliptic Stefan-like problems. Advances in Differential Equations and Control Processes 2008, 1, 113–132.
  11. Grisvard, P. Elliptic Problems in Non-Smooth Domains; Pitman: London, 1985.
  12. Haller-Dintelman, R.; Meyer, C.; Rehberg, J.; Schiela, A. Hölder continuity and optimal control for nonsmooth elliptic problems. Applied Mathematics and Optimization 2009, 60, 397–428.
  13. Hinze, M. A variational discretization concept in control constrained optimization: The linear-quadratic case. Computational Optimization and Applications 2005, 30, 45–61.
  14. Lang, J.; Schmitt, B.A. Exact discrete solutions of boundary control problems for the 1D heat equation. Journal of Optimization Theory and Applications 2023, 196, 1106–1118.
  15. Lanzani, L.; Capogna, L.; Brown, R. The mixed problem in Lp for some two-dimensional Lipschitz domains. Mathematische Annalen 2008, 342, 91–124.
  16. Lions, J. Contrôle optimal de systèmes gouvernés par des équations aux dérivées partielles; Dunod: Paris, 1968.
  17. Neittaanmäki, P.; Sprekels, J.; Tiba, D. Optimization of Elliptic Systems. Theory and Applications; Springer: New York, 2006.
  18. Shamir, E. Regularization of mixed second order elliptic problems. Israel Journal of Mathematics 1968, 6, 150–168.
  19. Tabacman, E.D.; Tarzia, D.A. Sufficient and/or necessary condition for the heat transfer coefficient on γ1 and the heat flux on γ2 to obtain a steady-state two-phase Stefan problem. Journal of Differential Equations 1989, 77, 16–37.
  20. Tarzia, D.A. Sur le problème de Stefan à deux phases. C.R. Acad. Sci. Paris 1979, 288A, 941–944.
  21. Tarzia, D.A. An inequality for the constant heat flux to obtain a steady-state two-phase Stefan problem. Engineering Analysis 1988, 5, 177–181.
  22. Tarzia, D.A. Numerical analysis for the heat flux in a mixed elliptic problem to obtain a discrete steady-state two-phase Stefan problems. SIAM Journal on Numerical Analysis 1996, 33, 1257–1265.
  23. Tarzia, D.A. Double convergence of a family of discrete distributed mixed elliptic optimal control problems with a parameter. In Proceedings of the 27th IFIP TC 7 Conference on System Modelling and Optimization, CSMO 2015, IFIP AICT 494; Bociu, L.; Desideri, J.; Habbal, A., Eds.; Springer Nature Singapore: Berlin, 2016; pp. 493–504.
  24. Tröltzsch, F. Optimal Control of Partial Differential Equations. Theory, Methods and Applications; American Mathematical Society: Providence, 2010.
  25. Wachsmuth, D.; Wachsmuth, G. Regularization error estimates and discrepancy principle for optimal control problems with inequality constraints. Control and Cybernetics 2011, 40, 1125–1158.
  26. Yang, C.; Sun, T. Second-order time discretization for reaction coefficient estimation of bilinear parabolic optimization problem with Neumann boundary conditions. Computers & Mathematics with Applications 2023, 140, 211–224.
Figure 1. State of the systems ( S ) , ( S h ) , ( S α ) and ( S h α ) taking q = 12 , b = 30 , z d = 40 and g = 10 .
Figure 1. State of the systems ( S ) , ( S h ) , ( S α ) and ( S h α ) taking q = 12 , b = 30 , z d = 40 and g = 10 .
Preprints 191002 g001
Figure 2. Plot of u and u h α against n = 1 / h for different values of ( h , α ) .
Figure 2. Plot of u and u h α against n = 1 / h for different values of ( h , α ) .
Preprints 191002 g002
Figure 3. Plot of g o p , g h o p , g α o p and g h α o p
Figure 3. Plot of g o p , g h o p , g α o p and g h α o p
Preprints 191002 g003
Figure 4. Plot of q o p , q h o p , q α o p and q h α o p
Figure 4. Plot of q o p , q h o p , q α o p and q h α o p
Preprints 191002 g004
Figure 5. Plot of b o p , b h o p , b α o p and b h α o p
Figure 5. Plot of b o p , b h o p , b α o p and b h α o p
Preprints 191002 g005
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated