Next Article in Journal
The Code Underneath
Next Article in Special Issue
Rationality Levels in a Heterogeneous Dynamic Price Game
Previous Article in Journal
Parallel Primal-Dual Method with Linearization for Structured Convex Optimization
Previous Article in Special Issue
Mathematical Methods in Applied Sciences
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Solution of Mathematical Model of Heat Conduction in Multi-Layered Nanoscale Solids

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 Ciencias Matemáticas y Físicas, Facultad de Ingeniería, Universidad Católica de Temuco, Temuco 4813302, Chile
3
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
4
Departamento Académico de Matemáticas, Facultad de Ciencias Físicas y Matemáticas, Universidad Nacional Pedro Ruiz Gallo, Avenida Juan XXIII 391, Lambayeque 14013, Peru
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(2), 105; https://doi.org/10.3390/axioms14020105
Submission received: 15 December 2024 / Revised: 21 January 2025 / Accepted: 28 January 2025 / Published: 30 January 2025
(This article belongs to the Special Issue Mathematical Methods in the Applied Sciences, 2nd Edition)

Abstract

:
In this article, we are interested in studying and analyzing the heat conduction phenomenon in a multi-layered solid. We consider the physical assumptions that the dual-phase-lag model governs the heat flow on each solid layer. We introduce a one-dimensional mathematical model given by an initial interface-boundary value problem, where the unknown is the solid temperature. More precisely, the mathematical model is described by the following four features: the model equation is given by a dual-phase-lag equation at the inside each layer, an initial condition for temperature and the temporal derivative of the temperature, heat flux boundary conditions, and the interfacial condition for the temperature and heat flux conditions between the layers. We discretize the mathematical model by a finite difference scheme. The numerical approach has similar features to the continuous model: it is considered to be the accuracy of the dual-phase-lag model on the inside each layer, the initial conditions are discretized by the average of the temperature on each discrete interval, the inside of each layer approximation is extended to the interfaces by using the behavior of the continuous interface conditions, and the inside each layer approximation on the boundary layers is extended to state the numerical boundary conditions. We prove that the finite difference scheme is unconditionally stable and unconditionally convergent. In addition, we provide some numerical examples.
MSC:
65M06; 65M12; 35Q79

1. Introduction

In the last several decades, there has been an increasing interest in heat transfer problems between different substances: solids of various types or solids and fluids [1,2,3,4,5,6,7,8,9]. Researchers’ interests differ in constructing new mathematical models, the deduction of analytical solutions, giving some didactic examples, the development of numerical simulations, the theoretical study of the models, the development of new technologies, and the improvement of current applications. Mainly, concerning the numerical solutions and simulations, we have several numerical methods proposed in the literature: high-order implicit time integration schemes [3], high-order finite volume schemes [5], the hybrid boundary element method, and the radial basis integral equation [4], high-order implicit Runge–Kutta schemes [7], the projection method [6], and finite difference methods [9].
We know that, for situations where the temperature is near absolute zero, the heat propagates at a finite speed [10]. Consequently, improving the mathematical models of heat transfer that originated from applying the Fourier law is necessary. A consistent extension is the well-known dual-phase-lagging model, introduced by Tzou in [11] (see also [12]). It is based in the non-Fourier heat conduction law and the energy equation:
q ( x , t + τ q ) = k u x ( x , t + τ T ) , q x ( x , t ) = C u t ( x , t ) + S ( x , t ) .
Here, t is the time, x is the space position, u 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 S is the volumetric heat generation. We observe that, by a Taylor expansion, we get
q ( x , t ) + τ q q x ( x , t ) = k u x ( x , t ) + τ T 2 u t x ( x , t ) .
Then, differentiating with respect to x and replacing the energy equation, we obtain
C u t + τ q 2 u 2 t = k 2 u x 2 + τ T 3 u t 2 x S ( x , t ) τ q S t ( x , t ) ,
which is known as the heat conduction equation under the dual-phase-lagging effect or briefly as the dual-phase-lagging model.
The first equation in (1) states that the gradient of temperature and the heat flux is proportional at the same spatial position at distinct material times given by t + τ q and t + τ T , respectively. The delay times τ q and τ T come from assuming microstructural interactions and the relaxation time caused by phonon scattering or phonon–electron interactions and fast–transient effects of thermal inertia, respectively. According to [13] (see also [11,14]), the values τ q and τ T are only reported for a few materials: ( τ q , τ T ) = ( 0.4348 , 70.8333 ) for copper, ( τ q , τ T ) = ( 0.7438 , 89.286 ) for gold, ( τ q , τ T ) = ( 0.1670 , 19.097 ) for lead, and ( τ q , τ T ) = ( 0.136 , 7.86 ) for chromium, where the units are picoseconds. Moreover, we observe at least two facts related to the influence of the delay times in mathematical modeling. Firstly, if τ T = 0 , we have that the dual-phase-lagging model (2) is reduced to the Cattaneo model [15] and if ( τ q , τ T ) = ( 0 , 0 ) , the model (2) corresponds to the standard heat conduction model based on the Fourier law. Second, a natural question is the mathematical behavior of the temperature in the presence of both pase lags or the mathematical analysis for the influence of the parameters τ q and τ T on the solution of (2), which is a topic to be researched. Some advances are given in [16,17,18,19]. In the case of the result given in [17], the authors consider the model
u t + τ q 2 u 2 t + τ q 2 2 u 2 t = k 2 u x 2 + τ T 3 u t 2 x
with Dirichlet boundary conditions, and by analyzing the stability of the solutions or solutions which are bounded for all times, they obtain the following four types of behavior: the solution of (3) is always stable when τ q 2 = 0 , it is stable for τ T / τ q > 1 / 2 , it is unstable for τ T / τ q < 1 / 2 , and it is exponentially stable for τ T / τ q = 1 / 2 . The exponential stability is detailed in [16]. However, we notice that (3) is deduced by a second-order approximation in the Taylor expansion of q ( x , t + τ q ) and (3) is reduced to (2) when τ q 2 = 0 , C = 1 and S = 0 . Hence, by applying the result of [16], we deduce that the solution of (2) with Dirichlet boundary conditions is always stable for the particular case that τ q 2 = 0 , C = 1 and S = 0 . In the case of [18,19], the authors develop a numerical study of the effects of phase lag constants on the solution of dual-phase-lagging model solutions.
In this paper, we are interested in the problem of heat transfer in a multi-layered solid at very low temperatures. In order to make the mathematical model precise, let us consider a multi-layered solid of total length L, which is a compound of d-layers of lengths W ¯ 1 , W ¯ 2 , , W ¯ d (see Figure 1) and introduce the notation (see Figure 2)
L 0 = 0 , L = j = 1 W ¯ j   for   = 1 , d 1 ¯ , L d = L , L   are   the   interfaces   for   = 1 , d 1 ¯   the   boundaries   for   = 0 , d , I = ( L 1 , L ) , = 1 , d ¯ ,   denotes   the   - t h l a y e r , I l a y = = 1 d I , I i n t = = 1 d 1 { L } , I = I l a y I i n t , I = { L 0 , L d } , 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 suppose that the heat conduction on each layer is modeled on by a dual-phase-lagging equation, i.e.,
C u t + τ q ( ) 2 u t 2 = k 2 u x 2 + τ T ( ) 3 u t x 2 + f ( x , t ) , ( x , t ) Q , T ,
where C , τ q ( ) , k , τ T ( ) and f are the physical parameters and the heat source function on the -th layer, i.e., C is the heat capacitance; τ q ( ) and τ T ( ) stand for the heat flux and the temperature gradient phase lags, respectively; k is the conductivity; and f is the heat source function. By notational convenience, we consider C , k , τ q , τ T : I R the piecewise constant functions and f : Q T R , the continuous function of the form
C ( x ) = = 1 d C 1 I ( x ) , k ( x ) = = 1 d k 1 I ( x ) , τ q ( x ) = = 1 d τ q ( ) 1 I ( x ) , τ T ( x ) = = 1 d τ T ( ) 1 I ( x ) , f ( x , t ) = = 1 d f ( x , t ) 1 [ L 1 , L ) ( x ) ,
with I A the indicator function defined as I A ( x ) = 1 if x A and I A ( x ) = 0 otherwise. For each { 1 , , d } , the constant C is the heat capacitance; τ q ( ) and τ T ( ) stand for the heat flux and the temperature gradient phase lags, respectively; k is the conductivity; and f is the heat source function. Hence, the mathematical model is given by the initial interface-boundary value problem
C ( x ) u t + τ q ( x ) 2 u t 2 = k ( x ) 2 u x 2 + τ T ( x ) 3 u t x 2 + f , ( x , t ) Q T l a y ,
u ( x , 0 ) = ψ 1 ( x ) , u t ( x , 0 ) = ψ 2 ( x ) , x I I ,
α 1 K ¯ 1 u x + u ( L 0 , t ) = φ 1 ( t ) , t [ 0 , T ] ,
α 2 K ¯ 2 u x + u ( L d , t ) = φ 2 ( t ) , t [ 0 , T ] ,
u ( x , t ) = 0 , ( x , t ) I T i n t ,
k ( x ) u x + τ T ( x ) 2 u x t ( x , t ) = 0 , ( x , t ) I T i n t ,
where α 1 and α 2 are some coefficients; K ¯ 1 and K ¯ 2 are the Knudsen numbers; ψ 1 and ψ 2 are the initial conditions; φ 1 and φ 2 are two given functions modelling the boundary conditions; and the bracket · is defined by G ( x , t ) = G ( x 0 , t ) G ( x + 0 , t ) . Here, K n 2 C L c 2 = 3 k τ q with L c being a characteristic length and the boundary conditions (8) and (9) being models of the temperature-jump condition [14,20]. We recall that the Knudsen numbers are dimensionless quantities characterizing the boundary conditions of a flow defined as a ratio of the mean free path (the average distance traveled by each molecule between successive collisions) and the characteristic length of the flow (e.g., the diameter of a thruster) [21]. It is known that usually the Knudsen number cannot be measured by developing direct laboratory experiments and is defined by a non-linear regression. In that sense, the numerical values used in simulations are referred to as pseudo-Knudsen numbers. Moreover, following [14,20],we have that the relation of a Knudsen number K ^ and the heat conductivity k is given by K ^ 2 = 3 k τ q / C L c where L c is a characteristic length and the parameter α ^ associated with K ^ is proportionally constant such that u u w = α ^ K ^ ( u · n ) ,where u w is the wall-jumped temperature and n is the unit outward normal vector on the boundary.
We can reformulate the system (6)–(11) by introducing a change in variable. Let us consider the function v : Q T ¯ R such that v = u t , then the model (6)–(11), is rewritten as follows
C ( x ) v + τ q ( x ) v t = k ( x ) 2 u x 2 + τ T ( x ) 2 v x 2 + f , ( x , t ) Q T l a y ,
v ( x , t ) = t u ( x , t ) , ( x , t ) Q T ,
u ( x , 0 ) = ψ 1 ( x ) , v ( x , 0 ) = ψ 2 ( x ) , x I I ,
α 1 K ¯ 1 x u + τ T v ( L 0 , t ) + ( u + τ T v ) ( L 0 , t ) = ϕ 1 ( t ) , t [ 0 , T ] ,
α 2 K ¯ 2 x u + τ v ( L d , t ) + ( u + τ T v ) ( L d , t ) = ϕ 2 ( t ) , t [ 0 , T ] ,
u ( x , t ) = 0 , v ( x , t ) = 0 , ( x , t ) I T i n t ,
k ( x ) x u + τ T v ( x , t ) = 0 , ( x , t ) I T i n t ,
where ϕ 1 = φ 1 + τ T ( L 0 ) ( φ 1 ) t and ϕ 2 = φ 2 + τ T ( L d ) ( φ 2 ) t .
By applying the finite difference method, we approximate the system (6)–(11). We follow the numerical approximations given in [14,22], where the authors consider a change in variable, a semi-discrete finite difference scheme for the new variable, a fully finite difference scheme for the new variable, and then approximate the original variable. The numerical scheme is developed by approximating (12)–(18) by a semidiscrete scheme and a fully discrete scheme. The methodology for the discretization of (12)–(18) consists of four steps: we approximate Equation (12) on the interior of each layer, we discretize appropriately interfaces (17) and (18), we approximate the boundary conditions (16), and we discretize Equation (13). Then, we deduce the finite difference numerical scheme approximating models (6)–(11) by using a the discrete version of the change variable. Roughly speaking, the numerical scheme for (6)–(11) consists of the solution of two linear systems of algebraic equations. Consequently, it is easy to implement.
The main results of the paper are the following: (i) we introduce semi-discrete and fully finite difference schemes to approximate the solution of (12)–(18); (ii) we introduce a full discrete finite difference scheme to approximate the solution of (6)–(11) and prove that this scheme is equivalent to the fully finite difference schemes for approximating (12)–(18); (iii) in the case of ϕ 1 = ϕ 2 = 0 , we prove an energy estimate for u and v, satisfying the system (12)–(18) and also prove discrete energy estimate; (iv) we prove that the finite difference is unconditionally stable; (v) we prove an error estimate; and we introduce some numerical examples.
This paper is organized as follows. In Section 2, we introduce the finite difference schemes approximating (12)–(18) and (6)–(11). In Section 3, we introduce the analytical and numerical results. Finally, in Section 4 and Section 5, we present the numerical examples and the conclusiones of the work.

2. Finite Difference Approximation

2.1. Discretization of the Domain

Let us consider the notation in (4). We assume that each interval I is divided into m parts and that the temporal interval [ 0 , T ] is divided into N parts. More precisely, to discretize the space and time domains, we select m , N N , and consider that the -th layer I and the time interval [ 0 , T ] are divided into m and N parts of sizes Δ x = ( L L 1 ) / m and Δ t = T / N , respectively. To be precise in our analysis, we define the following notation and terminology:
M 0 = 0 , M = i = 1 m i   for   { 1 , , d } , Δ W = ( L L 1 ) / m , x j = L 1 + ( j M 1 ) Δ W   for   ( , j ) { 1 , , d } × { M 1 , , M } , Δ x j = Δ W   for   j { M 1 , , M } , I Δ x i n t = { x j : j = M 1 , , M d 1 } , I , Δ x = { x j : j = M 1 + 1 , , M 1 } , I Δ x l a y = = 1 d I , Δ x , I Δ x l a y = { x j : j = M 0 , M d } , I ¯ Δ x = I Δ x l a y I Δ x i n t I Δ x l a y , Δ t = T / N , t n = n Δ t   for   n = 0 , , N , T Δ t = { t n : n = 0 , , N } , Q Δ x , Δ t = I ¯ Δ x × T Δ t , I = { M 0 , , M d } , I i n t = { M 1 , M 2 , , M d 1 } , I = { M 0 , M d } , I l a y = I ( I i n t I 0 ) .
It is important to note that Q Δ x , Δ t = I ¯ Δ x × T Δ t is the discretization of the computational domain Q T .
We describe the typical finite difference grid, norms and difference operators notation. We begin by defining the grid function space by
U Δ x , Δ t = { U = ( u 0 , , u N ) R M d + 1 × R N + 1 : u n = ( u M 0 n , , u M d n ) , u j n = u ( x j , t n ) , ( j , n ) I × { 0 , , N } } .
Let W U Δ x , Δ t , then we introduce the finite difference operators and the finite difference notation
w n + 1 / 2 = 1 2 ( w n + w n + 1 ) , n { 0 , , N 1 } , δ t w n + 1 / 2 = 1 Δ t ( w n + 1 w n ) , n { 0 , , N 1 } , w n ¯ = 1 4 ( w n + 1 + 2 w n + w n 1 ) , n { 1 , , N 1 } , Δ t w n = 1 2 Δ t ( w n + 1 w n 1 ) , n { 1 , , N 1 } , δ x w j + 1 2 n = 1 Δ x j ( w j + 1 n w j n ) , ( j , n ) { M 0 , M d 1 } × { 0 , , N } , δ x 2 w j = 1 Δ x j δ x w j + 1 2 n δ x w j 1 2 n , ( j , n ) { M 0 + 1 , , M d 1 } × { 0 , , N } .
Moreover, for V , W U Δ x , Δ t , we define the following notation:
( w n , v n ) I = 1 2 Δ x M 1 w M 1 n v M 1 n + j = M 1 + 1 M 1 Δ x j w j n v j n + 1 2 Δ x M w M n v M n   for   { 1 , , d } ,
w n I 2 = ( w n , w n ) I   for   { 1 , , d } , w n 2 = = 1 d w n I 2 , W 2 = n = 0 N w n 2 ,
w n I , = max M 1 j M | w j n |   for   { 1 , , d } , w n = max 1 d w n I , , W = max 0 n N w n ,
δ x w n I 2 = j = M M + 1 1 Δ x j δ x w j + 1 2 n 2   for   { 1 , , d } , δ x w n 2 = = 0 d 1 δ x w n I 2 , δ x W 2 = n = 0 N δ 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 schemes, we use the notation
u j ( t ) = u ( x j , t ) , v j ( t ) = v ( x j , t ) , u j n = u ( x j , t n ) , v j n = v ( x j , t n ) ,
for j = M 0 , , M d , respectively.
The finite difference discretization and error estimates will be developed by applying the following three Lemmas:
Lemma 1 
([14,23]). 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 that
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 ) ( ξ i ) ,
ξ 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 
([23,24]). Consider that the function g is such that g C 4 ( [ a , b ] ) , then it holds that
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 
([14,23]). Consider that W U Δ x , Δ t , then for any ϵ > 0 , it holds that
u n I 2 ( 1 + ϵ ) u M n 2 + 1 + 1 ϵ ( L L 1 ) δ x u M n 2   for   { 1 , , d } .
In a broad sense, Lemma 1 is applied to approximate the spatial derivatives, where relations (25) and (27) are used to approximate the second-order spatial derivatives on the boundaries and interfaces of the multi-layered solid and (26) inside each layer; Lemma 2 is used to approximate the time derivatives; and Lemma 3 is useful in the error estimate result.

2.2. Semidiscrete Scheme Approximating the Rewritten System

We construct the semidiscrete finite difference scheme for systems (12)–(18) by considering four steps. In the three first steps, we approximate (12) at the inside of each layer, the interfaces, and the boundaries, respectively. Meanwhile, in the fourth step, we approximate (13).
Step 1.
Approximation of (12) on I l a y . Here, we construct the semidiscrete scheme at inner grid points, i.e., except on the interfaces and boundaries. The inner grid points at I are x j for j I l a y . We start the discretization by considering Equation (12) at the inner grid points ( x j , t ) , then we have that
C ( x j ) v ( x j , t ) + τ q ( x j ) t v ( x j , t ) = k ( x j ) 2 x 2 u ( x j , t ) + τ T ( x j ) v ( x j , t ) + f ( x j , t ) .
To discretize the right-hand side of (28), we can apply approximation (26) in Lemma 1 and observe that
2 x 2 u + τ T ( x j ) v ( x j , t ) = δ x 2 u + τ T ( x j ) v ( x j , t ) ( Δ x j ) 2 12 4 x 4 u + τ T ( x j ) v ( ξ j , t ) ,
for ξ j ( x j 1 , x j + 1 ) and j I l a y . Dropping the small value terms in (29), replacing the approximation in (28), and using the notation (24), we deduce that the semidiscrete approximation form of (12) at the inner grid points is given by
C ( x j ) v j ( t ) + τ q ( x j ) d d t v j ( t ) = k ( x j ) δ x 2 u j ( t ) + τ T ( x j ) v j ( t ) + f j ( t ) , j I l a y .
Step 2.
Approximation of (12) on I i n t . Let us consider the interface points x j I Δ i n t . We observe that the interface between the -th and ( + 1 ) -th layers is located at x = L or j = M . Let us consider the notation ( x 0 ) j = x j and ( x + 0 ) j = x j + . Then, considering the model Equation (12) at the inner grid points ( x j ± , t ) , we deduce that
C ( x j ± ) v + τ q ( x j ± ) t v ( x j ± , t ) = k ( x j ± ) 2 x 2 u + τ T ( x j ± ) v ( x j ± , t ) + f ( x j ± , t ) .
To discretize the right-hand side of (31), we can apply the approximations (25) and (27) in Lemma 1, respectively; we observe that
2 x 2 u + τ T ( x j ) v ( x j , t ) = 2 Δ x j x u + τ T ( x j ) v ( x j , t ) δ x u + τ T ( x j ) v ( x j 1 2 , t ) + Δ x j 3 3 x 3 u + τ T ( x j ) v ( ξ j , t ) , ξ j ( x j 1 , x j ) ,
2 x 2 u + τ T ( x j + ) v ( x j + , t ) = 2 Δ x j + δ x u + τ T ( x j + ) v ( x j + 1 2 + , t ) x u + τ T ( x j + ) v ( x j + , t ) Δ x j + 3 3 x 3 u + τ T ( x j + ) v ( ξ j , t ) , ξ j ( x j , x j + 1 ) .
The continuous interface condition given in (18) implies the following relationship:
k ( x j ) x u + τ T ( x j ) v ( x j , t ) = k ( x j + ) x u + τ T ( x j + ) v ( x j + , t ) .
Thus, from (31), dropping the small value terms in (32) and (33), using (34), and the notation (24), we obtain the semidiscrete approximation of the model equation at the interface points
Δ x j C ( x j ) v j ( t ) + τ q ( x j ) d d t v j ( t ) + Δ x j + C ( x j + ) v j ( t ) + τ q ( x j + ) d d t v j ( t ) = 2 k ( x j + ) δ x u j + 1 2 + τ T ( x j + ) v j + 1 2 k ( x j ) δ x u j 1 2 + τ T ( x j ) v j 1 2 + Δ x j f ( x j , t ) + Δ x j + f ( x j + , t ) .
In practice, one can replace x j and x j + with x j 1 and x j for j I i n t , respectively. Hence,
Δ x j 1 C ( x j 1 ) v j ( t ) + τ q ( x j 1 ) d d t v j ( t ) + Δ x j C ( x j ) v j ( t ) + τ q ( x j ) d d t v j ( t ) = 2 k ( x j ) δ x u j + 1 2 ( t ) + τ T ( x j ) v j + 1 2 ( t ) k ( x j 1 ) δ x u j 1 2 ( t ) + τ T ( x j 1 ) v j 1 2 ( t ) + Δ x j 1 f j 1 ( t ) + Δ x j f j ( t ) , j I i n t .
Step 3.
Approximation of (12) on I . We observe that the boundaries of the physical domain are located at x M 0 = 0 and x M d = L . Then, considering the evaluation of Equation (12) at the boundary points ( x M 0 , t ) and ( x M d , t ) , we deduce that
C ( x M 0 ) v ( x M 0 , t ) + τ q ( x M 0 ) t v ( x M 0 , t ) = k ( x M 0 ) 2 x 2 u + τ T ( x M 0 ) v ( x M 0 , t ) + f ( x M 0 , t ) ,
C ( x M d ) v ( x M d , t ) + τ q ( x M d ) t v ( x M d , t ) = k ( x M d ) 2 x 2 u + τ T ( x M d ) v ( x M d , t ) + f ( x M d , t ) ,
respectively. To discretize the right-hand sides of (37) and (38), we can apply the approximations (25) and (27) in Lemma 1, then, one can deduce the following relations:
2 x 2 u + τ T ( x M 0 ) v ( x M 0 , t ) = 2 Δ x M 0 δ x u + τ T ( x M 0 ) v ( x M 0 + 1 2 , t ) x u + τ T ( x M 0 ) v ( x M 0 , t ) Δ x M 0 3 3 x 3 u + τ T ( x M 0 ) v ( ξ M 0 , t ) , ξ M 0 ( x M 0 , x 1 ) ,
2 x 2 u + τ T ( x M d ) v ( x M d , t ) = 2 Δ x M d x u + τ T ( x M d ) v ( x M d , t ) δ x u + τ T ( x M d ) v ( x M d 1 2 , t ) + Δ x M d 3 3 x 3 u + τ T ( x M d ) v ( ξ M d , t ) , ξ M d ( x M d 1 , x M d ) ,
respectively.
On the other hand, from (15) and (16), we have that
x u + τ T ( x M 0 ) v ( x M 0 , t ) = 1 α 1 K ¯ 1 u + τ T ( x M 0 ) v ( x M 0 , t ) ϕ 1 ( t ) ,
x u + τ T ( x M d ) v ( x M d , t ) = 1 α 2 K ¯ 2 ϕ 2 ( t ) u + τ T ( x M d ) v ( x M d , t ) .
Replacing (41) and (42) in (39) and (40), respectively, and dropping the small value terms and replacing the approximations results in (37) and (38), respectively, we obtain the semidiscrete approximation at the boundaries
C ( x M 0 ) v M 0 ( t ) + τ q ( x M 0 ) d d t v M 0 ( t ) = 2 k ( x M 0 ) Δ x M 0 δ x u 1 2 ( t ) + τ T ( x M 0 ) v 1 2 ( t ) 1 α 1 K ¯ 1 u M 0 ( t ) + τ T ( x M 0 ) v M 0 ( t ) ϕ 1 ( t ) + f M 0 ( t ) ,
C ( x M d ) v M d ( t ) + τ q ( x M d ) d d t v M d ( t ) = 2 k ( x M d ) Δ x M d 1 α 2 K ¯ 2 ϕ 2 ( t ) u M d + τ T ( x M d ) v M d ( t ) δ x u M d 1 2 + τ T ( x M d ) v M d 1 2 ( t ) + f M d ( t ) .
Step 4.
Approximation of (13). Considering the evaluation of Equation (13) at point ( x j , t ) , we have that
v ( x j , t ) = t u ( x j , t ) .
Then, the semidiscrete approximation of (13) is given by
v j ( t ) = d d t u j ( t ) ,
which is deduced by using the notation (24) in (45).
Summarizing the results obtained before, we have that the semidiscrete scheme is given by (30), (36), (43), (44) and (46).

2.3. Fully Discrete Finite Difference Scheme Approximating the Rewritten System

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

2.4. Finite Difference Scheme Approximating the Original System

The finite difference scheme to obtain the numerical solution of (6)–(11) is given separately for n = 1 and n = 2 , , N 1 . More precisely, we have that the approximation (6)–(11) of
C j δ t u j 1 / 2 + 2 ( τ q ) j Δ t δ t u j 1 / 2 ψ 2 ( x j ) = 2 k j Δ x j δ x u j + 1 / 2 1 / 2 + ( τ T ) j δ t u j + 1 / 2 1 / 2 1 α 1 K ¯ 1 u j 1 / 2 + ( τ T ) j δ t u j 1 / 2 ϕ 1 1 / 2 + f j 1 / 2 , j = M 0 ,
C j δ t u j 1 / 2 + 2 ( τ q ) j Δ t δ t u j 1 / 2 ψ 2 ( x j ) = k j δ x 2 u j 1 / 2 + ( τ T ) j δ t u j 1 / 2 + f j 1 / 2 , j I l a y , Δ x j 1 C j 1 δ t u j 1 / 2 + 2 ( τ q ) j 1 Δ t δ t u j 1 / 2 ψ 2 ( x j ) + Δ x j + 1 C j + 1 δ t u j 1 / 2 + 2 ( τ q ) j + 1 Δ t δ t u j 1 / 2 ψ 2 ( x j ) = 2 k j + 1 δ x u j + 1 / 2 1 / 2 + ( τ T ) j + 1 δ t u j + 1 / 2 1 / 2 k j 1 δ x u j 1 / 2 1 / 2 + ( τ T ) j 1 δ t u j 1 / 2 1 / 2
+ Δ x j 1 f j 1 1 / 2 + Δ x j + 1 f j + 1 1 / 2 , j I i n t ,
C j δ t u j 1 / 2 + 2 ( τ q ) j Δ t δ t u j 1 / 2 ψ 2 ( x j ) = 2 k j Δ x j 1 α 2 K ¯ 2 ϕ 2 1 / 2 u j 1 / 2 + ( τ T ) j δ t u j 1 / 2 δ x u M d 1 2 1 / 2 + ( τ T ) j δ t u M d 1 2 1 / 2 + f j 1 / 2 , j = M d ,
for n = 1 . Meanwhile,
C j Δ t u j n + ( τ q ) j δ t 2 u j n = 2 k j Δ x j δ x u j + 1 / 2 n ¯ + ( τ T ) j Δ t u j + 1 / 2 n 1 α 1 K ¯ 1 u j n ¯ + ( τ T ) j Δ t u j n ϕ 1 n ¯ + f j n ¯ , j = M 0 ,
C j Δ t u j n + ( τ q ) j δ t 2 u j n = k j δ x 2 u j n ¯ + ( τ T ) j Δ t u j n + f j n , j I l a y ,
Δ x j 1 C j 1 Δ t u j n + ( τ q ) j 1 δ t 2 u j n + Δ x j + 1 C j + 1 Δ t u j n + ( τ q ) j + 1 δ t 2 u j n = 2 k j + 1 δ x u j + 1 / 2 n ¯ + ( τ T ) j + 1 Δ t u j + 1 / 2 n k j 1 δ x u j 1 / 2 n ¯ + ( τ T ) j 1 Δ t u j 1 / 2 n + Δ x j 1 f j 1 n ¯ + Δ x j + 1 f j + 1 n ¯ , j I i n t ,
C j Δ t u j n + ( τ q ) j 1 δ t 2 u j n = 2 k j Δ x j 1 α 2 K ¯ 2 ϕ 2 n ¯ u j n ¯ + ( τ T ) j Δ t u j n δ x u M d 1 2 n ¯ + ( τ T ) j Δ t u M d 1 2 n + f j n ¯ , j = M d ,
v j n + 1 = 2 δ t u j n v j n , j I ,
for n = 2 , , N 1 . Moreover,
u j 0 = ψ 1 ( x j ) , v j 0 = ψ 2 ( x j ) , j I ,
is the initial condition. We observe that the derivation of the finite difference scheme to solve the initial-interface boundary problems (6)–(11) is given by using the discrete schemes (47)–(52), and especially, the discrete version of the change of variable given in (51). More precisely, we have that the schemes (47)–(52) and (53)–(62) are equivalent (see Theorem 2).

3. Analytical and Numerical Analysis

3.1. Continuos Energy Estimation

We remark that model (6) (or equivalently (12)) corresponds to an energy balance since it originated in the energy Equation (1). It is well known that the function t ( 1 / 2 ) u ( · , t ) L 2 ( I ) 2 is called the energy for the heat equation u t u x x = f . Moreover, the energy analysis implies some inequalities called energy estimates, which imply the stability and uniqueness of solutions. The following theorem gives the corresponding generalization of the standard heat equation estimates to the dual-phase-lagging multi-layered model.
Theorem 1. 
Consider that u , v are solutions of the systems (6)–(11) and (12)–(18) with boundary conditions ϕ 1 = ϕ 2 = 0 , respectively; and denote by E the energy function defined as follows
E ( t ) = C τ q v L 2 ( I ) 2 + k u x L 2 ( I ) 2 + k 1 α 1 K ¯ 1 u 2 ( L 0 , t ) + k d α 2 K ¯ 2 u 2 ( L d , t ) .
Then, the estimate
E ( t ) E ( 0 ) + 1 2 0 t I f 2 ( x , s ) C ( x ) d x d s ,
is valid for any t [ 0 , T ] .
Proof. 
Let us multiply (12) by v and integrate over I l a y to get
I l a y C v 2 d x + 1 2 d d t I l a y C τ q v 2 d x = k d x ( u + τ T ( d ) v ) v ( L d , t ) k 1 x ( u + τ T ( 1 ) v ) v ( L 0 , t )
1 2 d d t I l a y k u x 2 d x I l a y k τ T v x 2 d x + I l a y f v d x .
Here, we have used notation (4) and (5) to follow that
I l a y k 2 u x 2 + τ T 2 v x 2 v d x = = 1 d k I 2 x 2 u + τ T ( ) v v d x = = 1 d 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 d k τ T ( ) I v x 2 d x ,
which imply (66) by using (18) and the fact that v = u t to deduce the identity 2 u x v x = ( u x 2 ) t .
From the assumptions ϕ 1 = ϕ 2 = 0 , the boundary conditions (15) and (16) and the identity ( u 2 ) t = 2 u v , we have that
k 1 x ( u + τ T ( 1 ) v ) v ( L 0 , t ) = k 1 α 1 K ¯ 1 ( u + τ T ( 1 ) v ) v ( L 0 , t ) = k 1 α 1 K ¯ 1 1 2 ( u 2 ) t + τ T ( 1 ) v 2 ( L 0 , t ) , k d x ( u + τ T ( d ) v ) v ( L d , t ) = k d α 2 K ¯ 2 ( u + τ T ( d ) v ) v ( L d , t )
= k d α 2 K ¯ 2 1 2 ( u 2 ) t + τ T ( d ) v 2 ( L d , t ) .
Thus, replacing (67) and (68) in (66), using the definition of E given on (63), and applying the Cauchy–Scharwz inequality, we have that
1 2 d d t E ( t ) + I l a y C v 2 d x + I l a y k τ T v x 2 d x + k 1 α 1 K ¯ 1 τ T ( 1 ) v ( L 0 , t ) 2 + k d α 2 K ¯ 2 τ T ( d ) v ( L d , t ) 2 = I l a y f v d x 1 4 I l a y f 2 C d x + I l a y C v 2 d x ,
which implies (64) by an integration on [ 0 , t ] . □

3.2. Equivalence of Finite Difference Schemes for Rewritten and Original Systems

Theorem 2. 
The finite difference schemes (47)–(52) and (53)–(62) are equivalent.
Proof. 
From (51) with n = 0 , Lemma 1, and the initial condition (52), we observe that
v j 1 / 2 = δ t u j 1 / 2 , j I
δ t v j 1 / 2 = 2 Δ t v j 1 / 2 v j 0 = 2 Δ t δ t u j 1 / 2 ψ 2 ( x j ) , j I .
Letting n = 0 in (47)–(50) and using the relations (69) and (70), we deduce (53)–(56).
On the other hand, we observe the identities
1 2 v j n + 1 / 2 + v j n 1 / 2 = Δ t u j n and 1 2 δ v j n + 1 / 2 + δ v j n 1 / 2 = δ t 2 u j n .
We follow (57)–(62), by adding (47)–(51) with superscripts n 1 / 2 and n + 1 / 2 and using (71). □

3.3. Discrete Energy Estimation

Theorem 3. 
Let us consider that ( u j n , v j n ) : ( j , n ) I × { 0 , , N } , is the solution of the fully finite difference scheme (47)–(52) with boundary conditions ϕ 1 n + 1 / 2 = ϕ 2 n + 1 / 2 = 0 for n = 0 , , N 1 . Let us consider the notation
C v n = C M 0 v M 0 n , , C M d v M d n , k δ x u n = k M 0 u M 0 n , , k M d u M d n , 1 C f n + 1 2 = 1 C M 0 f M 0 n + 1 2 , , 1 C M d f M d n + 1 2
and define the discrete energy E n by
E n : = C v n 2 + k δ x u n 2 + k 1 α 1 K n ( 1 ) ( u M 0 n ) 2 + k d α 2 K n ( 2 ) ( u M d n ) 2 , n = 1 , , N ,
where the discrete norms are defined in (20)–(23). Then, the following discrete energy estimate
E n + 1 E 0 + Δ t 2 k = 0 n 1 C f k + 1 2 2 ,
is satisfied for n = 0 , , N 1 .
Proof. 
We can rewrite the finite difference scheme (47)–(52) by developing the following algebraic operations: multiplying (47) by 2 1 Δ x M 0 v M 0 n + 1 / 2 ; (48) by Δ x j v j n + 1 / 2 , (49) by 2 1 v j n + 1 / 2 , and (50) by 2 1 Δ x M d v M d n + 1 / 2 . In the new form of the scheme, we can sum up the results and rearranging some terms to obtain
= 1 d 1 2 C M 1 Δ x M 1 v M 1 n + 1 / 2 2 + j = M 1 + 1 M 1 C j Δ x j v j n + 1 / 2 2 + 1 2 C M Δ x M v M n + 1 / 2 2 + = 1 d 1 2 C M 1 Δ x M 1 τ q M 1 δ t v M 1 n + 1 / 2 v M 1 n + 1 / 2 + j = M 1 + 1 M 1 C j Δ x j τ q j δ t v j n + 1 / 2 v j n + 1 / 2 + 1 2 C M Δ x M τ q M δ t v M n + 1 / 2 v M n + 1 / 2 = = 1 d [ Δ x M 1 k M 1 δ x u M 1 n + 1 / 2 + ( τ T ) M 1 v M 1 n + 1 / 2 v M 1 n + 1 / 2 + j = M 1 + 1 M 1 Δ x j δ x 2 u j n + 1 / 2 + ( τ T ) j v j n + 1 / 2 v j n + 1 / 2 + Δ x M k M δ x u M n + 1 / 2 + ( τ T ) M v M n + 1 / 2 v M n + 1 / 2 ] + = 1 d 1 2 f M 1 n + 1 / 2 Δ x M 1 v M 1 n + 1 / 2 + j = M 1 + 1 M 1 Δ x j f j n + 1 / 2 v j n + 1 / 2 + 1 2 Δ x M f M n + 1 / 2 v M n + 1 / 2 k 1 α 1 K n ( 1 ) u M 0 n + 1 / 2 + ( τ T ) M 0 v M 0 n + 1 / 2 v M 0 n + 1 / 2 k 3 α 2 K n ( 2 ) u M d n + 1 / 2 + ( τ T ) M d v M d n + 1 / 2 v M d n + 1 / 2 .
On the other hand, we observe that we have the following identities:
δ t v j n + 1 / 2 v j n + 1 / 2 = 1 2 Δ t ( v j n + 1 ) 2 ( v j n ) 2 , j = M 1 + 1 M 1 Δ x j δ x 2 u j n + 1 / 2 + τ T ( ) v j n + 1 / 2 v j n + 1 / 2 = j = M 1 + 1 M 1 δ x u j n + 1 / 2 + ( τ T ) j v j n + 1 / 2 δ x v j + 1 / 2 n + 1 / 2 δ x u M 1 + 1 / 2 n + 1 / 2 + ( τ T ) M 1 + 1 / 2 v M 1 + 1 / 2 n + 1 / 2 v M 1 + 1 / 2 n + 1 / 2 + δ x u M + 1 / 2 n + 1 / 2 + ( τ T ) M + 1 / 2 v M + 1 / 2 n + 1 / 2 v M + 1 / 2 n + 1 / 2 , δ x v j + 1 / 2 n + 1 / 2 = δ t δ x u j + 1 / 2 n + 1 / 2 .
From (74), the relation (51), the norm notation, the definition of E n given on (72) and the application of Cauchy–Schwartz inequality imply that the estimate
1 2 Δ t ( E n + 1 E n ) + C v n + 1 / 2 2 + k τ T δ x v n + 1 / 2 2 + k 1 ( τ T ) M 0 α 1 K n ( 1 ) v M 0 n + 1 / 2 2 + k d ( τ T ) M d α 2 K n ( 2 ) v M d n + 1 / 2 2 = f n + 1 / 2 , v n + 1 / 2 1 C f n + 1 / 2 2 + C v n + 1 / 2 2 ,
for n = 0 , , N 1 , which implies (73) and concludes the proof. □
Theorem 4. 
The scheme (47)–(52) is unconditionally stable.
Proof. 
The proof is a consequence of Theorem 3. □
Theorem 5. 
Let us consider that ( u j n , v j n ) and ( U j n , V j n ) for j = M 0 , , M d , and n = 1 , , N are the solution of the fully finite difference scheme (47)–(52) and the analytic solution of (12)–(18) on U Δ x , Δ t , respectively. If 3 Δ t 2 , the following estimate
U n u n + V n v n C ¯ Δ t 2 + = 1 d ( Δ W ) 2 , n = 1 , , N ,
is satisfied for a positive constant C ¯ .
Proof. 
From the definition, U n and V n satisfy the following relations:
C j V j n + 1 / 2 + ( τ q ) j δ t V j n + 1 / 2 = 2 k j Δ x j δ x U j + 1 / 2 n + 1 / 2 + ( τ T ) j V j + 1 / 2 n + 1 / 2 1 α 1 K ¯ 1 U j n + 1 / 2 + τ T ( x j ) V j n + 1 / 2 ϕ 1 n + 1 / 2 + f j n + 1 / 2 + R j n + 1 / 2 , j = M 0 ,
C j V j n + 1 / 2 + ( τ q ) j δ t V j n + 1 / 2 = k j δ x 2 U j n + 1 / 2 + ( τ T ) j V j n + 1 / 2 + f j n + 1 / 2 + R j n + 1 / 2 , j I l a y , Δ x j 1 C j 1 Δ x j 1 + Δ x j + 1 V j n + 1 / 2 + ( τ q ) j 1 δ t V j n + 1 / 2 + Δ x j + 1 C j + 1 Δ x j 1 + Δ x j + 1 V j n + 1 / 2 + ( τ q ) j + 1 δ t V j n + 1 / 2 = 2 Δ x j 1 + Δ x j + 1 k j + 1 δ x U j + 1 2 n + 1 / 2 + ( τ T ) j + 1 V j + 1 2 n + 1 / 2 k j 1 δ x U j 1 2 n + 1 / 2 + ( τ T ) j 1 V j 1 2 n + 1 / 2
+ Δ x j 1 Δ x j 1 + Δ x j + 1 f j 1 n + 1 / 2 + Δ x j + 1 Δ x j 1 + Δ x j + 1 f j + 1 n + 1 / 2 + R j 1 n + 1 / 2 + R j + 1 n + 1 / 2 , j I i n t ,
C j V j n + 1 / 2 + ( τ q ) j δ t V j n + 1 / 2 = 2 k j Δ x j 1 α 2 K ¯ 2 ϕ 2 n + 1 / 2 U j n + 1 / 2 + ( τ T ) j V j n + 1 / 2 δ x U j 1 / 2 n + 1 / 2 + ( τ T ) j V j 1 / 2 n + 1 / 2 + f j n + 1 / 2 + R j n + 1 / 2 , j = M d ,
V j n + 1 / 2 = δ t U j n + 1 / 2 + r j n + 1 / 2 , j I ,
with the initial condition ( U j 0 , V j 0 ) = ψ 1 ( x j ) , ψ 2 ( x j ) for j I , R j n + 1 / 2 and r j n + 1 / 2 , the residuals of the Taylor series expansions, such that there exists a positive constant C ¯ satisfying
| R j n + 1 / 2 | C ¯ ( Δ t 2 + Δ x j ) , j I I i n t ,
| R j n + 1 / 2 | C ¯ ( Δ t 2 + Δ x j 2 ) , j I I I i n t ,
| r j n + 1 / 2 | Δ t 2 , j I ,
| δ x r j + 1 / 2 n + 1 / 2 | C ¯ Δ t 2 , j I ,
for n = 0 , , N 1 . We notice that the application of Lemma 2 implies that
r j 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 .
which implies the estimates (83) and (84).
Let us consider the notation U j n = U j n u j n and V j n = V j n v j n . From (47)–(52) and (76)–(80), we have that ( U j n , V j n ) satisfy the following scheme
C j V j n + 1 / 2 + ( τ q ) j δ t V j n + 1 / 2
= 2 k j Δ x j δ x U j + 1 / 2 n + 1 / 2 + ( τ T ) j V j + 1 / 2 n + 1 / 2 1 α 1 K ¯ 1 U j n + 1 / 2 + τ T ( x j ) V j n + 1 / 2 ϕ 1 n + 1 / 2 + R j n + 1 / 2 , j = M 0 ,
C j V j n + 1 / 2 + ( τ q ) j δ t V j n + 1 / 2 = k j δ x 2 U j n + 1 / 2 + ( τ T ) j V j n + 1 / 2 + R j n + 1 / 2 , j I l a y , Δ x j 1 C j 1 Δ x j 1 + Δ x j + 1 V j n + 1 / 2 + ( τ q ) j 1 δ t V j n + 1 / 2 + Δ x j + 1 C j + 1 Δ x j 1 + Δ x j + 1 V j n + 1 / 2 + ( τ q ) j + 1 δ t V j n + 1 / 2 = 2 Δ x j 1 + Δ x j + 1 k j + 1 δ x U j + 1 2 n + 1 / 2 + ( τ T ) j + 1 V j + 1 2 n + 1 / 2 k j 1 δ x U j 1 2 n + 1 / 2 + ( τ T ) j 1 V j 1 2 n + 1 / 2
+ Δ x j 1 Δ x j 1 + Δ x j + 1 f j 1 n + 1 / 2 + Δ x j + 1 Δ x j 1 + Δ x j + 1 f j + 1 n + 1 / 2 + R j 1 n + 1 / 2 + R j + 1 n + 1 / 2 , j I i n t , C j V j n + 1 / 2 + ( τ q ) j δ t V j n + 1 / 2
= 2 k j Δ x j 1 α 2 K ¯ 2 ϕ 2 n + 1 / 2 U j n + 1 / 2 + ( τ T ) j V j n + 1 / 2 δ x U j 1 / 2 n + 1 / 2 + ( τ T ) j V j 1 / 2 n + 1 / 2 + R j n + 1 / 2 , j = M d ,
V j n + 1 / 2 = δ t U j n + 1 / 2 + r j n + 1 / 2 , j I ,
for n = 0 , 1 , , N 1 .
We observe that the finite difference scheme (47)–(52) is similar to finite difference scheme (85)–(88) if we change ( u j n + 1 / 2 , v j n + 1 / 2 ) by ( U j n + 1 / 2 , V j n + 1 / 2 ) . Then, can develop the desired estimate by following similar algebraic procedures to the ones used in Theorem 3: multiplying (85)–(88) by 2 1 Δ x M 0 V M 0 n + 1 / 2 ,   Δ x j V j n + 1 / 2 , 2 1 ( Δ x j + Δ x + 1 ) V j n + 1 / 2 for = 1 , , d 1 , and 2 1 Δ x M d V M d n + 1 / 2 , respectively; summing up the results and using the following relations
j = M 1 + 1 M 1 Δ x j δ x 2 U j n + 1 / 2 + ( τ T ) j V j n + 1 / 2 V j n + 1 / 2 = j = M 1 + 1 M 1 δ x U j n + 1 / 2 + ( τ T ) j V j n + 1 / 2 δ x V j + 1 / 2 n + 1 / 2 δ x U M 1 n + 1 / 2 + ( τ T ) M 1 V M 1 n + 1 / 2 V , 1 n + 1 / 2 + δ x U M n + 1 / 2 + ( τ T ) M V M n + 1 / 2 V M n + 1 / 2 , δ t V j n + 1 / 2 V j n + 1 / 2 = 1 2 Δ t ( V j n + 1 ) 2 ( V j n ) 2 , j I , δ x V j + 1 / 2 n + 1 / 2 = δ t δ x U j + 1 / 2 n + 1 / 2 + δ x r j + 1 / 2 n + 1 / 2 , j I ,
and by making some rearrangements, we obtain the estimate
1 2 Δ t ( H n + 1 H n ) 1 4 ( H n + 1 + H n ) + δ n + 1 / 2 , n = 0 , , N 1 .
where
H n : = 1 2 Δ t C τ q V n 2 + k δ x U n 2 + k 1 2 Δ t α 1 K n ( 1 ) ( U M 0 n ) 2 + k d 2 Δ t α 2 K n ( 2 ) ( U M d n ) 2 , δ n + 1 / 2 : = 1 2 = 1 d j = M 1 + 1 M 1 k j Δ x j δ x r j + 1 / 2 n + 1 / 2 2 + k 1 2 α 1 K n ( 1 ) r M 0 n + 1 / 2 2 + k d 2 α 2 K n ( 2 ) r M d n + 1 / 2 2 + α 1 K n ( 1 ) + L 1 2 k 1 ( τ T ) M 0 Δ x M 0 2 R M 0 n + 1 / 2 2 + = 1 d j = M 1 + 1 M 1 1 4 C j Δ x j R j n + 1 / 2 2 + α 2 K n ( 2 ) + L d 2 k d ( τ T ) M d Δ x M d 2 R M d n + 1 / 2 2 .
From (90) and (81)–(84), we deduce that there is a positive constant C such that δ n + 1 / 2 C ( Δ t 2 + = 0 d ( Δ W ) 2 ) . Then, replacing in (90), we deduce the estimate
1 2 Δ t ( H n + 1 H n ) 1 4 ( H n + 1 + H n ) + C ( Δ t 2 + = 0 d ( Δ W ) 2 ) , n = 0 , , N 1 ,
which is equivalent to
1 Δ t 2 H n + 1 1 + Δ t 2 H n + 2 C Δ t Δ t 2 + = 0 d ( Δ W ) 2 , n = 0 , , N 1 .
Hence, we get (75) by observing that
H n + 1 1 + 3 2 Δ t H n + 3 C Δ t ( Δ t 2 + = 0 d ( Δ W ) 2 ) , n = 0 , , N 1 .
by using the assumption 3 Δ t 2 , applying the Gronwall inequality, and Lemma 3. □

4. Numerical Examples

In this section, we present two numerical examples to test our finite difference scheme presented in Section 2. More precisely, the first example is a theoretical comparison between the numerical solution and the analytical solution. In addition, we give a test of error to verify the accuracy of Theorem 5.
The second example provides an application of the numerical scheme to nanoscale thin films of gold and chromium. In this case, we use the physical properties of these materials.

4.1. Example 1

In this example, we have followed the ideas of [22,25,26]. The chosen parameters are given in Table 1. It is important to note that some of the chosen parameters may not make physical sense because the main goal of this example is to compare the exact solution with the numerical solution to verify the accuracy of the our numerical scheme. We chose φ 1 ( t ) = 1 4 π e 1 2 t , φ 2 ( t ) = 3 24 ( π + 4 3 ) e 1 2 t and source terms
f ( x , t ) = 2 4 ( π 2 2 ) e 1 2 t sin ( π x 2 ) , x [ 0 , 0.5 ) , 1 4 e 1 2 t [ ( 1 2 ) x + 2 1 2 ] , x [ 0.5 , 1 ) , 3 18 ( π 3 3 2 ) e 1 2 t sin ( π x 6 ) , x [ 1 , 1.5 ) , 3 18 ( π + 3 3 2 ) e 1 2 t cos ( π x 6 ) , x [ 1.5 , 2 ) .
The initial conditions are
u ( x , 0 ) = sin ( π x 2 ) , x [ 0 , 0.5 ) , ( 1 2 ) x + 2 1 2 , x [ 0.5 , 1 ) , sin ( π x 6 ) , x [ 1 , 1.5 ) , cos ( π x 6 ) , x [ 1.5 , 2 ] ,
and
u ( x , 0 ) t = 1 2 sin ( π x 2 ) , x [ 0 , 0.5 ) , 1 2 ( ( 1 2 ) x + 2 1 2 ) , x [ 0.5 , 1 ) , 1 2 sin ( π x 6 ) , x [ 1 , 1.5 ) , 1 2 cos ( π x 6 ) , x [ 1.5 , 2 ] .
It is easy to see that the aforementioned problem has the following exact solution
u ( x , t ) = e 1 2 t sin ( π x 2 ) , x [ 0 , 0.5 ) , e 1 2 t [ ( 1 2 ) x + 2 1 2 ] , x [ 0.5 , 1 ) , e 1 2 t sin ( π x 6 ) , x [ 1 , 1.5 ) , e 1 2 t cos ( π x 6 ) , x [ 1.5 , 2 ] .
In our simulations, we have considered T = 1 , α 1 = α 2 = 0.5 , K ¯ 1 = K ¯ 2 = 1 . Also, the discretization parameters that have been used are m i = 10 , Δ W i = 0.050 for i = 1 , , 4 ; N = 80 and Δ t = 0.125 .
The comparison of the analytical solution and the numerical solution is given in Figure 3. On the one hand, in Figure 3a, we show the comparison of the initial condition between the exact solution u ( x , 0 ) and the numerical solution u Δ ( x , 0 ) . Meanwhile, in Figure 3b, we show the comparison of the solution at final time T = 1 between the exact solution u ( x , T ) and the numerical solution u Δ ( x , T ) . On the other hand, in Figure 3c,d, we show the temperature distribution for every time t [ 0 , 1 ] for the exact solution and the numerical solution, respectively.
Now, consider the notation of Theorem 5. Then, from (22), one can define the L -norm error between the analitycal solution and numerical solution as
E ( Δ W , Δ t ) : = U n .
For simplicity, we took Δ W 1 = Δ W 2 = Δ W 3 = Δ W 4 = Δ x . To calculate spatial convergence order, we use
O 1 = log 2 E ( 2 Δ x , Δ t ) E ( Δ x , Δ t ) ,
for some fixed, sufficiently small Δ t . On the other hand, to calculate the temporal convergence order, we use
O 2 = log 2 E ( Δ x , 2 Δ t ) E ( Δ x , Δ t ) ,
for some fixed, sufficiently small Δ x .
In the simulation test of spatial error, we chose the same quantity of grid points for each layer, that is, m 1 = m 2 = m 3 = m 4 = m . Then, we test for m = 5 , 10 , 20 , 40 and 80. The final time is T = 1 , temporal discretization steps N = 10 , 000 and time step Δ t = 1 / 10 , 000 . Results are shown in Table 2.
On the other hand, for temporal errors, we fixed m = 500 , Δ x = 1 / 1000 and T = 1 . We use different values for N and Δ t . Results are shown in Table 3.
We conclude that the spatial convergence order is approximately 2. Meanwhile, the temporal order convergence is approximately 1. Results are consistent with the theoretical analysis from Theorems 4 and 5.
In addition, we verify that the precision of condition Δ t 2 / 3 arises from Theorem 5 in a final long time T = 5 . For this purpose, we consider K ¯ 1 = K ¯ 2 = 1 , m i = 10 for i = 1 , , 4 , which implies Δ x = 1 / 20 . Then, for N = 2 , we have Δ t = 5 / 2 > 2 / 3 and E ( Δ x , Δ t ) = 4.19 × 10 2 (see Figure 4a). On the other hand, if we consider N = 20 , then Δ t = 1 / 4 < 2 / 3 and E ( Δ x , Δ t ) = 6.7 × 10 3 (see Figure 4b). Therefore, we conclude that if condition Δ t 2 / 3 is not considered as time t increases, then the error between the analytical solution u ( x , t ) and the numerical solution u Δ ( x , t ) also increases.

4.2. Example 2

We have based this example on the ideas of [11,14,27]. To be more precise, in the paper of [14], the authors consider a gold layer that is on a chromium padding layer and is irradiated by an ultrashort-pulsed laser. In our case, we consider four layers; the first and third layers are gold films of a size of 0.5 nm. Meanwhile, the second and fourth layers are chromium films of a size of 0.5 nm. This implies that the spatial domain is [ 0 nm , 2 nm ] .
In Table 1 are specified properties of gold and chromium. The values of τ q and τ T have been obtained experimentally, while C and k are intrinsic properties of the materials provides in the literature [11]. Furthermore, following the ideas of [14,27], we can consider a laser heat source term widely used in dual-phase-lag (DPL) or two-temperature models as follows:
S ( x , t ) = 4 ln 2 π ( 1 R ) F δ t p exp x δ 4 ln 2 t 2 t p t p 2 ,
where F is fluence, R is surface reflectivity, δ is optical penetration depth, and t p is pulse duration. Then, if we take into account (2) and (6), then the source term f ( x , t ) can be considered as follows:
f ( x , t ) = S ( x , t ) + τ q 1 t S ( x , t ) , x [ 0 , 0.5 ) , S ( x , t ) + τ q 2 t S ( x , t ) , x [ 0.5 , 1 ) , S ( x , t ) + τ q 3 t S ( x , t ) , x [ 1 , 1.5 ) , S ( x , t ) + τ q 4 t S ( x , t ) , x [ 1.5 , 2 ] .
In this example, we took F = 13.7 j/m2, δ = 15.3 nm, t p = 0.1 ps and R = 0.93 . Therefore, the laser heat source term is
S ( x , t ) = 0.90146 1.53 exp x 15.3 2.77 t 0.2 0.01 2 .
Furthermore, initial and boundary conditions are given by ψ 1 ( x ) = 300 , ψ 2 ( x ) = 0 and φ 1 ( t ) = φ 2 ( t ) = 300 , respectively. These values are expressed in kelvins (K). In a physical sense, this means that the gold- and chromium-layer films are at room temperature. Additionally, there is no external flux, that is, u ( x , 0 ) x = 0 . For the numerical simulation, we consider the spatial mesh partition m i = 100 , for i = 1 , , 4 , N = 80 , and α 1 = α 2 = 1 / 2 . We simulate for three Knudsen numbers K ¯ 1 = K ¯ 2 = 0.1 , 1 and 10 in final times T = 0.5 and 1. The results are shown in Figure 5. We specify that the Knudsen numbers used in this example are not real; however, they are commonly used in the literature (for more details, consult [21]).
On the other hand, we consider the same initial and boundary conditions, W ¯ , C and k provided in Table 1, and a fixed final time T = 1 . In Figure 6, we illustrate the effects that occur when there is a decrease in phase lag, that is, when τ q , τ T 0 . The values used for τ q and τ T are shown in the Table 4.
We conclude that as the values of τ q and τ T decrease, the temperature u Δ begins to increase and starts to deviate from the phase-lag solution (DPL).

5. Conclusions and Future Work

We have introduced a mathematical model for the heat transfer phenomenon in multi-layered solids by considering a non-Fourier law. For modeling the interphases, we have assumed that the temperature and the heat flux are continuous. We have approximated the solution by introducing a finite difference scheme. We have proved some theoretical and numerical results; mainly, we have proved a continuous energy estimate, a discrete energy estimate, the unconditional stability of the numerical scheme, and an error estimate of the finite difference scheme. Moreover, we have validated our numerical approximation using analytical data and an example with parameter values close to industrial multi-layered solids composed of gold and chromium.
The results of this paper are deduced by assuming smooth conditions (on the coefficients and solution) and the energy estimates are deduced for the specific case of zero-flux boundary conditions. Hence, it will be interesting to study some extensions in a setting of more weak conditions and with other types of interface-boundary conditions. More precisely, we set out at least three issues that need more detailed exploration: (i) the study of the multi-layered dual-phase-lag equation with discontinuous interface conditions; (ii) the energy estimates in the case of non zero-flux boundary conditions or other kinds of boundary conditions; and (iii) the extension to multidimensional domains (see for instance [28]).

Author Contributions

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

Funding

This research was partially funded by Universidad Católica de Temuco; Universidad del Bío-Bío (Chile); the National Agency for Research and Development, ANID-Chile, through FONDECYT project 1230560; and by the Competition for Research Regular Projects, in the year of 2023, code LPR23-03, Universidad Tecnológica Metropolitana.

Data Availability Statement

The original files used to produce the simulations in the present work are available from the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Dorfman, A.; Renner, Z. Conjugate Problems in Convective Heat Transfer: Review. Math. Probl. Eng. 2009, 2009, 927350. [Google Scholar] [CrossRef]
  2. Zudin, Y.B. Theory of Periodic Conjugate Heat Transfer, 3rd ed.; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. Tzou, D.Y. A unified field approach for heat conduction from macro-to micro-scale. ASME J. Heat Transf. 1995, 117, 8–16. [Google Scholar] [CrossRef]
  12. Tzou, D.Y. Macro to Microscale Heat Transfer. The Lagging Behaviour, 2nd ed.; Taylor & Francis: Washington, DC, USA, 2014. [Google Scholar]
  13. Borjalilou, V.; Asghari, M. Small-scale analysis of plates with thermoelastic damping based on the modified couple stress theory and the dual-phase-lag heat conduction model. Acta Mech. 2018, 229, 124720. [Google Scholar] [CrossRef]
  14. 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]
  15. Cattaneo, C. A Form of Heat Conduction Equation Which Eliminates the Paradox of Instantaneous Propagation. C. R. Acad. Sci. 1958, 247, 431–433. [Google Scholar]
  16. Quintanilla, R. Exponential stability in the dual-phase-lag heat conduction theory. Int. J. Heat Mass Transf. 2002, 27, 217–227. [Google Scholar] [CrossRef]
  17. Quintanilla, R.; Racke, R. A note on stability in dual-phase-lag heat conduction. Int. J. Heat Mass Transf. 2006, 49, 1209–1213. [Google Scholar] [CrossRef]
  18. Kumar, S.; Srivastava, A. Thermal analysis of laser-irradiated tissue phantoms using dual phase lag model coupled with transient radiative transfer equation. Int. J. Heat Mass Transf. 2015, 90, 466–479. [Google Scholar] [CrossRef]
  19. Poshti, A.G.T.; Khosravirad, A.; Ayani, M.B. Analyses of non-Fourier heat conduction in 1-D spherical biological tissue based on dual-phase-lag bio-heat model using the conservation element/solution element (CE/SE) method: A numerical study. Int. Commun. Heat Mass Transf. 2022, 132, 105881. [Google Scholar] [CrossRef]
  20. 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 Mass Transf. 2009, 52, 3706–3711. [Google Scholar] [CrossRef]
  21. Rapp, B. Microfluidics: Modeling, Mechanics and Mathematics; Elsevier: Amsterdam, The Netherlands, 2016. [Google Scholar]
  22. 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. [Google Scholar] [CrossRef]
  23. Sun, Z.Z. Numerical Methods for Partial Differential Equations, 2nd ed.; Science Press: Beijing, China, 2012. [Google Scholar]
  24. 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]
  25. Coronel, A.; Lozada, E.; Berres, S.; Fernando, F.; Murúa, N. Mathematical modeling and numerical approximation of heat conduction in three-phase-lag solid. Energies 2024, 17, 2497. [Google Scholar] [CrossRef]
  26. Murúa, N.; Coronel, A.; Tello, A.; Berres, S.; Huancas, F. GPU Accelerating Algorithms for Three-Layered Heat Conduction Simulations. Mathematics 2024, 12, 3503. [Google Scholar] [CrossRef]
  27. Zhang, Y.; Tzou, D.Y.; Chen, J.K. Micro- and nanoscale heat transfer in femtosecond laser processing of metals. In High-Power and Femtosecond Lasers: Properties, Materials and Applications; Nova Science Publishers: Hauppauge, NY, USA, 2009; pp. 159–206. [Google Scholar]
  28. Liu, C.; Cao, W.; Song, X.; Wan, Y. A semi-analytical method of three-dimensional dual-phase-lagging heat conduction model. J. Heat Mass Transf. 2024, 218, 124720. [Google Scholar] [CrossRef]
Figure 1. Schematic representation of the multi-layered solid. For complete details of the notation, we refer to (4), where L is defined to identify the position of the interfaces.
Figure 1. Schematic representation of the multi-layered solid. For complete details of the notation, we refer to (4), where L is defined to identify the position of the interfaces.
Axioms 14 00105 g001
Figure 2. Graphic representation of the notation defined in (4) and representing the physical domain.
Figure 2. Graphic representation of the notation defined in (4) and representing the physical domain.
Axioms 14 00105 g002
Figure 3. Numerical results for Example 1. Here, u ( x , t ) and u Δ ( x , t ) are the analytical solution and the numerical solution, respectively.
Figure 3. Numerical results for Example 1. Here, u ( x , t ) and u Δ ( x , t ) are the analytical solution and the numerical solution, respectively.
Axioms 14 00105 g003
Figure 4. Comparison between the analytical solution u ( x , t ) and the numerical solution u Δ ( x , t ) for two different values of Δ t .
Figure 4. Comparison between the analytical solution u ( x , t ) and the numerical solution u Δ ( x , t ) for two different values of Δ t .
Axioms 14 00105 g004
Figure 5. Numerical results for Example 2. (a,b) shown the numerical solution profile u Δ ( x , t ) in kelvins at final time T = 0.5 ps and T = 1 ps, respectively, for different values of Knudsen numbers K ¯ 1 = K ¯ 2 = 0.1 , 1 and 10. Figure (c) shows the numerical solution profile u Δ ( x , t ) in domain [ 0 nm , 2 nm ] × [ 0 ps , 1 ps ] and K ¯ = 1 .
Figure 5. Numerical results for Example 2. (a,b) shown the numerical solution profile u Δ ( x , t ) in kelvins at final time T = 0.5 ps and T = 1 ps, respectively, for different values of Knudsen numbers K ¯ 1 = K ¯ 2 = 0.1 , 1 and 10. Figure (c) shows the numerical solution profile u Δ ( x , t ) in domain [ 0 nm , 2 nm ] × [ 0 ps , 1 ps ] and K ¯ = 1 .
Axioms 14 00105 g005
Figure 6. Comparison of numerical solution u Δ ( x , t ) for different values of τ q and τ T . The numerical values for each profile are given in Table 4.
Figure 6. Comparison of numerical solution u Δ ( x , t ) for different values of τ q and τ T . The numerical values for each profile are given in Table 4.
Axioms 14 00105 g006
Table 1. Parameters for Examples 1 and 2. W ¯ is expressed in nm; C in J/(m3 K); τ q and τ T in ps; and k in W/(m K), where J: = joules; K: = kelvins; kg: = kilograms; m: = meters; nm: = nanometers; ps: = picoseconds; and W: = watts.
Table 1. Parameters for Examples 1 and 2. W ¯ is expressed in nm; C in J/(m3 K); τ q and τ T in ps; and k in W/(m K), where J: = joules; K: = kelvins; kg: = kilograms; m: = meters; nm: = nanometers; ps: = picoseconds; and W: = watts.
Example 1 Example 2
Layer 1Layer 2Layer 3Layer 4Layer 1Layer 2Layer 3Layer 4
= 1 = 2 = 3 = 4 = 1 = 2 = 3 = 4
W ¯ 0.50.50.50.50.50.50.50.5
C 1111250320250320
τ q 11118.50.1368.50.136
τ T 2 4 / π 3 2 4 / π 2 + 1 / π 907.86907.86
k 1 / 2 1 / ( 2 1 ) 3 4 3 3159331593
Table 2. The spatial errors and convergence orders in L -norm with Δ t = 1 / 10 , 000 .
Table 2. The spatial errors and convergence orders in L -norm with Δ t = 1 / 10 , 000 .
m Δ x ErrorOrder
5 1 / 10 6.3566 × 10 3
10 1 / 20 1.7459 × 10 3 1.8643
20 1 / 40 4.4179 × 10 4 1.9825
401/80 1.0757 × 10 4 2.0381
80 1 / 160 2.7265 × 10 5 1.9802
Table 3. The temporal errors and convergence orders in L -norm with Δ x = 1 / 1000 .
Table 3. The temporal errors and convergence orders in L -norm with Δ x = 1 / 1000 .
N Δ t ErrorOrder
5 1 / 5 1.1784 × 10 2
10 1 / 10 6.4426 × 10 3 0.87111
20 1 / 20 3.4613 × 10 3 0.89633
40 1 / 40 1.7849 × 10 3 0.95547
80 1 / 80 9.0499 × 10 4 0.97987
160 1 / 160 4.5520 × 10 4 0.99140
320 1 / 320 2.2793 × 10 4 0.99791
Table 4. Values of τ q and τ T for comparison of a decrease in phase lag.
Table 4. Values of τ q and τ T for comparison of a decrease in phase lag.
GoldChromium
τ q τ T τ q τ T
DPL 8.5 9.0 × 10 1 1.36 × 10 1 7.86
D1 8.5 × 10 1 9.0 1.36 × 10 2 7.86 × 10 1
D2 8.5 × 10 2 9.0 × 10 1 1.36 × 10 3 7.86 × 10 2
D3 8.5 × 10 3 9.0 × 10 2 1.36 × 10 4 7.86 × 10 3
D4 8.5 × 10 4 9.0 × 10 3 1.36 × 10 5 7.86 × 10 4
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

Coronel, A.; Hess, I.; Huancas, F.; Chiroque, J. Numerical Solution of Mathematical Model of Heat Conduction in Multi-Layered Nanoscale Solids. Axioms 2025, 14, 105. https://doi.org/10.3390/axioms14020105

AMA Style

Coronel A, Hess I, Huancas F, Chiroque J. Numerical Solution of Mathematical Model of Heat Conduction in Multi-Layered Nanoscale Solids. Axioms. 2025; 14(2):105. https://doi.org/10.3390/axioms14020105

Chicago/Turabian Style

Coronel, Aníbal, Ian Hess, Fernando Huancas, and José Chiroque. 2025. "Numerical Solution of Mathematical Model of Heat Conduction in Multi-Layered Nanoscale Solids" Axioms 14, no. 2: 105. https://doi.org/10.3390/axioms14020105

APA Style

Coronel, A., Hess, I., Huancas, F., & Chiroque, J. (2025). Numerical Solution of Mathematical Model of Heat Conduction in Multi-Layered Nanoscale Solids. Axioms, 14(2), 105. https://doi.org/10.3390/axioms14020105

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