Graphical abstract
Shishkin-Bakhvalov mesh
Keywords: Interior layers, Boundary layers, Shishkin-Bakhvalov mesh
Method name: Finite difference method
Abstract
We consider two-parameter singularly perturbed problems of reaction-convection-diffusion type in one dimension. The convection coefficient and source term are discontinuous at a point in the domain. The problem is numerically solved using the upwind difference method on an appropriately defined Shishkin-Bakhvalov mesh. At the point of discontinuity, a three-point difference scheme is used. A convergence analysis is given and the method is shown to be first-order uniformly convergent with respect to the perturbation parameters. The numerical results presented in the paper confirm our theoretical results of first-order convergence. Summing up:
The Shishkin-Bakhvalov mesh is graded in the layer region and uniform in the outer region as shown in the graphical abstract.
The method presented here has uniform convergence of order one in the supremum norm.
The numerical orders of convergence obtained in numerical examples with Shishkin- Bakhvalov mesh are better than those for Shishkin mesh.
Specifications Table
| Subject area | Mathematics |
|---|---|
| More specific subject area | Numerical analysis |
| Name of your method | Finite difference method |
| Name(s) and reference(s) of original method | 1. P.A. Farrell, A.F. Hegarty, J.J.H. Miller, E. O’Riordan, & G.I. Shishkin (2004), Global maximum norm parameter-uniform numerical method for a singularly perturbed convection-diffusion problem with discontinuous convection coefficient, Math. Comput. Modelling, 40(11–12), 1375–1392. |
| 2. T. Linß(1999), An upwind difference scheme on a novel Shishkin-type mesh for a linear convection diffusion problem, J. Comput. Appl. Math. 110(1), 93–104. | |
| Resource availability | Matlab |
Introduction
Many physical problems such as flows in chemical reactors, equations involving modeling of semiconductor devices, simulation of water pollution problems, and simulation of many fluid flows are modelled mathematically as singular perturbation problems (SPPs), see [1], [9], [10], [19], [22] for details. The solutions of these problems are characterized by presence of layers (narrow region of rapid change). Depending on the location of layers, these are called boundary layer or interior layer problems. In this article we will examine a SPP with two small perturbation parameters and , multiplied to diffusion and convection term respectively. The convection coefficient and source term are discontinuous at a point in the domain.
Consider a singularly perturbed reaction-convection-diffusion problem, with a discontinuous source term and a convection coefficient.
| (1) |
where , and . The coefficient is sufficiently smooth in . The source term and the convection coefficient are discontinuous at the point . The coefficients and their derivatives have a jump discontinuity at . Recall that the jump in any function at a point is defined as Also are sufficiently smooth in . Under the above assumptions, the BVP (1) admits a unique solution .
The solution of above Eq. (1) has boundary layers at both boundaries due to the presence of small perturbation parameters and . In addition, it has strong interior layers in the neighborhood of due to the discontinuity of and and the sign pattern of in the domain. The ratio is crucial in determining the width of boundary and interior layers. So the analysis of the above problems naturally splits into two cases: and where and .
When the problem is one parameter singularly perturbed problem with interior layers. Here, the solution has strong interior layers of width in the neighbourhood of the point . For work in this direction, see [[2], [6], [7], [12], [14]].
The study of two-parameter SPPs was initiated by O’Malley [15], [16], [17], who examined the asymptotic solution. He noted that the ratio of and is very important and decides the width of boundary layers. Some numerical methods for singularly perturbed two-parameter reaction-convection-diffusion equation with smooth data can be found in [8], [18], [23], [25], [26]. Physical significance of the singularly perturbed problems with interior layers due to discontinuous coefficients can be seen while, modelling one-dimensional stationary semiconductor device equations, see [13]. Assume that the semiconductor device has only one junction and that the doping profile has jump discontinuities at the junction, which give rise to interior layers corresponding to these discontinuities. In [13], Markowich discussed a finite difference scheme for this problem and proposed a finite difference method for the resolution of interior layers with reasonable number of grid points.
The study of numerical methods for singularly perturbed two-parameter problems with discontinuity in data is an open area of research with much to explore. In [24], Shanti et al. presented an almost first-order numerical technique for two-parameter singularly perturbed problem with a discontinuous source term. The method comprised of upwind difference scheme on an appropriately defined Shishkin mesh. This result was improved by Prabha et al. in [20]. They proposed an almost second-order method on Shishkin mesh comprising the central, mid-point, and upwind difference scheme. They used a five-point difference scheme at the point of discontinuity. An almost second-order method was given by Chandru et al. in [3] for a singularly perturbed two-parameter problem with a discontinuous source term. The method consisted of proper use of upwind, central, and mid-point upwind difference methods on a suitably chosen Shishkin mesh. A three-point scheme was used at the point of discontinuity. Prabha et al. in [21], examined two parameter SPP with discontinuous source and convection-coefficient. They proposed an upwind difference scheme layer adapted Shishkin mesh with a three-point difference scheme at the point of discontinuity. The method was proved to be almost first order convergent.
In this article, for Eq. (1), we have used upwind difference method on an appropriately defined Shishkin- Bakhvalov mesh. In this mesh, the layer part has graded mesh formed by inverting the boundary layer term. The outer region has a uniform mesh. The transition point is chosen as in Shishkin mesh. This mesh was first proposed by Linß for a one-parameter SPP in [11]. Shishkin-Bakhvalov mesh performs better than Shishkin mesh. In Shishkin mesh, the order of convergence is deteriorated due to a logarithmic factor, unlike here. At the point of discontinuity a three-point difference scheme is used. The proposed method is uniformly convergent of order one.
The main contribution of the present paper is uniform convergence of order one in the supremum norm. The orders of convergence obtained in numerical examples for the Shishkin-Bakhvalov mesh are better then those for the Shishkin mesh. This is an improvement of the result of Prabha et al. in [21]. Their method has uniform convergence of order one up to a logarithmic factor in the supremum norm.
Throughout this article, denotes a generic positive constant independent of perturbation parameters, number of mesh points.
Here, the supremum norm on the domain is denoted by
The structure of the paper is as follows. In Section “Apriori bounds”, a priori bounds on the solution are proved, followed by the decomposition of the solution and some derivative bounds in Section “Decomposition of the solution”. The numerical method is proposed in Section “Discrete problem”. Section “Error estimates” presents the error estimates for the difference method. Some numerical results are included in Section “Numerical results”, which verify the theoretical claims made. A summary of the main results is in Section “Conclusion”.
Apriori bounds
In this section, we discuss the existence of a unique solution, the minimum principle, stability bound and the apriori bounds for the solution of Eq. (1).
Theorem 1
The SPPs(1)has a solution.
Proof
The proof is by construction. Let be particular solutions to the differential equations
and
respectively. The convection coefficients have the following properties:
Consider the function
where are constants chosen appropriately so that and are the solutions of the boundary value problems
and
respectively.
We observe that the function satisfies and Also on an open interval (0,1), So, cannot have an internal maximum or minimum, and hence
For the existence of constants and , we require that
In fact, □
In the next result, we prove the minimum principle for the operator .
Theorem 2
(Minimum Principle) Suppose that a functionsatisfies,andthen.
Proof
See [21] for proof. □
Theorem 3
Letbe a solution of(1)then
Proof
Let where and
Now and are non negative. For each
Since
It follows from the minimum principle that , which implies
□
Theorem 4
Ifis the solution of the Eq.(1)wherethen forit holds that
and
Proof
We first prove the result for the domain . The proof for follows the same argument.
Given any point , we can construct a neighbourhood where is such that and . As is differentiable in then the mean value theorem implies that there exists such that
Also,
Therefore, from the differential Eq. (1) and using integration by parts, we obtain
Using the fact that and taking modulus on both sides and after some simplifications, we arrive at the following bound
If we choose then the right-hand side of the above expression is minimized with respect to and we obtain the result for ,
For , the differential Eq. (1) gives,
On simplifying we arrive at
To obtain the required bounds for , we differentiate the Eq. (1) and arrive at
Taking modulus on both sides and the bounds for and into consideration, we arrive at,
On simplifying, we arrive at
□
Decomposition of the solution
The bounds presented in the previous section are not sufficient for the error analysis of the discretization method for the singularly perturbed problems. Thus, to obtain sharp bounds, the solution is decomposed as in [21] into layers and regular components as . The regular component is the solution of
| (2) |
The singular components and are the solutions of
| (3) |
and
| (4) |
respectively.
The regular and layer components are further decomposed as
and
As , we have and
We will find the bounds on these components for case first.
Let us decompose the regular part (similar to Prabha et al. [21]) as where and be the solution of the following problems:
respectively.
Also, .
Theorem 5
The regular componentand its derivatives upto order 3 satisfies the following bounds for
Proof
To bound the regular component , we need to bound and . With sufficient smoothness on the co-efficient in and in , we observed that and its derivatives are bounded. To bound , Theorem 3 gives
Now by Theorem 4
Using the bounds for and its derivatives in the expression for , we have
□
Theorem 6
Let. The singular componentsandand their derivatives up to order 3 satisfy the following bounds for
where,
Proof
Consider a barrier function For a large C, and . Now
Therefore
Similarly choose a barrier function with large . Now with gives
Using Theorem 4 on and , we obtain the following bounds for the derivatives of up to order 3,
Consider a barrier function For any large C, and . Now
Therefore
For choose the barrier function , with large . This gives and gives
By Theorem 4, we have the following bounds for the derivatives of of order up to 3,
□
Consider the case: .
Let be the regular component of the solution of the Eq. (1). Let us decompose it as in [21]
where and are the solution of the following problems respectively:
are chosen suitably, and .
The proof of the next theorem follows the argument presented in [8, Section 3] closely.
Theorem 7
Let. The regular componentand its derivatives up to order 3 satisfies the following bounds
Proof
For the coefficient and . Hence, we have that
(5) Also for the coefficients and , we have the following result
(6) We further decompose the component , as follows,
where and
(7) Assuming sufficient smoothness of the coefficients, the and its derivatives are bounded independently of the perturbation parameter . In particular, if we have
Using (5) and (6) we deduce that and then from (7) we obtain
We use these bounds for and to obtain
Now to bound we decompose , as follows
where and
(8) Assuming sufficient smoothness of the coefficients, we have
and
Using (5), (6) and (8) we obtain
We use these bounds for and to obtain
To bound we use the differential equation satisfied by it.
(9) Application of Theorem 3 gives
By Theorem 4 we have
Differentiating Eq. (9), we obtain
Substituting these bounds for and their derivatives into the equation for gives us
□
Theorem 8
Let. The singular componentsandsatisfy the following bounds for
where
Proof
In region we will find the bound for the left and right layer term. For the left layer, consider a barrier function For a large C, and . Now
therefore
For the right layer term, consider a barrier function For any large C, and . Now
Therefore
In a similar way, we can prove the bounds for and in the region . The bounds for higher derivatives of and can be proved using the techniques given in [5], [18]. □
The unique solution of the problem (1) is now given by
Discrete problem
The differential Eq. (1) is discretized using the upwind finite difference method on a suitably constructed Shishkin-Bakhvalov mesh. The domain is subdivided into six subintervals as follows
Let denotes the mesh points with a point of discontinuity at the point The interior points of the mesh are denoted by Let and The transition points in are:
On the sub-intervals and a graded mesh of mesh points is constructed by inverting the layer function and in the above sub-intervals respectively. On and a uniform mesh of mesh points is taken. We assume that for the case , and for , otherwise the boundary layers could be resolved by standard uniform mesh.
The mesh points are given by
The mesh generating function , maps a uniform mesh onto a layer adapted mesh in by . The mesh in terms of the mesh generating function can be written as:
with . The functions are monotonically increasing on and respectively. And are monotonically decreasing on and respectively. These mesh generating functions ’s are defined with the help of corresponding mesh characterizing functions ’s as
Lemma 1
We assume that the mesh-generating functionsandsatisfy the following conditions
and
Proof
The mesh-generating functions
Therefore,
Also mesh characterizing function
Similarly, we can prove the bounds for remaining functions in the intervals and □
Using this Lemma 1 we see that for ,
Similarly, we can show that
On the Shishkin-Bakhvalov mesh defined above, we use upwind finite difference method to discretize the differential Eq. (1). We define the difference scheme as: Find such that:
| (10) |
where
The following lemma demonstrates that the finite difference operator has characteristics that are similar to those of the differential operator
Lemma 2Discrete minimum principle:
Suppose that a mesh functionsatisfies, andthen
Proof
We refer to [21] for proof. □
Lemma 3
Ifis a mesh function satisfying the difference scheme(10), then.
Proof
Define the mesh function for , as
where Now, and are non negative. For
Also
It follows from the discrete minimum principle that , which implies
□
Error estimates
Let us denote the nodal error at each mesh point by
where and are solutions of Eqs. (1) and (10) at a point respectively.
We find the bounds for the nodal error in and separately. To find the error bounds, we decompose the solution of the discrete problem (10) into regular, and layer parts as
| (11) |
We further split the regular and layer section into parts to the left and right of the discontinuity, i.e., in and .
Let and be mesh functions, which approximate to the left and right sides of the point of discontinuity respectively, be defined as follows:
| (12) |
where and are, respectively, the solutions to the following discrete problems:
Similarly, we split the mesh function into left and right layer components and . We further decompose them into components on either side of the discontinuity, .
The decomposition is as follows:
where , and are solutions of the following equations:
| (13) |
| (14) |
The unique solution of the problem (10) is defined by
The next lemma gives bounds on the discrete layer components.
Lemma 4
The layer components,andsatisfy the following bounds:
Proof
Let us define the barrier function for the left layer term as
For large enough and , and .
Consider,
For both the cases and , on simplification, we get
By discrete minimum principle for the continuous case [18], we obtain
For consider the barrier function for the left layer term as:
For large enough and , and .
Consider
For case , the above expression becomes,
For the case , we obtain
Hence by discrete minimum principle for continuous case [18], we obtain
Similarly, we define the barrier function for the right layer component as
For large enough and , and . Consider,
For both the cases and , on simplification, we get
By discrete minimum principle for the continuous case [18], we obtain
Similarly, we prove the bound for for □
Lemma 5
The error in the regular component satisfies the following error estimates for the mesh points,
whereandare the regular part of the continuous and the discrete solution as defined byEqs. (12)and(2), respectively.
Proof
The truncation error for the regular part of the solution of the Eq. (1) for both the cases and is
Similarly
Define the barrier function
For large C, and . Hence using the approach given in [5], we get and
(15) Similarly,
(16) Combining the above results, we obtain
□
Lemma 6
The left singular component of the truncation error satisfy the following estimate at mesh point
whereandare the discrete and the continuous left layer components satisfying theEq. (13)andEq. (3), respectively.
Proof
In i.e., for , from Theorem 6, we obtain
(17) Also from Lemma 4, we have that is a monotonically decreasing function, so
Now,
Consider,
Next, we calculate .
For
So
Hence for all we have
For , the truncation error for the left layer component in the inner region i.e., for , is
We choose the barrier function for the layer component as
For sufficiently large , we have . Hence by discrete maximum principle in [18], . So, by the comparison principle, we can obtain the following bounds:
For , the truncation error for the left layer component for is given by
Choosing a barrier function for the layer component as
For sufficiently large , we have . Using the discrete minimum principle in [18], we can obtain the following bounds:
Hence for the left layer component
(18) By similar argument in the domains and , we have
(19) Combining the results (18) and (19), the desired result is obtained. □
Lemma 7
The right singular component of the truncation error satisfies the following approximation for each mesh point,
whereandare the discrete and the continuous right layer components satisfying theEq. (14)andEq. (4), respectively.
Proof
In , for , the left layer component has the following bound from Theorem 8
(20) Also from Lemma 4, we see that is increasing function. So
Now consider,
Now we calculate .
For
So
Hence for all , we have
For , the derivative bounds for right layer component in the inner region is given by Theorem 6. Truncation error for right layer component is given by,
By defining an appropriate barrier function and using the discrete minimum principle (in [18]), we can obtain the following bounds:
For case , the derivative bounds for right layer component for are given by Theorem 8. Hence by using truncation error for the right layer component, we obtain,
Choosing the barrier function for the layer component as
For sufficiently large , by the application of the discrete minimum principle (in [18]) we obtain the following bounds:
Hence the bound for the right layer component for is
(21) Similarly, we can prove the result for ,
(22) Combining the results (21) and (22) the final answer is obtained. □
Lemma 8
Letandbe the solutions to the problems(1)and(10), respectively. The errorestimated at the point of discontinuitysatisfies the following estimate
Proof
Consider
Since
Using the fact that in the given domain gives the lemma. □
Theorem 9
Letforandfor. Ifandbe respectively the solutions of the problems(1)and(10)then,
where C is a constant independent ofand discretization parameter.
Proof
For , from Lemma 5, Lemma 6, and Lemma 7, we have that
Let to find error at the point of discontinuity , consider the discrete barrier function defined in the interval where
and
We have and are non-negative. And
Hence by applying discrete minimum principle we get
Therefore, for
(23) In second case , consider the discrete barrier function defined in the interval where
where We have and are non negative and , and
Hence by applying discrete minimum principle, we get Therefore, for
(24) By combining the result (23) and (24) we obtain the desired result. □
Numerical results
In this section, we have considered some singularly perturbed two-parameter boundary value problems with discontinuous convection coefficient and source term as test problems. The proposed scheme is used to solve these problems numerically.
Example 1
with
Example 2
with
Since the exact solution for Example 1 and Example 2 is unknown, the maximum point-wise error and rate of convergence are computed using the double mesh principle (see [4], page 199). The double mesh difference is defined by
where and represent the numerical solutions determined using and mesh points respectively. The numerical rate of convergence is given by
Table 1 shows the results for various values of and for for Example 1. The order of convergence obtained approaches one as we increase the number of mesh points. In Table 2 the maximum point-wise error and order of convergence are given for Example 1 for varying values of and keeping the value of fixed.
Table 1.
Maximum point-wise error and approximate orders of convergence for Example 1 when .
| Number of mesh points N |
|||||
| 64 | 128 | 256 | 512 | 1024 | |
| 3.3161e-01 | 2.1205e-01 | 1.2184e-01 | 6.5947e-02 | 3.4499e-02 | |
| Order | 0.64507 | 0.79940 | 0.88563 | 0.93474 | |
| 3.0199e-01 | 1.8183e-01 | 9.9546e-02 | 5.2296e-02 | 2.6915e-02 | |
| Order | 0.73190 | 0.86918 | 0.92864 | 0.95830 | |
| 2.9894e-01 | 1.7875e-01 | 9.7305e-02 | 5.0937e-02 | 2.6164e-02 | |
| Order | 0.74189 | 0.87739 | 0.93378 | 0.96113 | |
| 2.9863e-01 | 1.7844e-01 | 9.7080e-02 | 5.0801e-02 | 2.6089e-02 | |
| Order | 0.74290 | 0.87823 | 0.93430 | 0.96142 | |
| 2.9860e-01 | 1.7841e-01 | 9.7058e-02 | 5.0788e-02 | 2.6081e-02 | |
| Order | 0.74300 | 0.87831 | 0.93435 | 0.96145 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0787e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0786e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0786e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0786e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0786e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0786e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
| 2.9894e-01 | 1.7875e-01 | 9.7305e-02 | 5.0937e-02 | 2.6164e-02 | |
| Order | 0.74189 | 0.87739 | 0.93378 | 0.96113 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0786e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
| 2.9860e-01 | 1.7841e-01 | 9.7056e-02 | 5.0786e-02 | 2.6081e-02 | |
| Order | 0.74301 | 0.87832 | 0.93436 | 0.96145 | |
Table 2.
Maximum point-wise error and approximate orders of convergence for Example 1 when .
| Number of mesh points N |
|||||
|---|---|---|---|---|---|
| 64 | 128 | 256 | 512 | 1024 | |
| 4.3793e-01 | 3.0942e-01 | 1.9296e-01 | 1.0991e-01 | 5.9142e-02 | |
| Order | 0.50113 | 0.68126 | 0.81198 | 0.89406 | |
| 4.4915e-01 | 3.0223e-01 | 1.8274e-01 | 1.0226e-01 | 5.4505e-02 | |
| Order | 0.57151 | 0.72586 | 0.83750 | 0.90783 | |
| 4.5302e-01 | 3.0188e-01 | 1.8160e-01 | 1.0136e-01 | 5.3951e-02 | |
| Order | 0.58557 | 0.73318 | 0.84130 | 0.90978 | |
| 4.5349e-01 | 3.0186 | 1.8149e-01 | 1.0127e-01 | 5.3895e-02 | |
| Order | 0.58716 | 0.73398 | 0.84170 | 0.90998 | |
| 4.5353e-01 | 3.0186e-01 | 1.8148e-01 | 1.0126e-01 | 5.3889e-02 | |
| Order | 0.58732 | 0.73405 | 0.84174 | 0.91000 | |
| 4.5354e-01 | 3.0186e-01 | 1.8148e-01 | 1.0126 | 5.3888e-02 | |
| Order | 0.58734 | 0.73406 | 0.84175 | 0.91001 | |
| 4.5354e-01 | 3.0186e-01 | 1.8147e-01 | 1.0126e-01 | 5.3863e-02 | |
| Order | 0.58733 | 0.73409 | 0.84170 | 0.91073 | |
| 4.5355e-01 | 3.0182e-01 | 1.8147e-01 | 1.0114e-01 | 5.3746e-02 | |
| Order | 0.58753 | 0.73396 | 0.84334 | 0.91218 | |
| 4.5347e-01 | 3.0154e-01 | 1.8095e-01 | 1.0082e-01 | 5.0923e-02 | |
| Order | 0.58862 | 0.73672 | 0.84375 | 0.98551 | |
| 4.5270e-01 | 2.9936e-01 | 1.7931e-01 | 9.3085e-01 | 2.7602e-02 | |
| Order | 0.59666 | 0.73941 | 0.94586 | 1.7537 | |
Fig. 1 a and b represent the numerical solution and maximum point-wise error for Example 1 for the case respectively with and . The numerical solution and maximum point-wise error for the case for Example 1 for is given in Fig. 2a and b respectively with and .
Fig. 1.
(a) and (b): Numerical solution and errors for when for Example 1..
Fig. 2.
(a) and (b): Numerical solution and errors for when for Example 1.
In Tables 3 and 4, maximum point-wise error and order of convergence are tabulated for Example 2. From these tables, we observe that the numerical order of convergence is consistent with the theoretical estimates presented in this paper.
Table 3.
Maximum point-wise error and approximate orders of convergence for Example 2 when .
| Number of mesh points N |
|||||
|---|---|---|---|---|---|
| 64 | 128 | 256 | 512 | 1024 | |
| 5.3686e-01 | 3.4621e-01 | 1.2697e-01 | 4.6968e-02 | 2.4601e-02 | |
| Order | 0.63289 | 0.12697 | 1.4470 | 1.4348 | |
| 5.5069e-01 | 3.7896e-01 | 1.5849e-01 | 4.7313e-02 | 1.0219e-02 | |
| Order | 0.53919 | 1.2576 | 1.7440 | 2.2109 | |
| 5.5215e-01 | 3.8238e-01 | 1.6172e-01 | 4.9611e-02 | 1.1616e-02 | |
| Order | 0.53006 | 1.2414 | 1.7047 | 2.0945 | |
| 5.5230e-01 | 3.8272e-01 | 1.6204e-01 | 4.9840e-02 | 1.1755e-02 | |
| Order | 0.52915 | 1.2398 | 1.7010 | 2.0839 | |
| 5.5231e-01 | 3.8275e-01 | 1.6207e-01 | 4.9863e-02 | 1.1769e-02 | |
| Order | 0.5290 | 1.2397 | 1.7006 | 2.0829 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0827 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0827 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0828 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0828 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0828 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0828 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0828 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0828 | |
| 5.5232e-01 | 3.8276e-01 | 1.6208e-01 | 4.9866e-02 | 1.1771e-02 | |
| Order | 0.52905 | 1.2397 | 1.7005 | 2.0828 | |
Table 4.
Maximum point-wise error and approximate orders of convergence for Example 2 when .
| Number of mesh points N |
|||||
|---|---|---|---|---|---|
| 64 | 128 | 256 | 512 | 1024 | |
| 5.9397e-01 | 4.4115e-01 | 2.8197e-01 | 1.6259e-01 | 8.8048e-02 | |
| Order | 0.42911 | 0.64574 | 0.79429 | 0.88487 | |
| 7.6741e-01 | 5.0315e-01 | 2.9775e-01 | 1.6443e-01 | 8.7022e-02 | |
| Order | 0.60902 | 0.75685 | 0.85662 | 0.91804 | |
| 8.0508e-01 | 5.1239e-01 | 2.9860e-01 | 1.6361e-01 | 8.6241e-02 | |
| Order | 0.65187 | 0.77903 | 0.86797 | 0.92381 | |
| 8.0927e-01 | 5.1325e-01 | 2.9859e-01 | 1.6346e-01 | 8.6127e-02 | |
| Order | 0.65694 | 0.78150 | 0.86920 | 0.92443 | |
| 8.0970e-01 | 5.1334e-01 | 2.9858e-01 | 1.6344e-01 | 8.6114e-02 | |
| Order | 0.65746 | 0.78176 | 0.86932 | 0.92450 | |
| 8.0974e-01 | 5.1335e-01 | 2.9858e-01 | 1.6344e-01 | 8.6106e-02 | |
| Order | 0.65750 | 0.78179 | 0.86937 | 0.92459 | |
| 8.0974e-01 | 5.1336e-01 | 2.9858e-01 | 1.6345e-01 | 8.6022e-02 | |
| Order | 0.65749 | 0.78182 | 0.86929 | 0.92607 | |
| 8.0976e-01 | 5.1344e-01 | 2.9857e-01 | 1.6328e-01 | 8.6538e-02 | |
| Order | 0.65729 | 0.78210 | 0.87070 | 0.91597 | |
| 8.0948e-01 | 5.1325e-01 | 2.9734e-01 | 1.5930e-01 | 9.4156e-02 | |
| Order | 0.65734 | 0.78751 | 0.90032 | 0.75868 | |
| 8.0711e-01 | 5.1523e-01 | 2.8102e-01 | 1.4310e-01 | 4.9626e-02 | |
| Order | 0.64754 | 0.87454 | 0.97363 | 1.5278 | |
For Example 2, Fig. 3a and b gives the numerical solution and maximum point-wise error for the case respectively with and . The Fig. 4a and b show the numerical solution and maximum point-wise error for the case respectively with and . From these figures, we observe that the maximum error is occurring at the point of discontinuity.
Fig. 3.
(a) and (b): Numerical solution and errors for when for Example 2.
Fig. 4.
(a) and (b): Numerical solution and errors for when for Example 2.
With the use of the Shishkin-Bakhvalov mesh, we are able to improve the order of convergence to one, unlike the Shishkin mesh, where the order of convergence is deteriorated due to the presence of a logarithmic factor. In Table 5, we have compared the order of convergence obtained for the numerical method presented here on the Shishkin-Bakhvalov mesh and Shishkin mesh for Example 1.
Table 5.
Comparison of order of convergence using Shishkin mesh and Shishkin-Bakvalov mesh of Example 1 for .
| Mesh | Number of mesh points N |
||||
|---|---|---|---|---|---|
| 64 | 128 | 256 | 512 | ||
| S-mesh | 0.23087 | 0.40876 | 0.57128 | 0.68814 | |
| S-B mesh | 0.64591 | 0.79977 | 0.88581 | 0.93482 | |
| S-mesh | 0.27379 | 0.46997 | 0.63313 | 0.73471 | |
| S-B mesh | 0.73267 | 0.86950 | 0.92879 | 0.95837 | |
| S-mesh | 0.27851 | 0.47689 | 0.64024 | 0.74010 | |
| S-B mesh | 0.74265 | 0.87771 | 0.93392 | 0.96120 | |
| S-mesh | 0.27899 | 0.47759 | 0.64096 | 0.74064 | |
| S-B mesh | 0.74366 | 0.87854 | 0.93444 | 0.96149 | |
| S-mesh | 0.27904 | 0.47766 | 0.64103 | 0.74070 | |
| S-B mesh | 0.74376 | 0.87863 | 0.93450 | 0.96152 | |
| S-mesh | 0.27904 | 0.47767 | 0.64104 | 0.74070 | |
| S-B mesh | 0.74377 | 0.87864 | 0.93450 | 0.96152 | |
| S-mesh | 0.27904 | 0.47767 | 0.64104 | 0.74070 | |
| S-B mesh | 0.74377 | 0.87864 | 0.93450 | 0.96152 | |
| S-mesh | 0.27904 | 0.47767 | 0.64104 | 0.74070 | |
| S-B mesh | 0.74377 | 0.87864 | 0.93450 | 0.96152 | |
| S-mesh | 0.27904 | 0.47767 | 0.64104 | 0.74070 | |
| S-B mesh | 0.74377 | 0.87864 | 0.93450 | 0.96152 | |
| S-mesh | 0.27904 | 0.47767 | 0.64104 | 0.74070 | |
| S-B mesh | 0.74377 | 0.87864 | 0.93450 | 0.96152 | |
Conclusion
In this article, a two-parameter SPP in one dimension with a discontinuous source term and convection coefficient is solved numerically by upwind difference method on a Shishkin-Bakhvalov mesh. At the point of discontinuity, we consider a three-point difference scheme. The theoretical error estimates show that the proposed scheme is first-order convergent in the maximum norm. The use of the Shishkin-Bakhvalov mesh helps in achieving the first-order convergence. The numerical results presented confirm the theoretical error estimates obtained. The numerical order of convergence approaches one as the number of mesh points increases. A comparison table between the numerical order of convergence obtained through the Shishkin mesh and the Shishkin-Bakhvalov mesh shows the efficiency of the mesh used.
CRediT authorship contribution statement
Nirmali Roy: Software, Validation, Formal analysis, Investigation, Resources, Data curation, Writing – original draft, Visualization. Anuradha Jha: Conceptualization, Methodology, Formal analysis, Investigation, Writing – original draft, Writing – review & editing, Visualization, Supervision, Project administration.
Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Acknowledgment
Thanks are due to the anonymous referee(s) and the editor for their valuable comments and suggestions on the initial draft of the article. This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.
Data availability
No data was used for the research described in the article.
References
- 1.Alhumaizi K. Flux limiting solution techniques for simulation of reaction-diffusion-convection system. Commun. Nonlinear Sci. Numer. Simul. 2007;12(6):953–965. [Google Scholar]
- 2.Cen Z. A hybrid difference scheme for a singularly perturbed convection-diffusion problem with discontinuous convection coefficient. Appl. Math. Comput. 2005;169(1):689–699. [Google Scholar]
- 3.Chandru M., Prabha T., Shanthi V. A parameter robust higher order numerical method for singularly perturbed two parameter problems with non-smooth data. J. Comput. Appl. Math. 2017;309:11–27. [Google Scholar]
- 4.Doolan E.P., Miller J.J.H., Schilders W.H. Vol. 1. Boole Press; 1980. Uniform Numerical Methods for Problems with Initial and Boundary Layers. [Google Scholar]
- 5.Farrell P.A., Hegarty A.F., Miller J.J.H., O’Riordan E., Shishkin G.I. Chapman and Hall/CRC, Boca; Raton, FL.: 2000. Robust Computational Techniques for Boundary Layers. [Google Scholar]
- 6.Farrell P.A., Hegarty A.F., Miller J.J.H., O’Riordan E., Shishkin G.I. Global maximum norm parameter-uniform numerical method for a singularly perturbed convection-diffusion problem with discontinuous convection coefficient. Math. Comput. Model. 2004;40(11–12):1375–1392. [Google Scholar]
- 7.Farrell P.A., Hegarty A.F., Miller J.J.H., O’Riordan E., Shishkin G.I. Singularly perturbed convection-diffusion problems with boundary and weak interior layers. J. Comput. Appl. Math. 2004;166:133–151. [Google Scholar]
- 8.Gracia J.L., O’Riordan E., Pickett M.L. A parameter robust second order numerical method for a singularly perturbed two-parameter problem. Appl. Numer. Math. 2006;56(7):962–980. [Google Scholar]
- 9.Hirsch C. Vol. I. Wiley; Chichester: 1990. Numerical Computation of Internal and External Flows. [Google Scholar]
- 10.Kreiss H.O., Lorenz J. Vol. 47. Classics in Appl. Math. SIAM; Philadelphia, PA: 2004. Initial-Boundary Value Problems and the Navier-Stokes Equations. [Google Scholar]; (Reprint of 1989 edition)
- 11.Linß T. An upwind difference scheme on a novel Shishkin-type mesh for a linear convection-diffusion problem. J. Comput. Appl. Math. 1999;110(1):93–104. [Google Scholar]
- 12.Linß T. Finite difference schemes for convection-diffusion problems with a concentrated source and a discontinuous convection field. Comput. Methods Appl. Math. 2002;2(1):41–49. [Google Scholar]
- 13.Markowich P.A. Progr. Sci. Comput. Vol. 5. Birkhäuser Boston; Boston, MA: 1985. A finite difference method for the basic stationary semiconductor device equations. numerical boundary value ODEs (Vancouver, B.C.,1984), 285–301. [Google Scholar]
- 14.Mukherjee K. Parameter- uniform improved hybrid numerical scheme for singularly perturbed problems with interior layers. Math. Model. Anal. 2018;23(2):167–189. [Google Scholar]
- 15.O’Malley Jr R.E. Two-parameter singular perturbation problems for second order equations. J. Math. Mech. 1967;16:1143–1164. [Google Scholar]
- 16.O’Malley Jr R.E. Academic Press; New York: 1974. Introduction to Singular Perturbations. [Google Scholar]
- 17.O’Malley Jr R.E. Springer; New York: 1990. Singular Perturbation Methods for Ordinary Differential Equations. [Google Scholar]
- 18.O’Riordan E., Pickett M.L., Shishkin G.I. Singularly perturbed problems modeling reaction-convection-diffusion processes. Comput. Methods Appl. Math. 2003;3(3):424–442. [Google Scholar]
- 19.Polak S., Heijer C.D., Schilders W. Semiconductor device modelling from the numerical point of view. Int. J. Numer. Methods Eng. 1987;24:763–838. [Google Scholar]
- 20.Prabha T., Chandru M., Shanthi V. Hybrid difference scheme for singularly perturbed reaction-convection-diffusion problem with boundary and interior layers. Appl. Math. Comput. 2017;31:237–256. [Google Scholar]
- 21.Prabha T., Chandru M., Shanthi V., Ramos H. Discrete approximation for a two-parameter singularly perturbed boundary value problem having discontinuity in convection coefficient and source term. J. Comput. Appl. Math. 2019;359:102–118. [Google Scholar]
- 22.Rap A., Elliott L., Ingham D.B., Lesnic D., Wen X. The inverse source problem for the variable coefficients confection-diffusion equation. Inverse Probl. Sci. Eng. 2007;15:413–440. [Google Scholar]
- 23.Roos H.-G., Uzelac Z. The SDFEM for a convection diffusion problem with two small parameters. Comput. Methods Appl. Math. 2003;3(3):443–458. [Google Scholar]
- 24.Shanthi V., Ramanujam N., Natesan S. Fitted mesh method for singularly perturbed reaction-convection-diffusion problems with boundary and interior layers. J. Appl. Math. Comput. 2006;22(1–2):49–65. [Google Scholar]
- 25.Zahra W.K., Daele M.V. Discrete spline solution of singularly perturbed problem with two small parameters on a Shishkin-type mesh. Comput. Math. Model. 2018;29(5):1–15. [Google Scholar]
- 26.Zahra W.K., El Mhlawy A.M. Numerical solution of two-parameter singularly perturbed boundary value problems via exponential spline. J. King Saud Univ. 2013;25(3):201–208. [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
No data was used for the research described in the article.





