Research Article | Open Access
New Approach for Solving a Class of Doubly Singular Two-Point Boundary Value Problems Using Adomian Decomposition Method
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.
Consider the following class of doubly singular two-point boundary value problems: with boundary conditions where , , , , and are any finite constants. The condition characterizes that problem (1.1) is singular and in addition to this if is allowed to be discontinuous at , then problem (1.1) is called doubly singular Bobisud . Consider problem (1.1) with the following conditions on , , and .
Type 1. Dirichlet boundary conditions: , , with in and ; in and ; (i) ; (ii) exists and continuous, for all and all real .
Type 2. Mixed type boundary conditions: , , with in ; in (0,1], and ; the same as ().
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 , and problem (1.1) with Type 1 boundary conditions is known as Thomas-Fermi equation. Thomas  and Fermi  independently derived a boundary value problem for determining the electrical potential in an atom. The analysis leads to the nonlinear SBVP with boundary conditions given by , .
Chan and Hon  considered the generalized Thomas-Fermi equation: , , with , where , , , , which is doubly singular problem. Problem (1.1) with where arises in the study of the distribution of heat sources in the human head  with , , .
There is a huge literature available on numerical methods for problem (1.1) with , but very few numerical methods are available to tackle doubly singular boundary value problems. Reddien  studied the linear form of problem (1.1) and derived numerical methods for which is stronger assumption than ().
Chawla and Shivakumar  established the existence as well as uniqueness of solution for problem (1.1) where . The existence and uniqueness for problem (1.1) have also been discussed by Dunninger and Kurtz  and Bobisud . Later Pandey and Verma  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  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 where is the second-order linear derivative operator, is the linear remainder operator, represents the nonlinear term, and is a source term. The above equation can be rewritten as The inverse operator of is defined as .
Operating the inverse linear operator on both the sides of (1.4) yields Next, we decompose the solution and the nonlinear function by an infinite series as where are Adomian polynomials that can be constructed for various classes of nonlinear functions with the formula given by Adomian and Rach  Substituting the series (1.6) into (1.5), we obtain From (1.8), the various components of the solution can be determined by using the recursive relation For numerical purpose, the -term truncated series 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 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 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 , and then it will be determined by using second boundary condition satisfying . In this case, it requires additional computational work to solve nonlinear equation for and may not be uniquely determined.
Benabidallah and Cherruault  have considered the following boundary value problem: The inverse operator was proposed, then unidentified constant is set, as , and each solution component is obtained by the following scheme: In order to determine the unidentified constants , it is also required -term approximate solution satisfying all the boundary conditions. It is clearly that . For boundary condition , the following scheme was proposed However, since each constant 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  introduced extended ADM for nonsingular problems with Dirichlet boundary condition. Khuri and Sayfy  applied a novel approach based on the mixed decomposition spline for solving singular problems arising in physiology. The method proposed by Ebaid  is based on the modification of Lesnic’s work . Later, Duan and Rach  introduced special modified inverse linear integral operators for higher order boundary value problem.
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. Section 2 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
We again write (1.1) with Type 1 boundary conditions as: which can be rewritten as where is the linear differential operator to be inverted and is an analytic nonlinear operator. It is also assumed that the solution of the problem (2.1) exits and unique. A twofold integral operator , regarded as the inverse operator of , is proposed as To establish the recursive scheme, we operate on the left hand side of (2.1) and use initial condition ; we have where .
Then (2.6) can be written as Using the boundary condition in (2.7), we get By using into (2.7), we obtain 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 where Next, the solution and the nonlinear function are decomposed by infinite series of the form respectively, where are Adomian polynomials .
Substituting the series (2.12) into (2.9) gives Using the above equation (2.13), the solution components are determined by the following recursive scheme: We further modify the above algorithm (2.14) to get a more efficient and economic algorithm. To obtain modified algorithm, the zeroth component is divided into the sum of two parts, namely, , where , . The first part, , is kept in and the rest part, , is added to . Thus, the zeroth component will be in modified algorithm as 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: which can be rewritten as where is the linear differential operator to be inverted and 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: To setup an algorithm, we operate the inverse operator on the left hand side of (2.16) and using the boundary condition , we have where .
By operating the inverse operator on both sides of (2.16) and using (2.20) we have Thus (2.21) can be written as Using boundary condition into (2.22), we obtain The equation (2.23) may be rewritten in operator equation form where Substituting the series (2.12) into (2.23) gives Upon matching both sides of (2.26), the solution components can be determined by the following modified recursive scheme: Thus, we have established two modified recursive schemes which give the complete determination of solution components , and hence the approximate series solution can be obtained for the singular boundary value problems (1.1) with Types 1 and 2 boundary conditions. For numerical purpose, the truncated -term approximate series solution is given by Note that the truncated -term approximate series solution is obtained by adding solutions components , that is, .
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 . Cherruault and Adomian  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  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 where is an operator from a Banach space to , is a given function in , and we are looking for satisfying (3.1).
Upon matching both sides of (3.7), we obtain the following scheme:
Theorem 3.1. Let be the nonlinear operator defined by (3.3) or (3.5) which satisfies the Lipschitz condition , for all with Lipschitz constant , . If , then there holds , for all and the sequence defined by (3.10) converges to .
we have , .
We now show that the sequence is convergent. To prove this, it is sufficient to show that is cauchy sequence in Banach space . Now using the nonlinearity of , we have Thus we obtain Now for every , and , we have As we know is geometric series with common ration , . Therefore, we have which converges to zero, that is, , as . This implies that there exits such that . But, we have , that is, 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.
In particular, if , , that is, and 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 For numerical purpose, the approximate series solution is Now, we define error function as and the maximum absolute errors as For different values of and , the maximum absolute error , for , and 8, is shown in Tables 1 and 2, and we observe that when increases the error decreases. On the other hand, Chawla and Katti  applied method based on three evaluations of 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 , and exact solution are plotted in Figures 1 and 2. It can be seen from the figures that series solution is very close to exact solution.
Example 4.2. Consider nonlinear singular two-point boundary value problem with exact solution and for any real and , this equation is called singular.
If , , that is, , , then problem (4.5) is called doubly singular boundary value problem.
Now we apply recursive scheme (2.15) to obtain the solution components as To compare the results numerically, the 6-term truncated series solution is given by Similarly, for , , that is, and , the solution components are obtained using the scheme (2.15) as The maximum absolute error , for , and , is listed in Tables 4 and 5. As the value of increases, the maximum absolute error decreases. In addition, to verify how close is our approximate series solutions , to exact solution , we have plotted approximate solution and exact solution in Figures 3 and 4. It is shown from figures that the approximate series solution is very near to the exact solution .
We can easily determine the solution components from above scheme as
The truncated series solution is obtained by adding , given by The comparison of numerical results of solutions with known solution is given in Table 6. It can be noted that the approximate solution is very close to known solution . However, Duggan and Goodman  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.