Abstract
Fifth and sixth order boundary value problems are solved using Daftardar Jafari method (DJM). DJM is introduced by Daftardar-Gejji and Jafari (2006). The approach provides the solution in the form of a rapidly convergent series. The comparison among Daftardar Jafari method (DJM), Adomian decomposition method (ADM), homotopy perturbation method (HPM), variation iteration method (VIM), and the iterative method (ITM) are displayed in table form which shows the efficiency of DJM for the solution of fifth and sixth order BVPs.
1. Introduction
Fifth order boundary value problems arise in the mathematical modeling of viscoelastic flows [1, 2]. Agarwal, in [3], presents the conditions for the uniqueness and existence of the solutions of such type of problems. In [4], Khan investigated the solution of the fifth order boundary value problem using the finite-difference method. The improvement produced when the sixth-degree B-spline functions were used in [5]. Wazwaz, in [6], presented the numerical solution of fifth order BVP using the Adomian decomposition method and its modified form.
Sixth order boundary value problems arise in astrophysics. Modeling by sixth order BVPs occurs when the narrow convecting layers bounded by stable layers which are believed to surround A-type stars. To solve such BVPs, nonnumerical techniques were developed by Twizell and Boutayeb [7] and Baldwin [8]. Baldwin also considers the same work in his book in [9]. Chawla and Katti, in [10], introduced the numerical methods for the solution of higher order differential equations. Wazwaz, in [11], used the Adomian decomposition method and its modified form to solve such problems.
The aim of this research paper is to solve fifth and sixth order boundary value problems by Daftardar Jafari method (DJM). Recently Daftardar-Gejji and Bhalekar used this method to solve fractional boundary value problems with Dirichlet boundary conditions [12]. Ullah et al. [13] used DJM to solve higher order boundary value problems and got excellent results. DJM is a computer friendly iterative method to solve, especially, nonlinear BVPs. In the Adomian decomposition method [6] one has to compute Adomian polynomials which involve tedious calculations, whereas, in DJM, a couple of computer commands are sufficient to deal nonlinear BVPs. Results obtained from DJM are in higher agreement than the other numerical solutions such as ADM, ITM, VIM, and HPM.
In the first section, the basic idea of DJM is introduced. Comparison between ADM and DJM and convergence of DJM and its analysis are discussed in the respective sections. The last section contains the numerical solutions of fifth and sixth order nonlinear boundary value problems. Tables 1, 2, and 3 are constructed in order to compare the results obtained.
2. Basic Idea of Daftardar Jafari Method
Let us consider the nonlinear functional equation [12] where is a function of , is linear, and is a nonlinear term. The series solution of the above functional equation is given by As is linear, so we can write Let us define The recursive relation for the components of is as follows:
3. Comparison of ADM and DJM
Taylor series expansion for the nonlinear term about is given by In ADM, the terms of the right hand side of the above equation are grouped to find the Adomian polynomials for the nonlinear term as follows; While in DJM, is decomposed as follows; Thus, in ADM and DJM, the terms of Taylor series of about are grouped differently.
4. Convergence of DJM
The convergence of DJM is presented by Daftardar-Gejji and Bhalekar [12] as follows.
Theorem 1. If is in a neighborhood of and for any and for some real and , , then the series is absolutely convergent and moreover, , .
Theorem 2. If is and , for all , then the series is absolutely convergent.
5. Analysis of DJM
Consider a sixth order BVP of the form with boundary conditions where is the source term, is a continuous nonlinear function, and , are real finite constants. Using the operator , (9) becomes Applying (six-fold integral operator) and using the boundary conditions at , (11) becomes Using DJM, the solution in series form is given by and the nonlinear term is given by an infinite series as follows: where ’s are defined in (4). These can be constructed for various classes of nonlinearity according to the specific algorithm set by Daftardar-Gejji [10, 14].
Substituting (13), (14) into (12), we have DJM identifies the zeroth component by all terms that arise from the boundary conditions at and from integrating the source term. Using DJM, the components for are as follows: From here, the obtained components , of contain the arbitrary constants , , and . To determine these constants, we impose the boundary conditions at to the approximant . The resulting algebraic system of equations can be solved to determine the values of these constants for the series solution of the sixth order BVP.
6. Numerical Results
In this section, we solve three nonlinear boundary value problems by using DJM. Fifth order nonlinear BVP is solved initially and the rest of the two examples are of sixth order.
Example 1. Consider the fifth order BVP subject to the boundary conditions The theoretical solution for this problem is Writing (17) in an operator form, we have Applying (five-fold integral operator) to (20) and using the boundary conditions at , we can write The constants are to be determined. Now using DJM, replacing and by the series defined in (13) and (14), we get The components of can be found using (16) as follows; where ’s are defined in (4). The components of are given as and so on. The required solution in series form is To find the values of unknown constants and , we impose the boundary conditions at on the three-term approximant to obtain the following system of equations; Solving this system of equations, we get Therefore the numerical solution is given by
Example 2. We next consider the sixth order nonlinear BVP as subject to the boundary conditions the theoretical solution for this problem is Using the operator , (29) can be written as Operating the last equation with and using the boundary conditions at , we can write where the inverse operator is a six-fold integral from 0 to and , , are constants to be determined in a parallel manner to our discussion above. Substituting the series for and in (33), we have To determine the components , , we use DJM as follows: where ’s are defined in (4) and (9). Therefore the required components are So the required solution is Using the boundary conditions at , we have Solving this system of equations for , , and , we get So the required series solution is given by In the following example, we consider the BVP in which the boundary conditions are given at the even-order derivatives. The assumption that the boundary conditions be taken at the even-order derivatives is in fact used by Boutayeb and Twizell [15, 16].
Example 3. Let us take the nonlinear BVP of the form
subject to the boundary conditions
The exact solution of this problem is .
Equation (41) can be written in an operator form as
Applying (six-fold integral operator) to (43) and using the boundary conditions at yields
where , , and are constants to be determined by using the boundary conditions at . Substituting the series for and for the nonlinear term in (44), we have
Following the same criteria as in Example 2, we conclude that
In order to find the values of , , and , we impose the boundary conditions at on the three-term approximant and then solve the obtained algebraic system of equations to get
for the solution which is
7. Concluding Remarks
The computations related with the three examples discussed above were performed by using Mathematica 7.0. We therefore conclude that the proposed algorithm (DJM) produced a rapidly convergent series as compared to modified ADM, VIM, ITM, and HPM. The other works, for example, spline solution, required restrictions on the boundary conditions and the ADM needs tedious calculations to find the Adomian polynomials, whereas no restrictions or complicated calculations are required in this approach. Moreover, numerical methods based on DJM would require less computational effort.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.