# New Approach for Solving a Class of Doubly Singular Two-Point Boundary Value Problems Using Adomian Decomposition Method

Authors: Randhir Singh; Jitendra Kumar; Gnaneshwar Nelakanti
Journal: Advances in Numerical Analysis
 (2012)

---

## Abstract

We propose two new modified recursive schemes for solving a class of doubly singular two-point boundary value problems. These schemes are based on Adomian decomposition method (ADM) and new proposed integral operators. We use all the boundary conditions to derive an integral equation before establishing the recursive schemes for the solution components. Thus we develop recursive schemes without any undetermined coefficients while computing successive solution components, whereas several previous recursive schemes have done so. This modification also avoids solving a sequence of nonlinear algebraic or transcendental equations for the undetermined coefficients with multiple roots, which is required to complete calculation of the solution by several earlier modified recursion schemes using the ADM. The approximate solution is computed in the form of series with easily calculable components. The effectiveness of the proposed approach is tested by considering four examples and results are compared with previous known results.


---

## Body

## 1. Introduction

Consider the following class of doubly singular two-point boundary value problems:(1.1)(p(t)y′(t))′=q(t)f(t,y(t)),0<t≤1,
with boundary conditions
(1.2)y(0)=a1,y(1)=c1,ory′(0)=0,ay(1)+by′(1)=c,
where a1, c1, a>0, b≥0, and c are any finite constants. The condition p(0)=0 characterizes that problem (1.1) is singular and in addition to this if q(t) is allowed to be discontinuous at t=0, then problem (1.1) is called doubly singular Bobisud [1]. Consider problem (1.1) with the following conditions on p(t), q(t), and f(t,y(t)).Type 1.
Dirichlet boundary conditions:y(0)=a1, y(1)=c1(E1)
p∈C[0,1], p∈C1(0,1] with p>0 in (0,1] and 1/p∈L1(0,1);(E2)
q>0 in (0,1] and ∫01(1/p)(∫x1qds)dx<∞;(E3)
(i)f∈C([0,1]×ℝ); (ii)  ∂f/∂y exists and continuous, ∂f/∂y≥0 for all 0≤t≤1 and all real y.Type 2.
Mixed type boundary conditions:y′(0)=0,  ay(1)+by′(1)=c(E1′)
p∈C[0,1],  p∈C1(0,1] with p>0 in (0,1];(E2′)
q>0 in (0,1], q∈L1(0,1) and ∫01(1/p)(∫0xqds)dx<∞;(E3′)
the same as (E3).In recent years, the study of such singular boundary value problems (1.1) has attracted the attention of several researchers [2–9]. In particular, if p(t)=1,  q(t)=t-1/2 and f(t,y)=y3/2 problem (1.1) with Type 1 boundary conditions is known as Thomas-Fermi equation. Thomas [10] and Fermi [11] independently derived a boundary value problem for determining the electrical potential in an atom. The analysis leads to the nonlinear SBVP y′′=t-1/2y3/2 with boundary conditions given by y(0)=1,  y(b1)=0.Chan and Hon [12] considered the generalized Thomas-Fermi equation: (tb2y′)′=cq(t)ye, y(0)=1, y(a)=0 with q(t)=tb2+d2, where 0≤b2<1, c>0, d2>-2, e>1, which is doubly singular problem. Problem (1.1) with q(t)=p(t)=tα where α=2 arises in the study of the distribution of heat sources in the human head [13] with f(t,y)=-δe-θy, θ>0, δ>0.There is a huge literature available on numerical methods for problem (1.1) with q(t)=1, but very few numerical methods are available to tackle doubly singular boundary value problems. Reddien [14] studied the linear form of problem (1.1) and derived numerical methods for q(t)∈L2[0,1] which is stronger assumption than (E2′).Chawla and Shivakumar [15] established the existence as well as uniqueness of solution for problem (1.1) where q(t)=p(t)=tα. The existence and uniqueness for problem (1.1) have also been discussed by Dunninger and Kurtz [16] and Bobisud [1]. Later Pandey and Verma [17] extended the results on the existence uniqueness for problem (1.1) with Types 1 and 2 boundary conditions.


### 1.1. Adomian Decomposition Method (ADM)

In this subsection, we briefly describe standard ADM for nonlinear second-order equation.Recently, many researchers [4, 18–26] have shown interest to the study of ADM for different scientific models. Adomian [18] asserted that the ADM provides an efficient and computationally suitable method for generating approximate series solution for a large class of differential equations. Let us consider nonlinear second-order ordinary differential equation
(1.3)Ly+Ry+Ny=g(t),
where L≡d2/dt2 is the second-order linear derivative operator, R is the linear remainder operator, N represents the nonlinear term, and g(t) is a source term. The above equation can be rewritten as
(1.4)Ly=g(t)-Ry-Ny.
The inverse operator of L is defined as L-1(·)=∫0t∫0t(·)dtdt.Operating the inverse linear operatorL-1(·) on both the sides of (1.4) yields
(1.5)y=y(0)+ty′(0)+L-1g(t)-L-1Ry-L-1Ny.
Next, we decompose the solution y and the nonlinear function Ny by an infinite series as
(1.6)y=∑n=0∞‍yn,Ny=∑n=0∞‍An,
where An are Adomian polynomials that can be constructed for various classes of nonlinear functions with the formula given by Adomian and Rach [19]
(1.7)An=1n!dndλn[N(∑k=0∞‍ykλk)]λ=0,n=0,1,2,….
Substituting the series (1.6) into (1.5), we obtain
(1.8)∑n=0∞‍yn=y(0)+ty′(0)+L-1g(t)-L-1R∑n=0∞‍yn-L-1∑n=0∞‍An.
From (1.8), the various components yn of the solution y can be determined by using the recursive relation
(1.9)y0=y(0)+ty′(0)+L-1g(t),yk+1=-L-1Ryk-L-1Ak,k≥0.
For numerical purpose, the n-term truncated series ψn=∑m=0n-1‍ym may be used to give the approximate solution.The ADM has been used to solve nonlinear boundary value problems (BVPs) for ordinary differential equations by several researchers [4, 20–26]. Solving nonlinear BVP by standard ADM is always a computationally involved task as it requires the computation of undetermined coefficients y′(0) in (1.9) in a sequence of nonlinear equations which increases computational complexity.It is important to note that the standard ADM (1.9) can not be applied directly to solve two-point boundary value problem (1.1) as the component y0 in scheme (1.9) is not independent from undetermined coefficient. Many researchers [23–25] have proposed modified ADM to overcome the difficulty by setting undermined coefficient y′(0)=c, and then it will be determined by using second boundary condition satisfying ψn(1)=y(1). In this case, it requires additional computational work to solve nonlinear equation ψn(1)=y(1) for c and c may not be uniquely determined.Benabidallah and Cherruault [24] have considered the following boundary value problem:
(1.10)y′′+py′=f(t,y),a<t<b,y(a)=α,y(b)=β.
The inverse operator L-1=∫ax∫bxdxdx was proposed, then unidentified constant y′(b) is set, as y′(b)=∑n=0∞‍cn, and each solution component yn is obtained by the following scheme:
(1.11)y0=y(a)+(x-a)[c0+y(b)p(b)],yn+1=cn+1(t-a)-∫atpyndt+L-1An+L-1p′yn,n≥0.
In order to determine the unidentified constants cn, it is also required n-term approximate solution ψn=∑m=0n-1‍ym satisfying all the boundary conditions. It is clearly that ψn(a)=y(a). For boundary condition x=b, the following scheme was proposed
(1.12)y0(b)=y(b),yn(b)=0,n≥1.
However, since each constant cn is determined by solving (1.12), this scheme also require additional computational work.In order to avoid solving such nonlinear algebraic equations for a two-point boundary value problems, Jang [26] introduced extended ADM for nonsingular problems with Dirichlet boundary condition. Khuri and Sayfy [27] applied a novel approach based on the mixed decomposition spline for solving singular problems arising in physiology. The method proposed by Ebaid [4] is based on the modification of Lesnic’s work [28]. Later, Duan and Rach [29] introduced special modified inverse linear integral operators for higher order boundary value problem.To the best of our knowledge, no one has applied ADM to solve a class of doubly singular two-point boundary value problem (1.1) with Types 1 and 2 boundary conditions.In this work, a new approach based on ADM and new integral operator are proposed for solving doubly singular two-point boundary value problems (1.1) with Types 1 and 2. To set up the modified scheme, we first consider DSBVP (1.1) and use all the boundary conditions and Adomian decomposition method to establish the recursion scheme. Thus a modified recursion scheme is developed which does not require the computation of undermined coefficients, whereas most of previous recursive schemes do require the computation of undermined coefficients (see [23–25]). In fact, the proposed recursion scheme is useful for solving problem (1.1) whether they are linear or nonlinear singular (nonsingular). The main advantage of the method is that it provides a direct scheme for solving the singular boundary value problem, that is, without linearization and discretization. Numerical results are presented to demonstrate the effectiveness of proposed recursive scheme. The symbolic and numerical computations have been performed using “MATHEMATICA” software.The organization of the paper is as follows. Section2 presents the inverse integral operator with modified Adomian decomposition method for doubly singular boundary value problems of (1.1) with Types 1 and 2 boundary conditions. In Section 3, the convergence of the method is discussed. In Section 4, we illustrate our method with numerical results along with graphical representation.


## 1.1. Adomian Decomposition Method (ADM)

In this subsection, we briefly describe standard ADM for nonlinear second-order equation.Recently, many researchers [4, 18–26] have shown interest to the study of ADM for different scientific models. Adomian [18] asserted that the ADM provides an efficient and computationally suitable method for generating approximate series solution for a large class of differential equations. Let us consider nonlinear second-order ordinary differential equation
(1.3)Ly+Ry+Ny=g(t),
where L≡d2/dt2 is the second-order linear derivative operator, R is the linear remainder operator, N represents the nonlinear term, and g(t) is a source term. The above equation can be rewritten as
(1.4)Ly=g(t)-Ry-Ny.
The inverse operator of L is defined as L-1(·)=∫0t∫0t(·)dtdt.Operating the inverse linear operatorL-1(·) on both the sides of (1.4) yields
(1.5)y=y(0)+ty′(0)+L-1g(t)-L-1Ry-L-1Ny.
Next, we decompose the solution y and the nonlinear function Ny by an infinite series as
(1.6)y=∑n=0∞‍yn,Ny=∑n=0∞‍An,
where An are Adomian polynomials that can be constructed for various classes of nonlinear functions with the formula given by Adomian and Rach [19]
(1.7)An=1n!dndλn[N(∑k=0∞‍ykλk)]λ=0,n=0,1,2,….
Substituting the series (1.6) into (1.5), we obtain
(1.8)∑n=0∞‍yn=y(0)+ty′(0)+L-1g(t)-L-1R∑n=0∞‍yn-L-1∑n=0∞‍An.
From (1.8), the various components yn of the solution y can be determined by using the recursive relation
(1.9)y0=y(0)+ty′(0)+L-1g(t),yk+1=-L-1Ryk-L-1Ak,k≥0.
For numerical purpose, the n-term truncated series ψn=∑m=0n-1‍ym may be used to give the approximate solution.The ADM has been used to solve nonlinear boundary value problems (BVPs) for ordinary differential equations by several researchers [4, 20–26]. Solving nonlinear BVP by standard ADM is always a computationally involved task as it requires the computation of undetermined coefficients y′(0) in (1.9) in a sequence of nonlinear equations which increases computational complexity.It is important to note that the standard ADM (1.9) can not be applied directly to solve two-point boundary value problem (1.1) as the component y0 in scheme (1.9) is not independent from undetermined coefficient. Many researchers [23–25] have proposed modified ADM to overcome the difficulty by setting undermined coefficient y′(0)=c, and then it will be determined by using second boundary condition satisfying ψn(1)=y(1). In this case, it requires additional computational work to solve nonlinear equation ψn(1)=y(1) for c and c may not be uniquely determined.Benabidallah and Cherruault [24] have considered the following boundary value problem:
(1.10)y′′+py′=f(t,y),a<t<b,y(a)=α,y(b)=β.
The inverse operator L-1=∫ax∫bxdxdx was proposed, then unidentified constant y′(b) is set, as y′(b)=∑n=0∞‍cn, and each solution component yn is obtained by the following scheme:
(1.11)y0=y(a)+(x-a)[c0+y(b)p(b)],yn+1=cn+1(t-a)-∫atpyndt+L-1An+L-1p′yn,n≥0.
In order to determine the unidentified constants cn, it is also required n-term approximate solution ψn=∑m=0n-1‍ym satisfying all the boundary conditions. It is clearly that ψn(a)=y(a). For boundary condition x=b, the following scheme was proposed
(1.12)y0(b)=y(b),yn(b)=0,n≥1.
However, since each constant cn is determined by solving (1.12), this scheme also require additional computational work.In order to avoid solving such nonlinear algebraic equations for a two-point boundary value problems, Jang [26] introduced extended ADM for nonsingular problems with Dirichlet boundary condition. Khuri and Sayfy [27] applied a novel approach based on the mixed decomposition spline for solving singular problems arising in physiology. The method proposed by Ebaid [4] is based on the modification of Lesnic’s work [28]. Later, Duan and Rach [29] introduced special modified inverse linear integral operators for higher order boundary value problem.To the best of our knowledge, no one has applied ADM to solve a class of doubly singular two-point boundary value problem (1.1) with Types 1 and 2 boundary conditions.In this work, a new approach based on ADM and new integral operator are proposed for solving doubly singular two-point boundary value problems (1.1) with Types 1 and 2. To set up the modified scheme, we first consider DSBVP (1.1) and use all the boundary conditions and Adomian decomposition method to establish the recursion scheme. Thus a modified recursion scheme is developed which does not require the computation of undermined coefficients, whereas most of previous recursive schemes do require the computation of undermined coefficients (see [23–25]). In fact, the proposed recursion scheme is useful for solving problem (1.1) whether they are linear or nonlinear singular (nonsingular). The main advantage of the method is that it provides a direct scheme for solving the singular boundary value problem, that is, without linearization and discretization. Numerical results are presented to demonstrate the effectiveness of proposed recursive scheme. The symbolic and numerical computations have been performed using “MATHEMATICA” software.The organization of the paper is as follows. Section2 presents the inverse integral operator with modified Adomian decomposition method for doubly singular boundary value problems of (1.1) with Types 1 and 2 boundary conditions. In Section 3, the convergence of the method is discussed. In Section 4, we illustrate our method with numerical results along with graphical representation.


## 2. Modified Adomian Decomposition Method

In this section, we establish two modified recursive schemes for solving doubly singular boundary value problems (1.1) with Types 1 and 2 boundary conditions.We again write (1.1) with Type 1 boundary conditions as:
(2.1)(p(t)y′(t))′=q(t)f(t,y(t)),0<t≤1,y(0)=a1,y(1)=c1,
which can be rewritten as
(2.2)Ly(t)=q(t)Ny(t),
where Ly(t)=(p(t)y′(t))′ is the linear differential operator to be inverted and Ny(t)=f(t,y(t)) is an analytic nonlinear operator. It is also assumed that the solution of the problem (2.1) exits and unique. A twofold integral operator L-1(·), regarded as the inverse operator of L(·), is proposed as
(2.3)L-1(·)=∫0t1p(s)∫s1(·)dxds.
To establish the recursive scheme, we operate L-1(·) on the left hand side of (2.1) and use initial condition y(0)=a1; we have
(2.4)L-1[(p(t)y′(t))′]=∫0t1p(s)∫s1(p(x)y′(x))′dxds=c2∫0t1p(s)ds-y(t)+a1,(2.5)L-1[(p(t)y′(t))′]=c2∫0t1p(s)ds-y(t)+a1,
where c2=p(1)y′(1).We again operate the inverse operatorL-1(·) on both sides of (2.1) and use (2.5), yielding
(2.6)y(t)=a1+c2∫0t1p(s)ds-∫0t1p(s)∫s1q(t)Ny(t)dxds.
For simplicity, we set h(t)=∫0t(1/p(s))ds  and  [L-1(·)]t=1=∫01(1/p(s))∫s1(·)dxds.Then (2.6) can be written as
(2.7)y(t)=a1+c2h(t)-[L-1q(t)Ny(t)].
Using the boundary condition y(1)=c1 in (2.7), we get
(2.8)c2=c1-a1h(1)+1h(1)[L-1q(t)Ny(t)]t=1.
By using c2 into (2.7), we obtain
(2.9)y(t)=a1+c1-a1h(1)h(t)+h(t)h(1)[L-1q(t)Ny(t)]t=1-[L-1q(t)Ny(t)].
It is important to note that the right hand side of (2.9) does not contain any unknown constants.The equation (2.9) can be rewritten in the following operator equation form as
(2.10)y=f+M(y),
where
(2.11)f=a1+c1-a1h(1)h(t),M(y)=h(t)h(1)[L-1q(t)Ny(t)]t=1-[L-1q(t)Ny(t)].
Next, the solution y(t) and the nonlinear function Ny(t) are decomposed by infinite series of the form
(2.12)y(t)=∑n=0∞‍yn(t),Ny(t)=∑n=0∞‍An(y0(t),y1(t),…,yn(t)),
respectively, where An(y0(t),y1(t),…,yn(t)) are Adomian polynomials [19].Substituting the series (2.12) into (2.9) gives
(2.13)∑n=0∞‍yn(t)=a1+c1-a1h(1)h(t)+h(t)h(1)[L-1q(t)∑n=0∞‍An]t=1-[L-1q(t)∑n=0∞‍An].
Using the above equation (2.13), the solution components y0,y1,…,yn are determined by the following recursive scheme:
(2.14)y0(t)=a1+c1-a1h(1)h(t),yn+1(t)=h(t)h(1)[L-1q(t)An]t=1-[L-1q(t)An],n≥0,oryn+1(t)=h(t)h(1)∫011p(s)∫s1q(t)Andxds-∫0t1p(s)∫s1q(t)Andxds,n≥0.
We further modify the above algorithm (2.14) to get a more efficient and economic algorithm. To obtain modified algorithm, the zeroth component y0 is divided into the sum of two parts, namely, f0+f1, where f0=a1,  f1=((c1-a1)/h(1))h(t). The first part, f0, is kept in y0 and the rest part, f1, is added to y1. Thus, the zeroth component will be y0=a1 in modified algorithm as
(2.15)y0(t)=a1,y1(t)=c1-a1h(1)h(t)+h(t)h(1)[L-1q(t)A0]t=1-[L-1q(t)A0],⋮yn+1(t)=h(t)h(1)[L-1q(t)An]t=1-[L-1q(t)An],n≥0.
Note that new modified recursion scheme (2.15) does not require the computation of undermined coefficients, since this algorithm does not contain any undermined coefficient. This slight change plays a major role for minimizing the size of calculations.Now, we again consider the same problem (1.1) with Type 2 boundary conditions:
(2.16)(p(t)y′(t))′=q(t)f(t,y(t)),0<t≤1,y′(0)=0,ay(1)+by′(1)=c,
which can be rewritten as
(2.17)Ly(t)=q(t)Ny(t),
where Ly(t)=(p(t)y′(t))′ is the linear differential operator to be inverted and Ny(t)=f(t,y(t)) is an analytic nonlinear operator. It is also assumed that the solution of problem (2.16) exits and is unique. In this case, we propose the following inverse integral operator:
(2.18)L-1(·)=∫t11p(s)∫0s(·)dxds.
To setup an algorithm, we operate the inverse operator L-1(·) on the left hand side of (2.16) and using the boundary condition y′(0)=0, we have
(2.19)L-1[(p(t)y′(t))′]=∫t11p(s)∫0s(p(x)y′(x))′dxds=∫t1y′(s)ds,(2.20)L-1[(p(t)y′(t))′]=c0-y(t),
where c0=y(1).By operating the inverse operatorL-1(·) on both sides of (2.16) and using (2.20) we have
(2.21)y(t)=c0-∫t11p(s)∫0sq(t)Ny(t)dxds.
Thus (2.21) can be written as
(2.22)y(t)=c0-[L-1q(t)Ny(t)].
Using boundary condition ay(1)+by′(1)=c into (2.22), we obtain
(2.23)y(t)=ca-bap(1)∫01q(t)Ny(t)dt-[L-1q(t)Ny(t)].
The equation (2.23) may be rewritten in operator equation form
(2.24)y=f+M(y),
where
(2.25)f=ca,M(y)=-bap(1)∫01q(t)Ny(t)dx-[L-1q(t)Ny(t)].
Substituting the series (2.12) into (2.23) gives
(2.26)∑n=0∞‍yn(t)=ca-bap(1)∫01q(t)∑n=0∞‍Andt-[L-1q(t)∑n=0∞‍An].
Upon matching both sides of (2.26), the solution components y0,y1,…,yn can be determined by the following modified recursive scheme:
(2.27)y0(t)=ca,yn+1(t)=-bap(1)∫01q(t)Andt-[L-1q(t)An],n≥0.
Thus, we have established two modified recursive schemes which give the complete determination of solution components yn, and hence the approximate series solution ψn(t) can be obtained for the singular boundary value problems (1.1) with Types 1 and 2 boundary conditions. For numerical purpose, the truncated n-term approximate series solution is given by
(2.28)ψn(t)=∑m=0n-1‍ym(t).
Note that the truncated n-term approximate series solution is obtained by adding n solutions components y0,y1,…,yn-1, that is, ψn=∑m=0n-1‍ym.


## 3. Convergence of Method

In this section, we discuss the convergence analysis of modified ADM for doubly singular boundary value problem (1.1).Many authors [30–33] established the convergence of ADM for differential and integral equations. The first proof of convergence of ADM for the general functional equation was given by Cherruault [31]. Cherruault and Adomian [32] proposed a new convergence proof of Adomian decomposition method for the general nonlinear functional equation based on the properties of convergent series. Recently, Hosseini and Nasabzadeh [33] introduced a simple technique to determine the rate of convergence of ADM for initial value problem.Now, we discuss the convergence of doubly singular two-point boundary value problems (1.1) with Types 1 and 2 boundary conditions. To do so, note that (2.9) and (2.23) may be written in the operator equation form
(3.1)y=f+M(y),
where M is an operator from a Banach space C[0,1] to C[0,1], f is a given function in C[0,1], and we are looking for y∈C[0,1] satisfying (3.1).For Type1 boundary conditions, we have
(3.2)f=a1+(c1-a1)h(1)h(t),(3.3)M(y)=h(t)h(1)[L-1q(t)Ny(t)]t=1-[L-1q(t)Ny(t)].
For Type 2 boundary conditions, f and M are given as
(3.4)f=ca,(3.5)M(y)=-bap(1)∫01q(t)Ny(t)dt-[L-1q(t)Ny(t)].
Let the solution y and the nonlinear function Ny be considered as sum of series
(3.6)y=∑n=0∞‍yn,Ny=∑n=0∞‍An(y0,y1,…,yn),
where An(y0,y1,…,yn) are Adomian polynomials [19].Substituting the series (3.6) into the operator equation (3.1) yields
(3.7)∑n=0∞‍yn=f+∑n=0∞‍Bn(y0,…,yn),y0+y1+⋯+yn+⋯=f+B0(y0)+⋯+Bn-1(y0,…,yn-1)+⋯,
where
(3.8)∑n=0∞‍Bn(y0,…,yn)=h(t)h(1)[L-1q(t)∑n=0∞‍An]t=1-[L-1q(t)∑n=0∞‍An],∑n=0∞‍Bn(y0,…,yn)=-bap(1)∫01q(t)∑n=0∞‍Andt-[L-1q(t)∑n=0∞‍An],
for Types 1 and 2 boundary conditions, respectively.Upon matching both sides of (3.7), we obtain the following scheme:
(3.9)y0=f,y1=B0(y0),⋮yn+1=Bn(y0,…,yn),⋮Letψn=∑m=0n-1‍ym be approximate solution, then the modified ADM for (3.1) is equivalent to the following problem:
(3.10)y0=f,ψn+1=y0+M(ψn),n≥0.
Finding the solution of (3.1) is equivalent to finding the sequence ψn such that ψn=y0+y1+⋯+yn-1 satisfies (3.10).Theorem 3.1.
LetM(y) be the nonlinear operator defined by (3.3) or (3.5) which satisfies the Lipschitz condition ∥M(φ)-M(ξ)∥≤δ∥φ-ξ∥, for all φ,ξ∈C[0,1] with Lipschitz constant δ, 0≤δ<1. If ∥y0∥<∞, then there holds ∥yk+1∥≤δ∥yk∥, for all k∈ℕ∪{0} and the sequence {ψn} defined by (3.10) converges to y=∑n=0∞‍yn=limn→∞ψn=ψ.Proof.
Since(3.11)ψ1=y0+y1,ψ2=y0+y1+y2,…,ψn=y0+y1+y2+⋯+yn,…,
we have yk+1=ψk+1-ψk,  k=1,2,….
We now show that the sequence{ψn} is convergent. To prove this, it is sufficient to show that {ψn} is cauchy sequence in Banach space C[0,1]. Now using the nonlinearity of M(y), we have
(3.12)∥yn+1∥=∥ψn+1-ψn∥=∥M(ψn)-M(ψn-1)∥≤δ∥ψn-ψn-1∥=δ∥yn∥.
Thus we obtain
(3.13)∥yn+1∥≤δ∥yn∥≤δ2∥yn-1∥⋯≤δn+1∥y0∥.
Now for every n,m∈ℕ, and n≥m, we have
(3.14)∥ψn-ψm∥=∥(ψn-ψn-1)+(ψn-1-ψn-2)+⋯+(ψm+1-ψm)∥≤∥ψn-ψn-1∥+∥ψn-1-ψn-2∥+⋯+∥ψm+1-ψm∥≤δn∥y0∥+δn-1∥y0∥+⋯+δm+1∥y0∥≤δm+1(1+δ+δ2+⋯+δn-m-1)∥y0∥.
As we know ∑j=0∞‍δj is geometric series with common ration δ, 0≤δ<1. Therefore, we have
(3.15)∥ψn-ψm∥≤δm+11-δ∥y0∥,
which converges to zero, that is, ∥ψn-ψm∥→0, as m→∞. This implies that there exits ψ such that limn→∞ψn=ψ. But, we have y=∑n=0∞‍yn=limn→∞ψn, that is, y=ψ which is solution of (3.1). Hence, we have convergence in norm.


## 4. Numerical Examples and Discussion

In this section, we consider four examples to demonstrate the effectiveness of proposed recursive schemes (2.15) and (2.27). The numerical results are compared with known results and maximum absolute error is also calculated. We also plot approximate and exact solutions to show how approximate solutions converge to exact solution.Example 4.1.
Consider linear two-point boundary value problem [6]
(4.1)(tαy′)′=βtα+β-2(βtβ+α+β-1)y,0<t≤1,y(0)=1,y(1)=e,
with exact solution y(t)=etβ. For every α>0 and β>0, (4.1) is called singular.In particular, ifα=0.5,  β=1, that is, p(t)=t0.5 and q(t)=t-0.5 then problem (4.1) is called doubly singular boundary value problem. Applying modified recursive scheme (2.15) to (4.1), the solution components are obtained as
(4.2)y0=1,y1=0.384948t0.5+t+0.333333t2,y2=-0.551338t0.5+0.128316t1.5+0.166667t2+0.076989t2.5+0.155556t3+0.023809t4,y3=0.224316t0.5-0.183779t1.5-0.097435t2.5+0.011111t3+0.015886t3.5+0.017460t4+0.004277t4.5+0.007442t5+0.000721t6,y4=-0.077011t0.5+0.074771t1.5+0.026485t2.5-0.022142t3.5+0.000396t4-0.004971t4.5+0.000881t5+0.000655t5.5+0.0006418t6+0.0001096t6.5+0.0001715t7+0.000012t8,⋮
For numerical purpose, the approximate series solution is
(4.3)ψ6=1-0.002003t0.5+t+0.002065t1.5+0.5t2+0.000603t2.5+0.166667t3-0.0006957t3.5+0.041666t4-0.0000457t4.5+0.0083333t5+0.0000802t5.5+0.001388t6+1.0684407×10-6t6.5+0.000198t7-4.663181×10-6t7.5+0.000024t8-3.885381×10-8t8.5+2.745287×10-6t9+1.676726×10-7t9.5+2.664448×10-7t10+1.5360215×10-8t10.5+2.063867×10-8t11+9.172396×10-10t12.
Now, we define error function as En(t)=ψn(t)-y(t) and the maximum absolute errors as
(4.4)∥En∥∞=max0<t≤1|En(t)|.
For different values of α and β, the maximum absolute error ∥En∥∞, for n=4,6, and 8, is shown in Tables 1 and 2, and we observe that when n increases the error decreases. On the other hand, Chawla and Katti [6] applied M3 method based on three evaluations of f to solve the same problem in which a huge amount of computation work is needed to obtain the numerical solution. The results are compared with our approximate series solution in Table 3. Furthermore, the approximate series solutions ψ2,  ψ4 and exact solution y are plotted in Figures 1 and 2. It can be seen from the figures that series solution is very close to exact solution.Table 1
Maximum error of Example4.1, when β=1.
α
∥
E
4
∥
∞
∥
E
6
∥
∞
∥
E
8
∥
∞
0
.
25
2.3211
×
10
-
3
4.2210
×
10
-
5
2.4843
×
10
-
6
0.5
2.3151
×
10
-
3
6.1226
×
10
-
5
3.2320
×
10
-
6
0.75
3.5315
×
10
-
3
7.0126
×
10
-
5
2.2117
×
10
-
6Table 2
Maximum error of Example4.1, when β=5.
α
∥
E
4
∥
∞
∥
E
6
∥
∞
∥
E
8
∥
∞
0.25
2.2419
×
10
-
3
3.3304
×
10
-
5
3.5127
×
10
-
6
0.5
1.3307
×
10
-
3
5.0264
×
10
-
5
4.6572
×
10
-
6
0.75
4.2104
×
10
-
3
4.3231
×
10
-
5
2.1260
×
10
-
6Table 3
Maximum error of Example4.1.
Proposed method
Chawla and Katti [6]
α, β
∥
E
8
∥
∞
N
error
α
=
0.50, β=4.0
2.4003
×
10
-
6
128
1.80
×
10
-
4
α
=
0.75, β=3.75
5.1431
×
10
-
6
128
1.80
×
10
-
4Figure 1
Comparison of exacty and approximate ψ2,  ψ4 solutions of Example 4.1, α=0.50,  β=1.Figure 2
Comparison of exacty and approximate ψ2,  ψ4 solutions of Example 4.1, α=0.50,  β=5.Example 4.2.
Consider nonlinear singular two-point boundary value problem(4.5)(tαy′)′=tα+β-2ey(tβey-α-β+1),0<t≤1,y(0)=ln(β4),y(1)=ln(β5),
with exact solution y(t)=ln(β/(4+tβ)) and for any real α>0 and β>0, this equation is called singular.Ifα=0.25,  β=1, that is, p(t)=t0.25, q(t)=t-0.75, then problem (4.5) is called doubly singular boundary value problem.Now we apply recursive scheme (2.15) to obtain the solution components as
(4.6)y0=-1.38629,y1=0.001856t0.75-0.25t+0.025t2,y2=-0.001605t0.75-0.000066t1.75+0.00625t2+0.000042t2.75-0.004861t3+0.000240t4,y3=-0.000283t0.75+0.000057t1.75-2.461715×10-8t2.5-0.000030t2.75-0.000347t3+4.475846×10-8t3.5-0.000011t3.75+0.000714t4+8.882529×10-7t4.75-0.000103t5+3.434065×10-6t6,⋮
To compare the results numerically, the 6-term truncated series solution is given by
(4.7)ψ6=-1.38629-3.372935×10-7x0.75-0.25t-1.108619×10-7t1.75+0.03125t2+7.059037×10-9t2.5-3.299920×10-8t2.75-0.005208t3+1.307442×10-11t3.25-1.557418×10-8t3.5+1.289457×10-7t3.75+0.000976t4-5.530529×10-11t4.25+1.078097×10-8t4.5+3.090869×10-7t4.75-0.000195t5-1.480660×10-11t5.25+1.980188×10-9t5.5-3.668865×10-7t5.75+0.0000405t6+2.567699×10-12t6.25-1.009792×10-9t6.5+1.315036×10-7t6.75-7.607217×10-6t7+5.654798×10-11t7.5-1.378289×10-8t7.75+8.830360×10-7t8+4.154631×10-10t8.75-4.867214×10-8t9+9.674748×10-10t10.
Similarly, for α=0.5,  β=1, that is, p(t)=t0.5 and q(t)=t-0.5, the solution components are obtained using the scheme (2.15) as
(4.8)y0=-1.38629,y1=0.006023t0.5-0.25t+0.020833t2,y2=-0.005737t0.5-0.000501t1.5+0.010416t2+0.000150t2.5-0.004513t3+0.000186t4,y3=-0.000302t0.5+0.000478t1.5-7.557899×10-7t2-0.000093t2.5-0.000693t3-0.000045t3.5+0.0007378t4+2.788479×10-6t4.5-0.0000851t5+2.348635×10-6t6,⋮
The maximum absolute error ∥En∥∞, for n=4,6, and 8, is listed in Tables 4 and 5. As the value of n increases, the maximum absolute error decreases. In addition, to verify how close is our approximate series solutions ψ2,  ψ4 to exact solution y, we have plotted approximate solution and exact solution in Figures 3 and 4. It is shown from figures that the approximate series solution ψ4 is very near to the exact solution y.Table 4
Maximum error for Example4.2, when β=1.
α
∥
E
4
∥
∞
∥
E
6
∥
∞
∥
E
8
∥
∞
0.25
1.3889
×
10
-
4
2.0435
×
10
-
6
2.5693
×
10
-
8
0.5
5.2987
×
10
-
4
1.1481
×
10
-
6
1.1616
×
10
-
8
0.75
2.4545
×
10
-
4
3.7571
×
10
-
7
2.1654
×
10
-
9Table 5
Maximum error for Example4.2, when β=5.
α
∥
E
4
∥
∞
∥
E
6
∥
∞
∥
E
8
∥
∞
0
.
25
6.5109
×
10
-
4
2.6137
×
10
-
7
6.0161
×
10
-
8
0.5
8.8947
×
10
-
4
1.1610
×
10
-
6
7.1746
×
10
-
8
0.75
7.6596
×
10
-
4
5.2644
×
10
-
7
6.3210
×
10
-
8Figure 3
Comparison of exacty and approximate ψ2,  ψ4 solutions of Example 4.2, when α=0.50,  β=1.Figure 4
Comparison of exacty and approximate ψ2,  ψ4 solutions of Example 4.2, when α=0.50,  β=5.Example 4.3.
The heat conduction model in human head problem Duggan and Goodman [13] is
(4.9)(t2y′)′=-t2e-y,0<t≤1,y′(0)=0,2y(1)+y′(1)=0.
We apply the recursive scheme (2.27) to (4.9), where p(t)=q(t)=t2, f=e-y, a=2, b=1, and c=0 then scheme (2.27) for (4.9) becomes as
(4.10)y0=0,yn+1=12∫01t2Andt+∫t1s-2(∫0sx2Andx)ds,n≥0.We can easily determine the solution components from above scheme as(4.11)y0=0,y1=0.333333-0.166667t2,y2=-0.086111+0.055555t2-0.008333t4,y3=0.032672-0.023611t2+0.005555t4-0.000529t6,y4=-0.014584+0.011258t2-0.003287t4+0.000529t6-0.0000373t8,⋮The truncated series solutionψ8 is obtained by adding y0,y1,…,y6, given by
(4.12)ψ8=0.270259-0.127429t2-0.0047677t4.-0.0002650t6-4.7439600×10-6t8-2.4024518×10-6t10+2.2847637×10-7t12-3.485344×10-8t14+2.384089×10-9t16-1.1874334×10-10t18.
The comparison of numerical results of solutions with known solution is given in Table 6. It can be noted that the approximate solution ψ8 is very close to known solution [13]. However, Duggan and Goodman [13] utilized the maximum principle based on lower and an upper solutions technique in which a lot of calculation is required as we need to solve sequence of linear differential equation analytically.Table 6
Comparison of numerical results with known results of Example4.3.
t
ψ
6
ψ
8
ψ
10
Solution in [13]
0
0.27073627
0.27025895
0.27010891
0.27035006
0.2
0.26561546
0.26515412
0.26500927
0.26525434
0.4
0.25016332
0.24974709
0.24961677
0.24986712
0.6
0.22410365
0.22375398
0.22364491
0.22388597
0.8
0.18695255
0.18668071
0.18659620
0.18679895
1
0.13798246
0.13778979
0.13772998
0.13787263Example 4.4.
The nonlinear singular boundary problem considered by Chawla et al. [34] is
(4.13)y′′+1ty′=-vey,0<t<1,y′(0)=0,y(1)=0,
with exact solution y(t)=2ln((B+1)/(Bt2+1)), where B=(4-v-2(4-2v)1/2)/v, v=1.In the above problem, we havep(t)=q(t)=t and f=-ey,  a=1,  b=0,  c=0, by applying recursive scheme (2.27), we have following recursive scheme:
(4.14)y0=0,yn+1=01∫01tAndt+∫t1s-1(∫0sxAndx)ds,n≥0.
We have successive solution components yn as
(4.15)y0=0,y1=0.25-0.25t2,y2=0.046875-0.0625t2+0.015625t4,y3=0.0130208-0.0195313t2+0.0078125t4-0.00130208t6,⋮
and then the truncated series is obtained as
(4.16)ψ6=0.316294-0.342438t2+0.0289497t4-0.003107t6+0.0003280x8-0.0000274t10+1.2715657×10-6t12.
In order to check whether the approximate solution converges to exact solution y, we plot approximate solution ψn, for n=2,4 and exact solution y in Figure 5. It is clear from the figure that the approximate solution ψ4 converges rapidly to exact solution. The maximum absolute error ∥En∥∞, for n=5,8, and 10, is presented in Table 7. It can be noted that Chawla et al. [34] employed fourth-order finite difference method to obtain the numerical solution in which a lot of computation work is required. However, the maximum absolute error obtained was 1.28×10-5 using N=64.Table 7
Numerical results and maximum error of Example4.4.
n
∥
E
n
∥
∞
n
Error in [34]
5
6.2129
×
10
-
4
16
2.52
×
10
-
3
8
1.0919
×
10
-
5
32
1.83
×
10
-
4
10
3.0638
×
10
-
6
64
1.28
×
10
-
5Figure 5
Comparison of exacty and approximate ψ2,  ψ4 solutions of Example 4.4.


## 5. Conclusion

In this paper, we we have illustrated how the modified recursive schemes (2.15) and (2.27) can be used to solve a class of doubly singular two-point boundary value problems (1.1) with Types 1 and 2 boundary conditions. The accuracy of the numerical results indicates that the method is well suited for the solution of this type problem. The main advantage of this approach is that it provides a direct scheme to obtain approximate solutions, and we have also shown graphically that these approximate solutions are almost identical to the analytic solution. Another advantage of a modified recursion scheme is that this does not require the computation of undermined coefficients, whereas most of previous recursive schemes do require the computation of undermined coefficients (see [23–25]). The method provides a reliable technique which requires less work compared to the traditional techniques such as finite difference method, Cubic spline method, and standard ADM. The numerical results of the examples are presented and only a few terms are required to obtain accurate solutions. By comparing the results with other existing methods, it has been proved that proposed modified ADM is a more powerful method for solving the singular problems (1.1).



---

*Source: 541083-2012-12-26.xml*