Next Article in Journal
Effect of Fuzzy Time Series on Smoothing Estimation of the INAR(1) Process
Next Article in Special Issue
Complex Dynamic Behaviors of a Modified Discrete Leslie–Gower Predator–Prey System with Fear Effect on Prey Species
Previous Article in Journal
Stability Analysis of a Stage-Structure Predator–Prey Model with Holling III Functional Response and Cannibalism
Previous Article in Special Issue
Global Attractivity of Symbiotic Model of Commensalism in Four Populations with Michaelis–Menten Type Harvesting in the First Commensal Populations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Numerical Method for a Heat Conduction Model in a Double-Pane Window

1
Departamento de Ciencias Básicas—Centro de Ciencias Exactas CCE-UBB, Facultad de Ciencias, Universidad del Bío-Bío, Campus Fernando May, Chillán 3780000, Chile
2
Departamento de Matemática, Facultad de Ciencias Naturales, Matemáticas y del Medio Ambiente, Universidad Tecnológica Metropolitana, Las Palmeras 3360, Ñuñoa-Santiago 7750000, Chile
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(8), 422; https://doi.org/10.3390/axioms11080422
Submission received: 12 July 2022 / Revised: 12 August 2022 / Accepted: 17 August 2022 / Published: 22 August 2022
(This article belongs to the Special Issue Advances in Applied Mathematical Modelling)

Abstract

:
In this article, we propose a one-dimensional heat conduction model for a double-pane window with a temperature-jump boundary condition and a thermal lagging interfacial effect condition between layers. We construct a second-order accurate finite difference scheme to solve the heat conduction problem. The designed scheme is mainly based on approximations satisfying the facts that all inner grid points has second-order temporal and spatial truncation errors, while at the boundary points and at inter-facial points has second-order temporal truncation error and first-order spatial truncation error, respectively. We prove that the finite difference scheme introduced is unconditionally stable, convergent, and has a rate of convergence two in space and time for the L -norm. Moreover, we give a numerical example to confirm our theoretical results.

1. Introduction

In the last decades, there is an increasing interest in the research and development of mathematical models related with clean technologies; see, for instance, [1]. The interest is motivated by the diminution of adverse environmental impacts of conventional energies, the growth of world population with improved life standards, the reduction in energy production costs, and the optimization of energy consumption [2]. It is known that about a third of the total energy is used in buildings and a about a third of energy is lost through windows [3]. Then, a key aspect to understand in order to save energy in buildings is the design of appropriate windows.
In the recent literature, there are several works focused in the study of heat transfer in pane windows [4,5,6,7,8,9,10,11,12,13,14]. The finite difference techniques is used to solve numerically the Boussinesq equations and to simulate the flow of the air in a window cavity [4]. The problem of natural convective flows in the cavity of a double-glazed window with photovoltaic cells is modeled and simulated by the Navier–Stokes and energy equations [5]. From a stationary two-dimensional formulation of heat transfer through a triple-pane window and applying the method of numerical modeling, we deduced that the thermal resistance of the triple-pane window filled with air turns out to be 1.7 times higher than that of the double-pane window having the same thickness as the triple-pane [6]. The determination of the optimum thickness of the air layer that is trapped between the interior and exterior glass of a window pane has been studied in the context of window design [7,13]. The research of other potential problems arising in pane windows (such as the low consumption of energy in a building with double pane window, the numerical modeling, the design of multiple pane windows, the relation to the climate, etc.) are conducted by several works [8,9,10,11,12,14].
The study of transfer heat problems between different substances, for instance, solids of different types or solids and fluids, are considered by several researchers [15,16,17,18,19,20,21,22,23]. The motivations are of different types: simple examples, analytical solutions, creation of mathematical models, different applications, theoretical study, and numerical simulations [15]. Particularly, in relation to the numerical solutions, we propose several numerical methods including the use of high-order implicit time integration schemes [17], hybrid boundary element method and radial basis integral equation [18], high-order finite volume schemed [19], projection method [20], high-order implicit Runge–Kutta schemes [21], and finite difference methods [23].
On the other hand, we know that for situations of very-low temperatures near absolute zero the heat propagate at a finite speed [24]. Then, the classical models of heat transfer, based on the Fourier law, needs an improvement. One of those generalizations is the well-known dual-phase-lagging model proposed by Tzou in [25] (see also [26]), which is based in non-Fourier heat conduction law and the energy equation given by
q ( x , t + τ q ) = k T x ( x , t + τ T ) ,
q x ( x , t ) = C T t ( x , t ) + Q ( x , t ) ,
respectively; where t is the time, x is the space position, T is the temperature, q is the heat flux, k is the heat conductivity, τ T is the phase lag of the temperature gradient, τ q is the phase lag of the heat flux, C is the heat capacity of the material, and Q is the volumetric heat generation. By applying a Taylor series expansion in (1), we deduce that
q ( x , t ) + τ q q x ( x , t ) = k T x ( x , t ) + τ T 2 T t x ( x , t ) .
Then, by using (2) in (3), we obtain
C T t + τ q 2 T t x = k 2 T x 2 + τ T 3 T t 2 x ,
which is known as the heat conduction equation under the dual-phase-lagging effect or briefly as dual-phase-lagging model.
In this paper, we are interested in the problem of heat transfer in a double pane window. Let us consider a double pane window of a total width thickness L, schematically presented in Figure 1. The width thickness of exterior glass, air space, and interior glass are given by 1 , 2 , and 3 , respectively. For convenience of the presentation, we introduce the following terminology and notation
L 0 = 0 , L 1 = 1 , L 2 = 1 + 2 , L 3 = 1 + 2 + 3 = L , L 0   and L 3   are   called   the   boundaries   and   L 1   and   L 2   the   interfaces , I 1 = ] L 0 , L 1 [ , I 2 = ] L 1 , L 2 [ ,   and   I 3 = ] L 2 , L 3 [ ,   are   called   the   layers , I l a y = I 1 I 2 I 3 , I i n t = { L 1 } { L 2 } , I = I l a y I i n t , I = { L 0 , L 1 } , I , T = { L } × [ 0 , T ] , Q , T = I × [ 0 , T ] , Q T l a y = I l a y × [ 0 , T ] , I T i n t = I i n t × [ 0 , T ] , Q T = Q T l a y I T i n t .
We assume that the mathematical model for heat transfer is given by the initial interface-boundary value problem
C u t + τ q ( ) 2 u t 2 = k 2 u x 2 + τ T ( ) 3 u t x 2 + f ( x , t ) , = 1 , 2 , 3 , in Q T l a y ,
u ( x , 0 ) = ψ 1 ( x ) , u t ( x , 0 ) = ψ 2 ( x ) , on I ,
α 1 K n ( 1 ) u x + u ( L 0 , t ) = φ 1 ( t ) , on [ 0 , T ] ,
α 2 K n ( 2 ) u x + u ( L 3 , t ) = φ 2 ( t ) , on [ 0 , T ] ,
u ( x 0 , t ) = u ( x + 0 , t ) , on I T i n t , k u x + τ T ( ) 2 u x t ( x 0 , t )
= k + 1 u x + τ T ( + 1 ) 2 u x t ( x + 0 , t ) , = 1 , 2 , on I T i n t ,
where u ( x , t ) is the temperature at the position x and time t, C is the heat capacitance; τ q ( ) and τ T ( ) stand for the heat flux and the temperature gradient phase lags, respectively; k is the conductivity; f are the source functions; α 1 and α 2 are some coefficients; K n ( 1 ) and K n ( 2 ) are the Knudsen numbers; ψ 1 and ψ 2 are the initial conditions; and φ 1 and φ 2 are two given functions modeling the boundary conditions. We notice three facts: the relationship between K n and k is given by K n 2 C L c 2 = 3 k τ q with L c a characteristic length, the boundary conditions (8) and (9) are a consequence of assuming a temperature-jump condition, and the model are not in dimensionless form; see [27,28] for details.
The state equation (Equation (6)) is deduced by assuming by the fact that the dual-phase-lagging model of the form (4) is satisfied in each layer I 1 , I 2 and I 3 . The interfacial conditions (10) and (11) are imposed in order to obtain a continuous behavior of temperature and the heat flux, respectively. For instance at x = L 1 , we have that (11), by application of the first-order non-Fourier’s law, is rewritten as follows
q ( L 1 0 , t ) + τ q ( 1 ) q t ( L 1 0 , t ) = q ( L 1 + 0 , t ) + τ q ( 2 ) q t ( L 1 + 0 , t ) .
The condition of the type (11) was introduced in [27] for the case of the mathematical model of a double-layered nano-scale thin film, where the authors observe that these kind of interfacial conditions plays an important role in the derivation of energy estimations. Other important aspect of the mathematical model (6) and (11) is the fact the state equation and the boundary conditions (8) and (9) are given only in terms of the temperature, which is different from the standard models where a variable the heat flux is considered.
The main results of the paper are the following: (i) we prove an energy estimate, (ii) we introduce a second-order accurate finite difference scheme for solving the mathematical model, and (iii) we prove that the unconditional stability, the convergence, and estimate that the rate of convergence is two in space and time for the L -norm. Additionally, we give two numerical examples.
The methodology used in the paper is a generalization of the one introduced in [27] for the case heat transfer in a double-layered nano-scale thin film. We consider the change variable v = u t and deduce the equivalent system to (6)–(11) in terms of u and v. We introduce the discretization by a semidiscrete finite difference scheme. In addition, we deduce a fully finite difference scheme, approaching the system for ( u , v ) . We rewrite the discrete scheme to approximate the solution of (6)–(11). Then, we introduce and prove the results of discrete energy estimation, unconditional stability, convergence, and error estimates.

2. Change of Variable and Continuous Energy Estimation

We introduce a new function v : Q T ¯ R such that v = u t . Then, from (6)–(11), we deduce that
C v + τ q ( ) v t = k 2 x 2 u + τ T ( ) v + f ( x , t ) , = 1 , 2 , 3 , in   Q T l a y ,
v ( x , t ) = t u ( x , t ) , in   Q T ,
u ( x , 0 ) = ψ 1 ( x ) , v ( x , 0 ) = ψ 2 ( x ) , on   I ,
α 1 K n ( 1 ) x u + τ T ( 1 ) v ( L 0 , t ) + ( u + τ T ( 1 ) v ) ( L 0 , t ) = ϕ 1 ( t ) , on   [ 0 , T ] ,
α 2 K n ( 2 ) x u + τ T ( 3 ) v ( L 3 , t ) + ( u + τ T ( 3 ) v ) ( L 3 , t ) = ϕ 2 ( t ) , on   [ 0 , T ] ,
u ( x 0 , t ) = u ( x + 0 , t ) , v ( x 0 , t ) = v ( x + 0 , t ) , on   I T i n t ,
k x u + τ T ( ) v ( x 0 , t ) = k + 1 x u + τ T ( + 1 ) v ( x + 0 , t ) , on   I T i n t ,
where ϕ i = φ i + τ T ( i ) ( φ i ) t for i = 1 , 2 .
Theorem 1.
Consider the notation and terminology defined on (5) and u , v solutions of (6)–(11) and (12)–(18) with boundary conditions ϕ 1 = ϕ 2 = 0 , respectively. If we denote by E the function defined as follows
E ( t ) = = 1 3 C τ q ( ) v 2 L 2 ( I ) 2 + = 1 3 k u x L 2 ( I ) 2 + u 2 ( L 0 , t ) α 1 K n ( 1 ) + u 2 ( L 3 , t ) α 2 K n ( 2 ) ·
Then, the estimate
E ( t ) E ( 0 ) + 1 2 0 t = 1 3 1 C I f 2 ( x , s ) d x d s ,
is valid for any t ] 0 , T ] .
Proof. 
Multiplying the Equation (12) by v, integrating over I l a y , using the identities
I v t v d x = 1 2 d d t I v 2 d x , I u x v x d x = 1 2 d d t I u x 2 d x , I 2 x 2 u + τ T ( ) v v d x = x ( u + τ T ( ) v ) v ( L + , t ) x ( u + τ T ( ) v ) v ( L 1 , t ) I u x v x d x τ T ( ) I v x 2 d x ,
for = 1 , 2 , 3 , and the interface conditions (17) and (18), we have that
= 1 3 C I v 2 d x + 1 2 = 1 3 C τ q ( ) d d t I v 2 d x = = 1 3 k x ( u + τ T ( ) v ) v ( L + , t ) x ( u + τ T ( ) v ) v ( L 1 , t ) = 1 d k I u x v x d x = 1 3 k τ T ( ) I v x 2 d x + = 1 3 I f ( x , t ) v d x = k 3 x ( u + τ T ( d ) v ) v ( L d , t ) k 1 x ( u + τ T ( 1 ) v ) v ( L 0 , t ) 1 2 = 1 3 k d d t I u x 2 d x = 1 3 k τ T ( ) I v x 2 d x + = 1 3 I f ( x , t ) v d x .
Now, using the fact that ϕ 1 = ϕ 2 = 0 , from (15) and (16), we deduce that
k 1 x ( u + τ T ( 1 ) v ) ( L 0 , t ) = 1 α 1 K n ( 1 ) ( u + τ T ( 1 ) v ) ( L 0 , t )
k 3 x ( u + τ T ( 3 ) v ) ( L 3 , t ) = 1 α 2 K n ( 2 ) ( u + τ T ( 3 ) v ) ( L 3 , t ) .
Thus, replacing (22) and (23) in (21), using the definition of E given on (19), and the Cauchy–Schwartz inequality, we have that
1 2 d d t E ( t ) + = 1 3 C I v 2 d x + = 1 3 k τ T ( ) I v x 2 d x = = 1 3 I f ( x , t ) v 2 d x = 1 3 1 4 C I f 2 ( x , t ) d x + = 1 3 C I v 2 d x ,
which implies (20) by an integration on [ 0 , t ] . □

3. Discretization of the Domain, Finite Difference Notation, and Preliminary Results

3.1. Discretization of the Domain

Let us consider the notation in (5). We assume that each interval I is divided into M parts of size Δ x = ( L L 1 ) / M , the temporal interval is divided into N parts of size Δ t = T / N , and we introduce the notation x , i = L 1 + i Δ x ,   x , i + 1 / 2 = L 1 + ( i + 1 / 2 ) Δ x , and t n = n Δ t for i = 1 , , M ; = 1 , 2 , 3 and n = 0 , , N . Then, the discretization of Q T is given by
Q Δ x , Δ t = Ω Δ x × T Δ t : = x , i : i = 0 , , M 1 , = 1 , , 3 , L 3 × t n : n = 1 , , N .

3.2. Finite Difference Notation

The grid function space is defined as follows
U Δ x , Δ t = U = ( u 0 , , u N ) : u n = ( u 1 , 0 n , , u 1 , M 1 n , u 2 , 1 n , , u 2 , M 2 n , u 3 , 1 n , , u 3 , M 3 n ) .
Then, for ( W , , n ) U Δ x , Δ t × { 1 , 2 , 3 } × { 0 , , N } , we introduce the finite difference notation
w , i n + 1 / 2 = 1 2 ( w , i n + w , i n + 1 ) , i = 0 , , M , δ t w , i n + 1 / 2 = 1 Δ t ( w , i n + 1 w , i n ) , i = 0 , , M , w , i n ¯ = 1 4 ( w , i n + 1 + 2 w , i n + w , i n 1 ) , i = 0 , , M , Δ t w , i n = 1 2 Δ t ( w , i n + 1 w , i n 1 ) , i = 0 , , M , δ x w , i + 1 / 2 n = 1 Δ x ( w , i + 1 n w , i n ) , i = 0 , , M 1 , δ x 2 w , i = 1 Δ x δ x w , i + 1 2 δ x w , i 1 2 , i = 1 , , M 1 .
Moreover, we consider the notation
( w n , v n ) = Δ x 1 2 w , 0 n v , 0 n + i = 1 M 1 w , i n v , i n + 1 2 w , M n v , M n ,
w n 2 = ( w n , w n ) , W 2 = = 1 3 w n 2 ,
w n = max 0 i M | w , i n | , W = max 1 3 w n ,
δ x w n 2 = Δ x i = 0 M 1 ( δ x w , i + 1 / 2 n ) 2 , δ x W 2 = = 1 3 δ x w n 2 ,
for the inner product and norms on U Δ x , Δ t .
On the other hand, in the case of semidiscrete and discrete sachems, we use the notation
u , i ( t ) = u ( x , i , t ) , v , i ( t ) = v ( x , i , t ) , u , i n = u ( x , i , t n ) , v , i n = v ( x , i , t n ) ,
for = 1 , 2 , 3 and i = 0 , , M , respectively.

3.3. Four Useful Finite Difference Approximation Lemmas

Lemma 1
([27,29]). Let us consider that [ a , b ] is an interval partitioned in m sub-intervals of the form [ z i 1 , z i ] , where z i is defined by z i = a + i h for i = 0 , , m with h = ( b a ) / m . If we consider that the function g is such that g C 4 ( [ z 0 , z m ] ) , then it holds
g ( z 0 ) = 2 h g ( z 1 ) g ( z 0 ) h g ( z 0 ) h 3 g ( ξ 0 ) , ξ 0 [ z 0 , z 1 ] , g ( z i ) = 1 h 2 g ( z i + 1 ) 2 g ( z i ) + g ( z i 1 ) h 2 12 g ( 4 ) ( ξ 0 ) ,
ξ i [ z i 1 , z i + 1 ] , i = 1 , , m 1 ,
g ( z m ) = 2 h g ( z m ) g ( z m ) g ( z m 1 ) h + h 3 g ( ξ m ) , ξ m [ z m 1 , z m ] .
Lemma 2
([29,30]). Consider that the function g is such that g C 4 ( [ a , b ] ) , then it holds
1 2 g ( a ) + g ( b ) = g ( b ) g ( a ) b a + ( b a ) 2 8 0 1 g a + b 2 + ( b a ) s 2 + g a + b 2 ( b a ) s 2 ( 1 s 2 ) d s .
Lemma 3
([27,29]). Consider that W U Δ x , Δ t , then for any ϵ > 0 , it holds
u 1 2 ( 1 + ϵ ) u 1 , 0 2 + 1 + 1 ϵ L 1 δ x u 1 2 , u 3 2 ( 1 + ϵ ) u 3 , M 3 2 + 1 + 1 ϵ ( L 3 L 2 ) δ x u 3 2 .

4. Semidiscrete and Discrete Schemes for Numerical Solution of (12)–(18)

4.1. Semidiscrete Approximation of System (12)–(18)

4.1.1. Approximation of (12) on I l a y

Here we construct the semidiscrete scheme at inner points, i.e., except on the interfaces and boundaries. The inner nodes at I are x , i for i = 1 , , M 1 . We start the discretization by considering Equation (12) at the inner points ( x , i , t ) , we have that
C v ( x , i , t ) + τ q ( ) t v ( x , i , t ) = k 2 x 2 u + τ T ( ) v ( x , i , t ) + f ( x , i , t ) ,
for = 1 , 2 , 3 and i = 1 , , M 1 . To discretize the right-hand side of (32), we can apply the approximation (30) in Lemma 1 and observe that
2 x 2 u + τ T ( ) v ( x , i , t ) = δ x 2 u + τ T ( ) v ( x , i , t ) ( Δ x ) 2 12 4 x 4 u + τ T ( ) v ( ξ , i , t ) ,
for ξ , i ] x , i 1 , x , i + 1 [ and i = 1 , , M 1 . Dropping the small value terms in (33), replacing the approximation in (32), and using the notation (28), we deduce that the semidiscrete approximation form of (12) at the inner points is given by
C v , i ( t ) + τ q ( ) d d t v , i ( t ) = k δ x 2 u , i ( t ) + τ T ( ) v , i ( t ) + f ( x , i , t ) , for   = 1 , , 3 , i = 1 , , M 1 .

4.1.2. Approximation of (12) on I i n t

We observe that the interface between th and ( + 1 ) th layers is located at x , M = x + 1 , 0 . Then, considering Equation (12) at the inner points ( x , M , t ) and ( x + 1 , 0 , t ) , we deduce that
C v + τ q ( ) t v ( x , M , t ) = k 2 x 2 u + τ T ( ) v ( x , M , t ) + f ( x , M , t ) ,
C + 1 v + τ q ( + 1 ) t v ( x + 1 , 0 , t ) = k + 1 2 x 2 u + τ T ( + 1 ) v ( x + 1 , 0 , t ) + f + 1 ( x + 1 , 0 , t ) ,
for = 1 , 2 . To discretize the right-hand sides of (35) and (36), we can apply the approximations (29) and (31) in Lemma 1, respectively; observe that
2 x 2 u + τ T ( ) v ( x , M , t ) = 2 Δ x x u + τ T ( ) v ( x , M , t ) δ x u + τ T ( ) v ( x , M 1 / 2 , t ) + Δ x 3 3 x 3 u + τ T ( ) v ( ξ , M , t ) , ξ , M [ x , M 1 , x , M ] ,
2 x 2 u + τ T ( + 1 ) v ( x + 1 , 0 , t ) = 2 Δ x + 1 δ x u + τ T ( + 1 ) v ( x + 1 , 1 / 2 , t ) x u + τ T ( + 1 ) v ( x + 1 , 0 , t ) Δ x + 1 3 3 x 3 u + τ T ( + 1 ) v ( ξ + 1 , 0 , t ) , ξ + 1 , 0 [ x + 1 , 0 , x + 1 , 1 ] .
From (18) we have that
k x u + τ T ( ) v ( x , M , t ) = k + 1 x u + τ T ( + 1 ) v ( x + 1 , 0 , t ) .
Thus, multiplying (35) and (36) by Δ x / ( Δ x + Δ x + 1 ) and Δ x + 1 / ( Δ x + Δ x + 1 ) , respectively; dropping the small value terms in (37) and (38) and replacing the approximations in (35) and (36), respectively; summing up the results and using (39) and the notation (28), we obtain the semidiscrete approximation form at the interface points
Δ x C Δ x + Δ x + 1 v , M ( t ) + τ q ( ) d d t v , M ( t ) + Δ x + 1 C + 1 Δ x + Δ x + 1 v + 1 , 0 ( t ) + τ q ( + 1 ) d d t v + 1 , 0 ( t ) = 2 Δ x + Δ x + 1 k + 1 δ x u + τ T ( + 1 ) v ( x + 1 , 1 / 2 , t ) k δ x u + τ T ( ) v ( x , M 1 / 2 , t ) + Δ x Δ x + Δ x + 1 f ( x , M , t ) + Δ x + 1 Δ x + Δ x + 1 f + 1 ( x + 1 , 0 , t ) , = 1 , 2 .

4.1.3. Approximation of (12) on I

We observe that the boundaries of the physical domain are located at x 1 , 0 = 0 and x 3 , M 3 = L . Then, considering the Equation (12) at the boundary points ( x 1 , 0 , t ) and ( x 3 , M 3 , t ) , we deduce that
C 1 v ( x 1 , 0 , t ) + τ q ( 1 ) t v ( x 1 , 0 , t ) = k 1 2 x 2 u + τ T ( 1 ) v ( x 1 , 0 , t ) + f 1 ( x 1 , 0 , t ) ,
C 3 v ( x 3 , M 3 , t ) + τ q ( 3 ) t v ( x 3 , M 3 , t ) = k 3 2 x 2 u + τ T ( 3 ) v ( x 3 , M 3 , t ) + f 3 ( x 3 , M 3 , t ) ,
respectively. To discretize the right-hand sides of (41) and (42), we can apply the approximations (29) and (31) in Lemma 1 and deduce the following relations
2 x 2 u + τ T ( 1 ) v ( x 1 , 0 , t ) = 2 Δ x 1 δ x u + τ T ( 1 ) v ( x 1 , 1 / 2 , t ) x u + τ T ( 1 ) v ( x 1 , 0 , t ) Δ x 1 3 3 x 3 u + τ T ( 1 ) v ( ξ 1 , 0 , t ) , ξ 1 , 0 [ x 1 , 0 , x 1 , 1 ] ,
2 x 2 u + τ T ( 3 ) v ( x 3 , M 3 , t ) = 2 Δ x 3 x u + τ T ( 3 ) v ( x 3 , M 3 , t ) δ x u + τ T ( 3 ) v ( x 3 , M 3 1 / 2 , t ) + Δ x 3 3 3 x 3 u + τ T ( 3 ) v ( ξ 3 , M 3 , t ) , ξ 3 , M 3 [ x 3 , M 3 1 , x 3 , M 3 ] ,
respectively. Moreover by (15) and (16), we have that
x u + τ T ( 1 ) v ( x 1 , 0 , t ) = 1 α 1 K n ( 1 ) u + τ T ( 1 ) v ( x 1 , 0 , t ) ϕ 1 ( t ) ,
x u + τ T ( 3 ) v ( x 3 , M 3 , t ) = 1 α 2 K n ( 2 ) ϕ 2 ( t ) u + τ T ( 3 ) v ( x 3 , M 3 , t ) .
Replacing (45) and (46) in (43) and (44), respectively; dropping the small value terms and replacing the approximations results in (41) and (42), respectively; we obtain the semidiscrete approximation form at the boundaries
C 1 v 1 , 0 ( t ) + τ q ( 1 ) t v 1 , 0 ( t ) = 2 k 1 Δ x 1 δ x u 1 , 1 / 2 ( t ) + τ T ( 1 ) v 1 , 1 / 2 ( t ) 1 α 1 K n ( 1 ) u 1 , 0 ( t ) + τ T ( 1 ) v 1 , 0 ( t ) ϕ 1 ( t ) + f 1 ( x 1 , 0 , t ) ,
C 3 v 3 , M 3 ( t ) + τ q ( 3 ) t v 3 , M 3 ( t ) = k 3 2 Δ x 3 1 α 2 K n ( 2 ) ϕ 2 ( t ) u 3 , M 3 + τ T ( 3 ) v 3 , M 3 ( t ) δ x u 3 , M 3 + τ T ( 3 ) v 3 , M 3 ( t ) + f 3 ( x 3 , M 3 , t ) .

4.1.4. Approximation of (13)

Considering Equation (13) at the point ( x , i , t ) we have that
v ( x , i , t ) = t u ( x , i , t ) , = 1 , 2 , 3 , i = 0 , , M .
Then, the semidiscrete approximation of (13) is given by
v , i ( t ) = d d t u , i ( t ) , = 1 , 2 , 3 , i = 0 , , M ,
which is deduced by using the notation (28) in (49).

4.1.5. Semidiscrete Finite Difference Scheme to Approximate (12)–(18)

Summarizing the results obtained before, we have that the semidiscrete scheme is given by (34), (40), (47), (48), and (50).

4.2. Fully Discrete Finite Difference Scheme to Approximate (12)–(18)

In order to obtain the full discrete finite difference scheme, we consider the semidiscrete approximation and evaluating each of semidiscrete relations at t = t n and t = t n + 1 , applying the Taylor expansion, Lemma 2 and adding the results, for n = 0 , , N 1 , we obtain the scheme
C 1 v 1 , 0 n + 1 / 2 + τ q ( 1 ) δ t v 1 , 0 n + 1 / 2 = 2 k 1 Δ x 1 δ x u 1 , 1 / 2 n + 1 / 2 + τ T ( 1 ) v 1 , 1 / 2 n + 1 / 2 1 α 1 K n ( 1 ) u 1 , 0 n + 1 / 2 + τ T ( 1 ) v 1 , 0 n + 1 / 2 ϕ 1 n + 1 / 2 + f 1 , 0 n + 1 / 2 ,
C v , i n + 1 / 2 + τ q ( ) δ t v , i n + 1 / 2 = k δ x 2 u , i n + 1 / 2 + τ T ( ) v , i n + 1 / 2 + f , i n + 1 / 2 , i = 1 , , M 1 , = 1 , 2 , 3 , Δ x C Δ x + Δ x + 1 v , M n + 1 / 2 + τ q ( ) δ t v , M n + 1 / 2 + Δ x + 1 C + 1 Δ x + Δ x + 1 v + 1 , 0 n + 1 / 2 + τ q ( + 1 ) δ t v + 1 , 0 n + 1 / 2 = 2 Δ x + Δ x + 1 { k + 1 δ x u + 1 , 1 / 2 n + 1 / 2 + τ T ( + 1 ) v + 1 , 1 / 2 n + 1 / 2 k δ x ( u , M 1 / 2 n + 1 / 2
+ τ T ( ) v , M 1 / 2 n + 1 / 2 ) } + Δ x Δ x + Δ x + 1 f , M n + 1 / 2 + Δ x + 1 Δ x + Δ x + 1 f + 1 , 0 n + 1 / 2 , = 1 , 2 , C 3 v 3 , M 3 n + 1 / 2 + τ q ( 3 ) δ t v 3 , M 3 n + 1 / 2 = 2 k 3 Δ x 3 1 α 2 K n ( 2 ) ϕ 2 n + 1 / 2 u 3 , M 3 n + 1 / 2 + τ T ( 3 ) v 3 , M 3 n + 1 / 2 δ x u 3 , M 3 n + 1 / 2 + τ T ( 3 ) v 3 , M 3 n + 1 / 2
+ f 3 , M 3 n + 1 / 2 ,
v , i n + 1 / 2 = δ t u , i n + 1 / 2 , i = 0 , , M , = 1 , 2 , 3 ,
with the initial condition
u , i 0 = ψ 1 ( x , i ) , v , i 0 = ψ 2 ( x , i ) , i = 0 .

5. Discrete Scheme for Numerical Solution of (6)–(11)

In this section, we derive a finite difference scheme to solve the initial-interface boundary problem (6)–(11), using the discrete scheme (51)–(56), and especially, the discrete version of the change of variable given in Equation (55). More precisely, let us consider the following finite difference scheme to obtain the numerical solution of (6)–(11)
C 1 δ t u 1 , 0 1 / 2 + 2 τ q ( 1 ) Δ t δ t u 1 , 0 1 / 2 ψ 2 ( x 1 , 0 ) = 2 k 1 Δ x 1 × δ x u 1 , 1 / 2 1 / 2 + τ T ( 1 ) δ t u 1 , 1 / 2 1 / 2 1 α 1 K n ( 1 ) u 1 , 0 1 / 2 + τ T ( 1 ) δ t u 1 , 0 1 / 2 ϕ 1 1 / 2 + f 1 , 0 1 / 2 , C δ t u , i 1 / 2 + τ q ( ) 2 τ q ( 1 ) Δ t δ t u , i 1 / 2 ψ 2 ( x , i ) = k δ x 2 u , i 1 / 2 + τ T ( ) δ t u , i 1 / 2 + f , i 1 / 2 ,
i = 1 , , M 1 , = 1 , 2 , 3 , Δ x C Δ x + Δ x + 1 δ t u , M 1 / 2 + 2 τ q ( ) Δ t δ t u , M 1 / 2 ψ 2 ( x , M ) + Δ x + 1 C + 1 Δ x + Δ x + 1 ( δ t u + 1 , 0 1 / 2 + 2 τ q ( + 1 ) Δ t δ t u + 1 , 0 1 / 2 ψ 2 ( x + 1 , 0 ) ) = 2 Δ x + Δ x + 1 { k + 1 δ x ( u + 1 , 1 / 2 1 / 2 + τ T ( + 1 ) × δ t u + 1 , 1 / 2 1 / 2 ) k δ x u , M 1 / 2 1 / 2 + τ T ( ) δ t u , M 1 / 2 1 / 2 } + Δ x Δ x + Δ x + 1 f , M 1 / 2
+ Δ x + 1 Δ x + Δ x + 1 f + 1 , 0 1 / 2 , for = 1 , 2 , C 3 δ t u 3 , M 3 1 / 2 + 2 τ q ( 3 ) Δ t δ t u 3 , M 3 1 / 2 ψ 2 ( x 3 , M 3 ) = 2 k 3 Δ x 3
× 1 α 2 K n ( 2 ) ϕ 2 1 / 2 u 3 , M 3 1 / 2 + τ T ( 3 ) δ t u 3 , M 3 1 / 2 δ x u 3 , M 3 1 / 2 + τ T ( 3 ) δ t u 3 , M 3 1 / 2 + f 3 , M 3 1 / 2 , C 1 Δ t u 1 , 0 n + τ q ( 1 ) δ t 2 u 1 , 0 n = 2 k 1 Δ x 1
× δ x u 1 , 1 / 2 n ¯ + τ T ( 1 ) Δ t u 1 , 1 / 2 n 1 α 1 K n ( 1 ) u 1 , 0 n ¯ + τ T ( 1 ) Δ t u 1 , 0 n ϕ 1 n ¯ + f 1 , 0 n ¯ , C Δ t u , i n + τ q ( ) δ t 2 u , i n = k δ x 2 u , i n ¯ + τ T ( ) Δ t u , i n + f , i n ,
i = 1 , , M 1 , = 1 , 2 , 3 , Δ x C Δ x + Δ x + 1 Δ t u , M n + τ q ( ) δ t 2 u , M n + Δ x + 1 C + 1 Δ x + Δ x + 1 Δ t u + 1 , 0 n + τ q ( + 1 ) δ t 2 u + 1 , 0 n = 2 Δ x + Δ x + 1 { k + 1 δ x u + 1 , 1 / 2 n ¯ + τ T ( + 1 ) Δ t u + 1 , 1 / 2 n k δ x ( u , M 1 / 2 n ¯
+ τ T ( ) Δ t u , M 1 / 2 n ) } + Δ x Δ x + Δ x + 1 f , M n ¯ + Δ x + 1 Δ x + Δ x + 1 f + 1 , 0 n ¯ , = 1 , 2 , C 3 Δ t u 3 , M 3 n + τ q ( 3 ) δ t 2 u 3 , M 3 n = 2 k 3 Δ x 3
× 1 α 2 K n ( 2 ) ϕ 2 n ¯ u 3 , M 3 n ¯ + τ T ( 3 ) Δ t u 3 , M 3 n δ x u 3 , M 3 n ¯ + τ T ( 3 ) Δ t u 3 , M 3 n + f 3 , M 3 n ¯ ,
v , i n + 1 = 2 δ t u , i n v , i n , i = 0 , , M = 1 , 2 , 3 ,
for n = 1 , , N , with the initial condition
u , i 0 = ψ 1 ( x , i ) , v , i 0 = ψ 2 ( x , i ) , i = 0 , , M , = 1 , 2 , 3 .
Theorem 2.
The finite difference schemes (51)–(56) and (57)–(66) are equivalent.
Proof. 
From (55) with n = 0 , Lemma 1, and the initial condition (56), we observe that
v , i 1 / 2 = δ t u , i 1 / 2 , i = 0 , , M , = 1 , 2 , 3 ,
δ t v , i 1 / 2 = 2 Δ t v , i 1 / 2 v , i 0 = 2 Δ t δ t u , i 1 / 2 ψ 2 ( x , i ) , i = 0 , , M , = 1 , 2 , 3 .
Letting n = 0 in (51)–(54) and using the relations (67)–(68) we deduce Equations (57)–(60).
On the other hand, we observe the identities
1 2 v , i n + 1 / 2 + v , i n 1 / 2 = Δ t u , i n and 1 2 δ v , i n + 1 / 2 + δ v , i n 1 / 2 = δ t 2 u , i n .
We follow the equations on (61)–(66), by adding the equations (51)–(55) with superscripts n 1 / 2 and n + 1 / 2 and using (69) . □

6. Numerical Analysis: Discrete Energy, Stability, Convergence, and Order Estimates

Theorem 3.
Let us consider that
( u , i n , v , i n ) : i = 1 , , M , = 1 , 2 , 3 , n = 1 , , N ,
is the solution of the fully finite difference scheme (51)–(56) with boundary conditions ϕ 1 n + 1 / 2 = ϕ 2 n + 1 / 2 = 0 for n = 0 , , N 1 . Moreover, assuming that E n is defined by
E n : = = 1 3 C v n 2 + = 1 3 k δ x u n 2 + k 1 α 1 K n ( 1 ) ( u 1 , 0 n ) 2 + k 2 α 2 K n ( 2 ) ( u 3 , M 3 n ) 2 .
Then, the following discrete energy estimate
E n + 1 E 0 + Δ t 2 k = 0 n = 1 3 1 C f k + 1 2 2 ,
for n = 0 , , N 1 , is satisfied.
Proof. 
Let us multiply (51) by 2 1 Δ x 1 v 1 , 0 n + 1 / 2 ; (52) by Δ x v , i n + 1 / 2 , (53) by 2 1 ( Δ x + Δ x + 1 ) v , i n + 1 / 2 , for = 1 , 2 ; (54) by 2 1 Δ x 3 v 3 , M 3 n + 1 / 2 ; summing up the results; and rearranging some terms, we obtain
= 1 3 C Δ x 1 2 ( v , 0 n + 1 / 2 ) 2 + i = 1 M 1 ( v , i n + 1 / 2 ) 2 + 1 2 ( v , M n + 1 / 2 ) 2 + = 1 3 C Δ x τ q ( ) [ 1 2 δ t v , 0 n + 1 / 2 v , 0 n + 1 / 2 + i = 1 M 1 δ t v , i n + 1 / 2 v , i n + 1 / 2 + 1 2 δ t v , M n + 1 / 2 v , M n + 1 / 2 ] = = 1 3 k [ δ x u 1 , 1 / 2 n + 1 / 2 + τ T ( 1 ) v 1 , 1 / 2 n + 1 / 2 v , 0 n + 1 / 2 + i = 1 M 1 Δ x δ x 2 u , i n + 1 / 2 + τ T ( ) v , i n + 1 / 2 v , i n + 1 / 2 + δ x u , M n + 1 / 2 + τ T ( ) v , M n + 1 / 2 v , M n + 1 / 2 ] + = 1 3 Δ x 1 2 f , 0 n + 1 / 2 v , 0 n + 1 / 2 + i = 1 M 1 f , i n + 1 / 2 v , i n + 1 / 2 + 1 2 f , M 3 n + 1 / 2 v , M 3 n + 1 / 2 k 1 α 1 K n ( 1 ) u 1 , 0 n + 1 / 2 + τ T ( 1 ) v 1 , 0 n + 1 / 2 v 1 , 0 n + 1 / 2 k 3 α 2 K n ( 2 ) u 3 , M 3 n + 1 / 2 + τ T ( 3 ) v 3 , M 3 n + 1 / 2 v 3 , M 3 n + 1 / 2 .
From the following identities
δ t v , i n + 1 / 2 v , i n + 1 / 2 = 1 2 Δ t ( v , i n + 1 ) 2 ( v , i n ) 2 , i = 1 , , M , = 1 , 2 , 3 , i = 1 M 1 Δ x δ x 2 u , i n + 1 / 2 + τ T ( ) v , i n + 1 / 2 v , i n + 1 / 2 = i = 1 M 1 δ x u , i n + 1 / 2 + τ T ( ) v , i n + 1 / 2 δ x v , i + 1 / 2 n + 1 / 2 δ x u , 1 / 2 n + 1 / 2 + τ T ( ) v , 1 / 2 n + 1 / 2 v , 1 n + 1 / 2 + δ x u , M 1 / 2 n + 1 / 2 + τ T ( ) v , M 1 / 2 n + 1 / 2 v , M n + 1 / 2 , = 1 , 2 , 3 ; δ x v , i + 1 / 2 n + 1 / 2 = δ t δ x v , i + 1 / 2 n + 1 / 2 , = 1 , 2 , 3 , i = 0 , , M 1 ;
the relation (55); and the norm notation, we have that the relation (72) can be rewritten as follows
= 1 3 C v n + 1 / 2 2 + = 1 3 C τ q ( ) 2 Δ t v n + 1 2 v n 2 + k 1 τ T ( 1 ) α 1 K n ( 1 ) v 1 , 0 n + 1 / 2 2 + k 3 τ T ( 3 ) α 2 K n ( 2 ) v 3 , M 3 n + 1 / 2 2 = = 1 3 k Δ x i = 1 M 1 δ x u , i n + 1 / 2 δ t δ x v , i + 1 / 2 n + 1 / 2 = 1 3 k τ T ( ) δ x v n + 1 / 2 2 + = 1 3 ( f n + 1 / 2 , v n + 1 / 2 ) k 1 τ T ( 1 ) α 1 K n ( 1 ) u 1 , 0 n + 1 / 2 δ t u 1 , 0 n + 1 / 2 k 3 τ T ( 3 ) α 2 K n ( 2 ) u 3 , M 3 n + 1 / 2 δ t u 3 , M 3 n + 1 / 2 = 1 2 Δ t = 1 3 k δ x u n + 1 2 δ x u n 2 = 1 3 k τ T ( ) δ x v n + 1 / 2 2 k 1 τ T ( 1 ) 2 Δ t α 1 K n ( 1 ) ( u 1 , 0 n + 1 ) 2 ( u 1 , 0 n ) 2 k 3 τ T ( 3 ) 2 Δ t α 2 K n ( 2 ) ( u 3 , M 3 n + 1 ) 2 ( u 3 , M 3 n ) 2 + = 1 3 ( f n + 1 / 2 , v n + 1 / 2 ) .
The definition of E n given on (70) and the application of Cauchy–Schwartz inequality imply the estimate
1 2 Δ t ( E n + 1 E n ) + = 1 3 C v n + 1 / 2 2 + = 1 3 k τ T ( ) δ x v n + 1 / 2 2 + k 1 τ T ( 1 ) α 1 K n ( 1 ) v 1 , 0 n + 1 / 2 2 + k 3 τ T ( 3 ) α 2 K n ( 2 ) v 3 , M 3 n + 1 / 2 2 = = 1 3 ( f n + 1 / 2 , v n + 1 / 2 ) = 1 3 1 4 C f n + 1 / 2 2 + = 1 3 C v n + 1 / 2 2 ,
for n = 0 , , N 1 , which implies (71) and conclude the proof. □
Theorem 4.
The finite difference scheme (51)–(56) is unconditionally stable with respect to the initial values and the source term.
Proof. 
The proof is consequence of Theorem 3. □
Theorem 5.
Let us consider that ( u , i n , v , i n ) and ( U , i n , V , i n ) for i = 1 , , M , = 1 , 2 , 3 , and n = 1 , , N are the solution of the fully finite difference scheme (51)–(56) and the analytic solution of (12)–(18) on U Δ x , Δ t , respectively. If 3 Δ t 2 , the following estimate
= 1 3 U n u n + = 1 3 V n v n C Δ t 2 + = 1 3 ( Δ x ) 2
is satisfied for a positive constant C.
Proof. 
Using the finite difference notation, we notice that U , i n and V , i n satisfy the following relations
C 1 V 1 , 0 n + 1 / 2 + τ q ( 1 ) δ t V 1 , 0 n + 1 / 2 = 2 k 1 Δ x 1 δ x U 1 , 1 / 2 n + 1 / 2 + τ T ( 1 ) V 1 , 1 / 2 n + 1 / 2 1 α 1 K n ( 1 ) U 1 , 0 n + 1 / 2 + τ T ( 1 ) V 1 , 0 n + 1 / 2 ϕ 1 n + 1 / 2 + f 1 , 0 n + 1 / 2 + R 1 , 0 n + 1 / 2 ,
C V , i n + 1 / 2 + τ q ( ) δ t V , i n + 1 / 2 = k δ x 2 U , i n + 1 / 2 + τ T ( ) V , i n + 1 / 2 + f , i n + 1 / 2 + R , i n + 1 / 2 , i = 1 , , M 1 , = 1 , 2 , 3 ,
Δ x C Δ x + Δ x + 1 V , M n + 1 / 2 + τ q ( ) δ t V , M n + 1 / 2 + Δ x + 1 C + 1 Δ x + Δ x + 1 V + 1 , 0 n + 1 / 2 + τ q ( + 1 ) δ t V + 1 , 0 n + 1 / 2 = 2 Δ x + Δ x + 1 { k + 1 δ x U + 1 , 1 / 2 n + 1 / 2 + τ T ( + 1 ) V + 1 , 1 / 2 n + 1 / 2 k δ x U , M 1 / 2 n + 1 / 2 + τ T ( ) V , M 1 / 2 n + 1 / 2 } + Δ x Δ x + Δ x + 1 f , M n + 1 / 2 + Δ x + 1 Δ x + Δ x + 1 f + 1 , 0 n + 1 / 2 + R , M n + 1 / 2 + R + 1 , 0 n + 1 / 2 , = 1 , 2 ,
C 3 V 3 , M 3 n + 1 / 2 + τ q ( 3 ) δ t V 3 , M 3 n + 1 / 2 = 2 k 3 Δ x 3 { 1 α 2 K n ( 2 ) ϕ 2 n + 1 / 2 U 3 , M 3 n + 1 / 2 + τ T ( 3 ) V 3 , M 3 n + 1 / 2 δ x U 3 , M 3 1 / 2 n + 1 / 2 + τ T ( 3 ) V 3 , M 3 1 / 2 n + 1 / 2 } + f 3 , M 3 n + 1 / 2 + R 3 , M 3 n + 1 / 2 ,
V , i n + 1 / 2 = δ t U , i n + 1 / 2 + r , i n + 1 / 2 , i = 0 , , M , = 1 , 2 , 3 ,
with the initial condition U , i 0 = ψ 1 ( x , i ) , and V , i 0 = ψ 2 ( x , i ) , for i = 0 , , M and = 1 , 2 , 3 ; there exists a positive constant C such that
| R 1 , 0 n + 1 / 2 | C ( Δ t 2 + Δ x 1 ) , n = 0 , , N 1 ,
| R , i n + 1 / 2 | C ( Δ t 2 + Δ x 2 ) , n = 0 , , N 1 , = 1 , 2 , 3 ,
| R , M n + 1 / 2 | C ( Δ t 2 + Δ x ) , n = 0 , , N 1 , = 1 , 2 , 3 ,
| R 3 , M 3 n + 1 / 2 | C ( Δ t 2 + Δ x 3 ) , n = 0 , , N 1 ,
| r , i n + 1 / 2 | C Δ t 2 , i = 0 , , M , = 1 , 2 , 3 , n = 0 , , N 1 ,
| δ x r , i + 1 / 2 n + 1 / 2 | C Δ t 2 , i = 0 , , M 1 , = 1 , 2 , 3 , n = 0 , , N 1 .
The estimates (83) and (84) are deduced by application of Lemma 2, i.e., are consequence of the following relation
r , i n + 1 / 2 = Δ t 2 8 0 1 3 u t 3 x i , t n + 1 / 2 Δ t 2 s + 3 u t 3 x i , t n + 1 / 2 + Δ t 2 s ( 1 s 2 ) d s .
Let us consider the notation U , i n = U , i n u , i n and V , i n = V , i n v , i n . From (51)–(56) and (74)–(78), we have that ( U , i n , V , i n ) satisfy the following scheme
C 1 V 1 , 0 n + 1 / 2 + τ q ( 1 ) δ t V 1 , 0 n + 1 / 2 = 2 k 1 Δ x 1 δ x U 1 , 1 / 2 n + 1 / 2 + τ T ( 1 ) V 1 , 1 / 2 n + 1 / 2 1 α 1 K n ( 1 ) U 1 , 0 n + 1 / 2 + τ T ( 1 ) V 1 , 0 n + 1 / 2 + R 1 , 0 n + 1 / 2 ,
C V , i n + 1 / 2 + τ q ( ) δ t V , i n + 1 / 2 = k δ x 2 U , i n + 1 / 2 + τ T ( ) V , i n + 1 / 2 + R , i n + 1 / 2 , i = 1 , , M 1 , = 1 , 2 , 3 , Δ x C Δ x + Δ x + 1 V , M n + 1 / 2 + τ q ( ) δ t V , M n + 1 / 2 + Δ x + 1 C + 1 Δ x + Δ x + 1 V + 1 , 0 n + 1 / 2 + τ q ( + 1 ) δ t V + 1 , 0 n + 1 / 2
= 2 Δ x + Δ x + 1 { k + 1 δ x U + 1 , 1 / 2 n + 1 / 2 + τ T ( + 1 ) V + 1 , 1 / 2 n + 1 / 2 k δ x U , M 1 / 2 n + 1 / 2 + τ T ( ) V , M 1 / 2 n + 1 / 2 } + R , M n + 1 / 2 + R + 1 , 0 n + 1 / 2 , = 1 , 2 , C 3 V 3 , M 3 n + 1 / 2 + τ q ( 3 ) δ t V 3 , M 3 n + 1 / 2
= 2 k 3 Δ x 3 1 α 2 K n ( 2 ) U 3 , M 3 n + 1 / 2 + τ T ( 3 ) V 3 , M 3 n + 1 / 2 δ x U 3 , M 3 1 / 2 n + 1 / 2 + τ T ( 3 ) V 3 , M 3 1 / 2 n + 1 / 2 + R 3 , M 3 n + 1 / 2 .
V , i n + 1 / 2 = δ t U , i n + 1 / 2 + r , i n + 1 / 2 , i = 0 , , M , = 1 , 2 , 3 ,
U , i 0 = V , i 0 = 0 , i = 0 , , M , = 1 , 2 , 3 .
The rest of the proof is similar to the methodology used in Theorem 3.
Multiplying Equations (85)–(88) by 2 1 Δ x 1 V 1 , 0 n + 1 / 2 ,   Δ x V , i n + 1 / 2 , 2 1 ( Δ x + Δ x + 1 ) V , M n + 1 / 2 for = 1 , 2 , and 2 1 Δ x 3 V 3 , M 3 n + 1 / 2 , respectively; summing up the results and using the following relation
i = 1 M 1 Δ x δ x 2 U , i n + 1 / 2 + τ T ( ) V , i n + 1 / 2 V , i n + 1 / 2 = i = 1 M 1 δ x U , i n + 1 / 2 + τ T ( ) V , i n + 1 / 2 δ x V , i + 1 / 2 n + 1 / 2 δ x U , 1 / 2 n + 1 / 2 + τ T ( ) V , 1 / 2 n + 1 / 2 V , 1 n + 1 / 2 + δ x U , M 1 / 2 n + 1 / 2 + τ T ( ) V , M 1 / 2 n + 1 / 2 V , M n + 1 / 2 , = 1 , 2 , 3 ,
we obtain
= 1 3 C Δ x 1 2 ( V , 0 n + 1 / 2 ) 2 + i = 1 M 1 ( V , i n + 1 / 2 ) 2 + 1 2 ( V , M n + 1 / 2 ) 2 + = 1 3 C Δ x τ q ( ) 1 2 δ t V , 0 n + 1 / 2 V , 0 n + 1 / 2 + i = 1 M 1 δ t V , i n + 1 / 2 V , i n + 1 / 2 + 1 2 δ t V , M n + 1 / 2 V , M n + 1 / 2 = = 1 3 k Δ x i = 1 M 1 δ x U , i + 1 / 2 n + 1 / 2 + τ T ( ) V , i + 1 / 2 n + 1 / 2 δ x V , i + 1 / 2 n + 1 / 2 k 1 α 1 K n ( 1 ) U 1 , 0 n + 1 / 2 + τ T ( 1 ) V 1 , 0 n + 1 / 2 V 1 , 0 n + 1 / 2 k 3 α 2 K n ( 2 ) U 3 , M 3 n + 1 / 2 + τ T ( 3 ) V 3 , M 3 n + 1 / 2 V 3 , M 3 n + 1 / 2 + = 0 3 Δ x 1 2 R , 0 n + 1 / 2 V , 0 n + 1 / 2 + i = 1 M 1 R , i n + 1 / 2 V , i n + 1 / 2 + 1 2 R , M n + 1 / 2 V , M n + 1 / 2 .
We observe that the following identities
δ t V , i n + 1 / 2 V , i n + 1 / 2 = 1 2 Δ t ( V , i n + 1 ) 2 ( V , i n ) 2 , i = 1 , , M , = 1 , 2 , 3 , δ x V , i + 1 / 2 n + 1 / 2 = δ t δ x U , i + 1 / 2 n + 1 / 2 + δ x r , i + 1 / 2 n + 1 / 2 , = 1 , 2 , 3 , i = 0 , , M 1 ; ( from   ( 89 ) ) ,
are satisfied. Then, (91) is equivalent to
= 1 3 C V n + 1 / 2 2 + = 1 3 C τ q ( ) 2 Δ t V n + 1 2 V n 2 + k 1 τ T ( 1 ) α 1 K n ( 1 ) V 1 , 0 n + 1 / 2 2 + k 3 τ T ( 3 ) α 2 K n ( 2 ) V 3 , M 3 n + 1 / 2 2 = = 1 3 k Δ x i = 1 M 1 δ x U , i n + 1 / 2 δ t δ x V , i + 1 / 2 n + 1 / 2 = 1 3 k τ T ( ) δ x V n + 1 / 2 2 k 1 τ T ( 1 ) α 1 K n ( 1 ) U 1 , 0 n + 1 / 2 V 1 , 0 n + 1 / 2 k 3 τ T ( 3 ) α 2 K n ( 2 ) U 3 , M 3 n + 1 / 2 V 3 , M 3 n + 1 / 2 + = 1 3 ( R n + 1 / 2 , V n + 1 / 2 ) = 1 2 Δ t = 1 3 k δ x U n + 1 2 δ x U n 2 = 1 3 k τ T ( ) δ x V n + 1 / 2 2 k 1 τ T ( 1 ) 2 Δ t α 1 K n ( 1 ) ( U 1 , 0 n + 1 ) 2 ( U 1 , 0 n ) 2 k 3 τ T ( 3 ) 2 Δ t α 2 K n ( 2 ) ( U 3 , M 3 n + 1 ) 2 ( U 3 , M 3 n ) 2 + = 1 3 ( R n + 1 / 2 , V n + 1 / 2 ) + = 1 3 k Δ x i = 1 M 1 δ x U , i + 1 / 2 n + 1 / 2 δ x r , i + 1 / 2 n + 1 / 2 k 1 α 1 K n ( 1 ) U 1 , 0 n + 1 / 2 r 1 , 0 n + / 2 k 3 α 2 K n ( 2 ) U 3 , M 3 n + 1 / 2 r 3 , M 3 n + 1 / 2 .
In order to introduce the estimates, we consider the notation H n defined as follows
H n = = 1 3 C τ q ( ) 2 Δ t V n 2 + = 1 3 k δ x U n 2 + k 1 τ T ( 1 ) 2 Δ t α 1 K n ( 1 ) ( U 1 , 0 n ) 2 + k 3 τ T ( 3 ) 2 Δ t α 2 K n ( 2 ) ( U 3 , M 3 n ) 2 .
From (92), we have that
L H S n R H S n , for   n = 0 , , N 1 ,
where
L H S n = 1 2 Δ t ( H n + 1 H n ) + = 1 3 C V n + 1 / 2 2 + = 1 3 k τ T ( ) δ x V n + 1 / 2 2 + k 1 τ T ( 1 ) α 1 K n ( 1 ) V 1 , 0 n + 1 / 2 2 + k 3 τ T ( 3 ) α 2 K n ( 2 ) V 3 , M 3 n + 1 / 2 2 R H S n = = 1 3 i = 1 M 1 k δ x U , i + 1 / 2 n + 1 / 2 δ x r , i + 1 / 2 n + 1 / 2 k 1 τ T ( 1 ) α 1 K n ( 1 ) U 1 , 0 n + 1 / 2 r 1 , 0 n + 1 / 2 k 3 τ T ( 3 ) α 2 K n ( 2 ) U 3 , M 3 n + 1 / 2 r 3 , M 3 n + 1 / 2 + = 1 3 ( R n + 1 / 2 , V n + 1 / 2 ) ,
By application of Lemma 3, we deduce that
k 1 τ T ( 1 ) δ x V 1 n + 1 / 2 2 + k 1 τ T ( 1 ) α 1 K n ( 1 ) V 1 , 0 n + 1 / 2 2 + k 1 τ T ( 3 ) δ x V 3 n + 1 / 2 2 + k 3 τ T ( 3 ) α 2 K n ( 2 ) V 3 , M 3 n + 1 / 2 2 k 1 τ T ( 1 ) α 1 K n ( 1 ) + L 1 1 + L 1 α 1 K n ( 1 ) V 1 , 0 n + 1 / 2 2 + 1 + α 1 K n ( 1 ) L 1 δ x V 1 n + 1 / 2 2 + k 2 τ T ( 2 ) α 2 K n ( 2 ) + L 3 L 2 1 + L 3 L 2 α 1 K n ( 2 ) V 3 , M 3 n + 1 / 2 2 + 1 + α 2 K n ( 2 ) L 3 L 2 δ x V 3 n + 1 / 2 2 k 1 τ T ( 1 ) α 1 K n ( 1 ) + L 1 V 1 n + 1 / 2 2 + k 2 τ T ( 2 ) ( L 3 L 2 ) α 2 K n ( 2 ) + L 3 L 2 V 3 n + 1 / 2 2 ,
which implies the following lower estimate for L H S n
L H S n 1 2 Δ t ( H n + 1 H n ) + = 1 3 C V n + 1 / 2 2 + k 2 τ T ( 1 ) δ x V 2 n + 1 / 2 2 + k 1 τ T ( 1 ) α 1 K n ( 1 ) + L 1 V 1 n + 1 / 2 2 + k 2 τ T ( 2 ) α 2 K n ( 2 ) + ( L 3 L 2 ) V 3 n + 1 / 2 2 .
By Cauchy–Schwartz inequality, we follow that
= 1 3 k Δ x i = 1 M 1 δ x U , i + 1 / 2 n + 1 / 2 δ x r , i + 1 / 2 n + 1 / 2 1 4 = 1 3 k δ x U n + 1 2 + δ x U n 2 + 1 2 = 1 3 k Δ x i = 1 M 1 δ x r , i + 1 / 2 n + 1 / 2 2 , k 1 α 1 K n ( 1 ) U 1 , 0 n + 1 / 2 r 1 , 0 n + 1 / 2 k 3 α 2 K n ( 2 ) U 3 , M 3 n + 1 / 2 r 3 , M 3 n + 1 / 2 k 1 4 α 1 K n ( 1 ) ( U 1 , 0 n + 1 ) 2 + ( U 1 , 0 n ) 2 + k 2 4 α 2 K n ( 2 ) ( U 3 , M 3 n + 1 ) 2 + ( U 3 , M 3 n ) 2 + k 1 2 α 1 K n ( 1 ) r 1 , 0 n + 1 / 2 2 + k 2 2 α 2 K n ( 2 ) r 3 , M 3 n + 1 / 2 2 , = 1 3 ( R n + 1 / 2 , V n + 1 / 2 ) = 1 2 = 0 3 Δ x R , 0 n + 1 / 2 V , 0 n + 1 / 2 + = 0 3 i = 1 M 1 R , i n + 1 / 2 V , i n + 1 / 2 + 1 2 = 0 3 R , M n + 1 / 2 V , M n + 1 / 2 k 1 τ T ( 1 ) 2 ( α 1 K n ( 1 ) + L 1 ) = 1 3 V n + 1 / 2 2 + α 1 K n ( 1 ) + L 1 2 k 1 τ T ( 1 ) = 0 3 Δ x 2 R 1 , 0 n + 1 / 2 2 + = 1 3 C V n + 1 / 2 2 + = 1 3 1 4 C Δ x i = 1 M 1 R , i n + 1 / 2 2 + k 1 τ T ( 1 ) 2 ( α 1 K n ( 1 ) + L 1 ) = 1 3 V n + 1 / 2 2 + α 1 K n ( 1 ) + L 1 2 k 1 τ T ( 1 ) = 1 3 Δ x 2 R , M n + 1 / 2 2 .
We can bound R H S n as follows
R H S n 1 4 = 1 3 k δ x U n + 1 2 + δ x U n 2 + k 1 4 α 1 K n ( 1 ) ( U 1 , 0 n + 1 ) 2 + ( U 1 , 0 n ) 2 + k 2 4 α 2 K n ( 2 ) ( U 3 , M 3 n + 1 ) 2 + ( U 3 , M 3 n ) 2 + k 1 τ T ( 1 ) 2 ( α 1 K n ( 1 ) + L 1 ) = 0 3 V n + 1 / 2 2 + = 1 3 C V 1 n + 1 / 2 2 + k 1 τ T ( 1 ) 2 ( α 1 K n ( 1 ) + L 1 ) = 1 3 V n + 1 / 2 2 + δ n + 1 / 2 ,
where
δ n + 1 / 2 = 1 2 = 1 3 k Δ x i = 1 M 1 δ x r , i + 1 / 2 n + 1 / 2 2 + k 1 2 α 1 K n ( 1 ) r 1 , 0 n + 1 / 2 2 + k 2 2 α 2 K n ( 2 ) r 3 , M 3 n + 1 / 2 2 + α 1 K n ( 1 ) + L 1 2 k 1 τ T ( 1 ) = 1 3 Δ x 2 R , 0 n + 1 / 2 2 + = 1 3 1 4 C Δ x i = 1 M 1 R , i n + 1 / 2 2 + α 1 K n ( 1 ) + L 1 2 k 1 τ T ( 1 ) = 1 3 Δ x 2 R , M n + 1 / 2 2 .
From (94)–(96) we obtain
1 2 Δ t ( H n + 1 H n ) 1 4 ( H n + 1 + H n ) + δ n + 1 / 2 , n = 0 , , N 1 .
Moreover, as consequence of (79)–(84) we deduce that there is a positive constant such that δ n + 1 / 2 C ( Δ t 2 + = 0 3 ( Δ x ) 2 ) . Then, replacing in (97), we deduce the estimate
1 2 Δ t ( H n + 1 H n ) 1 4 ( H n + 1 + H n ) + C ( Δ t 2 + = 0 3 ( Δ x ) 2 ) , n = 0 , , N 1
or equivalently
1 Δ t 2 H n + 1 1 + Δ t 2 H n + 2 C Δ t ( Δ t 2 + = 0 3 ( Δ x ) 2 ) , n = 0 , , N 1 .
If we consider the assumption 3 Δ t 2 , the last estimate implies that
H n + 1 1 + 3 2 Δ t H n + 3 C Δ t ( Δ t 2 + = 0 3 ( Δ x ) 2 ) , n = 0 , , N 1 .
Thus, by the Gronwall inequality and Lemma 3 we obtain the estimate (73) and conclude the proof of theorem. □
Remark 1.
We notice that the second-order approximation, given by the estimate (73), is obtained although a first-order truncation is considered as a discretization strategy at the boundaries.

7. A Numerical Example

Let us consider that the physical and geometry parameters are given by
L 0 = 0 , L 1 = 1 / 3 , L 2 = 2 / 3 , L 3 = 1 , C 1 = C 2 = C 3 = 1 , τ q ( 1 ) = τ q ( 2 ) = τ q ( 3 ) = 1 , τ T ( 1 ) = 1 , τ T ( 2 ) = 4 , τ T ( 3 ) = 2 , k 1 = 8 / 27 π 2 , k 2 = 16 / 9 π 2 , k 3 = 4 / 9 π 2 , and   α 1 = α 2 = 1 / 2 ;
the initial conditions are given by
u ( x , 0 ) = sin ( 3 π x / 4 ) , 0 x < L 1 , cos ( π ( x + 2 / 3 ) / 4 ) , L 1 x < L 2 , sin ( π ( x 1 / 2 ) ) , L 2 x L 3 , u t ( x , 0 ) = 1 3 u ( x , 0 ) ;
and the boundary conditions are φ 1 ( t ) = 3 π exp ( t / 3 ) / 8 and φ 2 ( t ) = π exp ( t / 3 ) / 2 . We observe that the analytic solution is given by
u ( x , t ) = exp ( t / 3 ) sin ( 3 π x / 4 ) , 0 x < L 1 , exp ( t / 3 ) cos ( π ( x + 2 / 3 ) / 4 ) , L 1 x < L 2 , exp ( t / 3 ) sin ( π ( x 1 / 2 ) ) , L 2 x L 3 .
We consider that the discretization parameters are Δ x 1 = Δ x 2 = Δ x . Let us consider U ^ = u ( x , t ) for ( x , t ) Q Δ x , Δ t (see Section 3.1), i.e., the evaluation of the analytical solution on the discretization domain; U the numerical solution; introduce the notation
E Δ x , Δ t = U ^ U , O r d e r x = log 2 E 2 Δ x , Δ t E Δ x , Δ t , O r d e r t = log 2 E Δ x , 2 Δ t E Δ x , Δ t ,
where · is the notation defined in (24)–(27). For the spatial convergence orders in the L -norm error, we consider several values of Δ x with fixed Δ t = 1 / 1000 and for the temporal convergence in the L -norm error, we consider several values of Δ t with fixed Δ x = 1 / 1000 , the results of the simulation are shown on Table 1. The numerical solution is given on Figure 2.

8. Conclusions

In this paper, we have proposed a theoretical one-dimensional mathematical model for heat conduction model in a double-pane window with a temperature-jump boundary condition and a thermal lagging interfacial effect condition between layers. We construct a second-order accurate finite difference scheme and prove that finite difference scheme introduced is unconditionally stable, convergent, and has rate of convergence two in space and time for the L -norm.

Author Contributions

Conceptualization, A.C.; methodology, A.C.; software, F.H.; verification, F.H., A.T. and E.L.; formal analysis, A.C. and A.T.; investigation, A.C., F.H. and E.L.; resources, F.H.; data curation, E.L.; writing—original draft preparation, E.L.; writing—review and editing, E.L.; visualization, A.C. and A.T.; supervision, A.C.; project administration, A.C.; funding acquisition, A.C. All authors have read and agreed to the published version of the manuscript.

Funding

A.C. and F.H. acknowledge the partial support of Universidad del Bío-Bío (Chile) through the projects: Postdoctoral Program as a part of the project “Instalación del Plan Plurianual UBB 2016-2020”, research project 2120436 IF/R, research project INES I+D 22–14; and Universidad Tecnológica Metropolitana through the project supported by the Competition for Research Regular Projects, year 2020, Code LPR20-06.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data used for supporting the findings are included within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Sahni, M.; Sahni, R. Applied Mathematical Modeling and Analysis in Renewable Energy, 1st ed.; CRC Press: Boca Raton, FL, USA, 2021. [Google Scholar]
  2. Rashid, M.H. (Ed.) Electric Renewable Energy Systems; Elsevier: London, UK, 2015. [Google Scholar]
  3. Arici, M.; Karabay, H.; Kan, M. Flow and heat transfer in double, triple and quadruple pane windows. Energy Build. 2015, 86, 394–402. [Google Scholar] [CrossRef]
  4. Korpela, S.A.; Lee, Y.; Drummond, J.E. Heat Transfer Through a Double Pane Window. ASME J. Heat Transfer. 1982, 104, 539–544. [Google Scholar] [CrossRef]
  5. Han, J.; Lu, L.; Yang, H. Numerical evaluation of the mixed convective heat transfer in a double-pane window integrated with see-through a-Si PV cells with low-e coatings. Appl. Energy 2010, 87, 3431–3437. [Google Scholar] [CrossRef]
  6. Basok, B.I.; Davydenko, B.V.; Isaev, S.A.; Goncharuk, S.M.; Kuzhel, L.N. Numerical Modeling of Heat Transfer Through a Triple-Pane Window. J. Eng. Phys. Thermophys. 2016, 89, 1277–1283. [Google Scholar] [CrossRef]
  7. Aydin, O. Conjugate heat transfer analysis of double pane windows. Build. Environ. 2006, 41, 109–116. [Google Scholar] [CrossRef]
  8. Medved, S.; Novak, P. Heat transfer through a double pane window with an insulation screen open at the top. Energy Build. 1998, 28, 257–268. [Google Scholar] [CrossRef]
  9. Chow, T.-T.; Li, C.; Lin, Z. Thermal characteristics of water-flow double-pane window. Int. J. Therm. Sci. 2011, 50, 140–148. [Google Scholar] [CrossRef]
  10. Karabay, H.; Arıcı, M. Multiple pane window applications in various climatic regions of Turkey. Energy Build. 2012, 45, 67–71. [Google Scholar] [CrossRef]
  11. Rubin, M. Calculating heat transfer through windows. Int. J. Energy Res. 1982, 6, 341–349. [Google Scholar] [CrossRef]
  12. Aydin, O. Determination of optimum air-layer thickness in double-pane windows. Energy Build. 2000, 32, 303–308. [Google Scholar] [CrossRef]
  13. Arici, M.; Karabay, H. Determination of optimum thickness of double-glazed windows for the climatic regions of Turkey. Energy Build. 2010, 42, 1773–1778. [Google Scholar] [CrossRef]
  14. Arici, M.; Kan, M. An investigation of flow and conjugate heat transfer in multiple pane windows with respect to gap width, emissivity and gas filling. Renew. Energy 2015, 75, 249–256. [Google Scholar] [CrossRef]
  15. Dorfman, A.; Renner, Z. Conjugate Problems in Convective Heat Transfer: Review. Math. Probl. Eng. 2009, 2009, 927350. [Google Scholar] [CrossRef]
  16. Zudin, Y.B. Theory of Periodic Conjugate Heat Transfer, 2nd ed.; Springer: Berlin, Germany, 2011. [Google Scholar]
  17. Kazemi-Kamyab, V.; van Zuijlen, A.H.; Bijl, H. A high order time-accurate loosely-coupled solution algorithm for unsteady conjugate heat transfer problems. Comput. Methods Appl. Mech. Eng. 2013, 264, 205–217. [Google Scholar] [CrossRef]
  18. Ooi, E.H.; van Popov, V. An efficient hybrid BEM–RBIE method for solving conjugate heat transfer problems. Comput. Math. Appl. 2014, 66, 2489–2503. [Google Scholar] [CrossRef]
  19. Costa, R.; Nóbrega, J.M.; Clain, S.; Machado, G.J. Very high-order accurate polygonal mesh finite volume scheme for conjugate heat transfer problems with curved interfaces and imperfect contacts. Comput. Methods Appl. Mech. Eng. 2019, 357, 112560. [Google Scholar] [CrossRef]
  20. Pan, X.; Lee, C.; Choi, J.-I. Efficient monolithic projection method for time-dependent conjugate heat transfer problems. J. Comput. Phys. 2018, 369, 191–208. [Google Scholar] [CrossRef]
  21. Guo, S.; Feng, Y.; Tao, W.-Q. Deviation analysis of loosely coupled quasi-static method for fluid-thermal interaction in hypersonic flows. Comput. Fluids 2017, 149, 194–204. [Google Scholar] [CrossRef]
  22. Errera, M.-P.; Duchaine, F. Comparative study of coupling coefficients in Dirichlet-Robin procedure for fluid-structure aerothermal simulations. J. Comput. Phys. 2016, 312, 218–234. [Google Scholar] [CrossRef]
  23. Kazemi-Kamyab, V.; van Zuijlen, A.H.; Bijl, H. Analysis and application of high order implicit Runge-Kutta schemes for unsteady conjugate heat transfer: A strongly-coupled approach. J. Comput. Phys. 2014, 272, 471–486. [Google Scholar] [CrossRef]
  24. Dai, W.; Han, F.; Sun, Z. Accurate numerical method for solving dual-phase-lagging equation with temperature jump boundary condition in nano heat conduction. Int. J. Heat Mass Transf. 2013, 64, 966–975. [Google Scholar] [CrossRef]
  25. Tzou, D.Y. A unified approach for heat conduction from macro-to micro-scale. ASME J. Heat Transf. 1995, 117, 8–16. [Google Scholar] [CrossRef]
  26. Tzou, D.Y. Macro to Microscale Heat Transfer. The Lagging Behaviour, 2nd ed.; Taylor & Francis: Washington, DC, USA, 2014. [Google Scholar]
  27. Sun, H.; Sun, Z.Z.; Dai, W. A second-order finite difference scheme for solving the dual-phase-lagging equation in a double-layered nano-scale thin film. Numer. Methods Partial. Differ. Equ. 2017, 33, 142–173. [Google Scholar] [CrossRef]
  28. Ghazanfarian, J.; Abbassi, A. Effect of boundary phonon scattering on Dual-Phase-Lag model to simulate micro- and nano-scale heat conduction. Int. J. Heat And Mass Transf. 2009, 52, 3706–3711. [Google Scholar] [CrossRef]
  29. Sun, Z.Z. Numerical Methods for Partial Differential Equations, 2nd ed.; Science Press: Beijing, China, 2012. [Google Scholar]
  30. Liao, H.L.; Sun, Z.Z. Maximum norm error estimates of efficient difference schemes for second-order wave equations. J. Comput. Appl. Math. 2011, 235, 2217–2233. [Google Scholar] [CrossRef] [Green Version]
Figure 1. A schematic form of a a double-pane window.
Figure 1. A schematic form of a a double-pane window.
Axioms 11 00422 g001
Figure 2. Numerical solution of the mathematical model (6)–(11) with the data of Section 7. (a) Full solution for for ( x , t ) [ 0 , 1 ] × [ 0 , 2 ] and (b) profile at T = 1 .
Figure 2. Numerical solution of the mathematical model (6)–(11) with the data of Section 7. (a) Full solution for for ( x , t ) [ 0 , 1 ] × [ 0 , 2 ] and (b) profile at T = 1 .
Axioms 11 00422 g002
Table 1. Convergence error. For space convergence, we fix Δ t = 1 / 1000 . For temporal convergence we fix Δ x = 1 / 1000 .
Table 1. Convergence error. For space convergence, we fix Δ t = 1 / 1000 . For temporal convergence we fix Δ x = 1 / 1000 .
Δ x E Δ x , Δ t Order x Δ t E Δ x , Δ t Order t
0.1000 2.415 × 10 4 - 0.1000 4.688 × 10 5 -
0.0500 4.087 × 10 5 1.992 0.0500 2.257 × 10 5 2.000
0.0250 2.537 × 10 5 1.997 0.0250 3.762 × 10 6 2.001
0.0125 4.828 × 10 6 1.998 0.0125 6.276 × 10 7 2.002
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Coronel, A.; Huancas, F.; Lozada, E.; Tello, A. A Numerical Method for a Heat Conduction Model in a Double-Pane Window. Axioms 2022, 11, 422. https://doi.org/10.3390/axioms11080422

AMA Style

Coronel A, Huancas F, Lozada E, Tello A. A Numerical Method for a Heat Conduction Model in a Double-Pane Window. Axioms. 2022; 11(8):422. https://doi.org/10.3390/axioms11080422

Chicago/Turabian Style

Coronel, Aníbal, Fernando Huancas, Esperanza Lozada, and Alex Tello. 2022. "A Numerical Method for a Heat Conduction Model in a Double-Pane Window" Axioms 11, no. 8: 422. https://doi.org/10.3390/axioms11080422

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