In this work, we present an alternate algorithm to solve the Emden-Fowler Equation  . This equation has several interesting physical applications occurring in astrophysics in the form of the Fermi-Thomas equation . The analysis is accompanied by examples that demonstrate the comparison and show the pertinent features of the modified technique. Two versions of FEM approaches have been used to obtain a numerical solution to this problem. The decomposition scheme representing the nonlinear problem is presented. Some references for such numerical solutions can be found in   . In particular, Scott  used an invariant imbedding method to solve Troesch’s problem, while Khuri  used a numerical method based on Laplace transformation and a modified decomposition technique to obtain an approximate solution of the same problem. Feng  solved this problem numerically using a modified homotopy perturbation technique. Chang and Chang  developed a new technique for calculating the one-dimensional differential transform of nonlinear functions; the algorithm was illustrated by studying several nonlinear ordinary differential equations, including Troesch’s problem. Chang  proposed a new algorithm based on the vibrational method and variable transformation to solve Troesch’s problem. The cubic B-spline finite-element method (see   ) is often used for solving nonlinear problems that arise in engineering applications; cubic B-spline functions are utilized to develop a collocation method for solving Troesch’s problem.
Adomians decomposition algorithm has been recently employed to solve a wide range of problems (see   ). We adapt the algorithm to solving the most general form of Emden-Fowler Equation given by
with specified initial condition
The balance of this paper is as follows. In Section 2.1, we give a brief description of Adomians method and then introduce a modified version of this algorithm. We apply the modified scheme to Equations (1), (2). While in Section 2.2, we seek a finite element solution for solving Emden-Fowler Equation. We consider the mesh point ui over the interval [0, 1], with x0 = 0 and xn = 1, noting that the mesh points distance = h.
In Section 3, several interesting examples that arise in applications are used to illustrate the algorithm with error estimates.
And tables are not prescribed, although the various table text styles are provided. The formatter will need to create these components, incorporating the applicable criteria that follow.
2.1. Adomians Decomposition Method
In this section, we first describe algorithm of Adomians decomposition method as it applies to general nonlinear equation of the form
where N is a nonlinear operator on a Hilbert space H and f is a known element of H. We assume that for a given f a unique solution u of Equation (3) exists. We then introduce a modified version of this algorithm to handle equations of the form Equation (1).
The Adomians algorithm assumes a series solution for u given by
And the nonlinear operator N to be decomposed into
where An’s are Adomians polynomials of given by
Substituting Equations (4) and (5) into the functional Equation (3) yields.
The convergence of the series in Equation (7) will yield
Thus, one can, recurrently determine every term of the series the convergence of this series has been established (see  ).
To illustrate the scheme, let the nonlinear operator N(u) be a nonlinear function of u, say g(u) then the first four Adomians Polynomials are given by
How do we interpret and solve Emden-Fowler Equation in this setting?
Following the Adomians decomposition analysis  defines the linear operator.
Equation (1) can be rewritten in terms of the linear operator
It was shown in  that Equation (1) with condition (2) possesses a unique solution.
Thus, the inverse operator of Lt, namely exists and is the twofold indefinite integral; i.e.
Operating on both sides of (11) with yields
From which it follows, upon using the initial conditions given in Equation (2).
The Adomians decomposition method yields the solution in the form given in (4) i.e. ,then from Equation (14)
For later numerical computation, let the expression
can serve as a practical solution. We will show through several examples, that this Adomians decomposition method which converts the given equation to recurrences relation whose terms are computed using maple 15.
2.2. Finite Element Method (FEM)
We seek a finite element solution for solving Emden-Fowler Equation, we consider the mesh point ui over the interval [0, 1], with x0 = 0 and xn = 1, note that the mesh points distance = h, with . Given
The finite element method minimizes the integral (17) over a class of Piecewise polynomials. The idea is to choose a finite number of trial functions ,and among all their linear combinations to find the one, which is the minimum, the unknown determined by a system of N discrete algebraic equations, which the computer can handle. Therefore, the goal is to choose trial functions ,which are convenient enough for the given integral (17) to be compute and minimized, and at the same time general enough to approximate closely the unknown u. The software TWEPEP starts by a subdivision of the given region into smaller pieces which are triangles with standard six-node with a quadratic basis function, and with one edge curved when adjacent to a curved boundary according to the isoperimetric method. It is also optional to use 10-piont cubic (3rd degree) or the 15-points quartic (4th degree) isoperimetric triangular elements for greater accuracy. Each time a triangle is partitioned, it is divided by a line from the midpoint of its longest side to the opposite vertex. If this side is not on the boundary, the triangle which shares that side must also be divided to avoid non-conforming elements with discontinuous basis functions. An initial triangulation with sufficient triangles to define the region is supplied by the user, then the refinement and grading of this triangulation is guided by a user supplied function D3EST which should be largest where the final triangulation is to be densest. The Cuthill-McKee algorithm (   ) used to initially number the nodes, and a special bandwidth reduction algorithm is used to decrease the bandwidth of the Jacobian matrix even further.
In all cases, the algebraic system solved by Newton’s method. One iteration per time step is done for parabolic problems and one iteration is sufficient for linear elliptic problems. The linear system is solved directly by block Gaussian elimination, without row interchanges since pivoting is unnecessary when the matrix is positive definite. Symmetry also taken advantage of in the elimination process if it is present then the storage and computational work halved. If the Jacobian matrix is too large to keep in core, the frontal method is used efficiently organize its storage out of core.
3. Illustrations of the Methods
In this section, we shall consider three examples the first is the linearized Emden-Fowler Equation, and the other two are nonlinear. The out-come of modified Adomians decomposition method compared with and the finite element method the p, the h versions, and any known solution to the underlying Emden-Fowler Equation. Then solution obtained generalized by maple . While the nonlinear system of equations given in (17) has been solved using the old version of the computer algebra system TWEPEP .
Example 1. Consider Emden-Fowler Equation of the form
Substituting these values into the general formula Equation (13), we obtain
The exact solution to Equation (18) given by .
Example 2. Consider the Emden Fowler of the form
Using Equation (13), the various ui are given by
The exact solution of Equation (20) is given by
The exact solution compared with the numerical solution using Adomians method.
Example 3. Our final Example deals with Emden-Fowler Equation of the form
Using Equation (13) the various iterates are given by
The exact solution of Equation (23) and (24) is given by
The exact solution compared with the numerical solution using Adomians method, shown in Table 3 errors obtained by approximation and as defined in Equation (16) respectively.
In the next section, we will give the numerical results arising from the implementation of this adaptive collocation approach over the Emden-Fowler problem.
In this section, the ADM collocation method used to solve the Emden-Fowler problem for different values of the ui using the computer algebra system Maple 15. In Tables 1-3, the numerical solutions obtained by the above method at the mesh points . Respectively, are compared with the given analytic solutions the resulting relative error is also compared with h version FEM numerical techniques, namely, 50, 100 and 150 elements.
In Tables 4-6, the numerical solution obtained by the FEM collocation at the mesh points ,is compared with the exact solutions given. A Fortran code called TWOPEP  used to solve to solve the problems.
Table 1. Error obtained using decomposition method for example 1.
Table 2. Error obtained using decomposition method for example 2.
Table 3. Error obtained using decomposition method with four five and six terms for example 3.
Table 4. Error obtained using finite element method example 1.
Table 5. Error obtained using finite element method example 2.
Table 6. Error obtained using finite element method example 3.
From Tables 4-6, we observe that the h and the p collocation FEM method yields a almost exact solution for elements in order = 50, 100, and 150, respectively  an investigate the effect of the choice of the number of elements around the singularity points over comes the failed of the traditional ADM on the numerical solution of Troesch’s problem. Tables 4-6 provide the relative error obtained by the h and the p shape-spline method,
We observe generally notable change in the numerical results when the number of elements and the degree increased, we can say almost exact.
From Tables 1-3, it is evident that the relative error for all given examples decreases as the number of terms of the ADM increase, convergence is rapid and the relative error is small.
Likewise, result in Tables 4-6 shows the F.E.M error as the number of elements is subdivided (the h version) also as the degree of the polynomial is increased (p version). With more dense elements near t = 0 has the upper hand results.
In this work, the Adomians decomposition method, and the finite element method p and the h versions have been successfully applied to find the solution of nonlinear Emden-Fowler Equation. For general cases, Adomians decomposition method usually fails to solve singular initial value problems of Emden-Fowler type, while an effective modification of FEM that only requires denser elements around the singularity point is introduced. We conclude that FEM is a powerful method for the solution of nonlinear Emden-Fowler Equation. However, the computations by the ADM are simpler and faster than FEM techniques. The FME offers great advantages of straightforward applicability, computational efficiency and high accuracy.
 Adomians, G. (1990) A Review of the Decomposition Method and Some Recent Results for Nonlinear Equations. Mathematical and Computer Modelling, 13, 17-43.
 Evans, D.J. and Hossen, K.A. (2000) Asymptotic Decomposition of Mildly Nonlinear Differential Equation. International Journal of Computer Mathematics, 78, 569-573.
 Scott, M.R. (1975) On the Conversion of Boundary-Value Problems into Stable Initial-Value Problems via Several Invariant Imbedding Algorithms. In: Aziz, A.K., Ed., Numerical Solutions of Boundary-Value Problems for Ordinary Differential Equations, Academic Press, New York, 89-146.
 Chang, S.H. and Chang, I.L. (2008) A New Algorithm for Calculating the One-Dimensional Differential Transform of Nonlinear Functions. Applied Mathematics and Computation, 195, 799-808.
 Hossein, J., Tayyebi, E., Sadeghi, S. and Khalique, C.M. (2014) New Modification of the Adomian Decomposition Method for Nonlinear Integral Equations. International Journal of Advances in Applied Mathematics and Mechanics, 1, 33-39.
 Almazmumy, M., Hendi, F.A., Bakodah, H.O. and Alzumi, H. (2012) Recent Modifications of Adomian Decomposition Method for Initial Value Problem in Ordinary Differential Equations. American Journal of Computational Mathematics, 2, 228-234.
 Rosen, R. (1968) Matrix Bandwidth Minimization. Proceedings of 23rd National Conference, ACM, ACM Publication P-68, Brandon/Systems Press, Princeton, NJ, 585-595.