# Accelerated Fitted Mesh Scheme for Singularly Perturbed Turning Point Boundary Value Problems

Authors: Tesfaye Aga Bullo
Journal: Journal of Mathematics
 (2022)

---

## Abstract

An accelerated fitted mesh scheme is proposed for the numerical solution of the singularly perturbed boundary value problems whose solution exhibits an interior layer near the turning point. To resolve the interior layer, a mesh of the Shishkin type is used with the help of a transition parameter that separates the layer and regular region. A tridiagonal solver is implemented to solve the system of equation. The stability of the described scheme is analyzed, and the truncation error is obtained. The proposed scheme is of almost second-order convergent and accelerated to almost sixth-order convergent by applying the Richardson extrapolation technique. The numerical results obtained by the present scheme have been compared with some existing methods, and it is observed that it gives better accuracy.


---

## Body

## 1. Introduction

Singularly perturbed differential equations arise in various branches of science and engineering. The well-known examples are the Navier–Stokes equation with large Reynolds number in fluid dynamics, the convective heat transport problems with large Peclet number, and so on. These equations may be divided into singularly perturbed ordinary or partial differential equations and have their physical phenomena in each real-life activities [1–3]. Numerical treatment of the singularly perturbed boundary value problems attracts the attention of researchers because of the presence of boundary and/or interior layers in its solution. In particular, classical finite difference or finite element methods fail to yield satisfactory numerical results on uniform meshes and to obtain stability concerning the perturbation parameter [4, 5].The singularly perturbed boundary valued ordinary differential equations broadly categorized into reaction-diffusion and convection-diffusion types. The convection-diffusion type has also its different types depending on the kind of layers (boundary and/or interior layers) [3–5]. Hence, the singularly perturbed convection-diffusion boundary valued problems are divided into problems exhibiting right or left boundary layer, interior layer or boundary, and interior layers. The layer resolving numerical methods for singularly perturbed differential equations are usually classified into the fitted operator and fitted mesh methods [6]. In fitted operator methods, exponential fitting factors will be used to control the rapid growth or decay of the numerical solution in layer regions. However, fitted mesh methods use nonuniform and nonlinear meshes, which will be fine in layer regions and coarse outside the layer regions. The well-known layer resolving fitted meshes are Bakhvalov meshes, which are obtained from some nonlinear mesh generating function, and Shishkin meshes which are piecewise-uniform meshes. These two meshes require a priori information about the location and width of the layer [7, 8].In this study, a layer resolving higher-order fitted mesh method is suggested for the singularly perturbed turning point boundary value problems of the form:(1)εy″x+axy′x−bxyx=fx,x∈Ω=−1,1,y−1=l1,y1=l2,where the coefficient of diffusion term ε satisfy 0<ε≪1 and called perturbation parameter. Also, l1 andl2 are given constant numbers. Assume that the considered problem has only one turning point atx=0∈Ω¯. That is, the coefficient of convection term ax vanishes exactly atx=0. For the uniqueness of the solution of the problem in equation (1), we also assume that the functions involved in equation (1) are sufficiently smooth. Moreover, it is assumed that the following conditions are satisfied:(2)a0=0,a′0>0,ax<0,x∈−1,0,ax>0,x∈0,1,bx≥β≥0,x∈−1,1,b0a′0≥0.The behavior and location of an interior layer are determined by the conditions provided in equation (2). Numerical treatment of the turning point of the singularly perturbed problems is more problematic than the problems without a turning point. Moreover, problems with turning point problems have attracted more care and have been considered by many researchers both analytically and numerically under various assumptions [9, 10]. These problems have wide applications in the field of physical sciences and engineering such as control theory, electrical networks, lubrication theory, etc. The solution of the proposed problem exhibits an interior layer, to resolve this layer a piecewise-uniform mesh has been generated which is dense in the layer region and coarse otherwise.In the past few decades, various uniformly convergent numerical schemes based on fitted mesh methods are proposed for solving singularly perturbed convection-diffusion problem types. For more details, one can refer to the book in [6] and literature [1, 9, 10]. These referred books and articles may help us just to get prior knowledge about the nature of the solution of these families of problems and where and why the existing methods fail to work. Further, it is a recent and active research area in engineering and applied science. Though many classical numerical methods such as finite difference methods, finite element methods, and finite volume methods have been developed so far, most of them fail to give a more accurate solution. This difficulty is due to the presence of perturbation parameter that causes the existence of a layer where the solutions vary rapidly and behave smoothly away from the layer [11–14].Further, interested researcher or reader can find a real time application of the modeled problem of equation (1) and its analytical properties such as existence of the solution, stability and bounds of the considered problem in the literature [1, 7, 9, 15–19]. Moreover, we have been observed that from different presented methods to solve singularly perturbed problems with turning point due to the vanishments of the convection coefficient (a(0)=0), the family of fitted operator methods are not appropriate. This is due to the occurrences of interior layer and behaviors of fitted operator methods. Furthermore the procedures provided in this paper, focused on the numerical technique to produce accurate numerical solution for the families of the problems with interior layers or one can extend to apply on the multiple turning point problems.


## 2. Description of the Scheme

To define a piecewise-uniform mesh, we consider a positive integerN≥8. Since the solution of the problem under consideration exhibits an interior layer, we chose the transition parameter τ defined by(3)τ=min14,2εlnN.Now, divide the solution domainΩ¯=−1,1 into three subintervals −1,−τ,−τ,τ, and τ,1 with N/4 points in−1,−τ,τ,1, and N/2 points in −τ,τ. Thus, the mesh spacing in these subintervals is given by(4)hi=41−τN,i=1,2,…,N4,3N4+1,…,N,4τN,N4+1,…,3N4,and the mesh pints are given by(5)xi=−1+ihi,i=0,1,2,…,N4,−τ+i−N4hi,N4+1,…,3N4,τ+i−3N4hi,3N4+1,…,N.Denoting this discretization of the solution domain byΩN, and yi is the approximation of yxi, so that the discretization form of equation (1) on ΩN, for i=1,2,…,N−1 is given by(6)εδ2yi+aiδ0yi−biyi=fi,where δ2yi=2/hi+hi+1δ+yi−δ−yi, δ0yi=yi+1−yi−1/hi+hi+1, δ+yi=yi+1−yi/hi+1, and δ−yi=yi−yi−1/hi.Further, equation (6) can be rewritten in the form of three-term recurrence relation of the form:(7)Eiyi−1−Fiyi+Giyi+1=Hi,where Ei=2ε/hihi+hi+1−ai/hi+hi+1, Fi=2ε/hihi+1+bi, Gi=2ε/hi+1hi+hi+1+ai/hi+hi+1, and Hi=fi.


### 2.1. Thomas Algorithm

In this section, the stability of solving the tridiagonal system given in equation (7) is provided. Consider the scheme in equation (7), for i=1,2,…,N−1 and subject to the boundary conditions in equation (1) that can be rewritten as y−1=y0=l1, and y1=yN=l2. Assume that the solution of equation (7) is given by(8)yi=Wiyi+1+Ti,i=N−1,N−2,…,2,1,where Wi and Ti are to be determined.Considering equation (7) at the nodal point xi−1, we have(9)yi−1=Wi−1yi+Ti−1.Substituting equations (9) into (7) gives EiWi−1yi+Ti−1−Fiyi+Giyi+1=Hi, which leads to obtaining the equation:(10)yi=GiFi−EiWi−1yi+1+−Hi+EiTi−1Fi−EiWi−1.Comparing equations (10) with (8), the two values determined as(11)Wi=GiFi−EiWi−1,Ti=−Hi+EiTi−1Fi−EiWi−1.To solve these recurrence relations fori=1,2,…,N−1, we need the initial conditions for W0=0 and we take T0=y0=y−1=l1. With this starting point of initial values, we compute Wi and Ti for i=1,2,…,N−1 from equation (11) in the forward process, and then obtain yi in the backward process from equation (8) and from the boundary condition y1=yN=l2. Further, the conditions for the discrete invariant imbedding algorithm to be stable, if and only if [11](12)Fi≥Ei+Gi.Hence, the Thomas algorithm is stable for the described numerical scheme.


### 2.2. Truncation Error

In this section, the truncation error for the described method will be investigated. To achieve this investigation, the local truncation errorThi between the exact solution yxi, and the approximate solution yi is given by(13)Thi=εy″xi+axiy′xi−bxiyxi−2εhi+hi+1δ+yi−δ−yi+aiδ0yi−biyi.Using Taylor’s series expansion toyi around xi, we have the approximation for yi±1 as(14)yi+1=yi+hi+1yi′+hi+122yi″+hi+136yi′″+hi+1424yi4+Ohi+15,yi−1=yi−hiyi′+hi22yi″−hi36yi′″+hi424yi4+Ohi5.From these two basic equations, we obtain the following:(15)δ+yi=yi+1−yihi+1=yi′+hi+12yi″+hi+126yi′″+hi+1324yi4+Ohi+14,(16)δ−yi=yi−yi−1hi=yi′−hi2yi″+hi26yi′″−hi324yi4+Ohi4,(17)δ0yi=yi+1−yi−1hi+1+hi=hi+1−hi2yi″+hi+13+hi36hi+1+hiyi′″+….Substituting equations (15)–(17) into (13) and recall at the nodal point xi: y″xi=yi″axiy′xi=aiyi′, and bxiyxi=biyi, we get(18)Thi=−hi+1−hi2yi″−ε3hi+1−hi+hi+13+hi36hi+1+hiyi′″+….However,hi+1−hi=0, in the outer and interior layer regions. From the considered piecewise discretization of the solution domain, assume that the value of chosen transition parameter is τ=2εlnN. Thus, in the neighborhoods between the inner and outer layer region, we have:(19)hi+1−hi=41−τN−4τN=4−8τN=4−8εlnNN.Since the considered problem exhibits an interior layer, the described scheme works on piecewise discretization. Thus, we have to consider the values of the perturbation parameter,ε≤4/N. Substituting this inequality into equation (19) gives(20)hi+1−hi≤4−84/NlnNN=4N−16lnNNN≤N−2.Thus, from equations (18) and (20) the norm of truncation error for the formulated scheme is(21)T≤CN−2,where C=1/2yi″∞ is arbitrary constant.Furthermore, within each subinterval−1,−τ, −τ,τ and τ,1, we have the uniform mesh length h≤2/N. Thus, h2≤N−2. Therefore, the described method is almost second-order convergent. Truncation errors measure how well a finite difference discretization approximates the differential equation. Thus, the described scheme is almost second-order accurate. A finite difference scheme is known as consistent if the limit of truncation error is equal to zero as the mesh size goes to zero, [4]. Hence, this definition of consistency on the described method with the local truncation error in equation (18) is satisfied. Therefore, using this consistency and stability criteria provided in equation (12), the proposed scheme is convergent.


### 2.3. Richardson Extrapolation

Richardson extrapolation is that whenever the leading term in the error for an approximation scheme is known. By combining two or more approximations obtained from that scheme using different values of mesh lengths:hi, hi/2, hi/4, … to obtain a higher-order approximation and the technique is known as Richardson extrapolation. This procedure is a convergence acceleration technique that consists of considering a linear combination of two computed approximations of a solution.Particularly in our case, the described numerical scheme is almost second-order convergent as verified in equation (21). With the purpose of this equation, we have(22)yxi−yiN≤Chi2,where yxi and yiN are exact and approximate solutions, respectively, C is a constant independent of mesh sizes hi and perturbation parameters. Let us be the mesh obtained by bisecting each mesh interval in ΩN and denote the approximation of the solution on Ω2N by yi2N. Then, consider equation (22) works for any hi≠0, which implies(23)yxi−yiN≈Chi2+RN,xi∈Ω¯.So that, it works for anyhi/2≠0 yields(24)yxi−yi2N≈Chi22+R2N,xi∈Ω¯,where the remainders, RN and R2N are Oh4.Eliminating the constantC from equations (23) and (24) leads to 3yxi−4yi2N−yiN≅Oh4, which suggests that(25)yiNext=134y2N−yN,is also an approximation of yxi.Using this approximation to evaluate the truncation error, we obtain(26)yxi−yiNext≤Chi4.Now, using these two different solutions which are obtained by the same scheme given by equation (7), we get another third solution in terms of the two by equation (25). This is the Richardson extrapolation technique to accelerate the almost second-order to almost fourth-order convergent. Similar to these procedures eliminating the constant C1,C2,C3,… from the system of equations:(27)yxi−yiN≈C1hi2+C2hi4+C3hi6+C4hi8+…,yxi−yi2N≈C1hi22+C2hi24+C3hi26+C4hi28+…,yxi−yi2N≈C1hi22+C2hi24+C3hi26+C4hi28+…,yxi−yi4N≈C1hi42+C2hi44+C3hi46+C4hi48+….We obtain the two fourth-orders convergent numerical scheme:(28)yiN4ext=134yi2N−yiN,yi2N4ext=134yi4N−yi2N,which gives the sixth-order convergent:(29)yiN6ext=11516yi2N4ext−yiN4ext.


## 2.1. Thomas Algorithm

In this section, the stability of solving the tridiagonal system given in equation (7) is provided. Consider the scheme in equation (7), for i=1,2,…,N−1 and subject to the boundary conditions in equation (1) that can be rewritten as y−1=y0=l1, and y1=yN=l2. Assume that the solution of equation (7) is given by(8)yi=Wiyi+1+Ti,i=N−1,N−2,…,2,1,where Wi and Ti are to be determined.Considering equation (7) at the nodal point xi−1, we have(9)yi−1=Wi−1yi+Ti−1.Substituting equations (9) into (7) gives EiWi−1yi+Ti−1−Fiyi+Giyi+1=Hi, which leads to obtaining the equation:(10)yi=GiFi−EiWi−1yi+1+−Hi+EiTi−1Fi−EiWi−1.Comparing equations (10) with (8), the two values determined as(11)Wi=GiFi−EiWi−1,Ti=−Hi+EiTi−1Fi−EiWi−1.To solve these recurrence relations fori=1,2,…,N−1, we need the initial conditions for W0=0 and we take T0=y0=y−1=l1. With this starting point of initial values, we compute Wi and Ti for i=1,2,…,N−1 from equation (11) in the forward process, and then obtain yi in the backward process from equation (8) and from the boundary condition y1=yN=l2. Further, the conditions for the discrete invariant imbedding algorithm to be stable, if and only if [11](12)Fi≥Ei+Gi.Hence, the Thomas algorithm is stable for the described numerical scheme.


## 2.2. Truncation Error

In this section, the truncation error for the described method will be investigated. To achieve this investigation, the local truncation errorThi between the exact solution yxi, and the approximate solution yi is given by(13)Thi=εy″xi+axiy′xi−bxiyxi−2εhi+hi+1δ+yi−δ−yi+aiδ0yi−biyi.Using Taylor’s series expansion toyi around xi, we have the approximation for yi±1 as(14)yi+1=yi+hi+1yi′+hi+122yi″+hi+136yi′″+hi+1424yi4+Ohi+15,yi−1=yi−hiyi′+hi22yi″−hi36yi′″+hi424yi4+Ohi5.From these two basic equations, we obtain the following:(15)δ+yi=yi+1−yihi+1=yi′+hi+12yi″+hi+126yi′″+hi+1324yi4+Ohi+14,(16)δ−yi=yi−yi−1hi=yi′−hi2yi″+hi26yi′″−hi324yi4+Ohi4,(17)δ0yi=yi+1−yi−1hi+1+hi=hi+1−hi2yi″+hi+13+hi36hi+1+hiyi′″+….Substituting equations (15)–(17) into (13) and recall at the nodal point xi: y″xi=yi″axiy′xi=aiyi′, and bxiyxi=biyi, we get(18)Thi=−hi+1−hi2yi″−ε3hi+1−hi+hi+13+hi36hi+1+hiyi′″+….However,hi+1−hi=0, in the outer and interior layer regions. From the considered piecewise discretization of the solution domain, assume that the value of chosen transition parameter is τ=2εlnN. Thus, in the neighborhoods between the inner and outer layer region, we have:(19)hi+1−hi=41−τN−4τN=4−8τN=4−8εlnNN.Since the considered problem exhibits an interior layer, the described scheme works on piecewise discretization. Thus, we have to consider the values of the perturbation parameter,ε≤4/N. Substituting this inequality into equation (19) gives(20)hi+1−hi≤4−84/NlnNN=4N−16lnNNN≤N−2.Thus, from equations (18) and (20) the norm of truncation error for the formulated scheme is(21)T≤CN−2,where C=1/2yi″∞ is arbitrary constant.Furthermore, within each subinterval−1,−τ, −τ,τ and τ,1, we have the uniform mesh length h≤2/N. Thus, h2≤N−2. Therefore, the described method is almost second-order convergent. Truncation errors measure how well a finite difference discretization approximates the differential equation. Thus, the described scheme is almost second-order accurate. A finite difference scheme is known as consistent if the limit of truncation error is equal to zero as the mesh size goes to zero, [4]. Hence, this definition of consistency on the described method with the local truncation error in equation (18) is satisfied. Therefore, using this consistency and stability criteria provided in equation (12), the proposed scheme is convergent.


## 2.3. Richardson Extrapolation

Richardson extrapolation is that whenever the leading term in the error for an approximation scheme is known. By combining two or more approximations obtained from that scheme using different values of mesh lengths:hi, hi/2, hi/4, … to obtain a higher-order approximation and the technique is known as Richardson extrapolation. This procedure is a convergence acceleration technique that consists of considering a linear combination of two computed approximations of a solution.Particularly in our case, the described numerical scheme is almost second-order convergent as verified in equation (21). With the purpose of this equation, we have(22)yxi−yiN≤Chi2,where yxi and yiN are exact and approximate solutions, respectively, C is a constant independent of mesh sizes hi and perturbation parameters. Let us be the mesh obtained by bisecting each mesh interval in ΩN and denote the approximation of the solution on Ω2N by yi2N. Then, consider equation (22) works for any hi≠0, which implies(23)yxi−yiN≈Chi2+RN,xi∈Ω¯.So that, it works for anyhi/2≠0 yields(24)yxi−yi2N≈Chi22+R2N,xi∈Ω¯,where the remainders, RN and R2N are Oh4.Eliminating the constantC from equations (23) and (24) leads to 3yxi−4yi2N−yiN≅Oh4, which suggests that(25)yiNext=134y2N−yN,is also an approximation of yxi.Using this approximation to evaluate the truncation error, we obtain(26)yxi−yiNext≤Chi4.Now, using these two different solutions which are obtained by the same scheme given by equation (7), we get another third solution in terms of the two by equation (25). This is the Richardson extrapolation technique to accelerate the almost second-order to almost fourth-order convergent. Similar to these procedures eliminating the constant C1,C2,C3,… from the system of equations:(27)yxi−yiN≈C1hi2+C2hi4+C3hi6+C4hi8+…,yxi−yi2N≈C1hi22+C2hi24+C3hi26+C4hi28+…,yxi−yi2N≈C1hi22+C2hi24+C3hi26+C4hi28+…,yxi−yi4N≈C1hi42+C2hi44+C3hi46+C4hi48+….We obtain the two fourth-orders convergent numerical scheme:(28)yiN4ext=134yi2N−yiN,yi2N4ext=134yi4N−yi2N,which gives the sixth-order convergent:(29)yiN6ext=11516yi2N4ext−yiN4ext.


## 3. Numerical Illustrations

In this section, to endorse the applicability, efficiency, and effectiveness of the formulated scheme, model examples are considered. Furthermore, for the sake of comparison, the test examples have an exact solution [9]. However, it is possible to use the proposed method for modeled examples that have no exact solution and for its comparison double mesh principle will be used. Computational results are provided in the form of tables and figures. The errors presented in the tables are calculated in the maximum norm as(30)EN=maxiyxi−yi,fori=0,1,2,…,N,where yxi and yi are the exact and approximate solutions of the given problem at xi. The computed rate of convergence is defined by the formula [4]:(31)R=logEN−logE2Nlog2.Example 1.
Consider the singularly perturbed problem given by(32)εy″x+xy′x=−πxsinπx−επ2cosπx,−1<x<1,y−1=−2,y1=0.
The solution exhibits an interior layer of widthOεlnε at x=0.
The exact solution to the problem isyx=cosπx+erfx/2ε/erf1/2ε.Example 2.
Consider the singular perturbation problem,(33)εy″x+2xy′x=0,−1<x<1,y−1=−1,y1=1.
The solution exhibits an interior layer of widthOεlnε at x=0.
The exact solution to the problem isyx=erfx/ε/erf1/ε.
The computed maximum absolute errors and rate of convergences are presented in Tables1–4 The more recently existing results and the computational results for examples under consideration are compared in Tables 1–3. These results clearly show that the described scheme is more accurate than other existing methods. Also, Table 4 shows that the conformation of the accelerated rate of with the theoretical descriptions. Moreover, the described scheme is shown to be accelerated to almost uniformly convergent of sixth order. From the results presented in the Tables, it can be se en that the errors decrease as the perturbation parameter ε, decreases and after a certain, ε it stabilized which confirms the uniform convergence. The effectiveness and accuracy of the described scheme are confirmed by the comparison with existing results. Figure 1, verify that the physical behavior of the solution exhibits an interior layer. Further, Figure 2 indicates the effects of perturbation parameter on the solution profile that causes the maximum errors occurred for the two considered examples respectively.Table 1
Comparison of maximum absolute errors for Example1.
ε↓N⟶163264128256512Present method2−83.2593e − 033.2354e − 041.4027e − 053.5305e − 075.5660e − 097.8408e − 112−125.2735e − 031.2840e − 035.1993e − 049.2506e − 051.1128e − 058.4250e − 072−166.8477e − 031.5913e − 033.7413e − 041.1250e − 044.4767e − 059.6625e − 062−207.1858e − 031.7060e − 034.1918e − 041.0273e − 042.4288e − 058.5800e − 062−247.2686e − 031.7292e − 034.2747e − 041.0638e − 042.6433e − 056.4898e − 062−287.2868e − 031.7347e − 034.2920e − 041.0700e − 042.6715e − 056.6661e − 062−327.2912e − 031.7360e − 034.2962e − 041.0714e − 042.6764e − 056.6884e − 06Results in [9]2−81.77e − 011.02e − 016.00e − 024.06e − 023.10e − 022.64e − 022−121.49e − 015.00e − 022.55e − 021.44e − 028.64e − 035.46e − 032−161.93e − 014.80e − 021.06e − 024.65e − 032.34e − 031.30e − 032−202.05e − 015.44e − 021.32e − 023.02e − 038.48e − 043.72e − 042−242.08e − 015.61e − 021.41e − 023.46e − 038.19e − 041.82e − 042−282.09e − 015.66e − 021.44e − 023.58e − 038.84e − 042.14e − 042−322.09e − 015.67e − 021.44e − 023.61e − 039.00e − 042.23e − 04Table 2
Comparison of maximum absolute errors for Example2.
ε↓N⟶163264128256512Present method2−87.2136e − 053.0317e − 064.7218e − 087.1839e − 101.1296e − 114.0901e − 132−123.8966e − 031.0833e − 044.2209e − 061.5688e − 075.1949e − 091.6333e − 102−163.9313e − 031.0915e − 044.2209e − 061.5688e − 075.1949e − 091.6334e − 102−203.9336e − 031.0921e − 044.2209e − 061.5688e − 075.1949e − 091.6333e − 102−243.9338e − 031.0921e − 044.2209e − 061.5688e − 075.1949e − 091.6335e − 102−283.9338e − 031.0921e − 044.2209e − 061.5688e − 075.1949e − 091.6333e − 102−323.9338e − 031.0921e − 044.2209e − 061.5688e − 075.1949e − 091.6334e − 10Results in [9]2−85.43e − 021.48e − 023.24e − 036.61e − 041.88e − 045.10e − 052−126.31e − 021.57e − 023.47e − 039.45e − 042.75e − 047.71e − 052−166.63e − 021.62e − 023.66e − 031.02e − 032.98e − 048.38e − 052−206.67e − 021.61e − 023.73e − 031.04e − 033.03e − 048.54e − 052−246.69e − 021.61e − 023.75e − 031.04e − 033.05e − 048.58e − 052−286.69e − 021.61e − 023.75e − 031.04e − 033.05e − 048.59e − 052−326.69e − 021.61e − 023.75e − 031.04e − 033.05e − 048.60e − 05Table 3
Comparison of maximum absolute errors for Example2.
ε↓N = 128N = 256N = 512Results in [9]Present methodResults in [9]Present methodResults in [9]Present method2−41.58e − 024.5980e − 109.80e − 041.6310e − 108.03e − 056.7635e − 132−81.61e − 027.1839e − 101.04e − 031.6310e − 108.54e − 054.0901e − 132−101.61e − 024.7218e − 081.04e − 037.1838e − 108.59e − 051.1305e − 112−121.61e − 021.5688e − 071.05e − 035.1949e − 098.60e − 051.6333e − 10Table 4
Computed rate of convergence for Example2.
ε↓N⟶1632641282562−84.57256.00466.03845.99094.78752−125.16874.68174.74984.91644.99122−165.17064.69264.74984.91644.99112−205.17074.69344.74984.91644.99122−245.17074.69344.74984.91644.99122−285.17074.69344.74984.91644.99122−325.17074.69344.74984.91644.9912Figure 1
Graphs of approximate and exact solutions for Examples1 and 2 respectively, when ε=2−10 and N=64.Figure 2
Point wise absolute errors for Examples1 and 2 respectively, when ε=2−12 and N=128.


## 4. Conclusion

In this paper, singularly perturbed turning point boundary value problems are solved numerically by the accelerated Shishkin mesh type. This is sufficiently used to resolve the problems under consideration and gives accurate results even for small perturbation parameters closer and closer to zero. The stability of the described scheme is analyzed and the truncation error is obtained that guarantees its convergence. The proposed scheme is of almost second-order convergent and accelerated to almost sixth-order convergent by applying the Richardson extrapolation technique. The numerical results obtained by the present scheme have been compared with some existing methods and it is observed that the proposed scheme gives better accuracy.



---

*Source: 3767246-2022-03-15.xml*