Next Article in Journal
Performance Analysis of Hybrid MTS/MTO Systems with Stochastic Demand and Production
Previous Article in Journal
Garch Model Test Using High-Frequency Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Accurate Approximation of the Two-Phase Stefan Problem with Coefficient Smoothing

by
Vasily Vasil’ev
1,† and
Maria Vasilyeva
1,2,*,†
1
Multiscale model reduction Laboratory, North-Eastern Federal University, 677007 Yakutsk, Russia
2
Institute for Scientific Computation, Texas A&M University, College Station, TX 78801, USA
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2020, 8(11), 1924; https://doi.org/10.3390/math8111924
Submission received: 19 October 2020 / Revised: 27 October 2020 / Accepted: 28 October 2020 / Published: 2 November 2020
(This article belongs to the Section Computational and Applied Mathematics)

Abstract

:
In this work, we consider the heat transfer problems with phase change. The mathematical model is described through a two-phase Stefan problem and defined in the whole domain that contains frozen and thawed subdomains. For the numerical solution of the problem, we present three schemes based on different smoothing of the sharp phase change interface. We propose the method using smooth coefficient approximation based on the analytical smoothing of discontinuous coefficients through an error function with a given smoothing interval. The second method is based on smoothing in one spatial interval (cell) and provides a minimal length of smoothing calculated automatically for the given values of temperatures on the mesh. The third scheme is a convenient scheme using a linear approximation of the coefficient on the smoothing interval. The results of the numerical computations on a model problem with an exact solution are presented for the one-dimensional formulation. The extension of the method is presented for the solution of the two-dimensional problem with numerical results.

1. Introduction

One of the urgent problems of mathematical physics is the Stefan problem, which describes heat transfer with a phase change of matter. An example of physical processes with phase transitions is the problem of melting ice with a movable boundary between water and ice, the problem of melting a solid with an unknown boundary between the solid and liquid phases, and the heat transfer processes in permafrost areas. The Stefan problem is an initial-boundary value problem of a parabolic differential equation with discontinuous coefficients on the phase change interfaces. The phase change occurs for a given value of temperature (freezing point), where the energy balance on the interface is written in the form of the Stefan condition and represented as a sharp interface (a moving-boundary problem).
In the numerical solution of the Stefan problem, a major difficulty is associated with the tracking of the phase change interface evolution. The enthalpy method was presented in [1,2,3,4], where the concept of effective heat capacity was introduced through various methods of smoothing of discontinuous coefficients. The general approach of thermodynamic functions was presented in [5], where an online application was implemented to generate the first-order derivatives of the thermodynamic parameters for a closed system. The substantiation of the correctness and numerical methods for solving various topical applied problems of the Stefan type were summarized in the review paper [6] and the monographs [7,8,9]. The relaxed linearization methods for the solution of the heat transfer problem using finite element approximation were presented in [4]. An efficient enthalpy-based numerical approach with a trust region minimization algorithm was introduced in [10] with various smoothing functions. In [11], the mathematical model with the separate evolution of the phase change interface from the heat equation was presented with XFEMapproximation.
In this work, we consider an enthalpy method with different types of smoothing functions. We propose a smooth coefficient approximation-based on the analytical smoothing of discontinuous coefficients using the error function with a given smoothing interval. We study a grid and time step convergence to examine the accuracy of the method for different lengths of smoothing intervals and compared to the regular linear smoothing. The novel method with smoothing in one spatial interval is proposed. The method provides a minimal length of smoothing that is calculated automatically for the given temperature values on the mesh. We start with the presentation of the methods for the one-dimensional formulation of the heat equation and perform convergence studies against the grid and time-step sizes, where we calculate the errors between analytical and numerical solutions using the proposed smoothing methods. Then, we generalize the methods for finite element approximations and present the results for two-dimensional model problems. Triangular elements are used, but the formulation can be extended for any type of element.
The paper is organized as follows. In Section 2, we describe the problem formulation. In Section 3, we consider the problem in the one-dimensional domain and present a finite difference approximation. In order to construct an approximation, we present three schemes with different smoothing of discontinuous coefficients, which reduces the Stefan problem to a quasilinear problem for a parabolic equation with smooth coefficients. The generalization of the presented schemes is given in Section 4, where we present the finite element approximation for one- and two-dimensional problems. Numerical results for the model problem are presented in Section 5 for one- and two-dimensional formulations, where we investigate the accuracy of the proposed schemes with different types of smoothing. For the one-dimensional problem, we compare the numerical results with the exact solution. A result of the two-dimensional problem is presented for two geometries. The paper ends with the Conclusion.

2. Stefan Problem

We consider the two-phase Stefan problem in the domain Ω . Let u ( x , t ) be an unknown function (temperature) and u * be a phase change temperature that occurs on the phase change interface ξ :
ξ = { x Ω ,   u ( x , t ) = u * } , Ω = Ω 1 Ω 2 , Ω 1 Ω 2 = ξ
where Ω 1 is a frozen zone and Ω 2 is a thawed zone:
Ω 1 ( t ) = { x Ω ,   u ( x , t ) < u * } , Ω 2 ( t ) = { x Ω ,   u ( x , t ) > u * } .
We have conductive heat transfer in Ω 1 and Ω 2 :
c 1 u 1 t · k 1 u 1 = 0 , x Ω 1 , t ( 0 , T ] , c 2 u 2 t · k 2 u 2 = 0 , x Ω 2 , t ( 0 , T ] .
On the phase change interface ξ , we have a continuous temperature and the jump of the heat flux, which is associated with the latent heat of fusion for water [1,2]:
u 1 = u 2 = u * , x ξ , ( k 1 u 1 k 2 u 2 , ξ ) = D d ξ d t , x ξ .
We write the system of Equations (1) and (2) as the two-phase Stefan problem in domain Ω :
c ( u ) + D δ ( u u * ) u t · k ( u ) u = 0 , x Ω , t ( 0 , T ] ,
where δ is the Dirac delta function:
δ ( u u * ) = d η ( u u * ) d u , η ( u u * ) = 1 , u u * , 0 , u < u * ,
and:
c ( u ) = c 1 ( u ) , u < u * , c 2 ( u ) , u > u * , k ( u ) = k 1 ( u ) , u < u * , k 2 ( u ) , u > q u * .
The coefficients of the equation depend on the function u ( x , t ) and have a discontinuity of the first kind at u ( x , t ) = u * .
The main difficulty in the presented problem is associated with dynamic tracking of the phase change interface. Since the δ coefficient of Equation (3) at u ( x , t ) = u * becomes infinity, a numerical solution of this equation is possible after smoothing the function η [1,2,10]. Let the phase change not occur instantaneously, but take place in a small temperature range (slushy zone). The discontinuous coefficients η of Equation (3) are replaced by bounded continuous (smooth) functions of temperature η ˜ ( u ) :
c ˜ ( u ) + D δ ˜ ( u u * ) u t · k ˜ ( u ) u = 0 , x Ω , t ( 0 , T ] ,
where:
c ˜ ( u ) = c 1 + η ˜ ( u ) ( c 2 c 1 ) , k ˜ ( u ) = k 1 + η ˜ ( u ) ( k 2 k 1 ) , δ ˜ = d η ˜ ( u ) d u .
The resulting Equation (4) is a quasilinear parabolic equation with positive, bounded, continuous (smooth) coefficients, which depends on the coefficient smoothing procedure.
We have the following initial condition:
u ( x , 0 ) = u 0 ( x ) , x Ω ,
and boundary conditions:
u = g ( t ) , x Γ 1 , t ( 0 , T ] , k ˜ ( u ) u n = 0 , x Γ 2 , t ( 0 , T ] ,
where Γ 1 Γ 2 = Ω .
Next, we present two novel approaches to the accurate approximation of the Stefan problem and consider a convenient approach with a linear approximation of the η function. First, we define a smooth approximation of coefficients using the error function and linear approximation. Then, we present a novel approach with smoothing in one spatial interval that provides a very accurate approximation of the problem and does not depend on the interval of a slushy zone, which is hard to define because it depends on the speed of phase change interface propagation and can vary in space and time.

3. Approximation of the One-Dimensional Problem

Let Ω be the one-dimensional computational domain ( Ω = [ 0 , L ] ) and T h be the uniform mesh:
T h = { x i = i h ,   i = 0 , 1 , , N ;   h = L / N } ,
where h is the mesh size. For the time approximation, we use an implicit scheme with linearization from the previous time layer, where t m = m τ for m = 0 , 1 , , M and τ = T / M is the time step size.
We have the following finite difference approximation of the problem (4)–(6) with smooth coefficients on the grid T h :
c ˜ i m 1 + D δ ˜ i m 1 u i m u i m 1 τ   h + q i + 0.5 m q i 0.5 m = 0 , m = 1 , 2 , , M ,
where:
q i + 0.5 m = k ˜ i + 0.5 m 1 u i + 1 m u i m h ,
for i = 1 , , N .
We consider the approximation (7) with the following initial conditions:
u i 0 = u 0 ( x i ) , i = 0 , , N .
Let Γ 1 and Γ 2 be the left and right boundaries, x = 0 and x = L . For the Dirichlet boundary condition on x = 0 , we have:
u i m = g ( t m ) , i = 0 .
For the Neumann boundary condition on x = L , we have:
q i + 0.5 m = 0 , i = N ,
for m = 1 , 2 , , M .

3.1. Smoothing on the Δ Interval

Let [ u * Δ , u * + Δ ] be the smoothing interval (slushy zone). For the coefficients of Equations (7) and (8), we have:
k ˜ i + 0.5 m = 2 ( k ˜ i + 1 m ) 1 + ( k ˜ i m ) 1 , k ˜ i m = k 1 + η ˜ i m ( k 2 k 1 ) , c ˜ i m = c 1 + η ˜ i m ( c 2 c 1 ) , δ ˜ i m = d η ˜ i m d u i m .
Note that, in this approximation, coefficients c ˜ i m , k ˜ i m are defined on the mesh nodes, and k ˜ i + 0.5 m is defined on the cell as the harmonic average of the values on nodes x i + 1 and x i .
In schemes with smoothing on the Δ interval, the coefficients η ˜ and δ ˜ are defined in each node of the mesh and calculated using the given value of function u i on current node x i :
η ˜ i m = η ˜ ( u i m ) , δ ˜ i m = δ ˜ ( u i m ) .
We consider the following smoothing of discontinuous coefficients and define smooth functions η ˜ as follows:
  • Smoothing on the Δ interval using the error function:
    η ˜ ( u ) = 1 2 1 + erf u u * 2 Δ , δ ˜ ( u ) = 1 2 π Δ exp ( u u * ) 2 2 Δ 2 .
  • Linear smoothing in the Δ interval:
    η ˜ ( u ) = 1 , u u * + Δ , ( u u * + Δ ) 2 Δ , u * Δ < u < u * + Δ , 0 , u u * Δ , δ ˜ ( u ) = 0 , u u * + Δ , 1 2 Δ , u * Δ < u < u * + Δ , 0 , u u * Δ .
We note that the accuracy of the presented schemes depends on the choice of the Δ parameter. If we choose a very large Δ interval, we overestimate the slushy zone interval and obtain large errors. In general, the parameter Δ should depend on the spatial and time meshes in approximation as the parameter highly depends on the speed of the freezing front propagation. Other methods of such procedures were proposed in [10], where exponential- or sinusoidal-based functions can be used to smooth function η ˜ on the Δ interval. In [1,2], the authors presented smoothing using polynomials of a given degree.

3.2. Smoothing in One Spatial Interval

In order to construct a scheme without the estimation of the smoothing interval parameter Δ , we present a novel method to an accurate approximation of the two-phase Stefan problem by choosing the minimal possible interval of the slushy zone for the current mesh.
Let a phase change occur on one spatial interval [ x i , x i + 1 ] if ( u i u * ) · ( u i + 1 u * ) < 0 . In this scheme, η ˜ and δ ˜ are defined on cell [ x i , x i + 1 ] and approximated using values of the functions u i and u i + 1 . For the coefficients of Equations (7) and (8), we have:
k ˜ i + 0.5 m = k 1 + η ˜ i + 0.5 m ( k 2 k 1 ) , c ˜ i m = c 1 , u i m < u * , c 2 , u i m u * , , δ ˜ i m = δ ˜ i 0.5 m + δ ˜ i + 0.5 m ,
where coefficient c ˜ i m is defined on each node x i and coefficients η ˜ i + 0.5 m and δ ˜ i + 0.5 m are calculated taking into account the presence or absence of the phase change interface in the temperature interval [ u i , u i + 1 ] .
For the accurate approximation of the two-phase Stefan problem, we present a smoothing in one spatial interval:
η ˜ i + 0.5 = 1 , u i u *   and   u i + 1 u * , ( u i + 1 u * ) / ( u i + 1 u i ) , u i < u *   and   u i + 1 > u * , ( u i u * ) / ( u i u i + 1 ) , u i > u *   and   u i + 1 < u * , 0 , u i < u *   and   u i + 1 < u * , ,
δ ˜ i + 0.5 = 0 , u i u *   and   u i + 1 u * , ( u i + 1 u * ) / ( u i + 1 u i ) 2 , u i < u *   and   u i + 1 > u * , ( u i + 1 u * ) / ( u i u i + 1 ) 2 , u i > u *   and   u i + 1 < u * , 0 , u i < u *   and   u i + 1 < u * .
At the calculation of the phase change interface position, we use a linear interpolation of the desired function within the indicated temperature interval. Further, we determine the value of the corresponding coefficient for the difference equation.

4. Generalization of Methods for Finite Element Approximation

In this section, we generalize the presented algorithm for the solution of the two-dimensional problems on unstructured meshes [12]. We use a finite element method and set:
V = { v H ( Ω ) :   v = g 1   on   Γ 1 } , V = { v H ( Ω ) :   v = 0   on   Γ 1 } .
For the heat problem (4)–(6), we have the following variational formulation of the problem: find u m V such that:
s ( u m u m 1 , v ) + a ( u m , v ) = 0 , v V ,
where:
s ( u m , v ) = 1 τ Ω c ˜ m 1 + D δ ˜ m 1 u m   v   d x , a ( u m , v ) = Ω k ˜ m 1 u m · v   d x .
Let T h be the mesh for the domain Ω :
T h = i K i , i = 1 , N c ,
where N c is the number of grid cells.
We replace the space V by a finite dimensional subspace V h , V h V . We suppose that space V h is composed of piecewise linear basis functions ϕ i on the grid cell, i = 1 , N and N = dim ( V h ) is the number of nodes (vertices) for linear basis functions. We have the following decomposition of u h in the basis of V h :
u h ( x , t m ) = j = 1 N u j m ϕ j ( x ) .
Problem (18) is replaced by the following discrete problem:
j = 1 N u j m s ( ϕ j , ϕ i ) + a ( ϕ j , ϕ i ) = l ( ϕ i ) , i = 1 , N ,
where l ( ϕ i ) = s ( u h m 1 , ϕ i )
We have the following discrete system in the matrix form for U = ( u 1 , , u N ) T :
( S m 1 + A m 1 ) U m = F m 1 ,
where S m and A m are global mass and stiffness matrices:
S m = i = 1 N c S m , i , A m = i = 1 N c A m , i , F m = S m U m .
Here, S m , i and A m , i are local matrices in cell K i :
A m , i = { A l j K i } , A l j K i = a K i ( ϕ l , ϕ j ) = K i k ˜ m 1 ϕ l · ϕ j   d x ,
S m , i = { S l j K i } , S l j K i = s K i ( ϕ l , ϕ j ) = K i c ˜ m 1 + D δ ˜ m 1 ϕ l   ϕ j   d x ,
where:
c ˜ ( u ) = c 1 + η ˜ ( u ) ( c 2 c 1 ) , k ˜ ( u ) = k 1 + η ˜ ( u ) ( k 2 k 1 ) , δ ˜ = d η ˜ ( u ) d u .
In order to obtain a similar form of discrete system as in the previous section with finite difference approximation, we suppose that coefficient k ˜ i is defined in each cell ( i = 1 , , N c ) and coefficient c ˜ j is defined on mesh node ( j = 1 , , N ). We use a trapezoidal integration to obtain a diagonal mass matrix.

4.1. Smoothing on the Δ Interval

Similarly to the previous section, η ˜ and δ ˜ are defined in each node of the mesh and calculated using the given value of function u i on current node x i :
η ˜ i m = η ˜ ( u i m ) , δ ˜ i m = δ ˜ ( u i m ) ,
with the following approximations:
  • Smoothing on the Δ interval using the error function:
    η ˜ ( u ) = 1 2 1 + erf u u * 2 Δ , δ ˜ ( u ) = 1 2 π Δ exp ( u u * ) 2 2 Δ 2 .
  • Linear smoothing on the Δ interval:
    η ˜ ( u ) = 1 , u u * + Δ , ( u u * + Δ ) 2 Δ , u * Δ < u < u * + Δ , 0 , u u * Δ , δ ˜ ( u ) = 0 , u u * + Δ , 1 2 Δ , u * Δ < u < u * + Δ , 0 , u u * Δ .
Let n K be the number of vertices in cell K, where n K = 2 for the one-dimensional problem and n K = 3 for the two-dimensional problem with triangular cells. For the stiffness matrix, we have:
A l j K i = k ˜ K i m 1 K i ϕ l · ϕ j   d x ,
where:
k ˜ K i m = n K j = 1 n K ( k ˜ j m ) 1 , k ˜ j m = k 1 + η ˜ j m ( k 2 k 1 ) .
For the mass matrix with trapezoidal integration, we have:
S j j K i = | K i | n K c ˜ j m 1 + D δ ˜ j m 1 , S l j K i = 0 ,   for   l j ,
where:
c ˜ j m = c 1 + η ˜ j m ( c 2 c 1 ) .
Here, coefficients c ˜ j m , k ˜ j m are defined on the mesh nodes, and k ˜ K i m is defined on the cell as the harmonic average of the values on the cell nodes.

4.2. Smoothing in One Mesh Cell

Similar to smoothing in one spatial interval for the one-dimensional problem, we construct smoothing in one cell of the grid for the general case, where a cell can be of any shape (interval, triangle, tetrahedron, quadrilateral, etc.).
Let a phase change occur on one mesh cell K i if ( u i u * ) · ( u j u * ) < 0 for i , j = 1 , , n K ( n K is the number of vertices of mesh cell). We define η ˜ and δ ˜ on cell K i using a similar approximation by the values of the function u j K i in cell K i ( j = 1 , , n K ). For the stiffness matrix, we have:
A l j K i = k ˜ K i m 1 K i ϕ l · ϕ j   d x
with:
k ˜ K i m = k 1 + η ˜ K i m ( k 2 k 1 ) ,
For the mass matrix, we have:
S j j K i = | K i | n K   c ˜ j m 1 + | K i |   D   δ ˜ K i , j m 1 , S l j K i = 0 ,   for   l j ,
with:
c ˜ j m = c 1 , u j K i , m < u * , c 2 , u j K i , m u * , δ ˜ K i , j m = d η ˜ K i m d u j K i , m .
where u j K i , m is the value of function u on node j in cell K i and j , l = 1 , , n v . Here, c ˜ j K i , m is defined on mesh vertex j in cell K i using the corresponding value of function u, and k ˜ K i m is defined on cell K i . The coefficient η ˜ K i m is calculated by taking into account the presence or absence of the phase change interface in cell K i .
For the one-dimensional problem with n K = 2 , we have cell K i = [ x i , x i + 1 ] with | K i | = x i + 1 x i = h and u i = u 1 K i , u i + 1 = u 2 K i . Therefore, we have:
η ˜ K i = 1 , u 1 K i u *   and   u 2 K i u * , ( u 2 K i u * ) / ( u 2 K i u 1 K i ) , u 1 K i < u *   and   u 2 K i > u * , ( u 1 K i u * ) / ( u 1 K i u 2 K i ) , u 1 K i > u *   and   u 2 K i < u * , 0 , u 1 K i < u *   and   u 2 K i < u * ,
δ ˜ K i , 1 = 0 , u 1 K i u *   and   u 2 K i u * , ( u 2 K i u * ) / ( u 2 K i u 1 K i ) 2 , u 1 K i < u *   and   u 2 K i > u * , ( u 2 K i u * ) / ( u 1 K i u 2 K i ) 2 , u 1 K i > u *   and   u 2 K i < u * , 0 , u 1 K i < u *   and   u 2 K i < u * ,
δ ˜ K i , 2 = 0 , u 1 K i u *   and   u 2 K i u * , ( u 1 K i u * ) / ( u 2 K i u 1 K i ) 2 , u 1 K i < u *   and   u 2 K i > u * , ( u 1 K i u * ) / ( u 1 K i u 2 K i ) 2 , u 1 K i > u *   and   u 2 K i < u * , 0 , u 1 K i < u *   and   u 2 K i < u * .
Note that this approximation is equal to the smoothing presented in the previous section for the one-dimensional formulation using the finite-difference method.
Before the generalization of the smoothing in one mesh cell, we present a brief explanation of the concept that we used in this method. Let V + K i and V K i be the volume of thawed and frozen zones in cell K i , V K i = | K i | the volume of the cell, and V K i = V + K i + V K i . The coefficient η is the unfrozen water concentration that can be represented as a fraction of the thawed zone from the cell volume:
η ˜ K i = V + K i V K i ,
where V + K i = V K i for u j K i u * , j = 1 , , n v ( η ˜ = 1 ) and V + K i = 0 for u j K i < u * , j = 1 , , n v ( η ˜ = 0 ). In order to calculate the volume of the thawed zone in mesh cell V + K i , we use a linear approximation of the temperature in cell.
In the one-dimensional case, we have:
u ( x ) = u 1 ϕ 1 ( x ) + u 2 ϕ 2 ( x ) ,
where:
ϕ 1 ( x ) = x 1 x x 2 x 1 , ϕ 2 ( x ) = x x 1 x 2 x 1 .
Therefore, the location of the phase change interface in cell K i is the following (see Figure 1):
x * = x 1 + ( x 2 x 1 ) u * u 1 u 2 u 1 ,
and therefore, we obtain:
η ˜ K i = x * x 1 x 2 x 1 = u 1 u * u 1 u 2   for   u 1 > u 2 ,
η ˜ K i = 1 x * x 1 x 2 x 1 = 1 u * u 1 u 2 u 1 = u 2 u * u 2 u 1   for   u 2 > u 1 ,
for the one-dimensional problem when the phase change occurs in cell K i , ( u i u * ) · ( u 2 u * ) < 0 . In the approximation construction for the two-dimensional case, we use a similar approach, where we find an interface position on each edge between two nodes and use it to calculate a fraction of the unfrozen zone in cell K i . For example, for the case with u 1 > u * , u 2 < u * , and u 3 < u * (see Figure 1), we have:
η ˜ K i = V + K i V K i = u 1 u * u 1 u 2 u 1 u * u 1 u 3 ,
where the unfrozen zone volume and the volume of the cell are calculated as the area of corresponding triangles. Approximations of the η ˜ for other cases can be calculated in a similar way. In Figure 1, we present an illustration of thawed and frozen zones on mesh cell K i .
Finally, for the two-dimensional formulation with triangular cells, we have:
η ˜ K i = 1 , u 1 u * ,   u 2 u * ,   u 3 u * , u 1 u * u 1 u 2 u 1 u * u 1 u 3 , u 1 u * ,   u 2 < u * ,   u 3 < u * , 1 u 1 u * u 1 u 2 u 1 u * u 1 u 3 , u 1 < u * ,   u 2 u * ,   u 3 u * , u 3 u * u 3 u 1 u 3 u * u 3 u 2 , u 1 < u * ,   u 2 < u * ,   u 3 u * , 1 u 3 u * u 3 u 1 u 3 u * u 3 u 2 , u 1 u * ,   u 2 u * ,   u 3 < u * , u 2 u * u 2 u 1 u 2 u * u 2 u 3 , u 1 < u * ,   u 2 u * ,   u 3 < u * , 1 u 2 u * u 2 u 1 u 2 u * u 2 u 3 , u 1 u * ,   u 2 < u * ,   u 3 u * , 0 , u 1 < u * ,   u 2 < u * ,   u 3 < u * ,
δ ˜ K i , 1 = 0 , u 1 u * ,   u 2 u * ,   u 3 u * , ( u 2 u * ) ( u 2 u 1 ) 2 u 1 u * u 3 u 1 + u 2 u * u 2 u 1 ( u 1 u * ) ( u 3 u 1 ) 2 , u 1 u * ,   u 2 < u * ,   u 3 < u * , ( u 2 u * ) ( u 2 u 1 ) 2 u 1 u * u 3 u 1 u 2 u * u 2 u 1 ( u 1 u * ) ( u 3 u 1 ) 2 , u 1 < u * ,   u 2 u * ,   u 3 u * , u 3 u * ( u 3 u 1 ) 2 u 3 u * u 3 u 2 , u 1 < u * ,   u 2 < u * ,   u 3 u * , ( u 3 u * ) ( u 3 u 1 ) 2 u 3 u * u 3 u 2 , u 1 u * ,   u 2 u * ,   u 3 < u * , ( u 2 u * ) ( u 2 u 1 ) 2 u 2 u * u 2 u 3 , u 1 < u * ,   u 2 u * ,   u 3 < u * , ( u 2 u * ) ( u 2 u 1 ) 2 u 2 u * u 2 u 3 , u 1 u * ,   u 2 < u * ,   u 3 u * , 0 , u 1 < u * ,   u 2 < u * ,   u 3 < u * .
Here, the values of δ ˜ K i , 2 and δ ˜ K i , 3 are calculated in a similar way. The presented method can be extended to other types of elements.
We obtained an approximation of unfrozen water concentration with one mesh cell as a function of cell temperatures on nodes. The proposed methods work with unstructured meshes that can handle complex computational domains.

5. Numerical Results

We present the results for the proposed difference schemes on one- and two-dimensional examples. We solve the two-phase Stefan problem, which serves as a mathematical model for the pore water freezing/thawing process with input data specified in the international SI system:
k 1 = 2.21   W / ( m · K ) , k 2 = 0.59   W / ( m · K ) ,
c 1 = 1.89 × 10 6   J / ( m 3 · K ) , c 2 = 4.12 × 10 6   J / ( m 3 · K ) ,
D = 3.33 × 10 8   J / ( m 3 · K ) .
The phase change temperature is u * = 0   C. In the calculations, we use a linearized difference scheme, where nonlinear coefficients are calculated using a solution from the previous time layer.
We present numerical results for the three scheme:
  • erf-smoothing: the scheme with smoothing using the error function on the Δ interval.
  • delta-smoothing: the scheme with linear smoothing on the Δ interval.
  • h-smoothing: the scheme with smoothing in one spatial interval (mesh cell).
The first and third approximations are based on the definition of a slushy zone interval with parameter Δ .

5.1. One-Dimensional Problem

The computational domain size L = 8   m . We simulate for T = 10 7   s with initial condition:
u 0 ( x ) = u 0 , t = 0 , x [ 0 , L ] ,
with u 0 = 5   C.
The boundary conditions are the following:
u ( 0 , t ) = g , u x ( L , t ) = 0 , t > 0 ,
where we consider two test cases with g = 5   C and g = 15   C.
For a one-dimensional problem, an exact solution of the two-phase Stefan problem is defined using the phase change interface location ξ = ξ ( t ) :
ξ = γ t ,
where γ is the coefficient of proportionality (m/s 0.5 ).
The exact solution has the following form [13]:
u ( x , t ) = g erf ξ 2 a 1 t erf x 2 a 1 t / erf ξ 2 a 1 t , x ξ ( t ) , u 0 erf x 2 a 2 t erf ξ 2 a 2 t / 1 erf ξ 2 a 2 t , x < ξ ( t ) .
Using a phase change interface condition (2), we find γ as the root of the transcendental equation:
k 1 a 1 g exp γ 2 a 1 2 erf γ 2 a 1 + k 2 a 2 u 0 exp γ 2 a 2 2 1 erf γ 2 a 2 + γ D π 2 = 0 ,
where a 1 = k 1 / c 1 ,   a 2 = k 2 / c 2 , and erf is the error function [13,14,15,16]. The value of γ is calculated using the iterative secant method with the accuracy of ϵ < 10 12 . We have γ = 0.00023897230346 for g = 5 and γ = 0.0004188066281859222 for g = 15 .
In Figure 2, we present exact and numerical solutions at the final time T = 10 7   s 115 days and a phase change interface location ξ ( t ) . We present the results of the numerical solution of the problem using three types of smoothing. Numerical calculations were performed with n = 200 (mesh by space) and m = 200 for the time approximation. We consider the case with g = 5   C and g = 15   C. The smoothing parameter is chosen constant Δ = 0.3 throughout the entire computation time t ( 0 , T ] . In the left figure, a solution at the final time is presented, where we see that the first derivative of the function has a discontinuity of the first kind with respect to spatial variable x at u = u * , which agrees with the Stefan condition. In the right figure, we depict a phase change interface location by time. In numerical calculations, the phase change interface is found through the linear interpolation method in the interval, where the sought function has different signs at the ends ( u i m · u i + 1 m ) < 0 . We observe that the numerical solution both for the temperature at the final time and for the phase change interface location is accurate for smoothing using error functions (erf-smoothing) and for smoothing in one spatial interval (h-smoothing). We note that the novel method based on smoothing in one spatial interval is more accurate than the scheme with approximation using the Δ parameter, that is, in general, it should be carefully chosen for each test case and depends on the mesh size, number of time steps, and speed of the phase change interface propagation.
Next, we investigate the influence of the mesh size and the number of time steps on the accuracy of the presented methods. We consider n = 25 , 50 , 100 , 200 for the spatial mesh and m = 50 , 100 , 200 for the time approximation. We perform simulations and calculate errors for two smoothing parameters Δ = 0.3 and Δ = 0.6 in the erf-smoothing and delta-smoothing methods. We calculate the relative L 2 errors for a solution and phase change interface:
e e ( u T ) = i ( y i ( T ) u ( x i , T ) ) 2 i u ( x i , T ) 2 × 100 % , e f ( u T ) = i ( y i ( T ) u ˜ i ( T ) ) 2 i ( u ˜ i ( T ) ) 2 × 100 % ,
e e ( γ ) = j ( ξ j ξ e ( t j ) ) 2 j ξ e ( t j ) 2 × 100 % , e f ( γ ) = j ( ξ j ξ f ( t j ) ) 2 j ξ f ( t j ) 2 × 100 % ,
where y , ξ are the numerical solutions, u ( x , t ) , ξ e ( t ) are the exact solutions, and u ˜ , ξ f are the solutions on the very fine grid with n = m = 800 .
In Table 1, Table 2 and Table 3, we present the relative errors for the three methods: erf-smoothing, h-smoothing, and linear delta-smoothing. We present relative errors in % and investigate the influence of the boundary condition, smoothing interval Δ , and the space and time mesh parameters on the accuracy of the numerical solution. In Table 1, the relative errors for the scheme with smoothing using an error function are presented (erf-smoothing) for Δ = 0.3 and Δ = 0.6 , where errors for g = 5 are presented on the left and for g = 15 presented on the right. In Table 2, the results for the scheme with smoothing in one spatial interval (h-smoothing) are presented. Relative errors for the scheme with linear smoothing on the Δ interval are presented in Table 3 (h-smoothing) for Δ = 0.3 and Δ = 0.6 . From the errors between the exact and numerical solutions ( e e ( u T ) and e e ( γ ) ), we observe that the erf-smoothing and linear delta-smoothing methods are highly dependent on parameter Δ . The error decreases along with the spatial mesh refining as the number of time layers increases.
The errors between a very fine grid solution ( m = n = 800 ) and a numerical solution for different parameters m and n ( e f ( u T ) and e f ( γ ) ) demonstrate the convergence of the solution depending on m and n. We observe that for the coarse parameters m and n, we can obtain results with a large error. For example, we have e f ( u T ) = 25 % and e f ( γ ) = 70 % for Δ = 0.3 , g = 15 , and m = n = 50 for the erf-smoothing method. For larger Δ , we can obtain more stable results. However, for a finer mesh and more time steps, the parameter Δ = 0.6 is too large to obtain good approximation. For example, we have e f ( u T ) = 3 % for Δ = 0.6 and e f ( u T ) = 1 % for Δ = 0.3 in the test problem with g = 5 and m = n = 200 . A new method with smoothing in one spatial interval (h-smoothing) does not have parameter Δ and provides very good results with small errors and convergence depending on parameters m and n. This method automatically determines a sufficient smoothing parameter.
A graphical illustration of the errors from Table 1, Table 2 and Table 3 for the presented methods is shown in Figure 3 and Figure 4. We depict errors for m = 100 and m = 200 with different spatial mesh parameters n and Δ . The h-smoothing scheme provides accurate results on a coarse spatial grid at large time steps. We observe that the erf-smoothing method is less sensitive to the parameter Δ and provides sufficiently good results with a good choice of the parameter Δ . By comparing the results for g = 5 and g = 15 in Figure 3 and Figure 4, we see that for a larger temperature gradient, we obtain worse results. In the erf-smoothing and delta-smoothing methods, we should use a finer mesh and more time steps for better approximation with a good choice of parameter Δ . The scheme with smoothing in one spatial interval provides an accurate numerical solution with the minimal smoothing interval, which is different in each spatial interval and time layer.

5.2. Two-Dimensional Problem

In this section, we present numerical results for a two-dimensional heat problem. We consider the two-phase Stefan problem with similar parameters as in the previous section. We consider computational domain Ω = [ L 1 × L 2 ] with size L 1 = L 2 = 2   m and simulate for T = 10 6   s with initial condition u 0 = 5   C. As boundary conditions, we set g = 5   C and g = 15   C for x Γ 1 = { x Ω : x = 0 ,   y = 0 } and zero flux on other boundaries, Ω / Γ 1 . The computational mesh is uniform with triangular cells with size n = n 1 × n 2 . Numerical calculations are performed with m = 200 for the time approximation. We present the results of the numerical solution of the problem using three types of smoothing schemes for n = n 1 × n 2 , n 1 = n 2 = 25 , 50 , 100 , and 100.
We calculate relative L 2 errors for the solution at the final time:
e e ( u T ) = i ( y i ( T ) u f , h s ( x i , T ) ) 2 i u f , h s ( x i , T ) 2 , e f ( u T ) = i ( y i ( T ) u ˜ i ( T ) ) 2 i ( u ˜ i ( T ) ) 2 ,
where y is the numerical solution and u ˜ is the solution on the fine grid with n = m = 400 using the current method. Here, for u f , h s ( x , T ) , we use a reference solution with the h-smoothing method. We compare the results with h-smoothing to show that this method provides an accurate solution and does not depend on the parameter Δ as in the previous examples for the one-dimensional problem.
In Figure 5, we present the numerical solution at the final time for g = 5   C and g = 15   C. In the left figure, we depict a temperature field at the final time with an isotherm of u = u * (phase change interface). In the right figure, we show a solution on line x 1 = x 2 , where the line is depicted in yellow color in the left figure. The phase change interface at the final time is depicted for three types of smoothing and indicated in different colors. Here, we use a similar color in the right figure to plot the temperature along the line x 1 = x 2 . Numerical calculations are performed with n = 200 (mesh by space) and m = 200 for the time approximation. The smoothing parameter is chosen as constant Δ = 0.3 .
In Table 4, Table 5 and Table 6, we investigate the influence of the mesh size (n) on the accuracy of the presented methods. Time step number m is fixed, m = 200 . We consider n = 25 , 50 , 100 , 200 for the spatial mesh. In Table 4, we present the relative errors for the erf-smoothing scheme with Δ = 0.15 , 0.3 , and 0.6 . In the left table, we present the errors for boundary condition g = 5 . The table at the right demonstrates the results for g = 15 . We present relative errors in % and investigate the influence of mesh size on the accuracy of the numerical solution. In Table 5, the results for the h-smoothing scheme are presented for g = 5 and 15 . Relative errors for delta-smoothing are shown in Table 6. The first error e e ( u T ) is an error between the current solution and a reference solution using the h-smoothing scheme on mesh m = n = 400 . We observe that in order to obtain good results using the erf-smoothing scheme, we should take smaller Δ for g 5 than for the test case with g = 15 . For example, we have 6.5 % of the error for Δ = 0.6 and 1.2 % of the error for Δ = 0.15 in the test case with g = 5 . Table 6 shows the optimal value of Δ = 0.3 for g = 5 and Δ = 0.6 for g = 15 . For the h-smoothing scheme with smoothing in one spatial interval, we obtain good results for both test cases with g = 5 and g = 15 .
The second error e f ( u T ) illustrates the convergence of the solution with increasing mesh parameters m and n to the reference solution on the fine grid m = n = 400 using the corresponding method. We observe that both errors e f ( u T ) and e e ( u T ) are sensitive to the size of the mesh, where we obtain a large error for a very coarse grid n 1 = n 2 = 25 . We obtain accurate results for n = 50 , 100 , and 100 using the h-smoothing method.

5.3. Geometry with an Unstructured Grid

The main advantage of the finite element method is that it provides the possibility of problem solving in complex geometries using the construction of the unstructured mesh with triangular elements.
We consider the computational domain with size L 1 = 6   m with a rough boundary and two circle perforations. In Figure 6, we depict the computational domain and unstructured mesh. In the left figure, we present the computational domain. The unstructured grid with triangular elements is presented in the right figure. We depict a rough top boundary Γ 1 in green color, where we set the Dirichlet boundary conditions:
u ( x , t ) = g , x Γ 1 .
Similar to the previous results, we consider g = 5 and g = 15 . On the circle perforation, we set the Robin-type boundary conditions:
k u x ( x , t ) = α ( u g 1 ) , x Γ t 1 , k u x ( x , t ) = α ( u g 2 ) , x Γ t 2 ,
where we set α = 20 . In Figure 6, the first circle is indicated in red color with g 1 = 10 , and the second circle is indicated in orange color with g 2 = 15 . Circle perforations illustrate a pipe influence to the temperature distribution. The pipes contain fluid with temperature g 1 (first) and g 2 (second) with heat transfer parameter α . The radius of the first circle is r 1 = 0.1 , and the radius of the second one is r 2 = 0.2 . On other boundaries (blue color), we set the Neumann boundary condition:
k u x ( x , t ) = 0 , x Ω / ( Γ 1 Γ t 1 Γ t 1 .
We simulate for T = 10 6   s with initial condition u 0 = 2   C. A computational mesh is fixed and contains n vertices, n = 18,242.
The numerical solution at the final time for g = 5   C and g = 15   C is presented in Figure 7 and Figure 8, respectively. In the left figure, we depict the temperature field at the final time with the isotherm of u = u * (phase change interface). In the right figure, we show the solution on lines x 1 = 2.5 (line position is indicated in yellow color in the left figure) and x 1 = 4.2 (orange color in the left figure). The phase change interface at the final time is depicted for three types of smoothing in different colors in the left figure, and we use a similar color in the right figure to plot the temperature along lines. Numerical calculations are performed for Δ = 0.3 with m = 200 for the time approximation.
We calculate similar errors for the solution at the final time ( e e ( u T ) and e f ( u T ) ). The error e f ( u T ) is calculated using the solution with m = 400 using the current method. The error e f ( u T ) is calculated using the reference solution with the h-smoothing method. In Table 7, Table 8 and Table 9, we investigate the influence of the number of time steps m and Δ on the accuracy of the presented methods. We consider m = 50 , 100 , 200 and Δ = 0.15 , 0.3 , 0.6 .
In Table 7, we present relative errors for the erf-smoothing scheme with Δ = 0.15 , 0.3 , and 0.6 . In the left table, we present errors for boundary condition g = 5 . In the right table, results for g = 15 are shown. In Table 8, the results for the h-smoothing scheme are presented for g = 5 and 15 . The relative errors for delta-smoothing are shown in Table 9 for different values of m and Δ . We observe good results for the erf-smoothing scheme, when we take Δ = 0.15 for g = 5 and Δ = 0.3 for g = 15 . In the delta-smoothing scheme, we have good results for Δ = 0.3 for g = 5 and g = 15 . We obtain an accurate solution for the scheme with h-smoothing for m = 50 , 100 , and 200 for g = 5 with less then one percent of error. The scheme with h-smoothing works very well for g = 15 with less than one percent for m = 200 .
We present and investigate three schemes: smoothing on the Δ interval using the error function (erf-smoothing), linear smoothing on the Δ interval (delta-smoothing), and smoothing in one mesh cell (h-smoothing). The first algorithm (erf-smoothing) is based on the analytical spreading of the point source function and smoothing of discontinuous coefficients. The algorithm with smoothing in one mesh cell (h-smoothing) provides a minimal length of the smoothing interval that is calculated automatically for the given temperature values on the mesh at a given time layer. The third scheme (delta-smoothing) is a convenient scheme based on smoothing using linear approximation on the Δ interval. We study the proposed schemes on one-dimensional and two-dimensional model problems. We consider a problem with two values of the boundary conditions on different spatial and time meshes. We present errors for the methods with smoothing on the Δ interval for different values of the smoothing interval parameter Δ , which is fixed and given as a constant value. Numerical results show that the smoothing scheme with the minimal smoothing interval shows its computational efficiency and provides good results.

6. Conclusions

In this work, we consider the two-phase Stefan problem, which describes the heat transfer problems with phase change. In a two-phase formulation, the mathematical model is defined in the whole domain, which contains frozen and thawed zones.
The main problem is associated with the sharp phase change interface. For the numerical solution of the problem, we present and investigate schemes with smoothing in one spatial interval (cell) and smoothing on the Δ interval using the linear function and the error function. We observe that smoothing with the error function provides better results with smaller errors than linear smoothing on the Δ interval. However, the novel smoothing on one spatial interval (cell) gives better results, does not depend on the parameter Δ , and can automatically smooth the coefficient in one mesh cell. We generalize the presented methods for the two-dimensional formulation of the problem and present results for two geometries with structured and unstructured meshes.

Author Contributions

Methodology: V.V., M.V.; investigation: M.V. All authors read and agreed to the published version of the manuscript.

Funding

The work is supported by the mega-grant of the Russian Federation Government N14.Y26.31.0013 and RSF N19-11-00230.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Samarsky, A.; Moiseenko, B. Economical shock-capturing scheme for multidimensional Stefan problems. Comput. Math. Math. Phys. 1965, 5, 816–827. [Google Scholar]
  2. Budak, B.M.; Sobol’eva, E.; Uspenskii, A.B. A difference method with coefficient smoothing for the solution of Stefan problems. USSR Comput. Math. Math. Phys. 1965, 5, 59–76. [Google Scholar] [CrossRef]
  3. Morgan, K.; Lewis, R.; Zienkiewicz, O. An improved algrorithm for heat conduction problems with phase change. Int. J. Numer. Methods Eng. 1978, 12, 1191–1195. [Google Scholar] [CrossRef]
  4. Nedjar, B. An enthalpy-based finite element method for nonlinear heat problems involving phase change. Comput. Struct. 2002, 80, 9–21. [Google Scholar] [CrossRef]
  5. Jäntschi, L.; Bolboacă, S.D. First order derivatives of thermodynamic functions under assumption of no chemical changes revisited. J. Comput. Sci. 2014, 5, 597–602. [Google Scholar] [CrossRef]
  6. Danilyuk, I. On the Stefan problem. Russ. Math. Surv. 1985, 40, 157. [Google Scholar] [CrossRef]
  7. Vasil’ev, V. Numerical Integration of Differential Equations with Nonlocal Boundary Conditions. Yakutsk. Fil. Sib. Otd. Akad. Nauk. SSSR Yakutsk. 1985. [Google Scholar]
  8. Vasil’ev, V.; Maksimov, A.; Petrov, E.; Tsypkin, G. Heat and mass transfer in freezing and thawing soils. Nauk. Fizmatlib M 1996. [Google Scholar]
  9. Samarskii, A.A.; Vabishchevich, P.N. Computational Heat Transfer; Wiley: Hoboken, NJ, USA, 1995. [Google Scholar]
  10. Amiri, E.A.; Craig, J.R.; Hirmand, M.R. A trust region approach for numerical modeling of non-isothermal phase change. Comput. Geosci. 2019, 23, 911–923. [Google Scholar] [CrossRef]
  11. Chessa, J.; Smolinski, P.; Belytschko, T. The extended finite element method (XFEM) for solidification problems. Int. J. Numer. Methods Eng. 2002, 53, 1959–1977. [Google Scholar] [CrossRef]
  12. Vasilyeva, M.; Stepanov, S.; Spiridonov, D.; Vasil’ev, V. Multiscale Finite Element Method for heat transfer problem during artificial ground freezing. J. Comput. Appl. Math. 2020, 371, 112605. [Google Scholar] [CrossRef]
  13. Tikhonov, A.N.; Samarskii, A.A. Equations of Mathematical Physics; Courier Corporation: North Chelmsford, MA, USA, 2013. [Google Scholar]
  14. Neumann, F. Lectures Given in the 1860’s. Die Partiellen Differential-Gleichungen der Mthematischen Physik; 1912; Volume 2, pp. 17–121. [Google Scholar]
  15. Lunardini, V.J. Heat Transfer with Freezing and Thawing; Elsevier: Amsterdam, The Netherlands, 1991. [Google Scholar]
  16. Kurylyk, B.L.; McKenzie, J.M.; MacQuarrie, K.T.; Voss, C.I. Analytical solutions for benchmarking cold regions subsurface water flow and energy transport models: One-dimensional soil thaw with conduction and advection. Adv. Water Resour. 2014, 70, 172–184. [Google Scholar] [CrossRef]
Figure 1. Illustration of unfrozen water concentration η in mesh cell K i . Left: one-dimensional formulation (1D). Right: two-dimensional formulation (2D).
Figure 1. Illustration of unfrozen water concentration η in mesh cell K i . Left: one-dimensional formulation (1D). Right: two-dimensional formulation (2D).
Mathematics 08 01924 g001
Figure 2. One-dimensional problem. Exact solution (black color). Numerical solutions using error function (erf) smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing in the Δ interval (green color). Left: solution at the final time. Right: phase change interface location.
Figure 2. One-dimensional problem. Exact solution (black color). Numerical solutions using error function (erf) smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing in the Δ interval (green color). Left: solution at the final time. Right: phase change interface location.
Mathematics 08 01924 g002
Figure 3. One-dimensional problem. Boundary conditions g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Solid line for m = 200 and dashed line for m = 100 . Left: relative L 2 errors for the solution at the final time. Right: relative L 2 errors for the phase change interface location.
Figure 3. One-dimensional problem. Boundary conditions g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Solid line for m = 200 and dashed line for m = 100 . Left: relative L 2 errors for the solution at the final time. Right: relative L 2 errors for the phase change interface location.
Mathematics 08 01924 g003
Figure 4. One-dimensional problem. Boundary conditions g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Solid line for m = 200 and dashed line for m = 100 . Left: relative L 2 errors for the solution at the final time. Right: relative L 2 errors for the phase change interface location.
Figure 4. One-dimensional problem. Boundary conditions g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Solid line for m = 200 and dashed line for m = 100 . Left: relative L 2 errors for the solution at the final time. Right: relative L 2 errors for the phase change interface location.
Mathematics 08 01924 g004
Figure 5. Two-dimensional problem. Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Left: solution at the final time. Right: solution on line x 1 = x 2 at the final time.
Figure 5. Two-dimensional problem. Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Left: solution at the final time. Right: solution on line x 1 = x 2 at the final time.
Mathematics 08 01924 g005
Figure 6. Geometry with unstructured grid. Left: computational domain (gray color), top boundary (green), circle one (red), and circle two (orange). Right: unstructured mesh with triangular elements.
Figure 6. Geometry with unstructured grid. Left: computational domain (gray color), top boundary (green), circle one (red), and circle two (orange). Right: unstructured mesh with triangular elements.
Mathematics 08 01924 g006
Figure 7. Geometry with the unstructured grid for g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Yellow line: x 1 = 2.5 . Orange line: x 1 = 4.2 .
Figure 7. Geometry with the unstructured grid for g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Yellow line: x 1 = 2.5 . Orange line: x 1 = 4.2 .
Mathematics 08 01924 g007
Figure 8. Geometry with the unstructured grid for g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Yellow line: x 1 = 2.5 . Orange line: x 1 = 4.2 .
Figure 8. Geometry with the unstructured grid for g = 5 . Numerical solutions using error function smoothing (blue color), smoothing in one spatial interval (red color), and linear smoothing using the Δ interval (green color). Yellow line: x 1 = 2.5 . Orange line: x 1 = 4.2 .
Mathematics 08 01924 g008
Table 1. One-dimensional problem with erf-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
Table 1. One-dimensional problem with erf-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
g = 5
nm e e ( u T ) e e ( γ ) e f ( u T ) e f ( γ )
Δ = 0.3
25508.66557.5649.78657.766
50507.96253.9309.05954.133
100500.6039.9851.19510.152
200501.6571.2090.4681.146
251005.74736.5606.78136.752
501003.62530.1254.75230.310
1001001.1161.5750.2911.718
2001001.4780.8890.2380.783
252002.03913.3742.88913.517
502002.19419.9713.28520.147
1002001.75518.0432.70918.220
2002001.0592.8120.3462.963
Δ = 0.6
25504.36411.7513.19611.694
50503.4634.8711.2064.781
100503.2532.2530.5322.169
200503.1250.9000.2990.883
251004.53613.4323.29313.367
501003.6606.7401.3306.633
1001002.8132.5590.2782.616
2001003.0590.7380.1700.674
252004.51013.7373.27813.670
502003.5616.6371.2196.529
1002003.1992.5670.3862.450
2002003.0720.9240.1470.806
Δ = 0.3
255029.26785.66930.36087.115
505024.49168.82525.69470.129
100502.5562.6141.6912.923
200503.8554.0752.8803.587
2510012.40334.19913.33835.294
501006.64324.7567.72925.782
1001003.12914.4514.18815.393
2001002.3872.3291.3091.982
252002.64116.8913.88817.781
502008.37931.7009.51432.780
1002007.07724.7548.16125.780
2002001.8051.5090.6121.098
Δ = 0.6
25505.4515.7595.1575.718
50503.3353.9631.6444.004
100503.8833.2732.0513.235
200503.9682.9982.0252.815
251003.8516.6433.9206.910
501001.5879.7901.91610.239
1001002.8112.7370.6252.966
2001003.3962.2681.1661.992
252005.4958.2755.0508.042
502003.3324.1321.6163.848
1002003.1962.4680.9082.192
2002003.0541.5550.5941.253
Table 2. One-dimensional problem with h-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
Table 2. One-dimensional problem with h-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
g = 5
nm e e ( u T ) e e ( γ ) e f ( u T ) e f ( γ )
25501.8415.1021.6515.647
50500.8242.9020.6413.497
100500.5192.8640.3263.415
200500.9601.7260.7661.481
251001.6865.0601.5045.596
501000.6102.5800.4483.177
1001000.3741.5980.1792.204
2001000.4901.0510.3021.447
252001.7504.5551.5675.035
502000.6162.1310.4542.703
1002000.3521.1420.1571.729
2002000.1560.8130.0491.326
g = 15
nm e e ( u T ) e e ( γ ) e f ( u T ) e f ( γ )
25500.4678.6171.47810.688
50500.8214.3200.5216.231
100501.7942.1980.5653.629
200504.2154.2752.9793.140
251000.5447.9701.5579.978
501000.8273.3730.5075.273
1001001.7391.3080.4761.469
2001001.8961.7000.6451.308
252000.5577.5581.5049.549
502000.4263.4590.9155.404
1002000.7401.4500.5453.282
2002000.9100.7990.3561.649
Table 3. One-dimensional problem with delta-smoothing. Relative L 2 error for temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
Table 3. One-dimensional problem with delta-smoothing. Relative L 2 error for temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
g = 5
nm e e ( u T ) e e ( γ ) e f ( u T ) e f ( γ )
Δ = 0.3
255019.71890.02320.14988.656
50508.42239.3738.82638.419
100502.78920.1213.17819.112
200501.22811.5101.56010.564
251004.13320.3584.55919.400
501003.81725.2134.25524.123
1001004.89733.1645.30332.035
2001003.08624.0043.46722.928
252003.80115.4194.18814.540
502005.33737.7515.80936.612
1002002.10213.0712.41112.129
2002000.4316.2720.7455.244
Δ = 0.6
25508.39331.5229.00730.953
50501.7642.9351.2572.982
100500.9579.4801.2988.953
200500.8685.7980.6685.290
251003.38812.3863.49412.402
501002.1539.9252.5119.401
1001003.09225.3933.99724.806
2001001.1951.5990.1891.069
252002.87310.0843.4739.805
502002.2389.4172.5898.893
1002001.3691.6840.2962.024
2002001.1172.7390.3052.189
g = 15
nm e e ( u T ) e e ( γ ) e f ( u T ) e f ( γ )
Δ = 0.3
255055.431102.59355.776102.265
505043.798104.75144.197104.378
100503.3919.5413.6519.250
200500.7744.6011.0774.341
2510030.28869.37430.59969.026
5010016.59146.79816.94046.499
1001003.5169.9693.7989.654
2001002.2627.0672.5136.768
252002.3437.7352.7307.711
5020016.59548.64516.94448.349
10020015.45542.00515.82641.679
2002000.8803.0631.0462.723
Δ = 0.6
255031.86963.79932.60963.736
50501.3845.8351.7895.774
100500.6553.7231.1543.659
200501.1792.2180.3642.154
251003.71119.0234.78218.960
501008.16219.3688.69519.299
1001003.72512.7484.38712.681
2001001.2946.7781.6756.710
252002.8217.8083.5577.752
502008.43724.4759.14424.414
1002001.1431.5210.4021.451
2002001.1131.1130.2761.032
Table 4. Two-dimensional problem with erf-smoothing. Relative L 2 error for the temperature at the final time with respect to the finest grid solution using the presented method ( e f ( u T ) ) and h-smoothing ( e e ( u T ) ).
Table 4. Two-dimensional problem with erf-smoothing. Relative L 2 error for the temperature at the final time with respect to the finest grid solution using the presented method ( e f ( u T ) ) and h-smoothing ( e e ( u T ) ).
g = 5
nm e e ( u T ) e f ( u T )
Δ = 0.15
25 × 252006.6716.430
50 × 502004.2524.073
100 × 1002001.5401.079
200 × 2002001.2110.329
Δ = 0.3
25 × 252007.3396.083
50 × 502004.7142.957
100 × 1002003.8511.467
200 × 2002003.2630.552
Δ = 0.6
25 × 252009.5855.538
50 × 502007.4722.080
100 × 1002007.0221.036
200 × 2002006.5540.281
g = 15
nm e e ( u T ) e f ( u T )
Δ = 0.15
25 × 252003.4093.664
50 × 502001.6331.598
100 × 1002001.2591.923
200 × 2002002.0591.226
Δ = 0.3
25 × 252004.2064.484
5 × 5002001.5671.348
100 × 1002002.3602.426
200 × 2002001.9671.376
Δ = 0.6
25 × 252006.6366.360
50 × 502004.3683.427
100 × 1002003.8912.013
200 × 2002003.7380.833
Table 5. Two-dimensional problem with h-smoothing. Relative L 2 error for the temperature at the final time with respect to the finest grid solution using the presented method ( e f ( u T ) = e e ( u T ) ).
Table 5. Two-dimensional problem with h-smoothing. Relative L 2 error for the temperature at the final time with respect to the finest grid solution using the presented method ( e f ( u T ) = e e ( u T ) ).
g = 5
nm e e ( u T ) e f ( u T )
25 × 252004.3384.338
50 × 502001.7601.760
100 × 1002000.5740.574
200 × 2002000.1780.178
g = 15
nm e e ( u T ) e f ( u T )
25 × 252002.0782.078
50 × 502001.2931.293
100 × 1002001.0291.029
200 × 2002000.1450.145
Table 6. Two-dimensional problem with delta-smoothing. Relative L 2 error for the temperature at the final time with respect to the finest grid solution using the presented method ( e f ( u T ) ) and h-smoothing ( e e ( u T ) ).
Table 6. Two-dimensional problem with delta-smoothing. Relative L 2 error for the temperature at the final time with respect to the finest grid solution using the presented method ( e f ( u T ) ) and h-smoothing ( e e ( u T ) ).
g = 5
nm e e ( u T ) e f ( u T )
Δ = 0.15
25 × 252006.1515.598
50 × 5020011.59810.937
100 × 10020010.4859.836
200 × 2002007.3386.668
Δ = 0.3
25 × 252003.6473.818
50 × 502003.7823.556
100 × 1002004.2613.951
200 × 2002001.3740.919
Δ = 0.6
25 × 252004.7484.148
50 × 502003.9682.340
100 × 1002003.1530.486
200 × 2002003.1460.304
g = 15
nm e e ( u T ) e f ( u T )
Δ = 0.15
25 × 2520027.42120.040
50 × 5020027.00519.437
100 × 10020025.04817.213
200 × 2002009.5242.822
Δ = 0.3
25 × 2520012.6629.941
50 × 5020018.55415.872
100 × 10020015.92613.138
200 × 2002005.1392.203
Δ = 0.6
25 × 252002.9912.856
50 × 502004.8833.217
100 × 1002001.9680.909
200 × 2002002.1210.692
Table 7. Geometry with unstructured grid with delta-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
Table 7. Geometry with unstructured grid with delta-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
g = 5
nm e e ( u T ) e f ( u T )
Δ = 0.15
18,242501.7530.589
18,2421001.8710.443
18,2422001.8570.301
Δ = 0.3
18,242503.0520.825
18,2421003.2490.322
18,2422003.3660.086
Δ = 0.6
18,242507.0750.960
18,2421007.2860.430
18,2422007.4070.144
g = 15
nm e e ( u T ) e f ( u T )
Δ = 0.15
18,242503.9343.257
18,2421003.0872.318
18,2422001.9231.007
Δ = 0.3
18,242502.4871.759
18,2421002.1921.189
18,2422001.8940.548
Δ = 0.6
18,242503.4220.797
18,2421003.4990.486
18,2422003.5340.210
Table 8. Geometry with the unstructured grid with h-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
Table 8. Geometry with the unstructured grid with h-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
g = 5
nm e e ( u T ) e f ( u T )
18,242500.8770.877
18,2421000.5150.515
18,2422000.1960.196
g = 15
nm e e ( u T ) e f ( u T )
18,242503.3553.355
18,2421001.9921.992
18,2422000.8210.821
Table 9. Geometry with the unstructured grid with delta-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
Table 9. Geometry with the unstructured grid with delta-smoothing. Relative L 2 error for the temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
g = 5
nm e e ( u T ) e f ( u T )
Δ = 0.15
18,242502.8331.361
18,2421002.6840.909
18,2422002.3570.570
Δ = 0.3
18,242501.5560.721
18,2421001.5000.376
18,2422001.5000.167
Δ = 0.6
18,242502.9410.951
18,2421003.0320.401
18,2422003.1130.105
g = 15
nm e e ( u T ) e f ( u T )
Δ = 0.15
18,242503.8322.351
18,2421004.4591.009
18,2422004.3560.892
Δ = 0.3
18,242501.4892.190
18,2421001.1321.221
18,2422001.4160.500
Δ = 0.6
18,242501.5101.177
18,2421001.4830.647
18,2422001.5520.273
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Vasil’ev, V.; Vasilyeva, M. An Accurate Approximation of the Two-Phase Stefan Problem with Coefficient Smoothing. Mathematics 2020, 8, 1924. https://doi.org/10.3390/math8111924

AMA Style

Vasil’ev V, Vasilyeva M. An Accurate Approximation of the Two-Phase Stefan Problem with Coefficient Smoothing. Mathematics. 2020; 8(11):1924. https://doi.org/10.3390/math8111924

Chicago/Turabian Style

Vasil’ev, Vasily, and Maria Vasilyeva. 2020. "An Accurate Approximation of the Two-Phase Stefan Problem with Coefficient Smoothing" Mathematics 8, no. 11: 1924. https://doi.org/10.3390/math8111924

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