Mathematical Problems in Engineering

Volume 2013, Article ID 423797, 9 pages

http://dx.doi.org/10.1155/2013/423797

## Bernstein Series Solution of a Class of Lane-Emden Type Equations

^{1}Elementary Mathematics Education Program, Faculty of Education, Mugla Sitki Kocman University, 48000 Mugla, Turkey^{2}Department of Mathematics, Faculty of Sciences and Arts, Manisa Celal Bayar University, 45000 Manisa, Turkey

Received 17 December 2012; Accepted 26 February 2013

Academic Editor: Daoyi Dong

Copyright © 2013 Osman Rasit Isik and Mehmet Sezer. 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.

#### Abstract

The purpose of this study is to present an approximate solution that depends on collocation points and Bernstein polynomials for a class of Lane-Emden type equations with mixed conditions. The method is given with some priori error estimate. Even the exact solution is unknown, an upper bound based on the regularity of the exact solution will be obtained. By using the residual correction procedure, the absolute error can be estimated. Also, one can specify the optimal truncation limit which gives a better result in any norm. Finally, the effectiveness of the method is illustrated by some numerical experiments. Numerical results are consistent with the theoretical results.

#### 1. Introduction

Lane-Emden type equation that is presented in (1) models many phenomena in mathematical physics and astrophysics [1, 2]. Consider It describes the equilibrium density distribution in self-gravitating sphere of polytrophic isothermal gas [3]. On the other hand [3], it plays an important role in various fields such as stellar structure [2], radiative cooling, and modeling of clusters of galaxies. It is a nonlinear ordinary differential equation that has a singularity at the origin. In the neighborhood of , it has an analytic solution [1]. It is labeled by the names of the astrophysicists Lane [4] and Robert Emden.

In this paper, a class of Lane-Emden equations [5] is considered in the type of with the mixed conditions where and are functions defined on and , , , and are real constants. We will find an approximate solution, namely, Bernstein series solution, of (2) as such that satisfies (2) on the collocation nodes . Here, , , are Bernstein polynomials.

##### 1.1. Recent Works

Recently, a number of numerical methods are used for handling the Lane-Emden type problems based on perturbation techniques or series solutions. Adomian decomposition method [6, 7] which provides a convergent series solution has been used to solve (1) [8–10]. Wazwaz [8] gave an algorithm to overcome the difficulty of the singular point in using Adomian decomposition method [1].

The quasilinearization method [11–13] can be considered as an example for iteration methods. Its fast convergence, monotonicity, and numerical stability were analyzed by Krivec and Mandelzweig [12]. They verified this method on scattering length calculations in the variable phase approach to quantum mechanics. They also showed that the iterations converge uniformly and quadratically to the exact solution. The method gives accurate and stable answers for any coupling strengths, including super singular potentials for which each term of the perturbation theory diverges.

The Legendre wavelet method was given by Yousefi [14] to solve Lane-Emden equation. This method was used to convert Lane-Emden equations to integral equations and was expanded the solution by Legendre wavelets with unknown coefficients.

Ramos [15] applied a piecewise linearization method to solve the Lane-Emden equation. This method provided piecewise linear ordinary differential equations that can be easily integrated. Furthermore, it has given accurate results for hypersingular potentials, for which perturbation methods diverge. Homotopy analysis method (HAM) and modified HAM have also been used [16, 17] to solve (1). Parand et al. [18] proposed a collocation method based on a Hermite function collocation (HFC) method for solving some classes of Lane-Emden type equations which are nonlinear ordinary differential equations on the semi-infinite domain. A matrix method was given by Yuzbasi for solving nonlinear Lane-Emden type equations. Moreover, Yuzbasi and Sezer [5] applied a matrix method that depends on Bessel polynomials to solve (2). They estimated the absolute errors by using the residual correction procedure. In this study, a similar method to [5] was constructed. In addition, error analysis of the matrix method was developed.

In 2012, Pandey and coworkers [19–22] studied five methods. First, Pandey et al. [19] gave a numerical method for solving linear and nonlinear Lane-Emden type equations using Legendre operational matrix of differentiation. Second, Pandey et al. [20] studied a numerical method to solve linear and nonlinear Lane-Emden type equations using Chebyshev wavelet operational matrix. Third, Kumar et al. [21] presented a method for linear and nonlinear Lane-Emden type equations using the Bernstein polynomial operational matrix of integration. Fourth, Pandey and Kumar [22] proposed a numerical method for solving Lane-Emden type equations arising in astrophysics using Bernstein polynomials. This method is similar to the method used in the present study. And finally, a shifted Jacobi-Gauss collocation spectral method was proposed by Bhrawy and Alofi [23] for solving the nonlinear Lane-Emden type equation.

This paper is organized as follows. In Section 2, some definitions and theorems are given. The method is presented in Section 3. First, a matrix form for each term in (2) is found. Substituting these matrix forms into (2) gives a matrix equation, fundamental matrix equation. Then, a linear system by using collocation points is obtained. For the error analysis, in Section 4, some theorems that give some upper bounds for the absolute errors are presented. One of them guarantees the convergence if the solution is polynomial. The second one gives an upper bound in the case of the exact solution being unknown under the regularity condition. The residual correction procedure to estimate the absolute errors is also given so that the optimal truncation limit can be specified. On the other hand, this procedure gives a new approximate solution. Some numerical examples are given to illustrate the method.

#### 2. Preliminaries

Bernstein polynomials of th-degree are defined by where is the maximum range of the interval over which the polynomials are defined to form a complete basis [24].

We substitute the relation into (5) and obtain the relation

Let us consider pairs . The problem is to find a polynomial , called interpolating polynomial, such that The points are called interpolation nodes. If , the problem is over- or underdetermined.

Theorem 1 (see [25]). *Given distinct nodes and corresponding values , then there exists a unique polynomial such that for . *

Theorem 2 (see [25]). *Let be distinct nodes, and let be a point belonging to the domain of a given function . Assume that , where is the smallest interval containing the nodes and . Then, the interpolation error at the point is given by
**
where .*

Let us denote the interpolation polynomial of by . Lagrange characteristic polynomials are defined as Thus, can be written the following form, Lagrange form:

Hermite interpolation polynomial of on is defined as follows [25]. Suppose that are given data, with , , and . If is selected as and interpolation nodes are distinct, there exist a unique polynomial such that of the form where are the Hermite characteristic polynomials defined by Letting for , they satisfied the following recursive formula: where If , the interpolation error is given as follows: where .

The interpolation error may be reduced by using the roots of Chebyshev polynomials

#### 3. Fundamental Relations

Let be Bernstein series solution of (2). Let us find the matrix forms of and . can be written as where Therefore, can be written as On the other hand, can be written as [26–28] where For , the relation is obtained where Substituting (24) into (22) yields Putting (26) into (19) yields the matrix form for as By substituting (19) and (27) into (2), we obtain a matrix equation as By using the collocation points in (28), one obtains the fundamental matrix equation

We can obtain the corresponding matrix form for conditions (3), by means of the relation (27), as follows:

On the other hand, the matrix forms for the conditions can be written as where Replacing the condition matrices (31) by any two rows of , we get the augmented matrix as . Let the collocation points be selected such that the rank of is . Therefore, the unknown matrix is obtained as

#### 4. Error Analysis and Estimation of the Absolute Error

In this section, some upper bounds of the absolute error are given by using Lagrange and Hermite interpolation polynomials. Also, an estimation of the error based on residual correction is given.

Theorem 3 (see [29]). *Let be a nonsingular matrix and a vector. If and are, respectively, the solutions of the systems and , one has
*

Let be the exact solution of (2) and the interpolation polynomial of it on the nodes . If , then we can write as , where If is the Bernstein series solution of (2), then it satisfies (2) on the nodes. So, and are the solutions of and , respectively, where

Theorem 4. *Let and be the Bernstein series solution and the exact solution of (2), respectively, and the interpolation polynomial of . Let be the function and the matrix which are defined earlier.If , then
*

*Proof. *Adding and subtracting gives thefollowing by triangle inequality:
Since , the first term on the right hand side is bounded by Theorem 2. For the second term, by using Theorem 3 and properties of norm with (22), we get

Corollary 5. *If the exact solution of (2) is a polynomial, then the method gives the exact solution for .*

* Proof. *Since the exact solution is polynomial, for , ; the right hand side of (37) is zero.

The following theorem can be used for the estimation of the absolute error when the exact solution is unknown. Hence, an upper bound depending on is obtained under the condition for . It is well-known that if , then is bounded on .

Theorem 6. *Let and be Bernstein series solution and the exact solution of (2), respectively. Let the interpolation nodes contain and . Let and be the Hermite interpolation polynomial of on the nodes . Then, the error function is bounded by
**
where and .*

* Proof. *Adding and subtracting the polynomials with triangle inequality yields
The first term on the right hand side can be bounded by (17) since.

If the exact solution is unknown, the following steps can be used to find an upper bund of the absolute error. First, we construct the differential equation of . If is the Hermite interpolation polynomial of on the nodes , then satisfies the following differential equation: with the conditions Since is a polynomial, the method gives the exact solution by Corollary 5 under the condition . Thus, is obtained by finding Bernstein series solution of (42) so that an upper bound of the error is obtained depending on .

The following procedure, residual correction (e.g., see, [30–32]), can be given for the estimation of the absolute error. Moreover, one can estimate the optimal giving minimal absolute error using this procedure. The procedure is basic.

First, adding and subtracting the term to (2) yields the following differential equation, which admits as an exact solution: with the conditions Let be Bernstein series solution to (45). If is sufficiently small, the absolute error can be estimated by . Hence, the optimal for the absolute error can be obtained measuring the error functions for different values in any norm.

Corollary 7. *If is Bernstein series solution to (2), then is also an approximate solution for (2). Moreover, its error function is .*

Note that the approximate solution is a better approximation than in the norm for . Let us call the approximate solution as corrected Bernstein series solution.

#### 5. Numerical Examples

In this section, some numerical examples are given to illustrate the method. Some examples are given with their error estimation by using Theorem 4. Moreover, for these examples, the -norms of the error function , the estimate error function , and the absolute error of the corrected Bernstein series solution given in Corollary 7 are calculated for some and . The optimal truncation limit is specified for each example. All calculations are done in Maple . Since is a singular point, the equidistant nodes are selected as .

*Example 8. *Consider the Lane-Emden equation
Applying the method for on the equidistant nodes, Bernstein series solution is obtained as
which is the exact solution [14].

*Example 9. *Let us consider the equation
with the boundary conditions and . The exact solution of (49) is [5]
For different values , the norms and the upper bounds of the absolute errors are obtained on the equidistant nodes by using Theorem 4. Also, estimations of the absolute errors for and the norms of the absolute errors for corrected Bernstein series solutions, , are calculated on the Chebyshev nodes. All results are given in Table 1. The absolute error function for and the estimation of the error function, , are plotted in Figure 1. As seen from Table 1, the optimal truncation limit is specified as , which gives us the best approximation from the set . Moreover, the expected upper bounds are consistent with the absolute errors. Adding to yields the better results in -norm for .

*Example 10. *Let us consider the Lane-Emden equation
having as exact solution [14, 18, 33]. Assuming that the exact solution is unknown and , an upper bound depending on is obtained by Theorem 6. The errors for and are given in Tables 2 and 3, respectively. To obtain and , the equidistant nodes and the Chebyshev collocation nodes are used, respectively. Here, and are the Hermite interpolation polynomials on the sets and , respectively. and represent the values of and in -norms, respectively. By calculating and using Theorem 6, the upper bounds of the absolute errors on the equidistant nodes are given in Table 4 by comparison with the absolute error. As seen from the table, these upper bounds bound the absolute error on some reference points. In Table 5, a comparison between Bernstein series solutions for and the approximate solution obtained by the Hermite functions collocation (HFC) method [18] for , and is given. The results are as follows.

*Example 11. *Let us consider the equation
with the boundary conditions and . The exact solution of (49) is [14, 33]
For different values and , the norms of the absolute errors, the estimations of the absolute errors, and the corrected absolute errors are obtained on the equidistant nodes and given in Table 6. As seen from Table 6, for , corrected absolute errors are better than the absolute errors. Moreover, residual correction procedure estimates the absolute errors accurately.

*Example 12. *Let us consider the Lane-Emden equation [8, 17, 19]
which has exact solution . To show the effect of working with high accurate computations, Bernstein series solutions are obtained for digits 20 and digits 40. The results are given in Tables 7 and 8 for digits 20 and digits 40, respectively. Table 9 shows the comparison of the Bernstein series solution and the approximate solution given by Pandey et al. [19].

Clearly, norms of the absolute errors decrease to , and then they increase after that point. These results can be achieved by increasing digits number as in Table 8. Hence, working with high accuracy may yield more accurate results.

#### 6. Conclusions

To solve Lane-Emden type equations numerically, we introduce a matrix method depending on Bernstein polynomials and collocation points. The method is given with their error analysis. By using Lagrange and Hermite interpolation polynomials, some upper bounds obtained in Section 4 whenever the exact solution is sufficiently smooth. Also the residual correction procedure is given to estimate the absolute error. Even if the exact solution is unknown, one can find an upper bound for the absolute error as in Example 10. Numerical results are consistent with the theoretical results. As in Example 11, increasing number of digits may decrease the round-off error; therefore, more accurate results can be obtained. On the other hand, for , corrected Bernstein series solution, , is a better approximation than in -norm in the tables. As a disadvantage of the method, even if Bernstein series solution for can be obtained, the results may not be reliable since increases.

As a future work, we will shortly extend our study to nonlinear Lane-Emden type differential equation. The error analysis of the method can be improved. The conditions that guarantee the convergence of the method will be explored.

#### Acknowledgment

The author would like to thank to the referees for advices and corrections.

#### References

- H. T. Davis,
*Introduction to Nonlinear Differential And Integral Equations*, Dover Publications, New York, NY, USA, 1962. View at Zentralblatt MATH · View at MathSciNet - S. Chandrasekhar,
*An Introduction to the Study of Stellar Structure*, Dover Publications, New York, NY, YSA, 1957. View at Zentralblatt MATH · View at MathSciNet - J. I. Ramos, “Series approach to the Lane-Emden equation and comparison with the homotopy perturbation method,”
*Chaos, Solitons and Fractals*, vol. 38, no. 2, pp. 400–408, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. H. Lane, “On the theoretical temperature of the sun under the hypothesis of a gaseous mass maintaining its volume by its internal heat and depending on the laws of gases known to terrestrial experiment,”
*The American Journal of Science and Arts*, vol. 50, no. 2, pp. 57–74, 1870. View at Google Scholar - S. Yuzbasi and M. Sezer, “A collocation approach to solve a class of Lane-Emden type equations,”
*Journal of Advanced Research in Applied Mathematics*, vol. 3, no. 2, pp. 58–73, 2011. View at Publisher · View at Google Scholar · View at MathSciNet - G. Adomian,
*Solving Frontier Problems of Physics: The Decomposition Method*, vol. 60 of*Fundamental Theories of Physics*, Kluwer Academic Publishers, Boston, Mass, USA, 1994. View at MathSciNet - G. Adomian, “A review of the decomposition method in applied mathematics,”
*Journal of Mathematical Analysis and Applications*, vol. 135, no. 2, pp. 501–544, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A.-M. Wazwaz, “A new algorithm for solving differential equations of Lane-Emden type,”
*Applied Mathematics and Computation*, vol. 118, no. 2-3, pp. 287–310, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. H. Behiry, H. Hashish, I. L. El-Kalla, and A. Elsaid, “A new algorithm for the decomposition solution of nonlinear differential equations,”
*Computers & Mathematics with Applications*, vol. 54, no. 4, pp. 459–466, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. Liao, “A new analytic algorithm of Lane-Emden type equations,”
*Applied Mathematics and Computation*, vol. 142, no. 1, pp. 1–16, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - V. B. Mandelzweig and F. Tabakin, “Quasilinearization approach to nonlinear problems in physics with application to nonlinear ODEs,”
*Computer Physics Communications*, vol. 141, no. 2, pp. 268–281, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Krivec and V. B. Mandelzweig, “Numerical investigation of quasilinearization method in quantum mechanics,”
*Computer Physics Communications*, vol. 138, no. 1, pp. 69–79, 2001. View at Publisher · View at Google Scholar · View at Scopus - R. Krivec and V. B. Mandelzweig, “Quasilinearization approach to computations with singular potentials,”
*Computer Physics Communications*, vol. 179, no. 12, pp. 865–867, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. A. Yousefi, “Legendre wavelets method for solving differential equations of Lane-Emden type,”
*Applied Mathematics and Computation*, vol. 181, no. 2, pp. 1417–1422, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. I. Ramos, “Linearization methods in classical and quantum mechanics,”
*Computer Physics Communications*, vol. 153, no. 2, pp. 199–208, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Yildirim and T. Ozis, “Solutions of singular IVPs of Lane-Emden type by homotopy perturbation method,”
*Physics Letters A*, vol. 369, no. 1-2, pp. 70–76, 2007. View at Publisher · View at Google Scholar · View at Scopus - O. P. Singh, R. K. Pandey, and V. K. Singh, “An analytic algorithm of Lane-Emden type equations arising in astrophysics using modified homotopy analysis method,”
*Computer Physics Communications*, vol. 180, no. 7, pp. 1116–1124, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - K. Parand, M. Dehghan, A. R. Rezaei, and S. M. Ghaderi, “An approximation algorithm for the solution of the nonlinear Lane-Emden type equations arising in astrophysics using Hermite functions collocation method,”
*Computer Physics Communications*, vol. 181, no. 6, pp. 1096–1108, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. K. Pandey, N. Kumar, A. Bhardwaj, and G. Dutta, “Solution of Lane-Emden type equations using Legendre operational matrix of differentiation,”
*Applied Mathematics and Computation*, vol. 218, no. 14, pp. 7629–7637, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. K. Pandey, A. Bhardwaj, and N. Kumar, “Solution of Lane-Emden type equations using Chebyshev wavelet operational matrix,”
*Journal of Advanced Research in Scientific Computing*, vol. 4, no. 1, pp. 1–12, 2012. View at Google Scholar · View at MathSciNet - N. Kumar, R. K. Pandey, and C. Cattani, “Solution of Lane-Emden type equations Bernstein operational matrix of integration,”
*ISRN Astronomy and Astrophysics*, vol. 2011, Article ID 351747, 7 pages, 2011. View at Publisher · View at Google Scholar - R. K. Pandey and N. Kumar, “Solution of Lane-Emden type equations using Bernstein operational matrix of differentiation,”
*New Astronomy*, vol. 17, no. 3, pp. 303–308, 2012. View at Publisher · View at Google Scholar - A. H. Bhrawy and A. S. Alofi, “A Jacobi-Gauss collocation method for solving nonlinear Lane-Emden type equations,”
*Communications in Nonlinear Science and Numerical Simulation*, vol. 17, no. 1, pp. 62–70, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. I. Bhatti and P. Bracken, “Solutions of differential equations in a Bernstein polynomial basis,”
*Journal of Computational and Applied Mathematics*, vol. 205, no. 1, pp. 272–280, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Quarteroni, R. Sacco, and F. Saleri,
*Numerical Mathematics*, vol. 37 of*Texts in Applied Mathematics*, Springer, Berlin, Germany, 2nd edition, 2007. View at MathSciNet - O. R. Isik, Z. Güney, and M. Sezer, “Bernstein series solutions of pantograph equations using polynomial interpolation,”
*Journal of Difference Equations and Applications*, vol. 18, no. 3, pp. 357–374, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - O. R. Isik, M. Sezer, and Z. Güney, “Bernstein series solution of a class of linear integro-differential equations with weakly singular kernel,”
*Applied Mathematics and Computation*, vol. 217, no. 16, pp. 7009–7020, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - O. R. Isik, M. Sezer, and Z. Güney, “A rational approximation based on Bernstein polynomials for high order initial and boundary values problems,”
*Applied Mathematics and Computation*, vol. 217, no. 22, pp. 9438–9450, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. S. Watkins,
*Fundamentals of Matrix Computations*, Pure and Applied Mathematics, John Wiley & Sons,, New York, NY, USA, 2002. View at Publisher · View at Google Scholar · View at MathSciNet - F. A. Oliveira, “Collocation and residual correction,”
*Numerische Mathematik*, vol. 36, no. 1, pp. 27–31, 1980. View at Publisher · View at Google Scholar · View at MathSciNet - İ. Çelik, “Collocation method and residual correction using Chebyshev series,”
*Applied Mathematics and Computation*, vol. 174, no. 2, pp. 910–920, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - İ. Çelik, “Approximate calculation of eigenvalues with the method of weighted residuals-collocation method,”
*Applied Mathematics and Computation*, vol. 160, no. 2, pp. 401–410, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - N. Caglar and H. Caglar, “B-spline solution of singular boundary value problems,”
*Applied Mathematics and Computation*, vol. 182, no. 2, pp. 1509–1513, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet