Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống
1
/ 13 trang
THÔNG TIN TÀI LIỆU
Thông tin cơ bản
Định dạng
Số trang
13
Dung lượng
512,66 KB
Nội dung
Hindawi Publishing Corporation Advances in Difference Equations Volume 2010, Article ID 102484, 13 pages doi:10.1155/2010/102484 ResearchArticleUniformSecond-OrderDifferenceMethodforaSingularlyPerturbedThree-PointBoundaryValue Problem Musa C¸ akır Department of Mathematics, Faculty of Sciences, Y ¨ uz ¨ unc ¨ u Yil University, 65080 Van, Turkey Correspondence should be addressed to Musa C¸akır, cakirmusa@hotmail.com Received 21 June 2010; Accepted 15 October 2010 Academic Editor: Paul Eloe Copyright q 2010 Musa C¸akır. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We consider asingularlyperturbed one-dimensional convection-diffusion three-pointboundaryvalue problem with zeroth-order reduced equation. The monotone operator is combined with the piecewise uniform Shishkin-type meshes. We show that the scheme is second-order convergent, in the discrete maximum norm, independently of the perturbation parameter except fora logarithmic factor. Numerical examples support the theoretical results. 1. Introduction We consider the following singularlyperturbedthree-pointboundaryvalue problem: Lu : ε 2 u x εa x u x − b x u x f x , 0 <x<, 1.1 u 0 A, L 0 u : u − γu 1 B, 0 < 1 <, 1.2 where ε ∈ 0, 1 is the perturbation parameter, and, A, B, and γ are given constants. The functions ax ≥ 0, bx ≥ β>0andfx are sufficiently smooth. For 0 <ε 1 the function ux has in general boundary layers at x 0andx . Equations of this type arise in mathematical problems in many areas of mechanics and physics. Among these are the Navier-Stokes equations of fluid flow at high Reynolds number, mathematical models of liquid crystal materials and chemical reactions, shear in second-order fluids, control theory, electrical networks, and other physical models 1, 2. 2 Advances in Difference Equations Differential equations with a small parameter 0 <ε 1 multiplying the highest order derivatives are called singularlyperturbed differential equations. Typically, the solutions of such equations have steep gradients in narrow layer regions of the domain. Classical numerical methods are inappropriate forsingularlyperturbed problems. Therefore, it is important to develop suitable numerical methods to these problems, whose accuracy does not depend on the parameter value ε; that is, methods that are convergence ε-uniformly 1–5. One of the simplest ways to derive such methods consists of using a class of special piecewise uniform meshes a Shishkin mesh, see, e.g., 4–8 for motivation for this type of mesh, which are constructed a priori in function of sizes of parameter ε, the problem data, and the number of corresponding mesh points. Three-pointboundaryvalue problems have been studied extensively in the literature. Fora discussion of existence and uniqueness results and for applications of three-point problems, see 9–12 and the references cited in them. Some approaches to approximating this type of problem have also been considered 13, 14. However, the algorithms developed in the papers cited above are mainly concerned with regular cases i.e., when boundary layers are absent. Fitted difference scheme on an equidistant mesh for the numerical solution of the linear three-point reaction-diffusion problem have been studied in 15. Auniform finite difference method, which is first-order convergent, on an S-mesh Shishkin type mesh forasingularlyperturbed semilinear one-dimensional convection-diffusion three-pointboundaryvalue problem have also been studied in 16. Computational methods forsingularlyperturbed problems with two small parameters have been studied in different ways 17–21. In this paper, we propose the hybrid scheme for solving the nonlocal problem 1.1-1.2, which comprises three kinds of schemes, such as Samarskii’s scheme 22,afinitedifference scheme with uniform mesh, and finite difference scheme on piecewise uniform mesh. The considered algorithm is monotone. We will prove that the methodfor the numerical solution of the three-pointboundaryvalue problem 1.1-1.2 is uniformly convergent of order N −2 ln 2 N on special piecewise equidistant mesh, in discrete maximum norm, independently of singular perturbation parameter. In Section 2, we present some analytical results of the three-pointboundaryvalue problem 1.1-1.2.InSection 3, we describe some monotone finite-difference discretization and introduce the piecewise uniform grid. In Section 4, we analyze the convergence properties of the scheme. Finally, numerical examples are presented in Section 5. Notation 1. Henceforth, C denote the generic positive constants independent of ε and of the mesh parameter. Such a subscripted constant is also independent of ε and mesh parameter, but whose value is fixed. Assumption 1. In what follows, we will assume that ε ≤ CN −1 , which is nonrestrictive in practice. 2. Properties of the Exact Solution For constructing layer-adapted meshes correctly, we need to know the asymptotic behavior of the exact solution. This behavior will be used later in the analysis of the uniform convergence of the finite difference approximations defined in Section 3. For any continuous function vx, we use v ∞ for the continuous maximum norm on the corresponding interval. Advances in Difference Equations 3 Lemma 2.1. If a, b, and f ∈ C 2 0,, the solution of 1.1-1.2 satisfies the following estimates: u ∞ ≤ C, u k x ≤ C 1 1 ε k e −μ 1 x/ε e −μ 2 −x/ε , 0 ≤ x ≤ , k 1, 2, 3, 4, 2.1 provided that bx − εa x ≥ β ∗ > 0 and |γ| < 1, where μ 1 1 2 a 2 0 4β ∗ a 0 , μ 2 1 2 a 2 4β ∗ − a . 2.2 Proof. The proof is almost identical to that of 16, 23. 3. Discretization and Piecewise Uniform Mesh Introduce an arbitrary nonuniform mesh on the segment 0, ω N { 0 <x 1 < ···<x N−1 < } , ω N ω N ∪ { x 0 0,x N } . 3.1 Let h i x i − x i−1 be a mesh size at the node x i and i h i h i1 /2 be an average mesh size. Before describing our numerical method, we introduce some notation for the mesh functions. Define the following finite differences for any mesh function v i vx i given on ω N by v x,i v i − v i−1 h i ,v x,i v i1 − v i h i1 ,v 0 x ,i v x,i v x,i 2 , v x,i v i1 − v i i , i h i h i1 2 ,v x x,i v x,i − v x,i , w ∞ ≡ w ∞,ω N : max 0≤i≤N | w i | . 3.2 For equidistant subintervals of t he mesh, we use the finite differences in the form v x,i v i − v i−1 h ,v x,i v i1 − v i h ,v xx,i v x,i − v x,i h . 3.3 To approximate the solution of 1.1-1.2,weemployafinitedifference scheme defined on a piecewise uniform Shishkin mesh. This mesh is defined as follows. We divide each of the intervals 0,σ 1 and −σ 2 , into N/4 equidistant subintervals, and we divide σ 1 , − σ 2 into N/2 equidistant subintervals, where N is a positive integer 4 Advances in Difference Equations divisible by 4. The transition points σ 1 and σ 2 , which separate the fine and coarse portions of the mesh, are obtained by taking σ 1 min 4 ,μ −1 1 ε ln N ,σ 2 min 4 ,μ −1 2 ε ln N , 3.4 where μ 1 and μ 2 are given in Lemma 2.1. In practice, we usually have σ i i 1, 2,andso themeshisfineon0,σ 1 , − σ 2 , and coarse on σ 1 ,− σ 2 . Hence, if we denote the step sizes in 0,σ 1 , σ 1 ,− σ 2 ,and − σ 2 , by h 1 , h 2 , and h 3 , respectively, we have h 1 4σ 1 N ,h 2 2 − σ 2 − σ 1 N ,h 3 4σ 2 N ,h 2 1 2 h 1 h 3 2 N , h k ≤ N −1 ,k 1, 3,N −1 ≤ h 2 < 2N −1 , 3.5 so that ω N x i ih 1 ,i 0, 1, , N 4 ; x i σ 1 i − N 4 h 2 ,i N 4 1, , 3N 4 ; x i − σ 2 i − 3N 4 h 3 ,i 3N 4 1, ,N,h 1 4σ 1 N ,h 2 2 − σ 2 − σ 1 N , h 3 4σ 2 N . 3.6 On this mesh, we define the following finite difference schemes: L h 1 u i ≡ ε 2 k i u xx,i εa i u x,i − b i u i f i − R 1 i , for i 1, 2, , N 4 − 1; i 3N 4 1, ,N, L h 2 u i ≡ ε 2 u xx,i εa i u x,i − b i u i f i − R 2 i , for i N 4 1, , 3N 4 − 1, L h 3 u i ≡ ε 2 u x x,i εa i u x,i − b i u i f i − R 3 i , for i N 4 , 3N 4 , 3.7 Advances in Difference Equations 5 where k i 1 1 a i h/2ε , 3.8 R 1 i − ε 2 h 6 x i1 x i−1 ϕ 1 i x u 4 x dx − εa i h 4 x i1 x i−1 ψ i x u x dx − a 2 i h 2 4 1 a i h/2ε u xx,i , 3.9 R 2 i − ε 2 2 x i1 x i−1 ϕ 2 i x u x dx − εa i h −1 x i1 x i x i1 − x u x dx, 3.10 R 3 i − ε 2 2 x i1 x i−1 ϕ 3 i x u x dx − εa i h −1 i1 x i1 x i x i1 − x u x dx, 3.11 with the usual piecewise linear basis functions ψ i x ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ x − x i−1 h 2 ,x i−1 <x<x i , x i1 − x h 2 ,x i <x<x i1 , ϕ 1 i x 1 − h −1 | x − x i | 3 ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ x − x i−1 h 3 ,x i−1 <x<x i , x i1 − x h 3 ,x i <x<x i1 , ϕ 2 i x ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ − x − x i−1 h 2 ,x i−1 <x<x i , x i1 − x h 2 ,x i <x<x i1 , ϕ 3 i x ⎧ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎩ x − x i−1 2 h i i ,x i−1 <x<x i , x i1 − x 2 h i i1 ,x i <x<x i1 . 3.12 It is now necessary to define an approximation for the second boundary condition of 1.2.Letx N 0 be the mesh point nearest to 1 . Then, using interpolating quadrature formula with respect to x N 0 and x N 0 1 , we can write u x x − x N 0 1 x N 0 − x N 0 1 u x N 0 x − x N 0 x N 0 1 − x N 0 u x N 0 1 r x , 3.13 where r x 1 2 f ξ x − x N 0 x − x N 0 1 ,ξ∈ x N 0 , 1 . 3.14 6 Advances in Difference Equations Substituting x 1 into 3.13, f or the second boundary condition of 1.2,weobtain u N − γ 1 − x N 0 1 x N 0 − x N 0 1 u x N 0 1 − x N 0 x N 0 1 − x N 0 u x N 0 1 r x B. 3.15 Based on 3.7 and 3.15, we propose the following difference scheme for approximat- ing 1.1-1.2: h 1 y i ≡ ε 2 k i y xx,i εa i y x,i − b i y i f i i 1, 2, , N 4 − 1; i 3N 4 1, ,N, 3.16 h 2 y i ≡ ε 2 y xx,i εa i y x,i − b i y i f i i N 4 1, , 3N 4 − 1, 3.17 h 3 y i ≡ ε 2 y x x,i εa i y x,i − b i y i f i i N 4 , 3N 4 , 3.18 y 0 A, 0 y ≡ y N − γ 1 − x N 0 1 x N 0 − x N 0 1 y x N 0 1 − x N 0 x N 0 1 − x N 0 y x N 0 1 B. 3.19 4. Uniform Error Estimates Let z y − u, x ∈ ω N . Then, the error in the numerical solution satisfies h z ≡ R i ,i 1, 2, ,N− 1, z 0 0,z N − γ 1 − x N 0 1 x N 0 − x N 0 1 z N 0 1 − x N 0 x N 0 1 − x N 0 z N 0 1 r, 4.1 where R i R 1 i R 2 i R 3 i , 4.2 and r is defined by 3.14. Lemma 4.1. Let z i be the solution to 4.1. Then, the estimate z ∞, N ≤ C R ∞,ω N | r | 4.3 holds. Proof. The proof is almost identical to that of 16, 23. Advances in Difference Equations 7 Lemma 4.2. Under the above assumptions of Section 1 and Lemma 2.1, the following estimates hold for the error functions R i and r: R ∞,ω N ≤ C N −1 ln N 2 , | r | ≤ C N −1 ln N 2 . 4.4 Proof. The argument now depends on whether σ 1 σ 2 /4orσ 1 μ −1 1 ε ln N and σ 2 μ −1 2 ε ln N. In the first case μ −1 1 ε ln N ≥ 4 ,μ −1 2 ε ln N ≥ 4 , 4.5 and the mesh is uniform with h 1 h 2 h 3 N −1 for all i, 1 ≤ i ≤ N. Therefore, from 3.9, we have R 1 i ≤ C ε 2 h x i1 x i−1 u 4 x dx εh x i1 x i−1 u x dx h x i1 x i−1 u x dx ≤ C h 2 ε 2 ≤ C 16μ −2 1 ln 2 N 2 4 2 N 2 ≤ C N −1 ln N 2 . 4.6 The same estimate is obtained for R 2 i and R 3 i in a similar manner. In the second case μ −1 1 ε ln N< 4 ,μ −1 2 ε ln N< 4 , 4.7 and the mesh is piecewise uniform with t he mesh spacing 4σ 1 /N and 4σ 2 /N in the subintervals 0,σ 1 and − σ 2 ,, respectively, and 2 − σ 2 − σ 1 /N in the subinterval σ 1 ,−σ 2 . We have the estimate R 1 i in 0,σ 1 and −σ 2 , and the estimate R 2 i in σ 1 ,−σ 2 . In the layer region 0,σ 1 , the estimate R 1 i reduces to R 1 i ≤ C h 1 ε 2 ≤ C 16μ −2 1 ε 2 ln 2 N ε 2 N 2 , 1 ≤ i ≤ N 4 − 1. 4.8 Hence, R 1 i ≤ CN −2 ln 2 N, 1 ≤ i ≤ N 4 − 1. 4.9 8 Advances in Difference Equations The same estimate is obtained in the layer region − σ 2 , in a similar manner. We now have to estimate R 2 i for N/4 1 ≤ i ≤ 3N/4 − 1. In this case, we are able to rewrite R 2 i as follows: R 2 i ≤ C ε 2 x i1 x i−1 u x dx ε x i1 x i−1 u x dx ≤ C ε 2 h 2 εh 2 μ −1 1 e −μ 1 x i−1 /ε − e −μ 1 x i1 /ε μ −1 2 e −μ 2 −x i1 /ε − e −μ 2 −x i−1 /ε , N 4 1 ≤ i ≤ 3N 4 − 1. 4.10 Since x i 2μ −1 1 ε ln N i − N 4 h 2 , 4.11 it follows that e −μ 1 x i−1 /ε − e −μ 1 x i1 /ε 1 N 2 e −μ 1 i−1−N/4h 2 /ε 1 − e −2μ 1 h 2 /ε <N −2 . 4.12 Also, if we rewrite the mesh points in the form x i − σ 2 − 3N/4 − ih 2 , evidently e −μ 2 −x i1 /ε − e −μ 2 −x i−1 /ε 1 N 2 e −μ 2 3N/4−i−1h 2 /ε 1 − e −2μ 2 h 2 /ε <N −2 . 4.13 The last two inequalities together, 4.10, give the bound R 2 i ≤ CN −2 , N 4 1 ≤ i ≤ 3N 4 . 4.14 Finally, we estimate R 3 i for the mesh points x N/4 and x 3N/4 . For the mesh point x N/4 , R 3 i reduces to R 3 i ≤ C ε 2 x N/4 x N/4−1 x N/4−1 − x 2 h 1 h 1 h 2 u x dx ε 2 x N/41 x N/4 x N/41 − x 2 h 2 h 1 h 2 u x dx ε h 2 −1 x N/41 x N/4 x N/4 − x u x dx ≤ C ε 2 h 1 ε 2 h 2 εh 2 1 ε x N/4 x N/4−1 e −μ 1 x/ε e −μ 2 −x/ε dx 1 ε x N/41 x N/4 e −μ 1 x/ε e −μ 2 −x/ε dx . 4.15 Advances in Difference Equations 9 Since e −μ 1 x N/4−1 /ε − e −μ 1 x N/4 /ε e −μ 1 N/4−1h 1 /ε 1 − e −μ 1 h 1 /ε 1 N 2 1 − e −μ 1 h 1 /ε <N −2 , e −μ 2 −x N/4 /ε − e −μ 2 −x N/4−1 /ε e −μ 2 −x N/4 /ε 1 − e −μ 2 h 1 /ε 1 N 2 e −μ 2 N/2h 2 /ε 1 − e −μ 2 h 1 /ε <N −2 , e −μ 1 x N/4 /ε − e −μ 1 x N/41 /ε 1 N 2 1 − e −μ 1 h 2 /ε <N −2 , e −μ 2 −x N/41 /ε − e −μ 2 −x N/4 /ε 1 N 2 e −μ 2 N/2−1h 2 /ε 1 − e −μ 2 h 2 /ε <N −2 , 4.16 it then follows that R 3 i ≤ CN −2 . 4.17 The same estimate is obtained for i 3N/4 in a similar manner. This estimate is valid when only one of the values of σ 1 or σ 2 is equal to /4. Next, we estimate the remainder term r. Suppose that 1 ∈ 2α −1 ε| ln ε|,− 2α −1 ε| ln ε|, and the second derivative of f on this interval is bounded. From 3.14,weobtain | r | ≤ C f ξ x − x N 0 x − x N 0 1 ≤ C | x − x N 0 x − x N 0 1 | ≤ C h 2 2 ≤ C N −1 ln N 2 . 4.18 Combining Lemmas 2 and 3 gives us the following convergence result. Theorem 4.3. Let ux be the solution of (1) and y be the solution of (29). Then, y − u ∞, N ≤ CN −2 ln 2 N. 4.19 5. Algorithm and Numerical Results In this section, we present some numerical results which illustrate the present method. a The difference scheme 3.16–3.19 can be rewritten as A i y i−1 − C i y i B i y i1 −F i ,i 1, 2, ,N− 1, 5.1 10 Advances in Difference Equations where A i 2ε 3 h 1 2 2ε a i h 1 ,B i 2ε 3 h 1 2 2ε a i h 1 εa i h 1 , C i 4ε 3 h 1 2 2ε a i h 1 εa i h 1 b i ,i 1, 2, , N 4 − 1; 3N 4 1, ,N, A i ε 2 h 2 2 ,B i ε 2 h 2 2 εa i h 2 ,C i ε 2 h 2 2 εa i h 2 b i ,i N 4 1, , 3N 4 − 1, A i ε 2 h i ,B i ε 2 h i1 εa i h i1 ,C i ε 2 h i1 ε 2 h i εa i h i1 b i , h i h i1 2 ,i N 4 , 3N 4 , F i −f i ,i 1, 2, ,N − 1. 5.2 System 5.1 and 3.19 is solved by the following factorization procedure: α 1 0,β 1 0, α i1 B i C i − A i α i ,β i1 F i A i β i C i − A i α i ,i 1, 2, ,N− 1, σ 1 min 4 ,μ −1 1 ε ln N ,σ 2 min 4 ,μ −1 2 ε ln N ,h 2 2 − σ 2 − σ 1 N , N ∗ 0 1 − σ 1 Nh 2 /4 h 2 ,N 0 ⎧ ⎪ ⎨ ⎪ ⎩ N ∗ 0 , if 1 − x N ∗ 0 ≤ x N ∗ 0 − 1 , N ∗ 0 1, if 1 − x N ∗ 0 >x N ∗ 0 − 1 , Q i,N 0 ⎧ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎩ 1,i N 0 1, i−1 jN 0 1 α j ,N 0 2 ≤ i ≤ N, y N Bα N 0 1 − γμβ N 0 1 γ δα N 0 1 − μ N iN 0 1 Q i,N 0 β i α N 0 1 − γ δα N 0 1 − μ N iN 0 1 α i , δ 1 − x N 0 1 x N 0 − x N 0 1 ,μ 1 − x N 0 x N 0 1 − x N 0 , y i α i1 y i1 β i1 ,i N − 1, ,2, 1. 5.3 [...]... Initial and Boundary Layers, Boole Press, Dublin, Ireland, 1980 4 P A Farrell, A F Hegarty, J J H Miller, E O’Riordan, and G I Shishkin, Robust Computational Techniques forBoundary Layers, vol 16 of Applied Mathematics, Chapman & Hall/CRC, Boca Raton, Fla, USA, 2000 Advances in Difference Equations 13 5 H.-G Roos, M Stynes, and L Tobiska, Robust Numerical Methods forSingularlyPerturbed Differential... International Journal of Computer Mathematics, vol 84, no 10, pp 1465–1481, 2007 17 J L Gracia, E O’Riordan, and M L Pickett, A parameter robust second order numerical methodforasingularlyperturbed two-parameter problem,” Applied Numerical Mathematics, vol 56, no 7, pp 962–980, 2006 18 T Linß and H.-G Roos, “Analysis of a finite-difference scheme forasingularlyperturbed problem with two small parameters,”... boundaryvalue problems,” Computers & Mathematics with Applications, vol 47, no 4-5, pp 689–698, 2004 15 G M Amiraliyev and M Cakir, “Numerical solution of the singularlyperturbed problem with ¸ nonlocal boundary condition,” Applied Mathematics and Mechanics, vol 23, no 7, pp 755–764, 2002 16 M Cakir and G M Amiraliyev, “Numerical solution of asingularlyperturbedthree-pointboundaryvalue problem,”... O’Malley Jr., “Two-parameter singular perturbation problems forsecond-order equations,” Journal of Mathematics and Mechanics, vol 16, pp 1143–1164, 1967 22 AA Samarskii, Theory of Difference Schemes, M Nauka, Moscow, Russia, 1971 23 G Amiraliyev and M Cakir, A uniformly convergent difference scheme forasingularlyperturbed ¸ problem with convective term and zeroth order reduced equation,” International... small parameter, of a difference scheme for an ordinary differential equation,” Computational Mathematics and Mathematical Physics, vol 35, no 11, pp 1417–1422, 1995 8 G F Sun and M Stynes, A uniformly convergent methodforasingularlyperturbed semilinear reaction-diffusion problem with multiple solutions,” Mathematics of Computation, vol 65, no 215, pp 1085–1109, 1996 9 R Cziegis, “The numerical of singularly. .. Journal of Mathematical Analysis and Applications, vol 289, no 2, pp 355– 366, 2004 19 T Linß, “Layer-adapted meshes for convection-diffusion problems,” Computer Methods in Applied Mechanics and Engineering, vol 192, no 9-10, pp 1061–1105, 2003 20 C Clavero, J L Gracia, and F Lisbona, “High order methods on Shishkin meshes for singular perturbation problems of convection-diffusion type,” Numerical Algorithms,... singularlyperturbed nonlocal problem,” Lietuvas Matematica Rink, vol 28, pp 144–152, 1988 Russian ˇ 10 R Ciegis, “On the difference schemes for problems with nonlocal boundary conditions,” Informatica, vol 2, no 2, pp 155–170, 1991 11 A M Nakhushev, “Nonlocal boundaryvalue problems with shift and their connection with loaded equations,” Differential Equations, vol 21, no 1, pp 92–101, 1985 Russian ... computed using the formula PN ln eN /e2N ln 2 5.12 References 1 A H Nayfeh, Introduction to Perturbation Techniques, John Wiley & Sons, New York, NY, USA, 1993 2 R E O’Malley Jr., Singular Perturbation Methods for Ordinary Differential Equations, vol 89 of Applied Mathematical Sciences, Springer, New York, NY, USA, 1991 3 E P Doolan, J J H Miller, and W H A Schilders, Uniform Numerical Methods for Problems... measured in the discrete maximum norm For any values of ε and N N, the maximum pointwise errors eε and the ε -uniform eN are calculated using N eε max u xi − yiN , i eN N max eε , ε 5.10 where u is the exact solution of 5.5 and y is the numerical solution of the finite difference scheme 3.16 – 3.19 The convergence rates are N Pε N 2N ln eε /eε ln 2 5.11 The corresponding ε -uniform convergence rates are... Sapagovas and R Yu Chegis, “Numerical solution of some nonlocal problems,” Litovski˘ ı Matematicheski˘ Sbornik, vol 27, no 2, pp 348–356, 1987 Russian ı 13 B Liu, “Positive solutions of second-orderthree-pointboundaryvalue problems with change of sign,” Computers & Mathematics with Applications, vol 47, no 8-9, pp 1351–1361, 2004 14 R Ma, “Positive solutions for nonhomogeneous m-point boundaryvalue . I. A. Savin, “On the rate of convergence, uniform with respect to a small parameter, of a difference scheme for an ordinary d ifferential equation,” Computational Mathematics and Mathematical Physics, vol O’Riordan, and G. I. Shishkin, Robust Computational Techniques for Boundary Layers, vol. 16 of Applied Mathematics, Chapman & Hall/CRC, Boca Raton, Fla, USA, 2000. Advances in Difference Equations. scheme for a singularly perturbed problem with two small parameters,” Journal of Mathematical Analysis and Applications, vol. 289, no. 2, pp. 355– 366, 2004. 19 T. Linß, “Layer-adapted meshes for