- Research
- Open Access
- Published:

# Chebyshev wavelets method for solving Bratu’s problem

*Boundary Value Problems*
**volume 2013**, Article number: 142 (2013)

## Abstract

A numerical method for one-dimensional Bratu’s problem is presented in this work. The method is based on Chebyshev wavelets approximates. The operational matrix of derivative of Chebyshev wavelets is introduced. The matrix together with the collocation method are then utilized to transform the differential equation into a system of algebraic equations. Numerical examples are presented to verify the efficiency and accuracy of the proposed algorithm. The results reveal that the method is accurate and easy to implement.

## 1 Introduction

In this paper, we consider the boundary-value problem and initial value problem of Bratu’s problem. It is well known that Bratu’s boundary value problem in one-dimensional planar coordinates is of the form

with the boundary conditions u(0)=u(1)=0. For \lambda >0 is a constant, the exact solution of equation (1) is given by [1]

where *θ* satisfies

The problem has zero, one or two solutions when \lambda >{\lambda}_{c}, \lambda ={\lambda}_{c} and \lambda <{\lambda}_{c}, respectively, where the critical value {\lambda}_{c} satisfies the equation

It was evaluated in [1–3] that the critical value {\lambda}_{c} is given by {\lambda}_{c}=3.513830719.

In addition, an initial value problem of Bratu’s problem

with the initial conditions u(0)={u}^{\prime}(0)=0 will be investigated.

Bratu’s problem is also used in a large variety of applications such as the fuel ignition model of the thermal combustion theory, the model of thermal reaction process, the Chandrasekhar model of the expansion of the universe, questions in geometry and relativity about the Chandrasekhar model, chemical reaction theory, radiative heat transfer and nanotechnology [4–11].

A substantial amount of research work has been done for the study of Bratu’s problem. Boyd [2, 12] employed Chebyshev polynomial expansions and the Gegenbauer as base functions. Syam and Hamdan [8] presented the Laplace decomposition method for solving Bratu’s problem. Also, Aksoy and Pakdemirli [13] developed a perturbation solution to Bratu-type equations. Wazwaz [10] presented the Adomian decomposition method for solving Bratu’s problem. In addition, the applications of spline method, wavelet method and Sinc-Galerkin method for solution of Bratu’s problem have been used by [14–17].

In recent years, the wavelet applications in dealing with dynamic system problems, especially in solving differential equations with two-point boundary value constraints have been discussed in many papers [4, 16, 18]. By transforming differential equations into algebraic equations, the solution may be found by determining the corresponding coefficients that satisfy the algebraic equations. Some efforts have been made to solve Bratu’s problem by using the wavelet collocation method [16].

In the present article, we apply the Chebyshev wavelets method to find the approximate solution of Bratu’s problem. The method is based on expanding the solution by Chebyshev wavelets with unknown coefficients. The properties of Chebyshev wavelets together with the collocation method are utilized to evaluate the unknown coefficients and then an approximate solution to (1) is identified.

## 2 Chebyshev wavelets and their properties

### 2.1 Wavelets and Chebyshev wavelets

In recent years, wavelets have been very successful in many science and engineering fields. They constitute a family of functions constructed from dilation and translation of a single function called the mother wavelet \psi (x). When the dilation parameter *a* and the translation parameter *b* vary continuously, we have the following family of continuous wavelets [19]:

Chebyshev wavelets {\psi}_{n,m}=\psi (k,n,m,x) have four arguments, n=1,2,\dots ,{2}^{k-1}, *k* can assume any positive integer, *m* is the degree of Chebyshev polynomials of first kind and *x* denotes the time.

where

and m=0,1,2,\dots ,M-1, n=1,2,\dots ,{2}^{k-1}. Here {T}_{m}(x) are the well-known Chebyshev polynomials of order *m*, which are orthogonal with respect to the weight function \omega (x)=1/\sqrt{1-{x}^{2}} and satisfy the following recursive formula:

We should note that the set of Chebyshev wavelets is orthogonal with respect to the weight function {\omega}_{n}(x)=\omega ({2}^{k}x-2n+1).

The derivative of Chebyshev polynomials is a linear combination of lower-order Chebyshev polynomials, in fact [20],

### 2.2 Function approximation

A function u(x) defined over [0,1) may be expanded as

where {c}_{nm}=(u(x),{\psi}_{nm}(x)), in which (\cdot ,\cdot ) denotes the inner product with the weight function {\omega}_{n}(x). If u(x) in (7) is truncated, then (7) can be written as

where *C* and \Psi (x) are {2}^{k-1}M\times 1 matrices given by

and

## 3 Chebyshev wavelets operational matrix of derivative

In this section we first derive the operational matrix *D* of derivative which plays a great role in dealing with Bratu’s problem.

In the interval [(n-1)/{2}^{k-1},n/{2}^{k-1}),

Applying (6) the derivative of {\psi}_{n,m}(x) is

The function {\psi}_{i}(x) is zero outside the interval [(i-1)/{2}^{k-1},i/{2}^{k-1}), so

where

In fact we have shown that

where

From (10), it can be generalized for any n\in N as

## 4 Solution of Bratu’s problem

Consider Bratu’s problem given in (1). In order to use Chebyshev wavelets, we first approximate u(x) as

Applying (11) we can get

Thus we have

We now collocate (12) at {2}^{k-1}M-2 points at {x}_{i} as

Suitable collocation points are

Thus with the boundary conditions u(0)=u(1)=0, we have

Equations (13), (14) and (15) generate {2}^{k-1}M set of nonlinear equations. The approximate solution of the vector *C* is obtained by solving the nonlinear system using the Gauss-Newton method.

## 5 Error analysis

**Theorem 5.1** *A function* u(x)\in {L}_{\omega}^{2}([0,1]), *with bounded second derivative*, *say* |{u}^{\u2033}(x)|\le N, *can be expanded as an infinite sum of Chebyshev wavelets*, *and the series converges uniformly to* u(x), *that is* [21],

Since the truncated Chebyshev wavelets series is an approximate solution of Bratu’s problem, so one has an error function E(x) for u(x) as follows:

The error bound of the approximate solution by using Chebyshev wavelets series is given by the following theorem.

**Theorem 5.2** *Suppose that* u(x)\in {C}^{m}[0,1] *and* {C}^{T}\Psi (x) *is the approximate solution using the Chebyshev wavelets method*. *Then the error bound would be obtained as follows*:

*Proof* Applying the definition of norm in the inner product space, we have

Because the interval [0,1] is divided into {2}^{k-1} subintervals {I}_{n}=[(n-1)/{2}^{k-1},n/{2}^{k-1}], n=1,2,\dots ,{2}^{k-1}, then we can obtain

where {P}_{m}(x) is the interpolating polynomial of degree *m* which agrees with u(x) at the Chebyshev nodes on {I}_{n} with the following error bound for interpolating [22, 23]:

Therefore, using the above equation, we would get

□

## 6 Numerical examples

To illustrate the ability and reliability of the method for Bratu’s problem, some examples are provided. The results reveal that the method is very effective and simple.

**Example 6.1** Consider the first case for Bratu’s equation as follows, when \lambda =2 [14, 15]:

We solve the equation by using the Chebyshev wavelets method with k=2, M=4,6,8. The numerical results obtained are presented in Table 1. Table 1 shows the comparison between the absolute error of exact and approximate solutions for various values of *M* (with k=2). Moreover, higher accuracy can be achieved by taking higher order approximations.

**Example 6.2** Consider the initial value problem [10, 14–16, 24]

The exact solution is u(x)=-2ln(cos(x)). Here we solve it using Chebyshev wavelets, with k=1, M=6. First we assume that the unknown function u(x) is given by

Applying (12) we get

Using the initial condition, we obtain

Equations (18) and (19) generate a system of nonlinear equations. These equations can be solved for unknown coefficients of the vector *C*. A comparison between the exact and the approximate solutions is demonstrated in Figure 1. From Figure 1, it can be found that the obtained approximate solutions are very close to the exact solution. In addition, Table 2 shows the exact and approximate solutions using the method presented in Section 3 and compares the results with the method presented in [16]. Also, by comparing the results of the table, we see that the results of the proposed method are more accurate.

## 7 Conclusions

The aim of present work is to develop an efficient and accurate method for solving Bratu’s problems. The Chebyshev wavelet operational matrix of derivative together with the collocation method are used to reduce the problem to the solution of nonlinear algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the technique.

## References

Ascher UM, Matheij R, Russell RD:

*Numerical Solution of Boundary Value Problems for Ordinary Differential Equations*. SIAM, Philadelphia; 1995.Boyd JP: Chebyshev polynomial expansions for simultaneous approximation of two branches of a function with application to the one-dimensional Bratu equation.

*Appl. Math. Comput.*2003, 14: 189–200.Buckmire R: Investigations of nonstandard Mickens-type finite-difference schemes for singular boundary value problems in cylindrical or spherical coordinates.

*Numer. Methods Partial Differ. Equ.*2003, 19(3):380–398. 10.1002/num.10055Hsiao CH: Haar wavelet approach to linear stiff systems.

*Math. Comput. Simul.*2004, 64: 561–567. 10.1016/j.matcom.2003.11.011Buckmire R: Application of a Mickens finite-difference scheme to the cylindrical Bratu-Gelfand problem.

*Numer. Methods Partial Differ. Equ.*2004, 20(3):327–337. 10.1002/num.10093McGough JS: Numerical continuation and the Gelfand problem.

*Appl. Math. Comput.*1998, 89: 225–239. 10.1016/S0096-3003(97)81660-8Mounim AS, de Dormale BM: From the fitting techniques to accurate schemes for the Liouville-Bratu-Gelfand problem.

*Numer. Methods Partial Differ. Equ.*2006, 22(4):761–775. 10.1002/num.20116Syam MI, Hamdan A: An efficient method for solving Bratu equations.

*Appl. Math. Comput.*2006, 176: 704–713. 10.1016/j.amc.2005.10.021Li S, Liao SJ: Analytic approach to solve multiple solutions of a strongly nonlinear problem.

*Appl. Math. Comput.*2005, 169: 854–865. 10.1016/j.amc.2004.09.066Wazwaz AM: Adomian decomposition method for a reliable treatment of the Bratu-type equations.

*Appl. Math. Comput.*2005, 166: 652–663. 10.1016/j.amc.2004.06.059He JH: Some asymptotic methods for strongly nonlinear equations.

*Int. J. Mod. Phys. B*2006, 20(10):1141–1199. 10.1142/S0217979206033796Boyd JP: One-point pseudo spectral collocation for the one-dimensional Bratu equation.

*Appl. Math. Comput.*2011, 217: 5553–5565. 10.1016/j.amc.2010.12.029Aksoy Y, Pakdemirli M: New perturbation iteration solutions for Bratu-type equations.

*Comput. Math. Appl.*2010, 59: 2802–2808. 10.1016/j.camwa.2010.01.050Caglara H, Caglarb N, Özer M: B-spline method for solving Bratu’s problem.

*Int. J. Comput. Math.*2010, 87(8):1885–1891. 10.1080/00207160802545882Jalilian R: Non-polynomial spline method for solving Bratu’s problem.

*Comput. Phys. Commun.*2010, 181: 1868–1872. 10.1016/j.cpc.2010.08.004Venkatesh SG, Ayyaswamy SK, Raja Balachandar S: The Legendre wavelet method for solving initial value problems of Bratu-type.

*Comput. Math. Appl.*2012, 63: 1287–1295. 10.1016/j.camwa.2011.12.069Rashidinia J, Maleknejad K, Taheri N: Sinc-Galerkin method for numerical solution of the Bratu’s problem.

*Numer. Algorithms*2013, 62: 1–11. 10.1007/s11075-012-9560-3Lepik U: Numerical solution of differential equations using Haar wavelets.

*Math. Comput. Simul.*2005, 68(2):127–143. 10.1016/j.matcom.2004.10.005Daubechies I:

*Ten Lectures on Wavelet*. SIAM, Philadelphia; 1992.Sezer M, Kaynak M: Chebyshev polynomials solutions of linear differential equations.

*Int. J. Math. Educ. Sci. Technol.*1996, 27(4):607–618. 10.1080/0020739960270414Adibi H, Assari P: Chebyshev wavelet method for numerical solution of Fredholm integral equations of the first kind.

*Math. Probl. Eng.*2010, 2010: 1–17.Dahlquist G, Björck A 1. In

*Numerical Methods in Scientific Computing*. SIAM, Philadelphia; 2008.Biazar J, Ebrahimi H: Chebyshev wavelets approach for nonlinear systems of Volterra integral equations.

*Comput. Math. Appl.*2012, 63(3):608–616. 10.1016/j.camwa.2011.09.059Batiha B: Nnmerical solution of Bratu-type equations by the variational iteration method.

*Hacet. J. Math. Stat.*2010, 39: 23–29.

## Acknowledgements

Project is supported by the Huaihai Institute of Technology (No. Z2001151).

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

CY completed the main study, carried out the results of this article and drafted the manuscript. JH checked the proofs and verified the calculation. All the authors read and approved the final manuscript.

## Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Yang, C., Hou, J. Chebyshev wavelets method for solving Bratu’s problem.
*Bound Value Probl* **2013, **142 (2013). https://doi.org/10.1186/1687-2770-2013-142

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1687-2770-2013-142

### Keywords

- Approximate Solution
- Collocation Method
- Chebyshev Polynomial
- Operational Matrix
- Unknown Coefficient