Next Article in Journal
Analysis of a Two-Stage Tandem Queuing System with Priority and Clearing Service in the Second Stage
Previous Article in Journal
Thermostatistics, Information, Subjectivity: Why Is This Association So Disturbing?
Previous Article in Special Issue
Intelligent Low-Consumption Optimization Strategies: Economic Operation of Hydropower Stations Based on Improved LSTM and Random Forest Machine Learning Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Reconstruction of Time-Dependent Boundary Conditions to 2D Heat Equation on Disjoint Rectangles at Integral Observations

by
Miglena N. Koleva
1,* and
Lubin G. Vulkov
2
1
Department of Mathematics, Faculty of Natural Sciences and Education, University of Ruse, 8 Studentska Str., 7017 Ruse, Bulgaria
2
Department of Applied Mathematics and Statistics, Faculty of Natural Sciences and Education, University of Ruse, 8 Studentska Str., 7017 Ruse, Bulgaria
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(10), 1499; https://doi.org/10.3390/math12101499
Submission received: 17 April 2024 / Revised: 4 May 2024 / Accepted: 8 May 2024 / Published: 11 May 2024

Abstract

:
In this paper, two-dimensional (2D) heat equations on disjoint rectangles are considered. The solutions are connected by interface Robin’s-type internal conditions. The problem has external Dirichlet boundary conditions that, in the forward (direct) formulation, are given functions. In the inverse problem formulation, the Dirichlet conditions are unknown functions, and the aim is to be reconstructed upon integral observations. Well-posedness both for direct and inverse problems is established. Using the given 2D integrals of the unknown solution on each of the domains and the specific interface boundary conditions, we reduce the 2D inverse problem to a forward heat 1D one. The resulting 1D problem is solved using the explicit Saul’yev finite difference method. Numerical test examples are discussed to illustrate the efficiency of the approach.

1. Introduction

Inverse problems arise in the modeling of many physical and social processes [1,2]. Most of these models are dynamical; thus, they are governed by evolution differential equations. If all essential parameters, including coefficients, sources, and initial and boundary conditions in the evolutionary equation problem, are provided, the solution can be calculated, enabling the prediction of the process’s behavior under different conditions. However, in processes involving, for example, chemical diffusion, heat conduction, and population dynamics (such as honey bee populations), certain inputs such as the coefficients and boundary conditions of the differential equations are unknown and need to be reconstructed based on additional state observations. Such problems are usually ill-posed [2,3,4,5,6,7], and they are difficult to solve, even numerically.
One class of such identification problems is inverse problems, where the boundary condition(s) have to be determined. Recently, many papers concerning boundary inverse problems for diffusion equations of integer and fractional orders have been published.
The authors of [8] solved the inverse problem of recovering an unknown boundary condition in a parabolic problem from given observations at a boundary point. In [9], by applying a semigroup approach, the authors study boundary inverse problems for a linear parabolic equation. A numerical method, based on the decomposition technique, for solving the inverse problem of recovering the unknown boundary condition of a heat conduction equation is proposed in [10].
The inverse problem for boundary condition determination in time-fractional diffusion and equations on the basis of overspecified data is studied, for example, in [11,12,13,14]. The existence and uniqueness of the inverse problem is established in [11,13]. The authors of [13] apply a meshless method based on radial basis functions to solve the inverse problem. In [12,14], a spectral regularization technique is introduced, which relies on the solution provided by the Fourier method, to address the Cauchy problem for time-fractional diffusion and advection–dispersion equations.
The heat equation has many real-life applications; see, e.g., [15,16]. Various phenomena in fields such as ecology, biology, heat and mass transfer, and material science encompass diffusion processes across materials. For instance, [17] presents a model of diffusion-limited contamination and decontamination in a two-layer porous medium. Additionally, multilayer diffusion in a composite medium with imperfect contact is investigated in [18]. In [19], the authors examine how coupled heat and mass transfer affect the peristaltic motion of a magnetohydrodynamic stress–strain Jeffery-type hybrid nanofluid flowing through an inclined asymmetric micro-channel with a porous medium. The fractionalized flow and thermal transmission of a Brinkman-type tri-hybrid nanofluid over an infinite plate saturated in a porous medium are studied in [20]. Semi-analytical and numerical solutions for transport in a multi-layered profile are constructed, for example, in [21,22,23,24].
The basic model motivating the present paper is that of heat conduction in multiple species on different layers, where the effect of the intermediate region (layer) is modeled by special nonlocal jump conditions across the layer [24,25,26,27,28,29].
In [30], the authors consider one transient heat conduction problem in 1D multilayered slabs, cylinders, and spheres. They propose an analytical solution, based on the computation of the eigenvalues and the eigenfunctions of the resulting Sturm–Liouville-type system. The Fokas transform method is implemented in [31] to solve a multidomain linear reaction–diffusion equation with a discontinuous diffusion coefficient in order to investigate highly diffusive brain tumors while also considering the heterogeneity of brain tissue.
A second order in space finite volume scheme for solving multilayer diffusion problems is developed in [24]. In [27,29], the authors obtain an a priori estimate in Sobolev-like space for the weak solution of 1D and 2D parabolic problems on a disconnected domain. To solve the problem, a finite difference scheme is constructed and analyzed. In [26], a strong solution using the finite difference method for a parabolic problem on a disjoint domain is investigated.
One-dimensional boundary identification and backward heat conduction problems for layer materials are studied in [32]. In our previous works, we constructed a decomposition method to recover external boundary conditions in a time-fractional parabolic problem [33] and a hyperbolic–parabolic problem [34] on disjoint domains under point measurements.
Saul’yev asymmetric methods [35] have been used to solve a large class of integer and fractional order partial differential equations; see, e.g., [36,37,38,39,40]. In general, these schemes are unconditionally stable and first-order accurate, and they have an implicit form but can be realized explicitly. The restriction of the ratio between the time and square of the space step size is because of the consistency. The main advantage of this numerical method is computational efficiency.
In this work, we construct an explicit numerical method for solving the inverse problem to identify external Dirichlet boundary conditions in a 2D parabolic problem, defined on disjoint domains with imposed Dirichlet, Neumann, and interface boundary conditions. The approach is based on the idea presented in [41] to formulate the inverse problem as a one-dimensional problem, resolved by the Saul’yev method. We extend this conception for a more complicated problem, where we have to overcome the interface boundary and domain disconnectedness. Our method also differs in the construction of the approximations of the Neumann boundary conditions of the 2D direct problem. Moreover, special attention is paid to discretization at the corner nodes, where the interface boundary intersects with the Neumann boundary. The numerical scheme is constructed in a manner that decouples the problem at each time layer, namely, each solution can be computed in its own domain.
The paper is structured as follows. In the next section, we present the direct (forward) interface problem and establish well-posedness. In Section 3, we formulate the inverse problem, prove the well-posedness and describe the algorithm that reduces the two-dimensional inverse problem into the one-dimensional one. By applying the Saul’yev method [35], we realize the analytical approach through the explicit finite difference method in Section 4. Numerical tests are discussed in Section 5 and then the paper ended with some conclusions.

2. Direct Problem

In this section, we introduce the direct (forward) problem and discuss its well-posedness.

2.1. Formulation of the Problem

First, we formulate the 2D direct problem. As a model example, we consider the following initial boundary value problem, defined on disjoint domains; see Figure 1.
u 1 t = p 1 2 u 1 x 2 + q 1 2 u 1 y 2 + f 1 ( x , y , t ) , ( x , y , t ) Q 1 T = Ω 1 × ( 0 , T ]
u 2 t = p 2 2 u 2 x 2 + q 2 2 u 2 y 2 + f 2 ( x , y , t ) , ( x , y , t ) Q 2 T = Ω 2 × ( 0 , T ]
where Ω i = ( a i , b i ) × ( c , d ) , with Dirichlet and Neumann external boundary conditions
u 1 ( a 1 , y , t ) = μ 1 ( y ) φ 1 ( t ) , c y d , 0 < t T
u 2 ( b 2 , y , t ) = μ 2 ( y ) φ 2 ( t ) , c y d , 0 < t T
u 1 y ( x , c , t ) = g 1 c ( x , t ) , u 1 y ( x , d , t ) = g 1 d ( x , t ) , a 1 x b 1
u 2 y ( x , c , t ) = g 2 c ( x , t ) , u 2 y ( x , d , t ) = g 2 d ( x , t ) , a 2 x b 2
and interface mixed-type boundary conditions
p 1 u 1 x ( b 1 , y , t ) + α 1 u 1 ( b 1 , y , t ) = β 1 u 2 ( a 2 , y , t ) + γ 1 ( y , t ) , c y d , 0 < t T
p 2 u 2 x ( a 2 , y , t ) + α 2 u 2 ( a 2 , y , t ) = β 2 u 1 ( b 1 , y , t ) + γ 2 ( y , t ) , c y d , 0 < t T
where < a 1 < b 1 < a 2 < b 2 < + and < c < d < + .
The problem (1)–(8) is completed by the initial conditions
u i ( x , y , 0 ) = u i 0 ( x , y ) , ( x , y ) Ω ¯ i = [ a i , b i ] × [ c , d ] , i = 1 , 2
Further, we assume that
α i > 0 , β i > 0 , i = 1 , 2
In Equations (1) and (2), u 1 and u 2 can represent temperature fields in a two slabs. The interface conditions in Equations (7) and (8) are specific to this problem and describe the heat interaction of the slabs. For example, Equation (7) specifies that the flux p 1 u 1 x ( b 1 , y , t ) is proportional to the proportionality coefficients (contact transfer coefficients) α 1 and β 1 , to the difference in the temperatures u 2 ( a 2 , y , t ) and u 1 ( b 1 , y , t ) of the slabs, and to the heat source γ 1 ( y , t ) .
A motivated heat–mass transfer process that leads to the one-dimensional version of the present forward problem is described in [42].
The direct (forward) problem is to find the solutions u 1 ( x , y , t ) and u 2 ( x , y , t ) of Equations (1) and (2) at the given initial, boundary, and interface conditions (3)–(9).

2.2. Well-Posedness of the Direct Problem

In order to establish the well-posedness of the direct problem, i.e., existence, uniqueness, and continuous dependence from the input data, we follow the results from [27].
Without a loss of generality, we can suppose that the external Dirihlet boundary conditions (3) and (4) are zero, as well as γ i ( y , t ) = 0 , i = 1 , 2 . Otherwise, this can be archived by applying linear transformations like those in [33].
We use the product Hilbert space
L = L 2 ( Ω 1 ) × L 2 ( Ω 2 ) = { w = ( w 1 , w 2 ) : w j L 2 ( Ω i ) , j = 1 , 2 }
subjected to the inner product and the corresponding norm
( v , w ) L = ( v 1 , w 1 ) L 2 ( Ω 1 ) + ( v 2 , w 2 ) L 2 ( Ω 2 ) , w L = ( w , w ) L 1 / 2
with
( v j , w j ) L 2 ( Ω j ) = Ω j v j w j d x d y , j = 1 , 2
Next, we introduce the Sobolev spaces
H l : = { w = ( w 1 , w 2 ) : w j H 1 ( Ω j ) } , l = 1 , 2 ,
subjected to the inner products and norms
( v , w ) H l = ( v 1 , w 1 ) H l ( Ω 1 ) + ( v 2 , w 2 ) H l ( Ω 2 ) w = ( w , w ) H l 1 / 2 ,
with
( w j , v j ) H l ( Ω j ) = S = 0 l m = 0 S S w j x m y S 1 , S v j x m y S 1 L 2 ( Ω j ) , j = 1 , 2 , l = 1 , 2 ,
Now, we are able to introduce the bilinear form:
A ( u , w ) = Ω 1 p 1 u 1 x w 1 x + q 1 u 1 y w 1 y d x d y + Ω 2 p 2 u 2 x w 2 x + q 2 u 2 y w 2 y d x d y + α 1 u 1 ( b 1 , y ) w 1 ( b 1 , y ) + α 2 u 2 ( a 2 , y ) w 2 ( a 2 , y ) β 1 u 2 ( a 2 , y ) w 1 ( b 1 , y ) β 2 u 1 ( b 1 , y ) w 2 ( a 2 , y )
Next, by applying Theorem 26.1 of [43], we prove the boundedness and weak definiteness of the bilinear form A. Now, for the bilinear form A ( u , w ) = A ( t ; u , v ) , the following applies.
Lemma 1.
Suppose that the conditions (10) are fulfilled. Then, the bilinear form A ( u , w ) = A ( t ; u , w ) , measurable on [ 0 , T ] , is bounded on H 1 × H 1 , and A satisfies the Garding inequality on H 1
A ( u , u ) + k u L 2 m u H 2 , u H 1
where k and m are positive constants.
Further, we need the following facts from the theory of Hilbert spaces; see, e.g., [43].
Let Ω be bounded in R n and v ( t ) be a function mapping from Ω to a Hilbert space H. We introduce the Sobolev space of vector-valued functions H l ( Ω , H ) , subjected to the inner product
( v , w ) H l ( Ω , H ) = Ω | β | l ( D β v ( t ) , D β w ( t ) ) H d t , l = 0 , 1 , 2 , m
Let H 1 / 2 ( 0 , T ) be the fractional Sobolev space, as defined in [43,44]. We define the space L 2 ( Ω , H ) = H 0 ( Ω , H ) ,   H 1 , 1 / 2 = L 2 ( ( 0 , T ) , H 1 ) H 1 / 2 ( ( 0 , T ) , L ) and the space
W ( 0 , T ) = { v : v L 2 ( v | v L 2 ( ( 0 , T ) , H 1 ) , u t L 2 ( ( 0 , T ) , L ) ) }
subjected to the inner product
( v , w ) w ( 0 , T ) = 0 T ( v ( · , t ) , w ( · , t ) ) H 1 + v t ( · , t ) , w t ( · , t ) L d t
Now, the weak formulation of the problem (1)–(9) is as follows: for w L 2 ( ( 0 , T ) , H 1 ) , find u satisfying the identity
u t ( · , t ) , w ( · , t ) L + A ( u ( · , t ) , w ( · , t ) ) = ( f ( · , t ) , w ( · , t ) ) L
Theorem 1.
If (10) holds and u 0 = ( u 1 0 , u 2 0 ) L , f = ( f 1 , f 2 ) L 2 ( ( 0 , T ) , L ) , then the initial boundary value problem (1)–(9) have a unique weak solution u W ( 0 , T ) , and it depends continuously on u 0 and f.
Proof. 
We apply the theory of differential operators in Hilbert spaces [43] to the problem (1)–(9). First, let us note that the all of the above, starting with Lemma 1, are preparation for the proof. Namely, we use the theory for parabolic equations in Chapter 4 of [43]. Then, following the methods used in [27], we apply Theorem 26.1 from [43] to obtain the results of the present theorem. □

3. Inverse Problem

This section formulates and studies the inverse problem. First, using the integral observation, we reduce the 2D inverse problem to an equivalent 1D direct one. Then, we prove the well-posedness of the new 1D problem, from which we can obtain the existence and uniqueness of the solution to the original 2D inverse problem.
In the Dirichlet external boundary conditions (3) and (4), let the function φ i ( t ) , i = 1 , 2 be unknown; they have to be identified using some over-specified data.
The inverse problem (IP) for identifying the function φ i ( t ) , i = 1 , 2 in the external boundary conditions (3) and (4) can be formulated as follows:
IP: Find ( u 1 ( x , y , t ) , u 2 ( x , y , t ) , φ 1 ( t ) , φ 2 ( t ) ) , if the following integral observations are imposed:
a i b i c d u i ( x , y , t ) d x d y = m i ( t ) , i = 1 , 2 , 0 t T
This shows that if u i ( x , y , t ) , i = 1 , 2 are temperature, the mean temperature of each of the slabs is measured and the results are m i ( t ) , t [ 0 , t ] , i = 1 , 2 .

3.1. Reducing the Two-Dimensional Inverse Problem to One-Dimensional Ones

Here, we propose the main strategy to design a method for the reduction of the 2D inverse problem to a simple 1D direct problem.
We introduce the function
v i ( x , t ) = c d u i ( x , y , t ) d y , a i x b i , 0 t T , i = 1 , 2
Then, from (1) and (2), we obtain the equation
v i t p i 2 v i x 2 q ˜ i ( x , t ) = f ˜ i ( x , t ) , a i x b i , 0 t T , i = 1 , 2
where
q ˜ i ( x , t ) = q i g i d ( x , t ) g i c ( x , t ) , f ˜ i ( x , t ) = c d f ( x , y , t ) d y i = 1 , 2
with initial conditions
v i ( x , 0 ) = v i 0 ( x ) = c d u i 0 ( x , y ) d y , a i x b i , 0 t T , i = 1 , 2
external boundary conditions
v 1 ( a 1 , t ) = φ 1 ( t ) c d μ 1 ( y ) d y , 0 t T
v 2 ( b 2 , t ) = φ 2 ( t ) c d μ 2 ( y ) d y , 0 t T
and interface mixed-type boundary conditions
p 1 v 1 x ( b 1 , t ) + α 1 v 1 ( b 1 , t ) = β 1 v 2 ( a 2 , t ) + γ ˜ 1 ( t ) , θ t T
p 2 v 2 x ( a 2 , t ) + α 2 v 2 ( a 2 , t ) = β 2 v 1 ( b 1 , t ) + γ ˜ 2 ( t ) , 0 t T γ ˜ i ( t ) = c d γ i ( y , t ) d t , i = 1 , 2
The overspecified data (11) take the form
a i b i v i ( x , t ) d x = m i ( t ) , i = 1 , 2 , 0 t T
Equation (13) is obtained by integrating (1) and (2) over the interval [ c , d ] and then integration by parts is used for the boundary conditions (5)–(6). The interface and external Dirichlet boundary conditions are obtained in the same manner—by integrating over the interval [ c , d ] and using (12). Finally, the non-local conditions (19) directly follow from (11).
From (15) and (16), one calculates
φ 1 ( t ) = v 1 ( a 1 , t ) c d μ 1 ( y ) d y , φ 2 ( t ) = v 2 ( b 2 , t ) c d μ 2 ( y ) d y
Therefore, the inverse problem IP is reduced to the determination of the boundary values v 1 ( a 1 , t ) and v 2 ( b 2 , t ) from the observations (19).

3.2. Well-Posedness of the Inverse Problem

In this subsection, we prove the well-posedness of the direct problem (13)–(19), from which the well-posedness of the inverse problem follows.
Theorem 2.
Assume that f = ( f 1 , f 2 ) L 2 ( 0 , T ; L ( Ω ) ) , u 0 = ( u 1 , u 2 ) L , γ = ( γ 1 , γ 2 ) L 2 ( c , d ) . Then, the problem (13)–(19) has a unique solution v = ( v 1 , v 2 ) H 1 , 0 = L 2 ( 0 , T ; H 1 ) , which satisfies the following weak formulation:
β 2 Q 1 T v 1 ϕ 1 t d x d t β 1 Q 2 T v 2 ϕ 2 t d x d t + 0 T A v ( · , t ) , ϕ ( · , t ) d t = β 2 Ω 1 v 1 0 ( x ) ϕ 1 ( x , 0 ) d x + β 1 Ω 2 v 2 0 ( x ) ϕ 2 ( x , 0 ) d x + β 2 Ω 1 u 1 0 ( x ) ϕ 1 ( x , 0 ) d x + β 1 Ω 2 u 2 0 ( x ) ϕ 2 ( x , 0 ) d x + β 2 Q 1 T f ˜ 1 ( x , t ) + q ˜ 1 ( x , t ) ϕ 1 d x d t + β 1 Q 2 T f ˜ 2 ( x , t ) + q ˜ 2 ( x , t ϕ 2 d x d t
where ϕ i ( x , t ) H 1 ( Q i T ) , i = 1 , 2 and ϕ i ( x , T ) = 0 are a pair of test functions, ϕ = ( ϕ 1 , ϕ 2 ) , and
A ˜ v ( · , t ) , ϕ ( · , t ) d t = i = 1 2 β 3 i p i Ω i v i x ϕ i x d x i = 1 2 ( 1 ) 3 i ( ϕ i ( b i , t ) ϕ i ( a i , t ) ) ( β 1 β 2 v 3 i ( a 3 i , t ) β 3 i α i v i ( b i , t ) ) + i = 1 3 p i β 3 i ( 1 ) 3 i ( ϕ i ( b i , t ) ϕ i ( a i , t ) ) γ ˜ i ( t )
Proof. 
We differentiate both sides of (19) and then use the Equations (12) and (13) to derive
p i v i x ( b i , t ) p 1 v i x ( a i , t ) + f ^ i ( t ) = d m i d t , i = 1 , 2
where
f ^ i ( t ) = a i b 1 ( f ˜ i ( x , t ) q ˜ i ( x , t ) d x ) , i = 1 , 2
Further, we have
p 1 Q 1 T 2 v 1 x 2 ϕ 1 ( x , t ) d x d t = 0 T p 1 v 1 x ( b 1 , t ) ϕ 1 ( b 1 , t ) p 1 v 1 x ( a 1 , t ) ϕ 1 ( a 1 , t ) p 1 Q 1 T v 1 x ϕ 1 x d x d t
The use of (21), i = 1 , and (17) leads to
Q 1 T p 1 2 v 1 x 2 ϕ 1 ( x , t ) d x d t = 0 T ϕ 1 ( b 1 , t ) ϕ 1 ( a 1 , t ) β 1 v 2 ( a 2 , t ) α 1 v 1 ( b 1 , t ) d t + 0 T ϕ 1 ( b 1 , t ) ϕ 1 ( a 1 , t ) γ ˜ 1 ( t ) + d m 1 d t f ¯ 1 ( t ) ϕ 1 ( a 1 , t ) d t Q 1 T p 1 v 1 x ϕ 1 x
In a similar way, using (21), i = 2 , and (18), we obtain
Q 2 T p 2 2 v 2 x 2 ϕ 2 ( x , t ) d x d t = 0 T ϕ 2 ( b 2 , t ) ϕ 2 ( a 2 , t ) α 2 v 2 ( a 2 , t ) β 2 v 1 ( b 1 , t ) d t + 0 T ϕ 2 ( b 2 , t ) ϕ 2 ( a 2 , t ) γ ˜ 2 ( t ) + d m 2 d t f ¯ 2 ( t ) ϕ 2 ( b 2 , t ) d t Q 2 T p 2 v 2 x ϕ 2 x
Further, using the inequality from [44]
g 2 ( t ) 2 ε g L 2 ( 0 , T ) 2 + 2 ε d g d t L 2 ( 0 , T ) , ε ( 0 , T ) , g H 1 ( 0 , T )
together with the Poincare-type inequality
Ω i w i 2 ( x ) d x b i 2 a i 2 2 Ω i d w i d x ( x ) 2 d x , i = 1 , 2
we prove that for A v ( · , t ) , ϕ ( · , t ) , Lemma 1 holds.
This completes the proof of the theorem. □
As a consequence of Theorem 2 and (20), we deduce that the functions φ i ( t ) , i = 1 , 2 are uniquely determined.

4. Numerical Solution of the Direct and Inverse Problems

We follow the strategy proposed in [41] to use the Saul’yev scheme in order to recover φ i ( t ) , i = 1 , 2 numerically; but, in our case, we apply both first- and second-kind approximations and pay special attention to the discretization of the interface conditions. Then, the 2D direct problem (1)–(9) is discretized by the right and left Saul’yev schemes, which can be implemented explicitly. To this aim, we construct a suitable approximation for the Neumann boundary conditions, different from that in [41]. Moreover, interface conditions and conditions on the corner nodes, where the interface boundary intersects with the Neumann boundary, are also overcome. At each time layer, the computations in the first domain are performed from the upper right corner to the lower left corner (a backward method), while in the second domain, we start from the bottom left corner and move to the upper right corner (a forward method). This is possible because the numerical scheme is constructed such that at each time layer, the solution u 1 n + 1 does not depends on u 2 n + 1 , and conversely, the solution u 2 n + 1 does not depend on u 1 n + 1 .
Note that using forward and backward methods in one and the same domain and then averaging the result leads to an improvement in the order of accuracy [45]. Here, we use these methods in different domains, and the idea is to move from a known boundary to an unknown boundary in order to solve the inverse problem.
Let us introduce uniform temporal and spatial meshes:
ω ¯ h i = { x i j i = a i + j i h i , j i = 0 , 1 , , N i , h i = ( b i a i ) / N i } , i = 1 , 2 ω ¯ h y = { y s = c + s h y , s = 0 , 1 , , N y , h y = ( d c ) / N y } ω ¯ τ = { t n = n τ , n = 0 , 1 , , M , τ = T / M }
The values of the mesh function w i in the 1D case at grid node ( x i j i , t n ) are denoted by ( w i ) j i n , and, similarly, the values of the mesh function w i in the 2D case at grid node ( x i j i , y s , t n ) are denoted by ( w i ) j i , s n .

4.1. Numerical Solution of the Inverse Problem

Following the Saul’yev idea [35], we approximate (13) for i = 1 using the second kind formula and (13) for i = 2 using the first kind formula to derive
( v 1 ) j 1 n + 1 ( v 1 ) j 1 n τ p 1 ( v 1 ) j 1 + 1 n + 1 ( v 1 ) j 1 n + 1 ( v 1 ) j 1 n + ( v 1 ) j 1 1 n h 1 2 = ( q ˜ 1 ) j 1 n + 1 + ( f ˜ 1 ) j 1 n + 1
( v 2 ) j 2 n + 1 ( v 2 ) j 2 n τ p 2 ( v 2 ) j 2 + 1 n ( v 2 ) j 2 n ( v 2 ) j 2 n + 1 + ( v 2 ) j 2 1 n + 1 h 2 2 = ( q ˜ 2 ) j 2 n + 1 + ( f ˜ 2 ) j 2 n + 1
The interface conditions (17) and (18) are discretized as follows:
p 1 ( v 1 ) N 1 + 1 n + 1 ( v 1 ) N 1 n + 1 h 1 + α 1 ( v 1 ) N 1 n + 1 = β 1 ( v 2 ) 0 n + γ ˜ 1 n + 1
p 2 ( v 2 ) 0 n + 1 ( v 2 ) 1 n + 1 h 2 + α 2 ( v 2 ) 0 n + 1 = β 2 ( v 1 ) N 1 n + 1 + γ ˜ 2 n + 1
From (24), we express ( v 1 ) N 1 + 1 n + 1 and substitute (22) for j 1 = N 1 to obtain
( v 1 ) N 1 n + 1 ( v 1 ) N 1 n τ + p 1 ( v 1 ) N 1 n ( v 1 ) N 1 1 n h 1 + α 1 h 1 ( v 1 ) N 1 n + 1 = β 1 h 2 ( v 2 ) 0 n + γ 1 n + 1 h 1 + ( q ˜ 2 ) N 1 n + 1 + ( f ˜ 1 ) N 1 n + 1
Similarly, the substitution of ( v 2 ) 1 n + 1 from (24) to (23) for j 2 = 0 yields
( v 2 ) 0 , s n + 1 ( v 2 ) 0 , s n τ p 2 ( v 2 ) 1 , s n ( v 2 ) 0 , s n h 2 + α 2 h 2 ( v 2 ) 0 , s n + 1 = β 2 h 2 ( v 1 ) N 1 , s n + 1 + γ 2 n + 1 h 2 + ( q ˜ 2 ) 0 n + 1 + ( f ˜ 2 ) 0 n + 1
The discretizations (22), (23), (26), and (27) are realized in an explicit manner. Let k i = p i τ / h i 2 , κ i = τ / h i , and i = 1 , 2 . Thus, we have
( v 1 ) N 1 n + 1 = 1 1 + α 1 κ 1 1 p 1 κ 1 ( v 1 ) N 1 n + p 1 κ 1 ( v 1 ) N 1 1 n + β 1 κ 2 ( v 2 ) 0 n + κ 1 γ 1 n + 1 + τ ( q ˜ 2 ) N 1 n + 1 + τ ( f ˜ 1 ) N 1 n + 1 ( v 1 ) j 1 n + 1 = 1 1 + k 1 1 k 1 ( v 1 ) j 1 n + k 1 ( v j 1 + 1 n + 1 + v j 1 1 n ) + τ ( q ˜ 1 ) j 1 n + 1 + τ ( f ˜ 1 ) j 1 n + 1 , j 1 = N 1 1 , N 1 2 , , 1 ( v 2 ) 0 n + 1 = 1 1 + α 2 κ 2 1 p 2 κ 2 ( v 1 ) 0 n + p 2 κ 2 ( v 2 ) 1 n + β 2 κ 2 ( v 1 ) N 1 n + κ 2 γ 2 n + 1 + τ ( q ˜ 2 ) 0 n + 1 + τ ( f ˜ 2 ) 0 n + 1 ( v 2 ) j 2 n + 1 = 1 1 + k 2 1 k 2 ( v 2 ) j 2 n + k 2 ( v j 2 + 1 n + v j 2 1 n + 1 ) + τ ( q ˜ 2 ) j 2 n + 1 + τ ( f ˜ 2 ) j 2 n + 1 , j 2 = 1 , 2 , , N 2 1
To obtain the approximate values of v 1 ( a 1 , t ) and v 2 ( b 2 , t ) , as in [41], we use the trapezoidal rule approximation for (19):
( v 1 ) 0 n + 1 = 2 h 1 m 1 n + 1 2 j 1 = 1 N 1 1 ( v 1 ) j 1 n + 1 + ( v 1 ) N 1 n + 1 ( v 2 ) N 2 n + 1 = 2 h 2 m 2 n + 1 ( v 1 ) 0 n + 1 + 2 j 1 = 1 N 2 1 ( v 1 ) j 1 n + 1
Finally, from (20), we obtain
φ 1 n + 1 = ( v 1 ) 0 n + 1 c d μ 1 ( y ) d y , φ 2 n + 1 = ( v 2 ) N 2 n + 1 c d μ 2 ( y ) d y , n = 1 , 2 , , M

4.2. Numerical Solution of the Direct Problem

In this section, we construct a Saul’yev scheme for solving the direct problem (1)–(9) for an already determined external Dirichlet boundary condition. Let us define the operators
( u i ) j i , s n + 1 = p i δ x ( u i ) j i , s ( n + 1 , n ) + q i δ y ( u i ) j i , s ( n + 1 , n ) + ( u i ) j i , s n + 1 = p i δ x ( u i ) j i , s ( n , n + 1 ) + q i δ y ( u i ) j i , s ( n , n + 1 )
δ x ( u i ) j i , s ( ν 1 , ν 2 ) = ( u i ) j i + 1 , s ν 2 ( u i ) j i , s ν 2 ( u i ) j i , s ν 1 + ( u i ) j i 1 , s ν 1 h i 2 δ y ( u i ) j i , s ( ν 1 , ν 2 ) = ( u i ) j i , s + 1 ν 2 ( u i ) j i , s ν 2 ( u i ) j i , s ν 1 + ( u i ) j i , s 1 ν 1 h i 2
The finite difference scheme for (1) and (2) is
( u 1 ) j 1 , s n + 1 ( u 1 ) j 1 , s n τ + ( u 1 ) j 1 , s n + 1 = ( f 1 ) j 1 , s n + 1 , j 1 = N 1 1 , , 1 , s = N y 1 , , 1
( u 2 ) j 2 , s n + 1 ( u 2 ) j 2 , s n τ ( u 2 ) j 2 , s n + 1 = ( f 2 ) j 2 , s n + 1 , j 2 = 1 , , N 2 1 , s = 1 , , N y 1
First, we consider the boundary of the discrete domain Ω 1 h = ω ¯ h 1 × ω ¯ h y . For the approximation of (5) at the Neumann boundary y = d , a 1 < x 1 < b 1 , we have
( u 1 ) j 1 , N y + 1 n + 1 ( u 1 ) j 1 , N y n + 1 + ( u 1 ) j 1 , N y n ( u 1 ) j 1 , N y 1 n 2 h y = ( g 1 d ) j 1 n + 1
Then, from (33), we express ( u 1 ) j 1 , N y + 1 n + 1 ( u 1 ) j 1 , N y n + 1 / h y and substitute (31) for s = N y to derive
( u 1 ) j 1 , N y n + 1 ( u 1 ) j 1 , N y n τ = p 1 δ x ( u 1 ) j 1 , N y ( n , n + 1 ) 2 q 1 h y ( u 1 ) j 1 , N y n ( u 1 ) j 1 , N y 1 n h y ( g 1 d ) j 1 n + 1 + ( f 1 ) j 1 , N y n + 1 , j 1 = N 1 1 , , 2 , 1
At the Neumann boundary y = c , a 1 < x 1 < b 1 , we proceed similarly. We introduce the following approximation of (5):
( u 1 ) j 1 , 1 n + 1 ( u 1 ) j 1 , 0 n + 1 + ( u 1 ) j 1 , 0 n ( u 1 ) j 1 , 1 n 2 h y = ( g 1 c ) j 1 n + 1
By using ( u 1 ) j 1 , 0 n ( u 1 ) j 1 , 1 n from (35) and substituting (31) and s = 0 , we obtain
( u 1 ) j 1 , 0 n + 1 ( u 1 ) j 1 , 0 n τ = p 1 δ x 1 ( u i ) j i , 0 ( n , n + 1 ) + 2 q 1 h y ( u 1 ) j 1 , 1 n + 1 ( u 1 ) j 1 , 0 n + 1 h y ( g 1 c ) j 1 n + 1 + ( f 1 ) j 1 , 0 n + 1 , j 1 = N 1 1 , , 2 , 1
At the interface boundary x 1 = b 1 , c < y < d , we construct the following approximation of (7):
( u 1 ) N 1 + 1 , s n + 1 ( u 1 ) N 1 , s n + 1 + ( u 1 ) N 1 , s n ( u 1 ) N 1 1 , s n 2 h 1 + α 1 ( u 1 ) N 1 + 1 , s n + 1 = β 1 ( u 2 ) 0 , s n + ( γ 1 ) s n + 1
By using ( ( u 1 ) N 1 + 1 , s n + 1 ( u 1 ) N 1 , s n + 1 ) / h 1 from (37) and applying (31) for j 1 = N 1 , we obtain
( u 1 ) N 1 , s n + 1 ( u 1 ) N 1 , s n τ + 2 α 1 h 1 ( u 1 ) N 1 , s n + 1 = q 1 δ y ( u 1 ) N 1 , s ( n , n + 1 ) 2 p 1 h 1 2 ( u 1 ) N 1 , s n ( u 1 ) N 1 1 , s n + 2 β 1 h 1 ( u 2 ) 0 , s n + 2 ( γ 1 ) s n + 1 h 1 + ( f 1 ) N 1 , s n + 1 , j 1 = N 1 1 , , 2 , 1
We consider corner nodes ( x 1 = a 1 , y = c ) and ( x 1 = a 1 , y = d ), where the interface boundary intersects Neumann boundaries. Using (33), j 1 = N 1 , (37), s = N y , (35), j 1 = 0 , (37), and s = 0 , we derive
( u 1 ) N 1 , 0 n + 1 ( u 1 ) N 1 , 0 n τ + 2 α 1 h 1 ( u 1 ) N 1 , 0 n + 1 + 2 q 1 h y 2 ( ( u 1 ) N 1 , 0 n + 1 ( u 1 ) N 1 , 1 n + 1 ) = 2 q 1 h 1 ( g 1 c ) N 1 n 2 p 1 h 1 2 ( u 1 ) N 1 , 0 n ( u 1 ) N 1 1 , 0 n + 2 β 1 h 1 ( u 2 ) 0 , s n + 2 ( γ 1 ) 0 n + 1 h 1 + ( f 1 ) N 1 , 0 n + 1
( u 1 ) N 1 , N y n + 1 ( u 1 ) N 1 , N y n τ + 2 α 1 h 1 ( u 1 ) N 1 , N y n + 1 = 2 q 1 h y ( g 1 d ) N 1 n + 1 ( u 1 ) N 1 , N y n ( u 1 ) N 1 , N y 1 n h y 2 p 1 h 1 2 ( u 1 ) N 1 , N y n ( u 1 ) N 1 1 , N y n + 2 β 1 h 1 ( u 2 ) 0 , N y n + 2 ( γ 1 ) 0 n + 1 h 1 + ( f 1 ) N 1 , N y n + 1
The discrete Dirichlet boundary condition at x = a 1 , c y d is the standard
( u 1 ) 0 , s n + 1 = φ 1 n + 1 ( μ 1 ) s , s = N y , N y 1 , , 1
Therefore, the second kind Saul’yev finite difference scheme in the domain ω ¯ h 1 × ω ¯ h y × ω ¯ τ is formed by Equations (31), (34), (36), and (38)–(41) and initial condition ( u 1 ) j 1 , s 0 = u 1 0 ( x 1 j 1 , y s ) . Note that at each time layer, this discretization is independent of the solution in the second domain and can be executed in an explicit fashion as well.
Further, we construct the corresponding discretizations at the boundary of the second domain: Ω 2 h = ω ¯ h 2 × ω ¯ h y . At each time level, we compute the solution first in Ω 1 h and then in Ω 2 h , so that the solution u 1 n + 1 is already known. We proceed in the same manner as for the construction of the numerical scheme in Ω 1 h but take into account that now, we move from the bottom left corner to the upper right corner, and first kind Saul’yev formula is used. The resulting discretizations for (4), (6), and (8) at the boundary grid nodes are as follows:
( u 2 ) 0 , 0 n + 1 ( u 2 ) 0 , 0 n τ + 2 α 2 h 2 ( u 2 ) 0 , 0 n + 1 = 2 p 2 h 2 2 ( u 2 ) 1 , 0 n ( u 2 ) 0 , 0 n + 2 q 2 h y 2 ( u 2 ) 0 , 1 n ( u 2 ) 0 , 0 n + 2 β 2 h 2 ( u 1 ) N 1 , 0 n + 1 + 2 ( γ 2 ) 0 n + 1 h 2 2 q 2 h y ( g 2 c ) 0 n + 1 + ( f 2 ) 0 , 0 n + 1
( u 2 ) j 2 , 0 n + 1 ( u 2 ) j 2 , 0 n τ = p 2 δ x ( u 2 ) j 2 , 0 ( n + 1 , n ) + 2 q 2 h y 2 ( ( u 2 ) j 2 , 1 n + 1 ( u 2 ) j 2 , 0 n + 1 ) 2 q 2 h y ( g 2 c ) j 2 n + 1 , j 2 = 1 , 2 , , N 2 1
( u 2 ) 0 , s n + 1 ( u 2 ) 0 , s n τ + 2 α 2 h 2 ( u 2 ) 0 , s n + 1 = q 2 δ y ( u 2 ) 0 , s ( n + 1 , n ) 2 p 2 h 2 2 ( u 2 ) 0 , s n ( u 2 ) 1 , s n + 2 β 2 h 2 ( u 1 ) N 1 , s n + 1 + 2 ( γ 2 ) s n + 1 h 2 + ( f 2 ) 0 , s n + 1 , s = 1 , 2 , , N y 1
( u 2 ) 0 , N y n + 1 ( u 2 ) 0 , N y n τ + 2 α 2 h 2 ( u 2 ) 0 , N y n + 1 + 2 q 2 h y 2 ( u 2 ) 0 , N y n + 1 ( u 2 ) 0 , N y 1 n + 1 + 2 β 2 h 2 ( u 1 ) N 1 , N y n + 1 = 2 p 2 h 2 2 ( u 2 ) 1 , N y n ( u 2 ) 0 , N y n + 2 ( γ 2 ) N y n + 1 h 2 + 2 q 2 h y ( g 2 c ) N y n + 1 + ( f 2 ) 0 , N y n + 1
( u 2 ) j 2 , N y n + 1 ( u 2 ) j 2 , N y n τ + 2 q 2 h y 2 ( ( u 2 ) j 2 , N y n + 1 ( u 2 ) j 2 , N y 1 n + 1 ) = p 2 δ x ( u 2 ) j 2 , N y ( n + 1 , n ) + 2 q 2 h y ( g 2 d ) j 2 n + 1 , j 1 = 1 , 2 , , N 2 1
( u 2 ) N 2 , s n + 1 = φ 2 n + 1 ( μ 2 ) s , s = 1 , 2 , , N y
The finite difference scheme in the second domain Ω 2 h is formed by Equations (32) and (42)–(47) and initial condition ( u 1 ) j 1 , s 0 = u 1 0 ( x 1 j 1 , y s ) .

5. Numerical Tests

In this section, we illustrate the efficiency of the developed numerical method for solving the IP. The test example is (1)–(9) with the following parameters:
a 1 = 1 , b 1 = 2 , a 2 = 3 , b 2 = 4 , c = 0 , d = 1 , T = 1 p 1 = 2 , p 2 = 3 , q 1 = 2 , q 2 = 1.5 , α 1 = 3 , α 2 = 1 , β 1 = 2 , β 2 = 0.5
We deal with exact measurements (48) and the exact solution of the problem (1)–(9) in order to verify the accuracy. The computations are performed for h = h 1 = h 2 = h y ( N = N 1 = N 2 = N y ) and τ = h 2 . We give errors in the maximal discrete norm ( ε i , E i ) and the order of convergence ( c r i , C R i ) of the recovered functions φ i n and solutions ( u i ) j i , s n , obtained for φ i n , in comparison with the corresponding exact ones φ ( t ) and u i ( x , y , t ) , i = 1 , 2 .
ε i = ε i ( M ) max 0 n M | φ i ( t n ) φ i n | , E i = E i ( N ) = max 0 n M max 0 j i N max 0 s N | u i ( x j i , y s , t n ) ( u i ) j i , s n | , c r i = log 2 ε i ( M ) ε i ( 2 M ) , C R i = log 2 E i ( N ) E i ( 2 N ) .
Example 1 (Convergence test).
We take the following functions in the model problem (1)–(9):
f 1 ( x , y , t ) = e λ 1 t π 2 8 + λ 1 cos π x 4 + cos π y 4 f 2 ( x , y , t ) = e λ 2 t 3 π 2 8 + λ 2 cos π x 4 + cos π y 4 + 3 π 2 8 cos π x 2 γ 1 ( y , t ) = e λ 1 t 3 cos π y 4 π 2 2 e λ 2 t cos π y 2 γ 2 ( y , t ) = e λ 2 t 3 π 2 + cos π y 2 1 2 e λ 1 t cos π y 4 μ 1 ( y ) = 2 2 + cos π y 4 , μ 1 ( y ) = cos π y 4 1 , φ 1 ( t ) = e λ 1 t , φ 2 ( t ) = e λ 2 t u 1 0 ( x , y ) = cos π x 4 + cos π y 4 , u 2 0 ( x , y ) = cos π x 2 + cos π y 2
Then, the exact solution of (1)–(9) is
u 1 ( x , y , t ) = e λ 1 t cos π x 4 + cos π y 4 , u 2 ( x , y , t ) = e λ 2 t cos π x 2 + cos π y 2
and in view of (19), the exact measured functions are
m 1 ( t ) = 4 π e λ 1 t , m 2 ( t ) = 4 π e λ 2 t .
The computational results for λ 1 = 1 / 2 , λ 2 = 1 / 3 and λ 1 = 1 , λ 2 = 2 are listed in Table 1 and Table 2, respectively. We observe that for both tests, the order of convergence of the recovered functions φ i is first.
In Table 3 and Table 4, we give the errors of the corresponding numerical solutions, computed for recovered functions φ i with both sets of parameters λ i , i = 1 , 2 . The results show that the numerical method is convergent of order one.
In Figure 2, we plot the error (i.e., u i ( x j i , y s , t n ) ( u i ) j i , s n ) of the numerical solution of the 2D direct problem at the final time for λ 1 = 1 / 2 , λ 2 = 1 / 3 and λ 1 = 1 , λ 2 = 2 .
Example 2 (Noisy data).
We repeat the same experiment as in Example 1, but now, we give a noise to the measurements:
m i σ i ( t n ) = m i ( t n ) + 2 σ i m i ( t n ) ( ρ i ( t n ) 0.5 ) , i = 1 , 2
where σ i is the noise level and ρ i ( t n ) is a random function, uniformly distributed on the interval [ 0 , 1 ] . Then, we smooth the data through polynomial curve-fitting of the third degree.
In Figure 3 and Figure 4 we present exact and recovered functions φ i , i = 1 , 2 for N = 80 , σ 1 = 0.02 , σ 1 = 0.03 , with parameters λ 1 = 1 / 2 , λ 2 = 1 / 3 and λ 1 = 1 , λ 2 = 2 , respectively. The algorithm successfully restores the external boundary conditions. The largest error is close to the initial time.
The corresponding errors of the recovered solution u i at the final time layer are depicted in Figure 5. The precision is quite satisfactory. Therefore, we may conclude that the method is efficient also for noisy measurements.

6. Conclusions

This paper concerns an initial boundary-value problem for a two-dimensional heat equation, defined on disjoint domains. It is a special interface parabolic problem, in which the interface boundary conditions are of Robin’s type, while the external boundary conditions are of Dirichlet and Neumann form. We first establish the well-posedness of the direct (forward) problem. The Dirichlet conditions are unknown functions for the inverse problem and have to be determined on the basis of two integral observations—one on each rectangle. We reduce the inverse problem to a direct one with Dirichlet boundary conditions and integral conditions on the interface of the corresponding rectangle. We prove the well-posedness of the new problem, and as a consequence, the well-posedness of the original inverse problem follows.
The new, non-local problem is solved using the Saul’yev explicit difference scheme. Computational tests showed that the order of convergence of the numerical method for exact data is first. For noisy measurements, we show that the algorithm successfully restores external boundary conditions, and the precision of the solution is optimal.
The main advantage of the proposed method is that the 2D ill-posed problem is reduced to a 1D well-posed problem. Moreover, the numerical discretization is unconditionally stable and can be realized explicitly. The disadvantages are that the method is first-order accurate (for exact measurements) and conditionally consistent.
An even more challenging problem is to reconstruct the reaction space-dependent coefficient using integral observations. We hope to be able to address these issues and to report additional progress in the future.

Author Contributions

Conceptualization, M.N.K. and L.G.V.; methodology, M.N.K. and L.G.V.; investigation, M.N.K. and L.G.V.; resources, M.N.K. and L.G.V.; writing—original draft preparation, M.N.K. and L.G.V.; writing—review and editing, L.G.V.; validation, M.N.K. All authors have read and agreed to the published version of the manuscript.

Funding

This study is financed by the European Union–NextGenerationEU, through the National Recovery and Resilience Plan of the Republic of Bulgaria, project no. BG-RRP-2.013-0001-C01.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The authors are very grateful to the anonymous reviewers, whose valuable comments and suggestions improved the quality of this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations and nomenclature are used in this manuscript:
Ω i , i = 1 , 2 Spatial disconnected domains
p i Diffusion coefficient in ith domain
q i Diffusion coefficient in ith domain
f i Heat source function in ith domain
α i , β i Reaction coefficients in interface conditions in ith domain
μ i ( y ) Space-dependent part of the external boundary conditions in ith domain
φ i ( t ) Time-dependent part of the external boundary conditions in ith domain
γ i ( y , t ) Interface boundary source in ith domain
g i c ( x , t ) Dirichlet boundary source at y = c in ith domain
g i d ( x , t ) Dirichlet boundary source at y = d in ith domain
IPInverse problem

References

  1. Lesnic, D. Inverse Problems with Applications in Science and Engineering; CRC Press: Abingdon, UK, 2021; p. 349. [Google Scholar]
  2. Samarskii, A.A.; Vabishchevich, P.N. Numerical Methods for Solving Inverse Problems in Mathematical Physics; de Gruyter: Berlin, Germany, 2007; 438p. [Google Scholar]
  3. Hasanov, A.H.; Romanov, V.G. Introduction to Inverse Problems for Differential Equations, 1st ed.; Springer: Cham, Switzerland, 2017; 261p. [Google Scholar]
  4. Isakov, V. Inverse Problems for Partial Differential Equations, 3rd ed.; Springer: Cham, Switzerland, 2017; p. 406. [Google Scholar]
  5. Ivanov, V.K.; Vasin, V.V.; Tanana, V.P. Theory of Linear Ill-Posed Problems and Its Approximations; Nauka: Moscow, Russia, 1978. (In Russian) [Google Scholar]
  6. Kabanikhin, S.I. Inverse and Ill-Posed Problems; DeGruyer: Berlin, Germany, 2011. [Google Scholar]
  7. Prilepko, A.I.; Orlovsky, D.G.; Vasin, I.A. Methods for Solving Inverse Problems in Mathematical Physics; Marcel Dekker: New York, NY, USA, 2000. [Google Scholar]
  8. Rundell, W.; Yin, H.-M. A parabolic inverse problem with an unknown boundary condition. J. Differ. Equ. 1990, 86, 234–242. [Google Scholar] [CrossRef]
  9. Demir, A.; Ozbilge, E. Identification of the unknown boundary condition in a linear parabolic equation. J. Inequal. Appl. 2013, 96, 1–7. [Google Scholar] [CrossRef]
  10. Vasil’ev, V.I.; Su, L. Numerical method for solving boundary inverse problem for one-dimensional parabolic equation. Math. Model. 2017, 24, 108–117. [Google Scholar] [CrossRef]
  11. Rundell, W.; Xub, X.; Zuo, L. The determination of an unknown boundary condition in a fractional diffusion equation. Appl. Anal. 2013, 92, 1511–1526. [Google Scholar] [CrossRef]
  12. Zheng, G.H.; Wei, T. A new regularization method for a Cauchy problem of the time fractional diffusion equation. Adv. Comput. Math. 2012, 36, 377–398. [Google Scholar] [CrossRef]
  13. Abdollahi, A.N.; Rostamy, D. Identifying an unknown time-dependent boundary source in time-fractional diffusion equation with a non-local boundary condition. J. Comput. Appl. Math. 2019, 355, 3–50. [Google Scholar]
  14. Zheng, G.H.; Wei, T. Spectral regularization method for a Cauchy problem of the time fractional advection-dispersion equation. J. Comput. Appl. Math. 2010, 233, 2631–2640. [Google Scholar] [CrossRef]
  15. Kumar, S.; Ghosh, S.; Samet, B.; Goufo, E.F.D. An analysis for heat equations arises in diffusion process using new Yang-Abdel-Aty-Cattani fractional operator. Math. Method Appl. Sci. 2020, 43, 6062–6080. [Google Scholar] [CrossRef]
  16. Rasheed, M.; Ali, A.H.; Alabdali, O.; Shihab, S.; Rashid, A.; Rashid, T.; Hamad, S.H.A. The effectiveness of the finite differences method on physical and medical images based on a heat diffusion equation. J. Phys. Conf. Ser. 2021, 1999, 012080. [Google Scholar] [CrossRef]
  17. Liu, C.; Ball, W.P. Analytical modeling of diffusion-limited contamination and decontamination in a two-layer porous medium. Adv. Water Resour. 1998, 21, 297–313. [Google Scholar] [CrossRef]
  18. Sheils, N.E. Multilayer diffusion in a composite medium with imperfect contact. Appl. Math. Model. 2017, 46, 450–464. [Google Scholar] [CrossRef]
  19. Raza, A.; Stadoleanu, O.V.; Abed, A.M.; Ali, A.H.; Sallah, M. Heat transfer model analysis of fractional Jeffery-type hybrid nanofluid dripping through a poured microchannel. Int. J. Thermofluids 2024, 22, 100656. [Google Scholar] [CrossRef]
  20. Amir, M.; Ali, Q.; Raza, A.; Almusawa, M.Y.; Hamali, W.; Ali, A.H. Computational results of convective heat transfer for fractionalized Brinkman type tri-hybrid nanofluid with ramped temperature and non-local kernel. Ain Shams Eng. J. 2024, 15, 102576. [Google Scholar] [CrossRef]
  21. Carr, E.J. Generalized semi-analytical solution for coupled multispecies advection-dispersion equations in multilayer porous media. Appl. Math. Model. 2021, 94, 87–97. [Google Scholar] [CrossRef]
  22. Carr, E.J. New semi-analytical solutions for advection–dispersion equations in multilayer porous media. Transp. Porous Med. 2020, 135, 39–58. [Google Scholar] [CrossRef]
  23. Chen, J.-S.; Ho, Y.-C.; Liang, C.-P.; Wang, S.-W.; Liu, C.-W. Semi-analytical model for coupled multispecies advective-dispersive transport subject to rate-limited sorption. J. Hydrol. 2019, 579, 124164. [Google Scholar] [CrossRef]
  24. March, N.G.; Carr, E.J. Finite volume schemes for multilayer diffusion. J. Comput. Appl. Math. 2019, 345, 206–223. [Google Scholar] [CrossRef]
  25. Amosov, A.A. Global solvability of a nonlinear nonstationary problem with a nonlocal boundary condition of radiation heat transfer type. Differ. Equ. 2005, 41, 96–109. [Google Scholar] [CrossRef]
  26. Jovanovic, B.S.; Vulkov, L.G. Finite difference approximation of strong solutions of a parabolic interface problem on disconected domains. Publ. Inst. Math. 2008, 84, 37–48. [Google Scholar] [CrossRef]
  27. Jovanovic, B.S.; Vulkov, L.G. Numerical solution of a two-dimensional parabolic transmission problem. Int. J. Numer. Anal. Model. 2010, 7, 156–172. [Google Scholar]
  28. Koleva, M.N.; Vulkov, L.G. Weak and classical solutions to multispecies advection-dispersion equations in multilayer porous media. Mathematics 2023, 11, 3103. [Google Scholar] [CrossRef]
  29. Milovanović, Z. Finite Difference Scheme for a Parabolic Transmission Problem in Disjoint Domains. In Numerical Analysis and Its Applications, Lecture Notes in Computer Science; Dimov, I., Faragó, I., Vulkov, L., Eds.; Springer: Berlin/Heidelberg, Germany, 2013; Volume 8236, pp. 403–410. [Google Scholar]
  30. Mikhailov, M.D.; Oezisik, M.N.; Vulchanov, N.L. Diffusion in composite layers with automatic solution of the eigenvalue problem. Int. J. Heat Mass Transfer 1983, 26, 1131–1141. [Google Scholar] [CrossRef]
  31. Asvestas, M.; Sifalakis, A.G.; Papadopoulou, E.P.; Saridakis, Y.G. Fokas method for a multi-domain linear reaction-diffusion equation with discontinuous diffusivity. J. Phys. Conf. Ser. 2014, 490, 012143. [Google Scholar] [CrossRef]
  32. Movahedian, B.; Boroomand, B. The solution of direct and inverse transient heat conduction problems with layered materials using exponential basis functions. Int. J. Therm. Sci. 2014, 77, 186–198. [Google Scholar] [CrossRef]
  33. Koleva, M.N.; Vulkov, L.G. Numerical identification of external boundary conditions for time fractional parabolic equations on disjoint domains. Fractal Fract. 2023, 7, 326. [Google Scholar] [CrossRef]
  34. Koleva, M.N.; Vulkov, L.G. Reconstruction of Boundary Conditions of a Parabolic-Hyperbolic Transmission Problem; Springer Series Proc. in Mathematics & Statistics, to Appear; Springer: Berlin/Heidelberg, Germany, 2024. [Google Scholar]
  35. Saul’yev, V.K. Integration of Equation Parabolic Type by the Method of Nets; Pergamon Press: New York, NY, USA, 1964. [Google Scholar]
  36. Bieniasz, L.K.; Østerby, O.; Britz, D. Numerical stability of the Saul’yev finite difference algorithms for electrochemical kinetic simulations: Matrix stability analysis for an example problem involving mixed boundary conditions. Comput. Chem. 1995, 19, 357–370. [Google Scholar] [CrossRef]
  37. Pourghanbar, S.; Manafian, J.; Ranjbar, M.; Aliyeva, A.; Gasimov, Y.S. An efficient alternating direction explicit method for solving a nonlinear partial differential equation. Math. Probl. Eng. 2020, 2020, 9647416. [Google Scholar] [CrossRef]
  38. Vongkok, A.; Pochai, N. Numerical simulations for reactive nitrogen compounds pollution measurements in a stream using Saulyev method. Ital. J. Pure Appl. Math. 2020, 43, 552–582. [Google Scholar]
  39. Yang, J.; Li, Y.; Lee, C.; Lee, H.G.; Kwok, S.; Hwang, Y.; Xin, X.; Kim, J. An explicit conservative Sayl’yev scheme for the Cahn-Hillard equation, Intern. J. Mech. Sci. 2022, 217, 106985. [Google Scholar] [CrossRef]
  40. Zhu, L. A Second-order uniformly stable explicit asymmetric discretization method for one-dimensional fractional diffusion equations. Complexity 2019, 2019, 4238420. [Google Scholar] [CrossRef]
  41. Dehghang, M. Saul’yev techniques for solving a parabolic equations with a nonlinear boundary specification, Intern. J. Comput. Math. 2003, 80, 257–265. [Google Scholar]
  42. Jovanovic, B.S.; Vulkov, L.G. Formulation and analysis of a parabolic transmission problem on disjoint intervals. Publ. L’Inst. Math. 2012, 91, 111–123. [Google Scholar] [CrossRef]
  43. Wloka, J. Partial Differential Equations; Cambridge University Press: Cambridge, UK, 1987. [Google Scholar]
  44. Ladyzhenskaia, O.A.; Solonnikov, V.A.; Ural’tseva, N.N. Linear and Quasi-Linear Equations of Parabolic Type; American Mathematical Society: Ann Arbor, MI, USA, 1968; 648p. [Google Scholar]
  45. Darvishi, T. Forward-Backward Saul’yev Method to Solve PDEs. WSEAS Trans. Math. 2003, 2, 21–25. [Google Scholar]
Figure 1. Spatial domain of the problem (1)–(8): two disconnected rectangles Ω 1 , Ω 2 ; the solution is coupled by interface conditions (7), (8) at x = b 1 and x = a 2 .
Figure 1. Spatial domain of the problem (1)–(8): two disconnected rectangles Ω 1 , Ω 2 ; the solution is coupled by interface conditions (7), (8) at x = b 1 and x = a 2 .
Mathematics 12 01499 g001
Figure 2. Error of the numerical solution, λ 1 = 1 / 2 , λ 2 = 1 / 3 (left) and λ 1 = 1 , λ 2 = 2 (right), N = 80 , Example 1.
Figure 2. Error of the numerical solution, λ 1 = 1 / 2 , λ 2 = 1 / 3 (left) and λ 1 = 1 , λ 2 = 2 (right), N = 80 , Example 1.
Mathematics 12 01499 g002
Figure 3. Exact and recovered functions φ 1 (left) and φ 2 (right), N = 80 , σ 1 = 0.02 , σ 1 = 0.03 , λ 1 = 1 / 2 , λ 2 = 1 / 3 , Example 2.
Figure 3. Exact and recovered functions φ 1 (left) and φ 2 (right), N = 80 , σ 1 = 0.02 , σ 1 = 0.03 , λ 1 = 1 / 2 , λ 2 = 1 / 3 , Example 2.
Mathematics 12 01499 g003
Figure 4. Exact and recovered functions φ 1 (left) and φ 2 (right), N = 80 , σ 1 = 0.02 , σ 1 = 0.03 , λ 1 = 1 , λ 2 = 2 , Example 2.
Figure 4. Exact and recovered functions φ 1 (left) and φ 2 (right), N = 80 , σ 1 = 0.02 , σ 1 = 0.03 , λ 1 = 1 , λ 2 = 2 , Example 2.
Mathematics 12 01499 g004
Figure 5. Error of the recovered solutions u 1 and u 2 , N = 80 , σ 1 = 0.02 , σ 1 = 0.03 and λ 1 = 1 / 2 , λ 2 = 1 / 3 (left), λ 1 = 1 , λ 2 = 2 (right), Example 2.
Figure 5. Error of the recovered solutions u 1 and u 2 , N = 80 , σ 1 = 0.02 , σ 1 = 0.03 and λ 1 = 1 / 2 , λ 2 = 1 / 3 (left), λ 1 = 1 , λ 2 = 2 (right), Example 2.
Mathematics 12 01499 g005
Table 1. Errors and convergence rate of φ 1 n and φ 2 n , λ 1 = 1 / 2 , λ 2 = 1 / 3 , Example 1.
Table 1. Errors and convergence rate of φ 1 n and φ 2 n , λ 1 = 1 / 2 , λ 2 = 1 / 3 , Example 1.
N ε 1 cr 1 ε 2 cr 2
203.6480 × 10−3 5.7428 × 10−3
401.7277 × 10−31.07823.2817 × 10−30.8073
808.4978 × 10−41.02371.8136 × 10−30.8556
1604.2181 × 10−41.01059.5262 × 10−40.9289
3202.1017 × 10−41.00504.8802 × 10−40.9650
6401.0491 × 10−41.00252.4697 × 10−40.9826
Table 2. Errors and convergence rate of φ 1 n and φ 2 n , λ 1 = 1 , λ 2 = 2 , Example 1.
Table 2. Errors and convergence rate of φ 1 n and φ 2 n , λ 1 = 1 , λ 2 = 2 , Example 1.
N ε 1 cr 1 ε 2 cr 2
201.5829 × 10−2 2.2918 × 10−2
407.8168 × 10−31.01791.0155 × 10−21.1743
803.8849 × 10−31.00874.9144 × 10−31.0471
1601.9367 × 10−31.00432.4263 × 10−31.0183
3209.6692 × 10−41.00211.2062 × 10−31.0083
6404.8310 × 10−41.00116.0141 × 10−41.0040
Table 3. Errors and convergence rate of ( u 1 ) n and ( u 2 ) n , λ 1 = 1 / 2 , λ 2 = 1 / 3 , Example 1.
Table 3. Errors and convergence rate of ( u 1 ) n and ( u 2 ) n , λ 1 = 1 / 2 , λ 2 = 1 / 3 , Example 1.
N E 1 CR 1 E 2 CR 2
206.2275 × 10−3 1.1486 × 10−2
402.9494 × 10−31.07826.5635 × 10−30.8073
801.4507 × 10−31.02373.6273 × 10−30.8556
1607.2008 × 10−41.01051.9052 × 10−30.9289
3203.5879 × 10−41.00509.7604 × 10−40.9650
6401.7907 × 10−41.00264.9230 × 10−40.9874
Table 4. Errors and convergence rate of ( u 1 ) n and ( u 2 ) n , λ 1 = 1 , λ 2 = 2 , Example 1.
Table 4. Errors and convergence rate of ( u 1 ) n and ( u 2 ) n , λ 1 = 1 , λ 2 = 2 , Example 1.
N E 1 CR 1 E 2 CR 2
202.7022 × 10−2 4.5835 × 10−2
401.3344 × 10−21.01792.0309 × 10−21.1743
806.6320 × 10−31.00879.8288 × 10−31.0471
1603.3061 × 10−31.00434.8525 × 10−31.0183
3201.6506 × 10−31.00212.4123 × 10−31.0083
6408.2469 × 10−41.00111.2032 × 10−31.0035
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.

Share and Cite

MDPI and ACS Style

Koleva, M.N.; Vulkov, L.G. Numerical Reconstruction of Time-Dependent Boundary Conditions to 2D Heat Equation on Disjoint Rectangles at Integral Observations. Mathematics 2024, 12, 1499. https://doi.org/10.3390/math12101499

AMA Style

Koleva MN, Vulkov LG. Numerical Reconstruction of Time-Dependent Boundary Conditions to 2D Heat Equation on Disjoint Rectangles at Integral Observations. Mathematics. 2024; 12(10):1499. https://doi.org/10.3390/math12101499

Chicago/Turabian Style

Koleva, Miglena N., and Lubin G. Vulkov. 2024. "Numerical Reconstruction of Time-Dependent Boundary Conditions to 2D Heat Equation on Disjoint Rectangles at Integral Observations" Mathematics 12, no. 10: 1499. https://doi.org/10.3390/math12101499

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

Article Metrics

Back to TopTop