
TL;DR
This paper formulates and analyzes an inverse multiphase Stefan problem as an optimal control problem, proving existence, convergence of discretization, and providing a rigorous mathematical framework for solving it.
Contribution
It introduces a variational optimal control approach for the inverse multiphase Stefan problem and proves convergence of finite difference discretizations to the continuous solution.
Findings
Existence of an optimal control is established.
Finite difference discretization converges to the continuous problem.
Uniform bounds and energy estimates are derived for the discrete solutions.
Abstract
We consider the inverse multiphase Stefan problem with homogeneous Dirichlet boundary condition on a bounded Lipschitz domain, where the density of the heat source is unknown in addition to the temperature and the phase transition boundaries. The variational formulation is pursued in the optimal control framework, where the density of the heat source is a control parameter, and the criteria for optimality is the minimization of the norm declination of the trace of the solution to the Stefan problem from a temperature measurement on the whole domain at the final time. The state vector solves the multiphase Stefan problem in a weak formulation, which is equivalent to Dirichlet problem for the quasilinear parabolic PDE with discontinuous coefficient. The optimal control problem is fully discretized using the method of finite differences. We prove the existence of the optimal control…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Optimal Stefan Problem
Ugur G. Abdulla [email protected] Department of Mathematical Sciences, Florida Institute of Technology, Melbourne, Florida 32901
Bruno Poggi [email protected] Department of Mathematics, University of Minnesota, Minneapolis, Minnesota 55455
Abstract
We consider the inverse multiphase Stefan problem with homogeneous Dirichlet boundary condition on a bounded Lipschitz domain, where the density of the heat source is unknown in addition to the temperature and the phase transition boundaries. The variational formulation is pursued in the optimal control framework, where the density of the heat source is a control parameter, and the criteria for optimality is the minimization of the norm declination of the trace of the solution to the Stefan problem from a temperature measurement on the whole domain at the final time. The state vector solves the multiphase Stefan problem in a weak formulation, which is equivalent to Dirichlet problem for the quasilinear parabolic PDE with discontinuous coefficient. The optimal control problem is fully discretized using the method of finite differences. We prove the existence of the optimal control and the convergence of the discrete optimal control problems to the original problem both with respect to cost functional and control. In particular, the convergence of the method of finite differences for the weak solution of the multidimensional multiphase Stefan problem is proved. The proofs are based on achieving a uniform bound and energy estimate for the discrete multiphase Stefan problem.
Key words: Inverse multidimensional multiphase Stefan problem, Quasilinear parabolic PDE with discontinuous coefficients, optimal control, Sobolev spaces, method of finite differences, discrete optimal control problem, energy estimate, embedding theorems, weak compactness, convergence in functional, convergence in control.
AMS subject classifications: 35R30, 35R35, 35K20, 35Q93, 65M06, 65M12, 65M32, 65N21.
1 Introduction
1.1 Introduction and Motivation
Let be a bounded domain with Lipschitz boundary, , and . Consider the general multi-dimensional multi-phase Stefan problem [30]: given phase transition temperatures , find a temperature function and the phase transition boundaries
[TABLE]
which satisfy
[TABLE]
where is a known function, are known positive functions which are smooth on each of the intervals and have discontinuities of the first kind at the points ;
[TABLE]
where is a known function, each is a positive number, is the normal to the free boundary in the direction of increasing (that is, along the gradient of ), and the saltus [v]\big{|}_{S^{j}} is the difference between the limiting value of on when approached from the domains and respectively; is a lateral boundary of the cylinder .
In the physical context, characterizes the density of the sources, is the initial temperature, (1.3) is the Stefan condition expressing the conservation law according to which the free boundary is pushed by the saltus of the heat flux from different phases, and (1.5) states that the temperature at the boundary is held constant at [math].
Weak formulation of the multiphase Stefan problem, as well as existence and uniqueness of the weak solution to the multiphase Stefan problem was first proved in [28, 36]. We refer to monographies [30, 32] for the extensive list of references.
Assume now that some of the data is not available, or involves some measurement error. For example, suppose that the density of the heat sources is not known and must be found along with the temperature and the free boundaries . As compensation for not knowing this function, we must have access to additional information, which for instance may come as a measurement of the temperature at the final moment:
[TABLE]
Inverse Multiphase Stefan Problem (IMSP). Find the temperature function , free boundaries , and the density of the heat sources satisfying (1.1)-(1.6).
The IMSP is not well posed in the sense of Hadamard. That is, if the data is not sufficiently coordinated, there may be no solution. Even if it exists, it might be not unique, and most importantly there is in general no continuous dependence of the solution on the data functions.
In two recent papers [1, 2] a new variational formulation of the one-phase inverse Stefan problem (ISP) was developed when space dimension is one. An optimal control framework was implemented in which the boundary heat flux and the free boundary are components of the control vector and the optimality criteri consists of the minimization of the sum of -norm declinations from the available measurement of the temperature on the fixed boundary and available information on the phase transition temperature on the free boundary. This approach allows one to tackle situations when the phase transition temperature is not known explicitly, and is available through measurement with possible error. It also allows for the development of iterative numerical methods of least computational cost due to the fact that for every given control vector, the parabolic PDE is solved in a fixed region instead of full free boundary problem. In [1] the well-posedness in Sobolev spaces framework and convergence of time-discretized optimal control problems is proved. In [2] full discretization was implemented and the convergence of the discrete optimal control problems to the original problem both with respect to cost functional and control is proved. The main advantage of this method is that numerically, the problem to be solved at each step is only a Neumann problem, and not a full free boundary problem. In [3, 4] Frechet differentiability and first order optimality condition in Besov spaces framework is proved and the formula for the Frechet gradient is derived. Numerical analysis via iterative gradient method in Hilbert-Besov spaces based on the results of [1, 2, 3, 4] was implemented in [5].
The new variational approach developed in [1, 2] is not applicable to the multiphase Stefan problem. The reason is that the Stefan condition on the phase transition boundary includes the flux calculated from both phases. Therefore, it can’t be treated as a Neumann condition, even if we include the free boundary as one of the control components. In [6] a new approach was developed based on the weak formulation of the multiphase Stefan problem as a boundary value problem for the nonlinear PDE with discontinuous coefficient. The optimal control framework was applied to the inverse multiphase Stefan problem with non-homogeneous Neumann conditions on the fixed boundaries in the case when the space dimension is one. The control vector was taken to be the heat flux on the left boundary and the optimality criteria consisted of the norm declinations from a measurement of the temperature on the right fixed boundary. The full discretization was implemented and convergence of the discrete optimal control problems to the original problem was proved.
The main goal of this paper is to apply the idea of the paper [6] to IMSP when the number of spatial dimensions is larger than . We prove the existence of the optimal control and convergence of the sequence of discrete optimal control problems to the continuous problem both with respect to the functional and control. The proof is based on the proof of uniform bound, and -energy estimate for the discrete multiphase Stefan problem, and results on the convergence of suitable interpolations of the discrete solutions. We address the problem of Frechet differentiability and application of the iterative gradient methods in Hilbert spaces in an upcoming paper.
We refer to a recent paper [1] for review of the literature on Inverse Stefan Problems. Most of the papers on ISP are in the one-dimensional case. Inverse Stefan problems with given phase boundaries were considered in [7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 23, 39, 21]; optimal control of Stefan problems, or equivalently inverse problems with unknown phase boundaries were investigated in [8, 19, 24, 25, 26, 27, 29, 31, 35, 33, 37, 38, 40, 21, 22, 41, 43].
The structure of the paper is as follows: in Section 1.2 the notation of Sobolev spaces are described. In Section 1.3 we formulate the IMSP as an optimal control problem. In Section 1.4 we perform full discretization through finite differences and formulate discrete optimal control problem. In Section 1.5, all the operative assumptions are declared. In Section 1.6 the main results are formulated. In Section 2 we prove the existence and uniqueness of the discrete state vector, as well as other auxiliary lemmas. In Section 3, we prove and estimates that the discrete state vectors satisfy. Section 4 describes different interpolations of the discrete state vectors to the whole domain and contains proofs on appropriate equivalences of the different interpolations. In Section 5, it is shown that piece-wise linear interpolations approximate a weak solution to the Stefan problem. This allows us to prove in Section 6 the existence of a solution to the optimal control problem, and in Section 7 we prove convergence of the discrete optimal control problems to the continuous optimal control problem.
1.2 Notations
- ball of radius and center ; - -dimensional Lebesgue measure;
[TABLE]
- Banach space of real-valued measurable functions on with finite norm
[TABLE]
- Banach space of essentially bounded real-valued measurable functions on with norm
[TABLE]
- Hilbert space of all elements of for which the partial weak derivative exists and lie in for each . This space has inner product
[TABLE]
- Hilbert space of all elements of having square-integrable first-order weak partial derivatives in all spatial directions. This space is endowed with the inner product
[TABLE]
- Hilbert space of all elements of having square-integrable first-order weak partial derivatives in all coordinate directions. The inner product is
[TABLE]
- linear subspace of elements of which satisfy
[TABLE]
in the sense of traces.
1.3 Multiphase Stefan Optimal Control Problem
Following the usual reformulation of the inverse multiphase Stefan problem (see [30, 36]), we define the function
[TABLE]
and consider the transformation
[TABLE]
Then , , and our conditions become:
[TABLE]
with possessing the same properties as . Now, we can invoke a monotone increasing piecewise smooth function such that on each of the intervals . Our partial differential equation becomes
[TABLE]
Moreover, we’re free to choose the jump of at the values . We choose them in such a way that so that upon integration by parts of (1.15) over , the integrals over the phase transition boundaries cancel out.
Definition 1**.**
We say that a measurable function is of type if
- (a)
2. (b)
for some .
Note that can take different values for different when for some .
Given , a solution to the Stefan problem (1.9)-(1.13) is understood in the following sense:
Definition 2**.**
is called a weak solution of the Stefan problem (1.9)-(1.13) if for any two functions of type , the integral identity
[TABLE]
is satisfied for arbitrary with .
For fixed , define the continuous control set
[TABLE]
Consider minimization of the cost functional
[TABLE]
on , where is a weak solution of the Stefan problem in the sense of Definition 2. This optimal control problem will be called Problem .
1.4 Discrete Optimal Control Problem
We apply the method of finite differences. Let , and cut by the planes
[TABLE]
so as to obtain a collection of elementary (closed) cells with length in each direction and length in the direction. We will denote by the discretization with steps . We introduce a partial ordering on the set of discretizations: we say that if and . We will call for . Let be a multi-index, and . We will agree to write , is the th component of if and is the st component of , while is the th component of . Then each elementary cell can be written uniquely in the following way
[TABLE]
Similarly we define the rectangular prisms:
[TABLE]
and whenever we write as a superscript to a set in , it is meant the projection of that set onto the hyper-plane of . For instance,
[TABLE]
We write the collections of these cells and prisms as
[TABLE]
[TABLE]
and consider the subcollections which lie only in and respectively:
[TABLE]
[TABLE]
The unions of the elements in these subcollections comprise the discretized versions of and respectively. So we write
[TABLE]
By the natural corner of a prism in it is meant the vertex of the prism whose coordinates are smallest relative to the other vertexes, and by the natural corner of a cell it is meant the vertex of the cell whose spatial coordinates are the same as those of the natural corner of , and whose time coordinate is . From here on, we identify each prism (cell) by its natural corner.
We denote by the lateral boundary of , and . Now define the lattice of points
[TABLE]
[TABLE]
We will usually write , . Note the obvious bijections , ; bijections of this form will henceforth be referred as natural. Given a set which is in natural bijection with a subset of the set of multi-indexes (or ), we write as the indexing set. Moreover, if , then (and similarly if ). When , we’ll agree to write instead of (and likewise if ). For emphasis, by it is meant the set of all those indexes which correspond to a prism in . These indexes are also in natural bijection with the natural corners of these prisms. In particular, some of the corresponding lattice points may fall on the boundary . We contrast this set to the set of indexes in natural bijection to the lattice points that lie strictly in the interior of , and to the set , of all indexes which are in natural bijection with the lattice points that lie in . It is clear that is a subset of . For ease of notation, we will often write
[TABLE]
and likewise for other expressions requiring subscripts.
It will be important to give a sense as to how to discretize functions given in the continuous setting. Given , we will construct appropriately discretized versions of these functions through the use of the Steklov averages. First fix an extension of to so that the extension lies in . Henceforth refer to the extension as . We denote
[TABLE]
and
[TABLE]
We note the region of integration in (1.18) is . Also,
[TABLE]
and we observe the region of integration in (1.19) is really .
We will need to smoothen the function . To this end, for let be a non-negative mollifier. We can take, for example,
[TABLE]
where is a constant chosen so that . We then define
[TABLE]
Given a discretization , we use the notation for a collection of real numbers . Each of these can be thought of as vectors in a suitable finite-dimensional space. We define
[TABLE]
We will consider space and time differences. For a collection of numbers , if we write , then
[TABLE]
is the backward time difference. The forward space difference along the direction is
[TABLE]
Moreover, for convenience of notation, we will write
[TABLE]
for suitable . For fixed , define the discrete control sets
[TABLE]
and the following mappings between the continuous and discrete control sets. Let
[TABLE]
be an interpolating map, where
[TABLE]
Also, let
[TABLE]
be a discretizing map, where is given by (1.19) for each .
At this point we are ready to define a solution of the discrete Stefan problem.
Definition 3**.**
Given , the vector function , a collection of real numbers , is called a discrete state vector provided it satisfies
- (i)
, 2. (ii)
For each fixed , the collection satisfies
[TABLE]
for arbitrary collection of values which satisfies that for . 3. (iii)
For each , we have for .
We note that the collection appearing in (1.22) is the function \mathscr{Q}_{\Delta}\Big{(}\mathscr{P}_{\Delta}([f]_{\alpha})\Big{)}. Given for some , it will be shown that the discrete state vector exists uniquely. This allows us to define a discrete cost functional by
[TABLE]
where the are taken from , the th component of the discrete state vector . The discrete optimal control problems will be called problems . We define
[TABLE]
for each . For each such we note
[TABLE]
1.5 Assumptions
Throughout the paper we will make the following assumptions:
- (a)
is open, bounded, and has Lipschitz boundary. 2. (b)
and are positive on , and the restrictions of to each of the segments are continuously differentiable functions with positive limits at the finite end-points. 3. (c)
for some . 4. (d)
[TABLE] 5. (e)
. 6. (f)
Either , or and . 7. (g)
For each , the set \big{\{}x\leavevmode\nobreak\ |\leavevmode\nobreak\ \phi(x)=u^{j}\big{\}} has dimensional measure [math].
A brief discussion of the assumptions follows: Assumption that is Lipschitz is assumed to guarantee application of standard Sobolev embedding theorems. Assumption (b) allows for the function to be continuously differentiable and strictly monotone increasing on each of the segments . Assumption (c) provides positive lower bound for , which we use to prove the existence of the discrete state vector, as well as to establish the energy estimates. Given assumption (b), assumption (d) is a necessary and sufficient condition that the map is a bijection. Furthermore, assumption (d) allows the function to have the aforementioned properties on all of , a requisite for our proof of the existence of the discrete state vector. Assumption (e) is important for the energy estimates. Either of the conditions in assumption (f) will guarantee , which allows for the functional to be well-defined. Finally, assumption (g) guarantees that the second term in the integral identity (1.16) is independent of the choice of the functions of type .
1.6 Main Results
We have the following results:
Theorem 4**.**
The optimal control problem has a solution. That is, the set
[TABLE]
is not empty.
Theorem 5**.**
The sequence of discrete optimal control problems approximates the optimal control problem with respect to the functional, that is,
[TABLE]
where
[TABLE]
Furthermore, let be a sequence of positive real numbers with . If the sequence is chosen so that
[TABLE]
then we have
[TABLE]
Also, the sequence is uniformly bounded in and all of its weak limit points lie in . Moreover, if is such a weak limit point, then there is a subsequence such that the linear interpolations of the discrete state vectors converge weakly in to , a weak solution to the Stefan Problem in the sense of Definition 2.
2 Preliminary Results
Proposition 6**.**
Fix a discretization and control . For a vector function as in Definition 3, consider the following condition:
(ii)’ For each and such that , we have
[TABLE]
where
[TABLE]
Then is a discrete state vector if and only if it satisfies conditions (i), (ii)’, and (iii).
Proof. Suppose satisfies (i),(ii)’ and (iii). Fix . Consider an arbitrary collection of real numbers for which satisfies for . For each , multiply (2.1) by , and then perform a summation of all (2.1) over . We obtain
[TABLE]
Observe that
[TABLE]
Plugging this calculation into (2.2) and using the fact that for each shows that (ii) is satisfied. Conversely, suppose (i), (ii) and (iii) are satisfied, and fix . Fix an arbitrary such that , and consider the collection such that if and . Then (1.22) becomes
[TABLE]
which is (2.1) for . Since was arbitrary in , it follows (ii)’ is satisfied.
Lemma 7**.**
Fix a discretization with small . Then for any , to each there corresponds a unique discrete state vector.
Proof. First we prove uniqueness. Let both satisfy Definition 3. At the outset it is clear that due to (i) and (iii). Proceeding by induction, fix and suppose . In (1.22) for both and , plug in , and subtract the resulting equalities. We obtain
[TABLE]
but we note that for each ,
[TABLE]
per the induction hypothesis. It follows
[TABLE]
Since is monotonically increasing, so is . It follows that all terms in the above sum are non-negative, and so each term is identically [math]. In particular, due to the monotonicity of it follows that for . Due to (iii), this can be extended to . By induction, this proves .
Now we prove the existence. Fix a discretization and . We will establish existence by induction on . When , we let be given as in (i) and (iii) of Definition 3. By the induction hypothesis at level , suppose that the first components have been constructed. We will give now by the method of successive approximations. Obviously on the lattice at the boundary of is just set to be [math]. For the lattice points in the interior, we notice that (2.1) can be written in the following way
[TABLE]
So set , and having calculated , obtain from the following system of equations:
[TABLE]
Since the left hand side of (2.4) is monotonically increasing with respect to and has a range , there is a unique solution , and hence the sequence is well-defined. Now for each , subtract (2.4) for and to get the system
[TABLE]
Now let
[TABLE]
so it follows
[TABLE]
and
[TABLE]
independently of . Hence, system (2.5) can be written as
[TABLE]
By (2.7) we have that
[TABLE]
uniformly over and . Let
[TABLE]
then (2.8) implies that
[TABLE]
for each . Define
[TABLE]
It is clear that . Thus we can arrive at the chain of inequalities
[TABLE]
Now, for any , for fixed we can write
[TABLE]
which implies that
[TABLE]
Setting in (2.10) gives that the sequence is uniformly bounded in with respect to . Now let be a subsequence which converges to . Choose in an inequality similar to (2.10) to see that
[TABLE]
so that
[TABLE]
which implies, upon sending that
[TABLE]
and so the sequence converges to a finite limit, for each . It follows we can define
[TABLE]
We claim that given by (2.11) satisfies (1.22). Due to Proposition 6, it is enough to see whether satisfies system (2.3). But this follows immediately since and the identity map are continuous functions. This finishes the step of the induction, and therefore the proof.
The next lemma formulates the necessary and sufficient condition for the convergence of the discrete optimal control problems to the continuous optimal control problem.
Lemma 8**.**
[42]** The sequence of discrete optimal control problems approximates the continuous optimal control problem with respect to the functional if and only if the following conditions are satisfied:
(i) For any , we have , and
[TABLE]
(ii) For any , we have , and
[TABLE]
Proposition 9**.**
The maps and satisfy the conditions of Lemma 8.
Proof. Fix and arbitrary. First let . Then we note
[TABLE]
Now let . We see
[TABLE]
which completes the proof.
The following proposition is proved in [30] for a wider class of solutions than that given in Definition 2:
Remark 10**.**
It is proved in [30] that there exists a unique solution to the Stefan problem in the sense of Definition 2. Moreover, it is proved that if a function satisfies integral identity (1.16) for some functions of type and any admissible test function , then it follows that is the unique weak solution to the Stefan Problem in the sense of Definition 2.
Proposition 11**.**
For any , there exists such that
[TABLE]
whenever .
Proof. Fix . For each , define the function as
[TABLE]
We will prove that
[TABLE]
As an element of , almost all restrictions of to lines parallel to the direction are absolutely continuous. Let , and write
[TABLE]
Then we have that for almost every ,
[TABLE]
and we will agree to write in place of the vector , to emphasize that the variable in the direction of the vector is replaced by . Using the definition of the collection , (2.15), and the Cauchy-Schwartz inequality, we get
[TABLE]
Since and
[TABLE]
it follows by the absolute continuity of the integral that the first term on the right-hand side of (2.16) vanishes as . Thus we focus on the second term. Recall that by we denote the natural corner of the prism . By an application of Fubini’s Theorem we switch the order of the integration with respect to and . Hence we observe
[TABLE]
Now fix . Since is dense in , it follows that we can choose a function depending on such that
[TABLE]
Add and subtract the terms in the integrands to obtain that
[TABLE]
We estimate each of . Since , it follows that is uniformly continuous on . Therefore, there exists such that
[TABLE]
whenever . Let satisfy
[TABLE]
Then it follows that for each , any , and any ,
[TABLE]
Therefore,
[TABLE]
[TABLE]
[TABLE]
Due to (2.19), these calculations imply that
[TABLE]
which shows that the left-hand side of (2.18) drops to [math] as . This proves the strong convergence of to in . Since
[TABLE]
estimate (2.14) follows after running the previous argument for each .
3 Estimates
Theorem 12**.**
(Discrete Maximum Principle) For any , any , and any , the discrete state vector satisfies the following estimate:
[TABLE]
Proof. Fix a discretization and . There corresponds the unique discrete state vector by Lemma 7. Consider the following transformation of the discrete state vector:
[TABLE]
Then (1.25) gives
[TABLE]
where satisfies
[TABLE]
and such a exists for each due to the Mean Value Theorem. It follows (2.1) is transformed as
[TABLE]
which yields
[TABLE]
Now, if for every , then . If, instead, we have for some , then , and let be such that
[TABLE]
By assumption, cannot lie on (i.e. the lateral boundary of ). If lies on , then we clearly have
[TABLE]
The final possibility is that lies on . In this case, (3.3) is satisfied at , and moreover we must have
[TABLE]
by definition of . Per our assumptions,
[TABLE]
uniformly for . Hence (3.3) yields the inequality
[TABLE]
The past observations imply that
[TABLE]
In a completely analogous fashion we are able to obtain a uniform lower bound:
[TABLE]
giving (3.1).
Theorem 13**.**
(Discrete Energy Estimate) For and any , the discrete state vector satisfies the following estimate:
[TABLE]
Proof. In (1.22), for each choose , and consider the identity
[TABLE]
Upon using (1.25) on the first term of (1.22) with the aforementioned , we readily observe
[TABLE]
for each . Due to (3.4), we can use Cauchy’s Inequality with on the last term to obtain from (3.6) the inequality
[TABLE]
true for each . Perform a summation of (3.6) over . We see
[TABLE]
We note by the Cauchy-Schwartz inequality that
[TABLE]
and owing to Proposition 11,
[TABLE]
With these observations, choosing in (3.8) and the maximizer for the second term on the left-hand side, we arrive at the desired estimate.
4 Theorem on Interpolations of a Discrete State Vector
We describe a few useful ways in which we can interpolate the discrete state vectors to functions over . Recall that a discrete state vector assigns a unique value to each point in the lattice . In particular, we can identify each cell in by its natural corner, which is a point in the aforementioned lattice. The collection of natural corners is indexed by the set .
By , it is meant an interpolation of a discrete state vector which assigns to the interior and top face of each cell in the value at its natural corner. That is,
[TABLE]
and we let be [math] elsewhere in that it is not already defined. Now for each , define the function as
[TABLE]
and [math] elsewhere in where it is not already given by (4.2). Intuitively, the are step functions which assign to each cell in the value of the forward spatial difference at the natural corner. Next, for fixed , we define as a spatial interpolation of the discrete state vector which assigns to each point in the lattice the corresponding value , is linear with respect to any spatial variable when all other spatial variables are fixed, and is extended as [math] on . This gives a unique interpolation, and we note is a continuous function. Then we define the function as the piece-wise constant interpolation of the functions onto time. That is,
[TABLE]
and . Finally, we define the function as the piece-wise linear interpolation of onto time. That is,
[TABLE]
Now let us make a few remarks about the spatial functions . Fix a rectangular prism . Such a prism has vertexes, which are the elements of . By definition of , one can see that for each , the value is the weighted average (with respect to distance from the point to each vertex) of the values where . Therefore satisfies the following representation in each prism :
[TABLE]
where each weight function is continuous, and moreover we have
[TABLE]
and we remark that, even though parts of the boundary of each prism intersects other prisms, the representation (4.5) is satisfied regardless of the prism chosen. Given (4.5), it easily follows that
[TABLE]
from which it is readily deduced that
[TABLE]
Continuing with the same set-up, fix a direction . There are one-dimensional faces (i.e. lines connecting the vertexes) in which run parallel to the direction. To each of these lines corresponds a space-difference
[TABLE]
Then by construction, for each , the value is the weighted average (with respect to the distance from the point to each appropriate line) of the values where . Therefore we have the following representation for in each prism :
[TABLE]
where the weight functions are continuous and satisfy
[TABLE]
It follows that
[TABLE]
Using (4.11), we estimate
[TABLE]
Since each line connecting lattice points is shared by rectangular prisms, (4.12) allows us to conclude
[TABLE]
Theorem 14**.**
Let be a sequence of discrete control vectors such that there exists for which for each . The following statements hold:
- (a)
The sequences are uniformly bounded in . 2. (b)
For each , the sequences are uniformly bounded in . Moreover, the sequence is uniformly bounded in . 3. (c)
The sequence converges strongly to [math] in as . 4. (d)
For each , the sequence converges strongly to [math] in as . Furthermore, the sequence converges strongly to [math] in as . 5. (e)
For each , the sequence converges strongly to [math] in as . 6. (f)
For each , the sequence converges weakly to [math] in as .
Proof. Due to Theorem 12, (4.8), and the fact that for each , statement (a) follows immediately. Now we move to prove statement (b). Fix . We have
[TABLE]
whence it is known each sequence is uniformly bounded in . Next, due to (4.13) we note
[TABLE]
Adding the above inequality over and using (3.5), we obtain
[TABLE]
where is independent of . Now fix again. We observe
[TABLE]
Adding the above inequality over and recalling that for each , we arrive at
[TABLE]
Now note that for each and each , we have due to (4.5) and the Cauchy-Schwartz inequality that
[TABLE]
which allows us to deduce
[TABLE]
where the last inequality holds since each value for is summed up at most times in the summation (because each interior lattice point is shared by prisms). Thanks to the energy estimate (3.5), it is then clear from (4.18) that
[TABLE]
so ends the proof of statement (b).
Next we prove (c). To this end, note that for each and , we have
[TABLE]
so that we can deduce
[TABLE]
thanks to Theorem 13. This ends the proof of (c).
The proof of statement (d) follows. For each and , we observe
[TABLE]
We note that if , then each satisfies that . Therefore, for each fixed , there is a (not necessarily unique) path along the edges of the prism which starts at , ends at , and is made up of gluing together at most one-dimensional edges of the prism. Call such a path , and the tangent vector to the path at point . It is easy to see then that we can write
[TABLE]
where the sum on the right-hand side of (4.21) is taken over the that correspond to vertexes of which lie on the path (except for the end-point ), and corresponds to the spatial direction that the path takes in moving from to the next vertex that lies on the path. With this observation in hand and using the Cauchy-Schwartz inequality, the following estimate is true, uniformly over the path chosen, and uniformly over :
[TABLE]
where the sum on the right-hand side of (4.22) is taken over all and such that and (intuitively, recall that the spatial differences are in natural bijection with the edges of the lattice. So effectively, the sum is over all edges of the prism ). Therefore, using (4.22) and (4.20), we have for each ,
[TABLE]
since there are vertexes other than in . By using (4.23) we derive
[TABLE]
where the last inequality holds since each edge in the lattice is shared by at most prisms. Finally we deduce
[TABLE]
uniformly over , where again we have made use of Theorem 13. Since
[TABLE]
statement (d) follows.
Now we move to proving (e). In this regard, it will be enough to estimate . So first fix . For each and , we see that for almost every ,
[TABLE]
Hence,
[TABLE]
where the last inequality holds since each edge of the prism is shared by at most prisms. Thus,
[TABLE]
due to Theorem 13. Statement (e) follows.
Moving on to statement (f), fix . We will now prove that the sequence converges weakly to [math] in . Due to (b), it is clear that both sequences have weak limit points in . So let be weak limit points of , in respectively. In particular, weakly in as , where is some subsequence of . Let us fix a step-function on , which is of the form
[TABLE]
where ’s are formed with intersections of with rectangles in , ’s partition , is the characteristic function of the set , and for each . Since the class of such step functions is dense in it is satisfactory to prove the claim (f) for arbitrary step function of type (4.25). Recall that here and in the sequel, and . Since (where is the Lebesgue measure on ), it follows by this construction that for each , and therefore the set
[TABLE]
has -st dimensional Lebesgue measure [math]. For each and , we observe
[TABLE]
where z_{\gamma^{*}}:=\frac{1}{h}\big{(}x_{\gamma^{*}}-x_{\gamma}\big{)}. Therefore,
[TABLE]
We now intend to switch the order of the summations on the right-hand side of (4.26). To do this, recall that the summation over is taken over all indexes that correspond to vertexes of the prism which satisfy . Since all prisms are congruent, it follows the vector that connects to does not depend on the specific coordinates of or ; it only depends on their difference (which is itself independent of ). Since , the vectors are taken from the set
[TABLE]
Consequently, the summation over can be thought of as a summation over the elements of , since is in bijection with . Let be the unique index in that is identified by . We remark that the set is independent of . Moreover, we can identify purely by the corresponding , so we write .
It follows from (4.26) that
[TABLE]
Now fix . Define
[TABLE]
and, since is non-negative and either linear or constant in each variable , it follows that , and in particular is independent of . Define the set
[TABLE]
Intuitively, is the set of all cells in whose interiors are not contained in a single . Define . Moreover, to each cell in we specify by the unique index for which the interior of is contained in . Thus it is seen that
[TABLE]
We can write
[TABLE]
where
[TABLE]
It can be shown that as . To see this, use the Cauchy-Schwartz inequality and Theorem 3.5 to get
[TABLE]
We claim that as . Consider the sets
[TABLE]
which are open in . Then as , since . Now fix . Choose such that . Now, choose so small that whenever , which can be done since all cells in must intersect , and the distance from the furthest point in each such cell to is at most . Therefore we need only pick so small that to guarantee . It follows that
[TABLE]
for each . Therefore as . Since , it follows by the absolute continuity of the integral that
[TABLE]
hence from (4.29) we conclude as .
Next, observe that
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
We claim each of go to [math] as . Since is the weak limit of , it follows as . Since , by Cauchy-Schwartz inequality and -norm continuity of the translation it follows as . As for , by the change of variable , we note
[TABLE]
Through Cauchy-Schwartz, the uniform boundedness of in , and due to -norm continuity of the translation, it follows that as . Also, as since converges weakly to on . since on . is estimated as follows: apply the Cauchy-Schwartz Inequality, then we have
[TABLE]
where is a constant independent of since is uniformly bounded in . We note that
[TABLE]
from which, by the absolute continuity of the integral and , it follows that vanishes as . Hence as .
Therefore, for each , (4.28) and (4.30) imply
[TABLE]
uniformly with respect to . Using this result, we conclude from (4.27) that
[TABLE]
which proves that in due to the arbitrariness of . But since were arbitrary weak limit points of respectively, it follows [math] is the unique weak limit of the sequence . Statement (f) follows after running the previous argument through all .
5 Approximation Theorem
Theorem 15**.**
Let be a sequence of discrete control vectors such that there exists for which for each , and such that the sequence of interpolations converges weakly to in . Then the sequence of interpolations of associated discrete state vectors converges weakly in to , with the unique weak solution to the Stefan Problem in the sense of Definition 2.
Proof. From (a) and (b) of Theorem 14, it follows that is uniformly bounded in . Consequently, has a weak limit point in . So let be any weak limit point of in . By the Rellich-Kondrachev Theorem [34], it is known that a subsequence of converges strongly to in . This allows one to choose a further subsequence of which converges pointwise a.e. to on . Since is uniformly bounded in , we have that . Moreover, by construction, on for each . Due to being a weak limit point of in , it follows that
[TABLE]
from which we conclude . Thus . Henceforth we proceed to show that satisfies the integral identity (1.16).
For simplicity of notation we write the subsequence of that converges weakly to in and pointwise a.e. on as the whole sequence . Let , where be a space of all continuously differentiable functions on whose support is a positive distance away from (the lateral boundary of ) and from (the top of the cylinder ). Since , it follows that there exists small enough so that for all . For each , define the collection indexed by as
[TABLE]
Per our previous remarks, it is clear that for fixed , the collection is an admissible test collection for the summation identity (1.22). Moreover we remark that independently of the value of , we have for all . So fix . Let in (1.22). This gives
[TABLE]
for each . Add up all identities (5.1) over to obtain
[TABLE]
By summation by parts we observe
[TABLE]
where is the forward time difference. Using (5.3) in (5.2) we can write
[TABLE]
Define the following interpolations of the collections and the forward differences of the latter:
[TABLE]
With these functions and with the interpolations described in Section 4, identity (5) can be written in the following way:
[TABLE]
since on .
Next we show that the sequences converge weakly in to functions of type . Due to Theorem 14 (c),(d), we know that converges strongly to in . As such, we can extract a subsequence of that converges pointwise a.e. on to . For ease of notation let this subsequence be denoted as the whole sequence. Define the set
[TABLE]
and from the previous remarks it’s clear . Now fix arbitrary . For such , we have
[TABLE]
Suppose that at the point we have for any (recall the ’s correspond to phase transition temperatures). In this case we observe
[TABLE]
On the contrary, if at the point we have for some , then we have
[TABLE]
The past few observations show that we can pass to a subsequence of which converges pointwise on to a function that satisfies
[TABLE]
which shows that is a function of type as in Definition 1. Moreover we claim that converges weakly in to . To see this, it is enough to show that and that is uniformly bounded in . Let be the range of . Due to Theorem 12, it follows the set is bounded in , hence its closure is compact in . Because of the piecewise continuity of , the sequence is uniformly bounded in , and so too must be the sequence . Hence is uniformly bounded in as well, since is a set of finite measure. A very similar argument concludes that too.
We have proved that a subsequence of converges weakly in to , a function of type . It is proved in a completely analogous way that a further subsequence of converges weakly to , a function of type . Again we denote this further subsequence as the whole sequence, for simplicity of notation.
Carrying on, it is easily shown that the functions converge uniformly on to the functions respectively as . Consequently, (5.5) implies
[TABLE]
where
[TABLE]
We claim as . Since the sequences are uniformly bounded in , and since converge uniformly on to the functions respectively as (hence, strongly in ), then by the Cauchy-Schwartz inequality it is seen that the absolute value of the integral term of (5.7) vanishes as . As for the last term, we observe
[TABLE]
and both terms on the right-hand side of the above inequality converge to [math] as (the first due to uniform convergence of to on , and the second due to uniform continuity of ). Therefore as . So, due to the weak convergence of the sequences to the functions in and respectively, it follows that taking on (5.6) gives the identity
[TABLE]
which is (1.16). Thus we have proved satisfies integral identity (1.16) for some functions of type , and for arbitrary test function . Since is dense in the set of admissible test functions for integral identity (1.16) and due to Remark 10, we have that is a weak solution to the Stefan Problem in the sense of Definition 2. Therefore, we have proved that if is a weak limit point of , then it must be a weak solution to the Stefan Problem. Due to uniqueness of the weak solution [30] (see Remark 10) it follows that has one and only one weak limit point, which shows that the whole sequence converges weakly to in . This ends the proof of the theorem.
Theorem 15 readily provides us with a general existence theorem for the Stefan Problem.
Corollary 16**.**
Let . Then there exists which is a weak solution to the Stefan Problem. Moreover, satisfies the following estimates:
[TABLE]
[TABLE]
where is a constant depending on and .
Proof. Given , consider the collection . Then the interpolations converge strongly to in , and by Lemma 9 and Cauchy-Schwartz inequality we have
[TABLE]
The conditions of Theorem 15 are satisfied, so there exists which is a weak solution to the Stefan Problem in the sense of Definition 2. Moreover, the sequence converges to weakly in , and strongly in . In particular, there is a subsequence which converges to almost everywhere on . By Theorem 12 and Theorem 14(a), it is clear that for each , is bounded above by the right-hand side of (3.1). Therefore, (5.8) easily follows. Furthermore, we have
[TABLE]
Using the estimations (4.19), (4.17), from (5.10), (5.9) follows.
6 Existence of the Optimal Control
Proof of Theorem 4. By definition of , there exists a sequence such that . Such a sequence is uniformly bounded in since is bounded, so the sequence has a weak limit point in . We claim . By Mazur’s Lemma, there is a sequence given as
[TABLE]
which converges strongly to in as , where for each , the set of real numbers is contained in and
[TABLE]
Then there is a subsequence which converges pointwise a.e. on to as . We observe that
[TABLE]
uniformly over . Therefore, it follows that .
Corollary 16 implies the existence of the unique weak solutions to the Stefan Problem for any of the functions . So let be the unique weak solutions to the Stefan Problem with and as controls, respectively. Due to (5.8), (5.9) and the fact that for all , it follows that the sequence is uniformly bounded in the spaces and . Therefore, has a weak limit point in . Let be such a weak limit point, and for ease of notation say that the whole sequence converges to weakly in . It’s clear then that . Moreover, since for each , it follows that . Hence .
Next we show that is actually a weak solution to the Stefan Problem with as control. To this end, fix an arbitrary , a function of type , and an arbitrary admissible test function for integral identity (1.16). For each , we have the identity
[TABLE]
Since converge weakly to in respectively, to obtain the desired identity it is only left to show that
[TABLE]
where is some function of type . To see that (6.2) is true, first pass to a subsequence that converges pointwise a.e. on to , and for ease of notation write this subsequence as the whole sequence. It is sufficient to prove that that there exists some function of type such that
- (i) ,
- (ii) is uniformly bounded in ,
- (iii)
To prove (i), let
[TABLE]
Then by construction, and converges pointwise to on . Now fix . Suppose that
[TABLE]
In this case we note that is continuous at , and therefore
[TABLE]
as . On the contrary, suppose that
[TABLE]
By way of contradiction, assume that there is a subsequence such that
[TABLE]
Then dist\big{(}L,[b(v^{j})^{-},b(v^{j})^{+}]\big{)}>0. Since is monotone, this gives a contradiction to the fact that . Thus in this case we have
[TABLE]
Hence the assertion (i) is proved. Since and is uniformly bounded in , the assertions (ii) and (iii) easily follow from the definition of the functional class . Therefore (6.2) is true, and so passing on (6.1), we obtain
[TABLE]
from which we conclude that is a weak solution to the Stefan Problem with as a control. Due to uniqueness, we then have is the same element as in the space .
By employing the following elementary identity for elements of the Hilbert space
[TABLE]
we have
[TABLE]
Since we’ve shown that weakly in , and since weak convergence in implies strong convergence in the space of traces, it follows that strongly in . As a result, (6.4) implies that
[TABLE]
so that . Theorem is proved.
In the previous proof we have actually shown the
Corollary 17**.**
The cost functional is weakly continuous on for any .
7 Convergence of the Discrete Optimal Control Problem
Proof of Theorem 5. To prove (1.27) and (1.29), it is enough to show that conditions (i) and (ii) of Lemma 8 are satisfied. We first claim that for any ,
[TABLE]
To see this, first note that if we write , then
[TABLE]
whence we have by Theorem 15 that the interpolations of the discrete state vectors converge weakly in to the unique weak solution of the Stefan problem with control (the convergence in (7.2) can be taken to be strong, but the argument given here only assumes weak convergence). Consequently, it is known that this implies
[TABLE]
Define as the piece-wise constant interpolation of the collection :
[TABLE]
Next, we note
[TABLE]
so, using (6.3), we observe
[TABLE]
By convergence of the Steklov averages to the original function in , it follows that
[TABLE]
We also have
[TABLE]
as . The latter follows from Theorem 14(d) and (7.3). By using (7.5), (7.6) and the uniform boundedness of in from (7.4) it follows that
[TABLE]
where is a constant independent of . Hence, (7.1) is proved.
Next we claim that for any sequence of discrete controls such that for some fixed , it follows that
[TABLE]
To this end, notice that by Proposition 9, the sequence is uniformly bounded in , hence also in . Therefore, there is an -weak limit point to the sequence . So let be any weak limit point of the aforementioned sequence, and pass to a subsequence that converges to it in the weak sense. For ease of notation, denote the subsequence as the whole sequence. Then we see that (7.2) is true, so the argument leading to the proof of (7.1) gives us
[TABLE]
Equipped with (7.9) and Corollary 17, we deduce
[TABLE]
from which (7.8) follows, since was any weak limit point in of .
The results (7.1) and (7.8) show that conditions (i) and (ii) of Lemma 8 are satisfied. Therefore (1.27) and (1.29) follow. Now let be a sequence satisfying (1.28). It is clear that is uniformly bounded in . Let be any weak limit point of in . By Corollary 17 and (1.29), we easily see , hence . The rest of the theorem is an easy consequence of Theorem 15.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] U.G.Abdulla, On the Optimal Control of the Free Boundary Problems for the Second Order Parabolic Equations. I.Well-posedness and Convergence of the Method of Lines, Inverse Problems and Imaging, 7 , 2(2013), 307-340.
- 2[2] U.G.Abdulla, On the Optimal Control of the Free Boundary Problems for the Second Order Parabolic Equations. II. Convergence of the Method of Finite Differences, Inverse Problems and Imaging, 10 , 4(2016), 869-898.
- 3[3] U.G. Abdulla and J. Goldfarb Frechet Differentiability in Besov Spaces in the Optimal Control of Parabolic Free Boundary Problems, Inverse and Ill-posed Problems, 26 , 2(2018), 211-228.
- 4[4] U.G.Abdulla, E.Cosgrove, J.Goldfarb On the Frechet Differentiability in Optimal Control of Coefficients in Parabolic Free Boundary Problems, Evolution Equations and Control Theory, 6 , 3(2017), 319-344.
- 5[5] U.G.Abdulla, V.Bukshtynov, A.Hagverdiyev Gradient Method in Hilbert-Besov Spaces for the Optimal Control of Parabolic Free Boundary Problems, Journal of Computational and Applied Mathematics, 346 , 2019, 84-109.
- 6[6] U.G.Abdulla and B.Poggi, Optimal Control of the Multiphase Stefan Problem, Applied Mathematics and Optimization, (2018). https://doi.org/10.1007/s 00245-017-9472-7 .
- 7[7] O.M.Alifanov, Inverse Heat Transfer Problems ,Springer-Verlag Telos,1995.
- 8[8] J.Baumeister, Zur optimal Steuerung von frien Randwertausgaben, ZAMM, 60 ,(1980),335-339 .
