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 be an unknown function (temperature) and be a phase change temperature that occurs on the phase change interface :
where is a frozen zone and is a thawed zone:
We have conductive heat transfer in and :
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]:
We write the system of Equations (1) and (2) as the two-phase Stefan problem in domain :
where is the Dirac delta function:
and:
The coefficients of the equation depend on the function and have a discontinuity of the first kind at .
The main difficulty in the presented problem is associated with dynamic tracking of the phase change interface. Since the coefficient of Equation (3) at 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 :
where:
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:
and boundary conditions:
where .
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 () and be the uniform mesh:
where h is the mesh size. For the time approximation, we use an implicit scheme with linearization from the previous time layer, where for and is the time step size.
We have the following finite difference approximation of the problem (4)–(6) with smooth coefficients on the grid :
where:
for .
We consider the approximation (7) with the following initial conditions:
Let and be the left and right boundaries, and . For the Dirichlet boundary condition on , we have:
For the Neumann boundary condition on , we have:
for .
3.1. Smoothing on the Interval
Let be the smoothing interval (slushy zone). For the coefficients of Equations (7) and (8), we have:
Note that, in this approximation, coefficients , are defined on the mesh nodes, and is defined on the cell as the harmonic average of the values on nodes and .
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 on current node :
We consider the following smoothing of discontinuous coefficients and define smooth functions as follows:
- Smoothing on the interval using the error function:
- Linear smoothing in the interval:
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 if . In this scheme, and are defined on cell and approximated using values of the functions and . For the coefficients of Equations (7) and (8), we have:
where coefficient is defined on each node and coefficients and are calculated taking into account the presence or absence of the phase change interface in the temperature interval .
For the accurate approximation of the two-phase Stefan problem, we present a smoothing in one spatial interval:
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:
For the heat problem (4)–(6), we have the following variational formulation of the problem: find such that:
where:
Let be the mesh for the domain :
where is the number of grid cells.
We replace the space V by a finite dimensional subspace , . We suppose that space is composed of piecewise linear basis functions on the grid cell, and is the number of nodes (vertices) for linear basis functions. We have the following decomposition of in the basis of :
Problem (18) is replaced by the following discrete problem:
where
We have the following discrete system in the matrix form for :
where and are global mass and stiffness matrices:
Here, and are local matrices in cell :
where:
In order to obtain a similar form of discrete system as in the previous section with finite difference approximation, we suppose that coefficient is defined in each cell () and coefficient is defined on mesh node (). 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 on current node :
with the following approximations:
- Smoothing on the interval using the error function:
- Linear smoothing on the interval:
Let be the number of vertices in cell K, where for the one-dimensional problem and for the two-dimensional problem with triangular cells. For the stiffness matrix, we have:
where:
For the mass matrix with trapezoidal integration, we have:
where:
Here, coefficients , are defined on the mesh nodes, and 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 if for ( is the number of vertices of mesh cell). We define and on cell using a similar approximation by the values of the function in cell (). For the stiffness matrix, we have:
with:
For the mass matrix, we have:
with:
where is the value of function u on node j in cell and . Here, is defined on mesh vertex j in cell using the corresponding value of function u, and is defined on cell . The coefficient is calculated by taking into account the presence or absence of the phase change interface in cell .
For the one-dimensional problem with , we have cell with and , . Therefore, we have:
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 and be the volume of thawed and frozen zones in cell , the volume of the cell, and . The coefficient is the unfrozen water concentration that can be represented as a fraction of the thawed zone from the cell volume:
where for , () and for , (). In order to calculate the volume of the thawed zone in mesh cell , we use a linear approximation of the temperature in cell.
In the one-dimensional case, we have:
where:
Therefore, the location of the phase change interface in cell is the following (see Figure 1):
and therefore, we obtain:
for the one-dimensional problem when the phase change occurs in cell , . 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 . For example, for the case with , , and (see Figure 1), we have:
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 .
Figure 1.
Illustration of unfrozen water concentration in mesh cell . Left: one-dimensional formulation (1D). Right: two-dimensional formulation (2D).
Finally, for the two-dimensional formulation with triangular cells, we have:
Here, the values of and 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:
The phase change temperature is 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 . We simulate for with initial condition:
with C.
The boundary conditions are the following:
where we consider two test cases with C and C.
For a one-dimensional problem, an exact solution of the two-phase Stefan problem is defined using the phase change interface location :
where is the coefficient of proportionality (m/s).
The exact solution has the following form [13]:
Using a phase change interface condition (2), we find as the root of the transcendental equation:
where , and is the error function [13,14,15,16]. The value of is calculated using the iterative secant method with the accuracy of . We have for and for .
In Figure 2, we present exact and numerical solutions at the final time days and a phase change interface location . We present the results of the numerical solution of the problem using three types of smoothing. Numerical calculations were performed with (mesh by space) and for the time approximation. We consider the case with C and C. The smoothing parameter is chosen constant throughout the entire computation time . 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 , 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 . 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.
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.
Next, we investigate the influence of the mesh size and the number of time steps on the accuracy of the presented methods. We consider for the spatial mesh and for the time approximation. We perform simulations and calculate errors for two smoothing parameters and in the erf-smoothing and delta-smoothing methods. We calculate the relative errors for a solution and phase change interface:
where are the numerical solutions, are the exact solutions, and are the solutions on the very fine grid with .
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 and , where errors for are presented on the left and for 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 and . From the errors between the exact and numerical solutions ( and ), 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.
Table 1.
One-dimensional problem with erf-smoothing. Relative 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 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 3.
One-dimensional problem with delta-smoothing. Relative error for temperature at the final time and phase change interface location with respect to the exact solution and a very fine grid solution.
The errors between a very fine grid solution () and a numerical solution for different parameters m and n ( and ) 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 and for , , and for the erf-smoothing method. For larger , we can obtain more stable results. However, for a finer mesh and more time steps, the parameter is too large to obtain good approximation. For example, we have for and for in the test problem with and . 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 and 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 and 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.
Figure 3.
One-dimensional problem. Boundary conditions . 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 and dashed line for . Left: relative errors for the solution at the final time. Right: relative errors for the phase change interface location.
Figure 4.
One-dimensional problem. Boundary conditions . 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 and dashed line for . Left: relative errors for the solution at the final time. Right: relative errors for the phase change interface location.
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 with size and simulate for with initial condition C. As boundary conditions, we set C and C for and zero flux on other boundaries, . The computational mesh is uniform with triangular cells with size . Numerical calculations are performed with for the time approximation. We present the results of the numerical solution of the problem using three types of smoothing schemes for , , and 100.
We calculate relative errors for the solution at the final time:
where y is the numerical solution and is the solution on the fine grid with using the current method. Here, for , 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 C and C. In the left figure, we depict a temperature field at the final time with an isotherm of (phase change interface). In the right figure, we show a solution on line , 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 . Numerical calculations are performed with (mesh by space) and for the time approximation. The smoothing parameter is chosen as constant .
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 at the final time.
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, . We consider for the spatial mesh. In Table 4, we present the relative errors for the erf-smoothing scheme with , and . In the left table, we present the errors for boundary condition . The table at the right demonstrates the results for . 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 and . Relative errors for delta-smoothing are shown in Table 6. The first error is an error between the current solution and a reference solution using the h-smoothing scheme on mesh . We observe that in order to obtain good results using the erf-smoothing scheme, we should take smaller for than for the test case with . For example, we have of the error for and of the error for in the test case with . Table 6 shows the optimal value of for and for . For the h-smoothing scheme with smoothing in one spatial interval, we obtain good results for both test cases with and .
Table 4.
Two-dimensional problem with erf-smoothing. Relative error for the temperature at the final time with respect to the finest grid solution using the presented method () and h-smoothing ().
Table 5.
Two-dimensional problem with h-smoothing. Relative error for the temperature at the final time with respect to the finest grid solution using the presented method ().
Table 6.
Two-dimensional problem with delta-smoothing. Relative error for the temperature at the final time with respect to the finest grid solution using the presented method () and h-smoothing ().
The second error illustrates the convergence of the solution with increasing mesh parameters m and n to the reference solution on the fine grid using the corresponding method. We observe that both errors and are sensitive to the size of the mesh, where we obtain a large error for a very coarse grid . We obtain accurate results for , 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 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 in green color, where we set the Dirichlet boundary conditions:
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.
Similar to the previous results, we consider and . On the circle perforation, we set the Robin-type boundary conditions:
where we set . In Figure 6, the first circle is indicated in red color with , and the second circle is indicated in orange color with . Circle perforations illustrate a pipe influence to the temperature distribution. The pipes contain fluid with temperature (first) and (second) with heat transfer parameter . The radius of the first circle is , and the radius of the second one is . On other boundaries (blue color), we set the Neumann boundary condition:
We simulate for with initial condition C. A computational mesh is fixed and contains n vertices, 18,242.
The numerical solution at the final time for C and 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 (phase change interface). In the right figure, we show the solution on lines (line position is indicated in yellow color in the left figure) and (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 with for the time approximation.
Figure 7.
Geometry with the unstructured grid for . 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: . Orange line: .
Figure 8.
Geometry with the unstructured grid for . 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: . Orange line: .
We calculate similar errors for the solution at the final time ( and ). The error is calculated using the solution with using the current method. The error 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 and .
Table 7.
Geometry with unstructured grid with delta-smoothing. Relative 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 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 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.
In Table 7, we present relative errors for the erf-smoothing scheme with , and . In the left table, we present errors for boundary condition . In the right table, results for are shown. In Table 8, the results for the h-smoothing scheme are presented for and . 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 for and for . In the delta-smoothing scheme, we have good results for for and . We obtain an accurate solution for the scheme with h-smoothing for , and 200 for with less then one percent of error. The scheme with h-smoothing works very well for with less than one percent for .
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
- Samarsky, A.; Moiseenko, B. Economical shock-capturing scheme for multidimensional Stefan problems. Comput. Math. Math. Phys. 1965, 5, 816–827. [Google Scholar]
- 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]
- 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]
- Nedjar, B. An enthalpy-based finite element method for nonlinear heat problems involving phase change. Comput. Struct. 2002, 80, 9–21. [Google Scholar] [CrossRef]
- 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]
- Danilyuk, I. On the Stefan problem. Russ. Math. Surv. 1985, 40, 157. [Google Scholar] [CrossRef]
- Vasil’ev, V. Numerical Integration of Differential Equations with Nonlocal Boundary Conditions. Yakutsk. Fil. Sib. Otd. Akad. Nauk. SSSR Yakutsk. 1985. [Google Scholar]
- Vasil’ev, V.; Maksimov, A.; Petrov, E.; Tsypkin, G. Heat and mass transfer in freezing and thawing soils. Nauk. Fizmatlib M 1996. [Google Scholar]
- Samarskii, A.A.; Vabishchevich, P.N. Computational Heat Transfer; Wiley: Hoboken, NJ, USA, 1995. [Google Scholar]
- 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]
- 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]
- 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]
- Tikhonov, A.N.; Samarskii, A.A. Equations of Mathematical Physics; Courier Corporation: North Chelmsford, MA, USA, 2013. [Google Scholar]
- Neumann, F. Lectures Given in the 1860’s. Die Partiellen Differential-Gleichungen der Mthematischen Physik; 1912; Volume 2, pp. 17–121. [Google Scholar]
- Lunardini, V.J. Heat Transfer with Freezing and Thawing; Elsevier: Amsterdam, The Netherlands, 1991. [Google Scholar]
- 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]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).







