Abstract

A finite volume method is a well-known and appropriate approach for numerical approximation of governing problems. This article proposes a finite volume approach to simulate the one-dimensional convection–diffusion transport problem. New expressions for interface approximation are constructed by combining the assumption of step-wise profile and piece-wise linear profile. In addition, a new numerical technique is developed based on these new interface approximations. This new numerical algorithm produces consistent results for numerical approximation of the governing problem and gives second-order accuracy along space and time. In order to justify the effectiveness of our numerical technique, numerical experiments are conducted for various magnitudes of convection and diffusion coefficients. The numerical results of the proposed algorithm are also compared to the finite volume method and the finite difference method. Based on this comparison, our numerical scheme presents stable and highly accurate results compared to the alternatives.

1. Introduction

The convection–diffusion equation is a basic governing problem to represent the transport phenomena of any property. These transport phenomena have been observed in a variety of fields, including industry, agriculture, biology, meteorology, and petrochemistry. The numerical solution of convection–diffusion model involves the mathematical modeling and simulation of pollutants and suspended matter in water and soil [17]. Mathematical models representing any transport phenomena are given by systems of second-order partial differential equations that contain terms describing convection and diffusion of a fluid in medium. The convection is defined by first-order terms, while the second-order term describes the diffusion of property. The convection–diffusion equation can be driven straightforwardly from the equation of continuity, which states that the rate of change for a scalar quantity in a differential control volume is given by convection and diffusion in and out along with any source or sinks inside the control volume [8, 9]. These governing equations cannot be solved using any analytical approach. Due to this reason, it is essential to apply different numerical methods to find out the numerical solution for such problems. The finite difference, finite element, and finite volume approaches are the three most popular and widely used numerical techniques for approximation of such governing problems.

The finite difference method (FDM) studied by [1016] is a domain discretizing technique that converts the governing problem into a difference equation. The functional values are approximated at the nodes of the network. In [17], finite difference approach was applied to simulate the basic conservation equations. It concludes that, convergence rate of finite difference approach is based over the conditions in liquid region. An efficient parallel characteristic scheme of finite difference method was proposed for numerical simulation of convection–diffusion equation (18). The advantage of the numerical approach of this study is that minimum iterations are required to get the optimal accuracy at each time level. In [19], the finite difference method is applied to a system of simultaneous nonlinear model representing the transport phenomena. This study concludes that a constraint is needed on the physical parameters of the problem to achieve the existence of a solution to the steady-state problem. A finite difference approach with high order accuracy is proposed for solving the convection–diffusion equation in [20]. For a limiting case where mesh-size and viscosity approach zero, a numerical algorithm based on the finite difference approach is discussed for numerical simulation of singularly perturbed convection problem [21]. A numerical simulation is discussed to study the convection and diffusion mechanism using the finite difference technique. Based on this study, the transport phenomena in the cylinder husk furnace is convection-dominated as treated by [22]. A compact form of finite difference is applied to solve the time-dependent convection–diffusion model [23]. In this new approach, the convection–diffusion equation is first transformed into the reaction-diffusion equation, and then it is solved by a proposed unconditionally stable numerical method. As we have studied in [24], a nine-point compact discretization strategy has been used in conjunction with the multigrid approach to get more accurate numerical approximation of the convection–diffusion equation. Finite difference techniques using spreadsheets are applied to approximate the one-dimensional advection-diffusion equation (see [25] the details). The numerical approximation of different finite difference schemes is compared with the analytical solution of the problem.

The finite element approach, which is discussed in [2630] is another numerical method used for the numerical approximation of the governing problems. For the approximation of transport problem using the finite element approach, local error estimates are derived [31]. In the study [32] with polynomials of degree , an explicit form of the finite element technique is presented for the time-dependent convection–diffusion problem. The proposed method employs space–time elements and allows the numerical solution to be computed one element at a time. A technique based on the finite element method is introduced for hyperbolic problems, which is also extended to steady-state convection-dominated problem [29]. The constructed method can be applied explicitly, which is stable for smaller mesh-size and complements to Galerkin method in the convection-dominant regime. For the one-dimensional transport problem, convergence of finite element approach is discussed [33]. Linear and nonlinear problems are focused. For linear elements, optimal rates of convergence order with different norms are studied. The finite element technique is applied to discretized unsteady transport equation [34]. The resultant matrix system is solved by using the conjugate gradient method, which improve computational time and memory size. A form of weak finite element method is applied to the approximate convection–diffusion equation implemented [35]. The optimal error estimates are discussed in different discrete norms. Finite element approximation [36] for a singularly perturbed one-dimensional transport model is constructed. For the convection–diffusion boundary value problem, Galerkin piece-wise linear finite element approach is considered, which is second-order accurate. By considering boundary layer character of solution, special formulae are applied to generate a discrete linear algebraic system [37]. A new finite volume approach with some novel feature for all variables is discussed [38]. The formulation proposed in this study shows flexibility in geometry and boundary conditions. The results obtained from this finite element formulation illustrate its ability to accurately predict the fluid properties in both forced and free convection flows. In [39], a finite element formulation for numerical modeling of porous medium flow is presented. In this study, both the semi- and quasi-implicit schemes are used to solve many problems. Mostly, the results presented are highly accurate and consistent with the experimental and other numerical data.

In flow simulation, it is essential to maintain conservation laws, which is not guaranteed in the finite difference method (FDM) and finite element method (FEM). The finite volume method (FVM) [4044] is evolved from the finite differences method, which is flexible and widely employed in fluid dynamics. The finite volume technique is an integration-based approach in which volume integrals with divergence terms are converted to surface integrals. This integration is a basic key step to ensure conservation of relevant property at each control volume level. This control volume integration gives a semidiscretize equation that involves interface fluxes which are needed to approximate. This interface approximation converts partial differential equations into a set of algebraic equations. In the past, based on different choices to these interface approximations, several numerical techniques of finite volume method (FVM) formulation are developed [4550]. The convection–diffusion equation can be either convection-dominated or diffusion-dominated its depending on the rate of convection and diffusion. Convection-dominated diffusion equations govern many phenomena in engineering and science. In many applications based on convection-dominated problems, diffusion rate will be smaller than that of convection. In such cases, standard numerical methods give unstable solution. To deal with this unstability issue, multiple numerical approaches have been proposed [5153]. An exponentially fitted form of finite volume technique is applied to approximate the convection-dominated diffusion problem [54]. After simple coordinate transformation, the resulting problem is approximated by using the exponentially fitted finite volume method. The adaptive mesh method is also a valuable technique for solving convection-dominated problems. Adaptive mesh refinement method and moving mesh refinement method are the most popular adaptive mesh approaches. A self-adaptive mesh is proposed to address the convection dominancy [55].

In our previous research article [45], Taylor series formulation is applied for the approximation of variable at the interface of the computational domain, and a new upwind numerical formulation is proposed for numerical simulation of the convection–diffusion problem. In the current study, new expressions are obtained using Lagrange interpolation for the approximation of variables at spatial interfaces of the control volume. Subsequently, a numerical scheme based on the upwind approach formulation is constructed using these interface approximations. One of the most common and widely used techniques, the Crank–Nicolson method, is applied for temporal approximation. The numerical results produced by our new algorithm are compared with some other numerical schemes of finite volume approach and finite difference technique. The obtained numerical results indicate that our new upwind approach gives highly accurate and stable results compared to other numerical algorithms.

The format of this article is organized as follows: A brief about the mathematical model of convection–diffusion and domain discretization using finite volume method is shown in Section 2. In Section 3, some numerical experiments are carried out to validate our theoretical algorithm, and the conclusion of this study is presented in Section 4.

2. Finite Volume Based Formulation

The basic principle of all finite volume methods is to study the differential equation in conservative form, integrate it over small regions (called cells or control volumes), and convert each such integral into an integral over the boundary of the cell using Gauss’s theorem. In order to have the nodes of the grid at the centres of cells, we introduced a new rectangular grid whose nodes are the cell centres of the original grid, which is shown in Figure 1. Nodal points are used within these control volumes for interpolating the field variable. Usually, the single node at the center of the control volume is used for each control volume. The finite volume method is a discretization of the governing equation in integral form, in contrast to the finite difference method, which is unusually applied to the governing equation in differential form.

In order to obtain a finite volume discretization, the domain will be subdivided to subdomains such that the collection of all those subdomains forms a partition of , as in [56],(i)Each of the domain is an open, connected, and bounded set without slits.(ii)There is no common point between each subdomains ( for ).(iii)The union of all the subdomains gives the domain of the region (). These subdomains are called control volumes (CVs) or control domains (see Figure 2). In the finite volume formulation the first step is to divide the whole computational domain into finite number of subdomain also called control volumes . When we are talking about one-dimensional problems, we are considering the CVs as subintervals of the problem and the nodes can be the midpoints or the edges of the subintervals (see Figure 3).

Assume that be a bounded polygonal domain and let be given, then the following initial-boundary value problem is written as follows.

The analysis and discretization of these problem is treated by using upwind finite volume method. The work is discussed in the analysis of finite volume method for coupled systems in which transport similar to equation play a great role. The one-dimensional convection–diffusion transport phenomena are governed by the following equation:where represents the coefficients of diffusion and convective velocity, respectively, where as is unknown field variable, which needs to compute over one-dimensional domain .

Governing equation (1) is the mathematical model for the convection–diffusion physical transport phenomena. The terms and represents convection and diffusion process, respectively.

We have restricted to cell centred and uniform discretization of computational domain . For each control volume, the grid point or computational node is adjusted at the centre of the control volume.

The interface or common boundary of control volume with its adjacent control volumes and are mostly positioned at the midposition between their centres, i.e., and . The spatial domain is divided into equal control volumes of uniform length . The partition of spatial and temporal domain are, respectively, define as and . By integrating governed equation (1) over the control volume around node , we get the following equation.

The first term is approximated by using trapezoidal rule for numerical integration, as follows:

Expression (3) represents our semidiscretized equation. In the past, based on different interface approximation techniques, numerous numerical schemes have been constructed. In the finite volume method, the most and well known interface approximation approaches are central differencing approach and upwind differencing approach.

The interface approximation by central differencing approach is defined as follows:

Here, for uniform discretization of domain and the interface approximation becomes as follows

Figure 2 represents the central differencing profile for the interface approximation computed as follows.

Remark 1. The Peclet number is a dimensionless number, it helps to calculate the transportiveness property of any numerical approach. The central differencing ignores the transportiveness property and gives unstable solution for greater values of .
While calculating convective flux at the interfaces, central differencing scheme is equally treated with the neighbouring nodes of the interface. This approach do not consider the flow direction and just takes the average of neighbouring nodes for interface approximation. This central differencing scheme has the major disadvantage of ignoring the influence of convection at the interfaces while approximating the variable.The above expressions (6) and (7) represent the upwind approach based approximation of convective flux at the interfaces. In the upwind approach, the interface approximation depends on flow direction. The value of variable at any interface is equal to the value at its upstream node. Figure 3 shows the interface approximation profile of upwind approach. The upwind approach addresses the transportiveness of any property in a better way. So, in this proposed study, the blending factor is introduced to merge the central differencing approach and upwind approach. In our proposed approach, we have combined the central differencing and upwind approach for the approximation of convective flux at the interfaces of control volume. The introduced blending factor take values and combine both interface approximation approaches as follows:Expression (8) represents our new expression for approximation of convective flux at the right interface of the control volume. The new expression for the approximation at left interface will be as follows:For and , this new approach gives same approximation expressions as upwind approach and central differencing approach, respectively.
Based on the central differencing approach, the gradients at the east and west interfaces of the control volume are approximated as follows:Now by substituting equations (8)–(11) in equation (3), it becomes as follows:Now, scheme is applied to evaluate the temporal integral as follows:Applying this temporal approximation (14) over each spatial node in (13) and taking for Crank-Nicolson temporal approximation, the expression (13) becomes as follows:Expression (15) represents our fully discretized equation valid for interior nodes from node 2 to node .

Remark 2. This new proposed algorithm utilises consistent expressions to calculate fluxes through cell interfaces. Therefore it can be easily shown that this new formulation is conservative. This new discretised equation is diagonally dominant and satisfies the requirements for boundedness of the solution.

2.1. Boundary Conditions

The discretization of the problem at left boundary node and right boundary node . There is no node at the left of and also at right side of node . For the treatment of boundary nodes, we have adjusted imaginary nodes or mirror nodes out side the computational domain at a distance of as shown in Figure 4.

The approximation of left imaginary node is as follows:where is left boundary of computational domain and it coincides with the left interface of first control volume around node 1. With this approximation of left imaginary node the discretized expression at node 1 becomes as follows:

Similarly, the approximation of right imaginary node is given as follows:

Now, the discretized expression for node is given as follows:

The above expressions (17) and (19) represents fully discretized expression at node 1 and node , respectively.

3. Numerical Experiments

Experiment 1. Consider one-dimensional convection–diffusion problem over the domain . The exact solution is
with as the convection velocity to the direction and as the diffusion coefficient [57, 58]. Now, the proposed scheme (15) is applied to approximate , for different cases of convection dominance and diffusion dominance. The initial and boundary values are calculated from an exact solution by taking , ,
The above Figures 57 represent the approximation for , and , respectively. In this approximation the value of diffusion coefficient and convective velocity is taken as 0.03 and 0.02, respectively. The magnitude of maximum error for and is and 0.0042, respectively. Figures 810 show the approximation at different time levels for different values of diffusion and convection coefficients. Results show that, in each case, the numerical approximation is stable and consistent.

Experiment 2. Consider a homogeneous one-dimensional convection–diffusion problem over a computational domain ; its exact solution is given as follows:
with as the convection velocity to the direction and as the diffusion coefficient.
Figure 11 represents the influence of blending factor over the numerical approximation. Taking and a diffusion dominant problems is approximated taking fixed where as the convective velocity is taken as and from left to right figure, respectively. and is taken as and , respectively. The results shown in Figure 11 represent that, in each diffusion dominant cases for high values of blending factor , the results are stable whereas for small vales of blending factor , it gives solution with high oscillations.
Figure 12 represents the numerical solution for different values of Peclect number . Here, taking diffusion coefficient and convective velocity results for convection-dominant case are presented in Figure 12(a). Figure 12(b) represents the results for and . Figure 12(c) at the right side represents the approximation for and . In Figure 12, numerical results indicate that the convection-dominant problem are highly unstable for low value of factor . In every figure we can see that, as we decrease the values of factor , the the amplitude of oscillation goes down.
Figures 1315 show the simulation of the case and convective velocity . The numerical results are consistent with the analytical solution for each value of blending factor . In Figure 16, numerical results for diffusion coefficient and convective velocity are presented.
Now, Figures 1719 represent the simulation of the problem for diffusion dominant problem. Taking the diffusion coefficient and convective velocity the below results are obtained. Figures 1719 show results for blending factor , and . Figure 20 shows results for and .

4. Conclusion

In this article, a numerical algorithm based on the finite volume method is proposed. A blending factor (a) is introduced to merge the central differencing and upwind approach, and a new numerical scheme is constructed. Our proposed new algorithm is applied to simulate the convection–diffusion transport problem for different values of diffusion coefficient , convective velocity , and blending factor . The existing central differencing approach gives poor results for convection-dominant problems. Therefore, we have combined the central differencing approach and up-winding approach to simulate convection-dominant and diffusion-dominant problems. Numerical results obtained by the proposed algorithm are consistent with the analytical solution.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.