# An Efficient Approach for Solving Nonlinear Troesch’s and Bratu’s Problems by Wavelet Analysis Method

Authors: A. Kazemi Nasab; Z. Pashazadeh Atabakan; A. Kılıçman
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

We introduce Chebyshev wavelet analysis method to solve the nonlinear Troesch and Bratu problems. Chebyshev wavelets expansions together with operational matrix of derivative are employed to reduce the computation of nonlinear problems to a system of algebraic equations. Several examples are given to validate the efficiency and accuracy of the proposed technique. We compare the results with those ones reported in the literature in order to demonstrate that the method converges rapidly and approximates the exact solution very accurately by using only a small number of Chebyshev wavelet basis functions. Convergence analysis is also included.


---

## Body

## 1. Introduction

Nonlinear equations occurring in a wide variety of problems in engineering and science have received a great deal of attention in the recent decades. Consider the Troesch nonlinear two-point boundary value problem [1–3] in the following form:
(1)u′′(t)+λsinh(λu(t))=0,t∈[0,1],u(0)=0,u(1)=1,
where λ is a positive constant. Troesch’s problem comes from the investigation of the confinement of a plasma column under radiation pressure. Many authors have paid considerable attention to solving Troesch’s problem. Weibel was the first to explain and solve the problem [4]. Roberts and Shipman [3] obtained the closed form solution of the problem in terms of the Jacobi elliptic function. Troesch obtained numerical solution of this problem by the shooting method [5]. Deeba et al. [6] proposed a numerical method based on the decomposition technique. A numerical scheme based on the modified homotopy perturbation method is deduced by Feng et al. [7]. Variational iteration method was proposed by Momani et al. [8]. Khuri solved this problem numerically based on Laplace transform and a modified decomposition technique [9] and also proposed B-spline collocation approach for solving Troesch’s problem [10]. The Sinc-Galerkin method was introduced by Zarebnia and Sajjadian [11]. S.-H. Chang and I.-L. Chang [12] proposed a new technique based on differential transform for solving Troesch’s problem. A new algorithm based on the variational method and variable transformation was proposed by Chang [13]. More detailed information and references to other discussions on Troesch’s problem may be found in [14–18].The closed form solution of Troesch’s problem is given in [3], where u′(0) is the derivative at 0 given by
(2)u′(0)=2(1-m)1/2.
The constant m satisfies the transcendental equation
(3)sinh(λ/2)(1-m)1/2=sc(λm),
where sc(λ∣m) is the Jacobi function defined by sc(λ∣m)=sinϕ/cosϕ, where ϕ, λ, and m satisfy the following integral:
(4)λ=∫0ϕ‍11-msin2θdθ.It has been indicated in [3, 5] that u(t) has a singularity located approximately at
(5)ts=12λln(161-m)=1λln(8u′(0)),
which implies that the singularity lies within the integration range if u′(0)>8eλ. This characteristic of Troesch’s problem makes it impossible to be solved by some methods when λ>1 [6, 7, 9, 19].Another well-known problem is the Bratu nonlinear two-point boundary value problem given in the following form:(6)u′′(t)+λeu(t)=0,t∈(0,1),u(0)=0,u(1)=0,
where λ is a physical parameter and the prime denotes the differentiation with respect to t. The Bratu problem is indeed a special case of the following well-known classical Gelfand problem by assuming N=1:
(7)u′′(t)+N-1ru′(t)+λeu(t)=0,r∈(0,1],N=1,2,3,…,(8)u(0)=0,u(1)=0,
where N=1,2, and 3 correspond to the infinite slab, infinite circular cylinder, and sphere, respectively. The numerical solutions for all N=1,2,3,… were obtained by Joseph and Lundgren [20] for the domain of a unit ball.The Bratu problem has an analytical solution given in the following form:(9)u(t)=-2ln[cosh((t-(1/2))(θ/2))cosh(θ/4)],
where θ is the solution of θ=2λcosh(θ/4).The Bratu problem has zero, one, or two solutions whenλ>λc, λ=λc, and λ<λc, respectively, where the critical value λc satisfies the equation 1=(1/4)2λcsinh(θc/4) and it was obtained in [21, 22] that the critical value λc is given by λc=3.513830719.The Bratu problem is used in a different variety of applications such as the fuel ignition of the thermal combustion theory, the model thermal reaction process, the Chandrasekhar model of the expansion of the universe, chemical reaction theory, radiative heat transfer, and nanotechnology [23–29].Solving the Bratu Problem by analytical and numerical methods has gained considerable attention from many authors. Aregbesola applied weighted residual method [22] and Wazwaz has employed the Adomian decomposition method to get exact solutions [23]. Homotopy analysis method was developed by Liao and Tan [29] and Laplace transform decomposition method was used in [30]. Nonpolynomial spline method has been applied by Jalilian to obtain smooth approximate solution of the one-dimensional Bratu problem [31]. Caglar et al. [32] developed the B-spline method. Variational method and differential transform method were used in [33, 34]. Also Abbasbandy et al. [35] tried to solve the problem using the Lie-group shooting method.In the recent years, wavelets have received considerable attention by researchers in different fields of science and engineering. One advantage of wavelet analysis is the ability to perform local analysis [36]. Wavelet analysis is able to reveal signal aspects that other analysis methods miss, such as trends, breakdown points, and discontinuities. In comparison with other orthogonal functions, multiresolution analysis aspect of wavelets permits the accurate representation of a variety of functions and operators. In other words, we can change M and k simultaneously to get more accurate solution.  In addition, the coefficient matrix of algebric equations obtained after dicretization is sparse. So it is computationally efficient to use wavelet methods for solving equations. In addition, the solution is convergent.We organize our paper as follows. In Section2, we introduce the Chebyshev wavelets, and the operational matrix of derivative for Chebyshev wavelets is defined. In Section 3, convergence analysis is included. In Section 4, we introduce the method of solving Troesch’s and Bratu’s problems by wavelet analysis method. Several numerical examples are included in Section 5 to confirm that our method is efficient and accurate. Some conclusions are drawn in Section 6.


## 2. Chebyshev Wavelets and Their Properties

### 2.1. Wavelets and Chebyshev Wavelets

Wavelets have been very successfully used in many scientific and engineering fields. They constitute a family of functions constructed from dilation and transformation of a single function called the mother waveletψ(t); we have the following family of continuous wavelets:
(10)ψa,b(t)=|a|-1/2ψ(t-ba),a,b∈R,a≠0.
Chebyshev wavelets, ψn,m=ψ(k,n,m,t), have four arguments, n=0,1,…,2k-1, where k can assume any positive integer, m is the degree of Chebyshev polynomials of the first kind, and t denotes the time.Consider(11)ψn,m(t)={2(k+1)/2T~m(2k+1t-2n-1),n2k≤t<n+12k,0,otherwise,
where
(12)T~m(t)={1π,m=0,2πTm(t),m≥1,
and m=0,1,…,M, and n=0,1,…,2k-1. In (10) the coefficients are used for orthonormality. Here Tm(t) are Chebyshev polynomials of the first kind of degree m which are orthogonal with respect to the weight function, w(t)=1/1-t2, and satisfy the following recursive formula:
(13)T0(t)=1,T1(t)=t,Tm+1(t)=2tTm(t)-Tm-1(t),m=1,2,….
Note that, in dealing with Chebyshev wavelets, the weight function w(t) has to be dilated and translated as follows:
(14)wn,k(t)=w(2k+1t-2n-1)
in order to get orthogonal wavelets.


### 2.2. Function Approximation

A functionu(t)∈Lw~2[0,1]  (where w~(t)=w(2t-1)) may be expanded as
(15)u(t)=∑n=0∞‍∑m=0∞‍cn,mψn,m(t),
where cn,m=(u(t),ψn,m(t))wn,k, in which (·,·) denotes the inner product in Lw~2[0,1]. If we consider truncated series in (15), we obtain
(16)u(t)=∑n=02k-1‍∑m=0M‍cn,mψn,m(t)=CTΨ(t),
where C and Ψ(t) are 2k(M+1)×1 matrices given by
(17)C=[c2k-1,Mc0,0,c0,1,…,c0,M,c1,0,c1,1,…,c1,M,…,c2k-1,0,c2k-1,1,…,c2k-1,M]T,Ψ(t)=[ψ2k-1,Mψ0,0,ψ0,1,…,ψ0,M,ψ1,0,ψ1,1,…,ψ1,M,…,ψ2k-1,0,ψ2k-1,1,…,ψ2k-1,M]T.


### 2.3. Operational Matrix of Derivative (OMD)

The derivative of the vectorΨ(t), which is defined in (17), can be expressed by
(18)ddtψ(t)=Dψ(t),
where D is 2k(M+1)×2k(M+1) operational matrix of derivative defined as follows:
(19)D=[E0⋯00E⋯0⋮⋮⋱⋮000E],
in which E is (M+1)×(M+1) matrix and its (i,j)th element is defined as follows:
(20)Ei,j={2k+2γi-1γj-1m,i=2,…,(M+1),j=1,…,j-1;(i+j)isodd,0,otherwise,
where
(21)γn={2,n=0,1,n≥1.
The method of calculation of D is illustrated in [37].Corollary 1.
The operational matrix fornth derivative can be obtained using (18) as
(22)dnΨ(t)dxn=DnΨ(t),
where Dn is the nth power of matrix D.


## 2.1. Wavelets and Chebyshev Wavelets

Wavelets have been very successfully used in many scientific and engineering fields. They constitute a family of functions constructed from dilation and transformation of a single function called the mother waveletψ(t); we have the following family of continuous wavelets:
(10)ψa,b(t)=|a|-1/2ψ(t-ba),a,b∈R,a≠0.
Chebyshev wavelets, ψn,m=ψ(k,n,m,t), have four arguments, n=0,1,…,2k-1, where k can assume any positive integer, m is the degree of Chebyshev polynomials of the first kind, and t denotes the time.Consider(11)ψn,m(t)={2(k+1)/2T~m(2k+1t-2n-1),n2k≤t<n+12k,0,otherwise,
where
(12)T~m(t)={1π,m=0,2πTm(t),m≥1,
and m=0,1,…,M, and n=0,1,…,2k-1. In (10) the coefficients are used for orthonormality. Here Tm(t) are Chebyshev polynomials of the first kind of degree m which are orthogonal with respect to the weight function, w(t)=1/1-t2, and satisfy the following recursive formula:
(13)T0(t)=1,T1(t)=t,Tm+1(t)=2tTm(t)-Tm-1(t),m=1,2,….
Note that, in dealing with Chebyshev wavelets, the weight function w(t) has to be dilated and translated as follows:
(14)wn,k(t)=w(2k+1t-2n-1)
in order to get orthogonal wavelets.


## 2.2. Function Approximation

A functionu(t)∈Lw~2[0,1]  (where w~(t)=w(2t-1)) may be expanded as
(15)u(t)=∑n=0∞‍∑m=0∞‍cn,mψn,m(t),
where cn,m=(u(t),ψn,m(t))wn,k, in which (·,·) denotes the inner product in Lw~2[0,1]. If we consider truncated series in (15), we obtain
(16)u(t)=∑n=02k-1‍∑m=0M‍cn,mψn,m(t)=CTΨ(t),
where C and Ψ(t) are 2k(M+1)×1 matrices given by
(17)C=[c2k-1,Mc0,0,c0,1,…,c0,M,c1,0,c1,1,…,c1,M,…,c2k-1,0,c2k-1,1,…,c2k-1,M]T,Ψ(t)=[ψ2k-1,Mψ0,0,ψ0,1,…,ψ0,M,ψ1,0,ψ1,1,…,ψ1,M,…,ψ2k-1,0,ψ2k-1,1,…,ψ2k-1,M]T.


## 2.3. Operational Matrix of Derivative (OMD)

The derivative of the vectorΨ(t), which is defined in (17), can be expressed by
(18)ddtψ(t)=Dψ(t),
where D is 2k(M+1)×2k(M+1) operational matrix of derivative defined as follows:
(19)D=[E0⋯00E⋯0⋮⋮⋱⋮000E],
in which E is (M+1)×(M+1) matrix and its (i,j)th element is defined as follows:
(20)Ei,j={2k+2γi-1γj-1m,i=2,…,(M+1),j=1,…,j-1;(i+j)isodd,0,otherwise,
where
(21)γn={2,n=0,1,n≥1.
The method of calculation of D is illustrated in [37].Corollary 1.
The operational matrix fornth derivative can be obtained using (18) as
(22)dnΨ(t)dxn=DnΨ(t),
where Dn is the nth power of matrix D.


## 3. Convergence Analysis

Lemma 2.
If the Chebyshev wavelet expansion of a continuous functionu(t) converges uniformly, then the Chebyshev wavelet expansion converges to the function u(t).Proof.
Suppose the Chebyshev wavelet expansion of the continuous functionu(t) converges to function v(t)(23)v(t)=∑n=12k-1‍∑m=0M‍c^nmψnm(t),
where c^n,m=(u(t),ψn,m(t))wn,k. Multiply both sides of (23) by ψr,s(t)wr,k(t), where r and s are fixed. Due to the uniform convergence, we can then integrate termwise on interval [0,1](24)∫01‍v(t)ψr,s(t)wr,kdt=∑n=12k-1‍∑m=0M‍∫01‍c^nmψnm(t)ψr,s(t)wr,kdt.
By the orthonormality of wavelet basis functions, we have
(25)∫01‍v(t)ψr,s(t)wr,kdt=c^r,s.
Thus (v(t),ψn,m(t))wn,k=c^n,m for n=1,2,…,2k-1 and m=0,1,…,M; consequently, u(t) and v(t) have the same Fourier expansions with Chebyshev wavelet basis; therefore, u(t)=v(t), for t∈[0,1] [38].Theorem 3.
A functionu(t)∈Lwn,k2([0,1]), with bounded second derivative, say |u′′(t)|≤B, can be expanded as an infinite sum of Chebyshev wavelets, and the series converges uniformly to u(t); that is,
(26)u(t)=∑n=1∞‍∑m=0∞‍c^nmψnm(t).Proof.
We have(27)c^n,m=(u(t),ψn,m(t))wn,k=∫01‍u(t)ψnm(t)wn,k(t)dt=∫n-1/2k-1n/2k-1‍2k/2pmu(t)Tm(2kt-2n+1)×w(2kt-2n+1)dt.
For  m>1, by substituting 2kt-2n+1=cosα, it yields
(28)c^nm=12k/2∫0π‍u(cosα+2n-12k)2πcosmαdα.
Using integration by parts, we get
(29)c^nm=22k/2πu(cosα+2n-12k)(sinmαm)|0π+223k/2mπ∫0π‍u′(cosα+2n-12k)sinmαsinαdα.
The first part is zero; therefore,
(30)c^nm=223k/2mπ∫0π‍u′(cosα+2n-12k)sinmαsinαdα.
Using integration by parts again, it yields
(31)c^nm=123k/2m2π×u′(cosα+2n-12k)(sin(m-1)αm-1-sin(m+1)αm+1)|0π+125k/2m2π∫0π‍u′′((cosα+2n-12k)rm(α))dα,
where
(32)rm(α)=sinα(sin(m-1)αm-1-sin(m+1)αm+1).
Thus, we get
(33)|c^nm|=|125k/2m2π∫0π‍u′′(cosα+2n-12k)rm(α)dα|≤(125k/2m2π)∫0π‍|u′′(cosα+2n-12k)rm(α)|dα≤B25k/2m2π∫0π‍|rm(α)|dα.
However
(34)∫0π‍|rm(α)|dα=∫0π‍|sinα(sin(m-1)αm-1-sin(m+1)αm+1)|dα≤∫0π‍|sinαsin(m-1)αm-1|+|sinαsin(m+1)αm+1|dα≤2mπm2-1.
Since n≤2k-1, we obtain
(35)|c^nm|≤2πB(2n)5/2(m2-1).
Now, if m=1, by using (30), we have
(36)|c^n1|<2π(2n)3/2max0≤t≤1|u′(t)|.
It is mentioned in [39] that {ψn0}n=1∞ form an orthogonal system constructed by Haar scaling function with respect to the weight function w(t), and so ∑n=1∞‍c^n0ψn0(t) is convergent. Hence, we will have
(37)|∑n=1∞‍∑m=0∞‍c^nmψnm(t)|≤|∑n=1∞‍c^n0ψn0(t)|+∑n=1∞‍∑m=1∞‍|c^nm||ψnm(t)|≤|∑n=1∞‍c^n0ψn0(t)|+∑n=1∞‍∑m=1∞‍|c^nm|<∞.
Therefore, in view of Lemma 2, the series ∑n=1∞‍∑m=1∞‍c^nmψnm(t) converges to u(t) uniformly.


## 4. The Chebyshev Wavelet Analysis Method

### 4.1. Troesch’s Problem

Troesch’s problems (1) can be considered as follows:
(38)u′=w,w′=λsinh(λu),u(0)=0,u(1)=1.
Then the Jacobian matrix of system (38) is given by
(39)J(u,w)=[01λ2cosh(λu)0].
Therefore, the eigenvalues of the Jacobian matrix at the end points of the interval [0,1] are
(40)λ′(0)=±λ,λ′(1)=±λcosh(λ).
If we choose large λ, we will have large eigenvalues; for example, if λ=10, then the eigenvalue becomes λ′=±1049. On the other hand, the Jacobian matrix J is normal if and only if λ2cosh(λu)=1. This equality is satisfied only for relatively small values of λ. This clarifies why conventional methods, such as finite differences, are not convenient for large values of λ [10]. To solve Troesch’s problems where there exist, a strong nonlinear term sinh(λu) and boundary layer only at the right endpoint (λ>1) [10], we propose Chebyshev wavelet analysis method especially to handle larger eigenvalues.Consider the Troesch nonlinear boundary value problem(41)u′′(t)+λsinh(λu(t))=0,t∈(0,1),
with the boundary conditions
(42)u(0)=0,u(1)=1.
In order to solve the problem, we first approximate all functions u(t) and u′′(t) using basis functions Ψ(t) as
(43)u(t)=CTΨ(t),u′′(t)=CTD2Ψ(t).
Substituting (43) in (41), we obtain
(44)CTD2Ψ(t)-λsinh(λCTΨ(t))=0.
Now, we have 2k(M+1)-2 nonlinear equations by collocating (41) at 2k(M+1)-2 suitable collocation, points. From boundary conditions we also get two equations. So we have a nonlinear system of 2k(M+1) equations with the same number of unknowns which can be solved by Newton’s iterative method to obtain the vector C and consequently the approximated solution u(t).


### 4.2. Bratu’s Problem

Consider the Bratu nonlinear boundary value problem(45)u′′(t)+λeu(t)=0,t∈(0,1),
with the boundary conditions
(46)u(0)=0,u(1)=0,
or initial conditions
(47)u(0)=0,u′(0)=0.
In order to solve the problem, we first approximate all functions u(t), u′(t), and u′′(t) using basis functions Ψ(t) as
(48)u(t)=CTΨ(t),u′(t)=CTDΨ(t),u′′(t)=CTD2Ψ(t).
Substituting (48) in (45), we obtain
(49)CTD2Ψ(t)+λeCTΨ(t)=0.
Now, we have 2k(M+1)-2 nonlinear equations by collocating (49) at 2k(M+1)-2 suitable collocation points. From boundary conditions, or initial conditions, we also get two equations. So we have a nonlinear system of 2k(M+1) equations with the same number of unknowns which can be solved by Newton’s iterative method to obtain the vector C and consequently the approximated solution u(t).


## 4.1. Troesch’s Problem

Troesch’s problems (1) can be considered as follows:
(38)u′=w,w′=λsinh(λu),u(0)=0,u(1)=1.
Then the Jacobian matrix of system (38) is given by
(39)J(u,w)=[01λ2cosh(λu)0].
Therefore, the eigenvalues of the Jacobian matrix at the end points of the interval [0,1] are
(40)λ′(0)=±λ,λ′(1)=±λcosh(λ).
If we choose large λ, we will have large eigenvalues; for example, if λ=10, then the eigenvalue becomes λ′=±1049. On the other hand, the Jacobian matrix J is normal if and only if λ2cosh(λu)=1. This equality is satisfied only for relatively small values of λ. This clarifies why conventional methods, such as finite differences, are not convenient for large values of λ [10]. To solve Troesch’s problems where there exist, a strong nonlinear term sinh(λu) and boundary layer only at the right endpoint (λ>1) [10], we propose Chebyshev wavelet analysis method especially to handle larger eigenvalues.Consider the Troesch nonlinear boundary value problem(41)u′′(t)+λsinh(λu(t))=0,t∈(0,1),
with the boundary conditions
(42)u(0)=0,u(1)=1.
In order to solve the problem, we first approximate all functions u(t) and u′′(t) using basis functions Ψ(t) as
(43)u(t)=CTΨ(t),u′′(t)=CTD2Ψ(t).
Substituting (43) in (41), we obtain
(44)CTD2Ψ(t)-λsinh(λCTΨ(t))=0.
Now, we have 2k(M+1)-2 nonlinear equations by collocating (41) at 2k(M+1)-2 suitable collocation, points. From boundary conditions we also get two equations. So we have a nonlinear system of 2k(M+1) equations with the same number of unknowns which can be solved by Newton’s iterative method to obtain the vector C and consequently the approximated solution u(t).


## 4.2. Bratu’s Problem

Consider the Bratu nonlinear boundary value problem(45)u′′(t)+λeu(t)=0,t∈(0,1),
with the boundary conditions
(46)u(0)=0,u(1)=0,
or initial conditions
(47)u(0)=0,u′(0)=0.
In order to solve the problem, we first approximate all functions u(t), u′(t), and u′′(t) using basis functions Ψ(t) as
(48)u(t)=CTΨ(t),u′(t)=CTDΨ(t),u′′(t)=CTD2Ψ(t).
Substituting (48) in (45), we obtain
(49)CTD2Ψ(t)+λeCTΨ(t)=0.
Now, we have 2k(M+1)-2 nonlinear equations by collocating (49) at 2k(M+1)-2 suitable collocation points. From boundary conditions, or initial conditions, we also get two equations. So we have a nonlinear system of 2k(M+1) equations with the same number of unknowns which can be solved by Newton’s iterative method to obtain the vector C and consequently the approximated solution u(t).


## 5. Numerical Examples

In this section, we solve Troesch’s and Bratu’s problems for different values of the parameterλ using the computer algebra system Maple and make a comparison between our results and those ones reported in the literature to confirm the efficiency and accuracy of our method.Example 1.
Troesch’s problem forλ=0.5,1, and 10.
In Tables1 and 2, the absolute errors in solutions obtained by the introduced method for λ=0.5 and λ=1, respectively, are compared with those ones reported by other existing methods. We observe that the wavelet analysis method with only a few number of basis functions is comparable to Laplace, HAM, and spline methods but is slightly better than perturbation method and much better than variational method in terms of accuracy.Table 1
Obtained absolute errors of Troesch's problem forλ=0.5.
t
Chebyshev  wavelet
Laplace
HPM
HAM
Spline
VIM
M
=
4
,
k
=
1
[9]
[7]
[18]
[10]
[7]
0.1
7.6
×
1
0
-
4
7.7
×
1
0
-
4
8.2
×
1
0
-
4
7.7
×
1
0
-
4
7.7
×
1
0
-
4
4.9
×
1
0
-
3
0.2
1.5
×
1
0
-
3
1.5
×
1
0
-
3
1.6
×
1
0
-
3
1.5
×
1
0
-
3
1.5
×
1
0
-
3
9.7
×
1
0
-
3
0.3
2.1
×
1
0
-
3
2.1
×
1
0
-
3
2.3
×
1
0
-
3
2.1
×
1
0
-
3
2.1
×
1
0
-
3
1.4
×
1
0
-
2
0.4
2.7
×
1
0
-
3
2.7
×
1
0
-
3
2.9
×
1
0
-
3
2.7
×
1
0
-
3
2.7
×
1
0
-
3
1.9
×
1
0
-
2
0.5
3.0
×
1
0
-
3
3.0
×
1
0
-
3
3.2
×
1
0
-
3
3.0
×
1
0
-
3
3.0
×
1
0
-
3
2.3
×
1
0
-
2
0.6
3.1
×
1
0
-
3
3.1
×
1
0
-
3
3.4
×
1
0
-
3
3.1
×
1
0
-
3
3.1
×
1
0
-
3
2.8
×
1
0
-
2
0.7
3.0
×
1
0
-
3
3.0
×
1
0
-
3
3.2
×
1
0
-
3
3.0
×
1
0
-
3
3.0
×
1
0
-
3
3.2
×
1
0
-
2
0.8
2.4
×
1
0
-
3
2.4
×
1
0
-
3
2.7
×
1
0
-
3
2.4
×
1
0
-
3
2.4
×
1
0
-
3
3.6
×
1
0
-
2
0.9
1.5
×
1
0
-
3
1.5
×
1
0
-
3
1.6
×
1
0
-
3
1.5
×
1
0
-
3
1.5
×
1
0
-
3
4.0
×
1
0
-
2Table 2
Obtained absolute errors of Troesch's problem forλ=1.0.
t
Chebyshev  wavelet
Laplace
HPM
HAM
Spline
VIM
M
=
4
,
k
=
1
[9]
[7]
[18]
[10]
[7]
0.1
2.8
×
1
0
-
3
2.9
×
1
0
-
3
3.6
×
1
0
-
3
2.9
×
1
0
-
3
2.8
×
1
0
-
3
1.8
×
1
0
-
2
0.2
5.6
×
1
0
-
3
5.9
×
1
0
-
3
7.1
×
1
0
-
2
5.7
×
1
0
-
3
5.6
×
1
0
-
3
3.6
×
1
0
-
2
0.3
8.2
×
1
0
-
3
8.2
×
1
0
-
3
1.0
×
1
0
-
2
8.3
×
1
0
-
3
8.2
×
1
0
-
3
5.5
×
1
0
-
2
0.4
1.0
×
1
0
-
2
1.0
×
1
0
-
2
1.3
×
1
0
-
2
1.0
×
1
0
-
2
1.0
×
1
0
-
2
7.4
×
1
0
-
2
0.5
1.2
×
1
0
-
2
1.2
×
1
0
-
2
1.6
×
1
0
-
2
1.2
×
1
0
-
2
1.2
×
1
0
-
2
9.3
×
1
0
-
2
0.6
1.3
×
1
0
-
2
1.3
×
1
0
-
2
1.7
×
1
0
-
2
1.3
×
1
0
-
2
1.3
×
1
0
-
2
1.1
×
1
0
-
1
0.7
1.3
×
1
0
-
2
1.3
×
1
0
-
2
1.7
×
1
0
-
2
1.2
×
1
0
-
2
1.3
×
1
0
-
2
1.3
×
1
0
-
1
0.8
1.1
×
1
0
-
2
1.1
×
1
0
-
2
1.5
×
1
0
-
2
1.2
×
1
0
-
2
1.1
×
1
0
-
2
1.5
×
1
0
-
1
0.9
7.4
×
1
0
-
3
7.4
×
1
0
-
3
9.7
×
1
0
-
3
7.4
×
1
0
-
3
7.4
×
1
0
-
3
1.7
×
1
0
-
1Due to the nonlinear termsinh(λu(t)), which is not analytic, some methods like Laplace, variational iteration method, and homotopy are not able to solve the Troesch problem when λ≥5. In Table 3, the numerical solution for λ=5 obtained by the current method is compared with the numerical approximation of the exact solutions given by a Fortran code called TWPBVP and B-spline method [10]. It can be seen that our obtained results are much more accurate than those obtained by B-spline method.Table 3
Numerical solution of Troesch's problem forλ=5.
t
Fortran code
B-spline
|
Error
|
Chebyshev wavelet
|
Error
|
[10]
M
=
9
,
k
=
3
0.0
0.00000000
0.00000000
0.0
0.00000000
0.0
0.2
0.01075342
0.01002027
7.3
×
1
0
-
3
0.01075412
7.0
×
1
0
-
7
0.4
0.03320051
0.03099793
2.2
×
1
0
-
3
0.03320271
2.2
×
1
0
-
6
0.8
0.25821664
0.24170496
1.4
×
1
0
-
2
0.25823492
1.8
×
1
0
-
5
0.9
0.45506034
0.42461830
3.0
×
1
0
-
2
0.45508401
2.4
×
1
0
-
5
1.0
1.00000000
1.00000000
0.0
1.00000000
0.0In Table4, the numerical solution obtained by the current method using M=20 and k=5 (672-term approximant), for λ=10, is compared with the results obtained by B-spline method over a nonuniform mesh using n=790 mesh points [10], with those in [12] computed using 1750-term approximant, and with those obtained by [13] using a method based on the variational iteration method and variable transformation. It can be seen that the results obtained by the present method with much lesser number of terms to approximate the solution are compatible and in well agreement with those ones obtained by Chang [13].Table 4
Numerical solution of Troesch's problem forλ=10.
t
Present method
B-spline,N=790
y
1750
(
x
)
y
1
(
x
)
=
4
μ
tanh
-
1
(
μ
1
(
x
)
)
y
2
(
x
)
=
4
μ
tanh
-
1
(
μ
2
(
x
)
)
M
=
20
,
k
=
5
[10]
[12]
[13]
[13]
0.00
0
0
0
0
0
0.100
4.2110
×
1
0
-
5
4.2097
×
1
0
-
5
4.2113
×
1
0
-
5
4.2112
×
1
0
-
5
4.2112
×
1
0
-
5
0.200
1.2996
×
1
0
-
4
1.2992
×
1
0
-
4
1.2997
×
1
0
-
4
1.2996
×
1
0
-
4
1.2996
×
1
0
-
4
0.300
3.5896
×
1
0
-
4
3.5886
×
1
0
-
4
3.5899
×
1
0
-
4
3.5898
×
1
0
-
4
3.5898
×
1
0
-
4
0.400
9.7785
×
1
0
-
4
9.7762
×
1
0
-
4
9.7792
×
1
0
-
4
9.7790
×
1
0
-
4
9.7790
×
1
0
-
4
0.500
2.6589
×
1
0
-
3
2.6583
×
1
0
-
3
2.6591
×
1
0
-
3
2.6590
×
1
0
-
3
2.6590
×
1
0
-
3
0.600
7.2286
×
1
0
-
3
7.2272
×
1
0
-
3
7.2291
×
1
0
-
3
7.2289
×
1
0
-
3
7.2289
×
1
0
-
3
0.700
1.9663
×
1
0
-
2
1.9660
×
1
0
-
2
1.9664
×
1
0
-
2
1.9664
×
1
0
-
2
1.9664
×
1
0
-
2
0.800
5.3728
×
1
0
-
2
5.3720
×
1
0
-
2
5.3732
×
1
0
-
2
5.3730
×
1
0
-
2
5.3730
×
1
0
-
2
0.900
1.5210
×
1
0
-
1
1.5209
×
1
0
-
1
1.5212
×
1
0
-
1
1.5211
×
1
0
-
1
1.5211
×
1
0
-
1
0.925
2.0199
×
1
0
-
1
2.0199
×
1
0
-
1
2.0201
×
1
0
-
1
2.0201
×
1
0
-
1
2.0201
×
1
0
-
1
0.950
2.7625
×
1
0
-
1
2.7623
×
1
0
-
1
2.7628
×
1
0
-
1
2.7627
×
1
0
-
1
2.7627
×
1
0
-
1
0.970
3.7224
×
1
0
-
1
3.7223
×
1
0
-
1
3.7229
×
1
0
-
1
3.7226
×
1
0
-
1
3.7226
×
1
0
-
1
0.980
4.4822
×
1
0
-
1
4.4820
×
1
0
-
1
4.4825
×
1
0
-
1
4.4823
×
1
0
-
1
4.4823
×
1
0
-
1
0.990
5.7407
×
1
0
-
1
5.7405
×
1
0
-
1
5.7411
×
1
0
-
1
5.7408
×
1
0
-
1
5.7408
×
1
0
-
1
0.995
6.9011
×
1
0
-
1
6.9010
×
1
0
-
1
6.9018
×
1
0
-
1
6.9011
×
1
0
-
1
6.9011
×
1
0
-
1
0.997
7.6577
×
1
0
-
1
7.6576
×
1
0
-
1
7.6587
×
1
0
-
1
7.6577
×
1
0
-
1
7.6577
×
1
0
-
1
0.998
8.1802
×
1
0
-
1
8.1802
×
1
0
-
1
8.1816
×
1
0
-
1
8.1803
×
1
0
-
1
8.1803
×
1
0
-
1
0.999
8.8899
×
1
0
-
1
8.8899
×
1
0
-
1
8.8917
×
1
0
-
1
8.8899
×
1
0
-
1
8.8899
×
1
0
-
1
1.000
1.0000
1.0000
1.0000
9.9999
9.9999Example 2.
Consider the Bratu problem forλ=1.
We solve the problem by applying the technique described in Section4 with M=10 and k=3. The absolute errors in solutions are tabulated in Table 5. As can be seen in Table 5, only a small number of Chebyshev wavelet basis functions are needed to get the approximate solution which is in full agreement with the exact solution up to 18 digits while, using other methods, we can find a numerical approximation to the exact solution which is the same at most in 10 digits. We display the exact and obtained solutions in Figure 1. Absolute errors in solutions are plotted in Figure 2.Table 5
Obtained absolute errors forλ=1.
t
Present method
NPSM
LGSM
Decomposition
Laplace
B-spline
M
=
10
,
k
=
3
[31]
[35]
[6]
[30]
[32]
0.1
1.23
×
1
0
-
19
5.77
×
1
0
-
10
7.51
×
1
0
-
7
2.68
×
1
0
-
3
1.98
×
1
0
-
6
2.98
×
1
0
-
6
0.2
3.13
×
1
0
-
19
2.47
×
1
0
-
10
1.02
×
1
0
-
6
2.02
×
1
0
-
3
3.94
×
1
0
-
6
5.46
×
1
0
-
6
0.3
6.20
×
1
0
-
19
4.56
×
1
0
-
11
9.05
×
1
0
-
7
1.52
×
1
0
-
4
5.85
×
1
0
-
6
7.33
×
1
0
-
6
0.4
7.80
×
1
0
-
19
9.64
×
1
0
-
11
5.24
×
1
0
-
7
2.20
×
1
0
-
3
7.70
×
1
0
-
6
8.50
×
1
0
-
6
0.5
7.70
×
1
0
-
19
1.46
×
1
0
-
10
5.07
×
1
0
-
9
3.01
×
1
0
-
3
9.47
×
1
0
-
6
8.89
×
1
0
-
6
0.6
7.80
×
1
0
-
19
9.64
×
1
0
-
11
5.14
×
1
0
-
7
2.20
×
1
0
-
3
1.11
×
1
0
-
5
8.50
×
1
0
-
6
0.7
6.20
×
1
0
-
19
4.56
×
1
0
-
11
8.95
×
1
0
-
7
1.52
×
1
0
-
4
1.26
×
1
0
-
5
7.33
×
1
0
-
6
0.8
3.13
×
1
0
-
19
2.47
×
1
0
-
10
1.01
×
1
0
-
6
2.02
×
1
0
-
3
1.35
×
1
0
-
5
5.46
×
1
0
-
6
0.9
1.22
×
1
0
-
19
5.77
×
1
0
-
10
7.42
×
1
0
-
7
2.68
×
1
0
-
3
1.20
×
1
0
-
5
2.98
×
1
0
-
6Figure 1
Plot of exact and approximated solutions forλ=1.Figure 2
Plot of absolute errors forλ=1.Example 3.
Consider the Bratu problem forλ=2.
We solve the problem withM=10 and k=3. The absolute errors in solutions are tabulated in Table 6. We display the exact and obtained solutions in Figure 3. The plot of absolute errors in solutions in Figure 4 confirms the priority of our method over other methods in terms of efficiency and accuracy.Table 6
Obtained absolute errors forλ=2.
t
Present  method
NPSM
LGSM
Decomposition
Laplace
B-spline
M
=
10
,
k
=
3
[31]
[35]
[6]
[30]
[32]
0.1
2.03
×
1
0
-
18
9.71
×
1
0
-
9
4.03
×
1
0
-
6
1.52
×
1
0
-
2
2.13
×
1
0
-
3
1.72
×
1
0
-
5
0.2
9.58
×
1
0
-
18
1.41
×
1
0
-
8
5.70
×
1
0
-
6
1.47
×
1
0
-
2
4.21
×
1
0
-
3
3.26
×
1
0
-
5
0.3
2.86
×
1
0
-
17
1.98
×
1
0
-
8
5.22
×
1
0
-
6
5.89
×
1
0
-
3
6.19
×
1
0
-
3
4.49
×
1
0
-
5
0.4
5.44
×
1
0
-
17
2.42
×
1
0
-
8
3.07
×
1
0
-
6
3.25
×
1
0
-
3
8.00
×
1
0
-
3
5.28
×
1
0
-
5
0.5
6.87
×
1
0
-
17
2.60
×
1
0
-
8
1.46
×
1
0
-
8
6.98
×
1
0
-
3
9.60
×
1
0
-
3
5.56
×
1
0
-
5
0.6
5.44
×
1
0
-
17
2.42
×
1
0
-
8
3.05
×
1
0
-
6
3.25
×
1
0
-
3
1.09
×
1
0
-
3
5.28
×
1
0
-
5
0.7
2.86
×
1
0
-
17
1.98
×
1
0
-
8
5.19
×
1
0
-
6
5.89
×
1
0
-
3
1.19
×
1
0
-
2
4.49
×
1
0
-
5
0.8
9.58
×
1
0
-
18
1.41
×
1
0
-
8
5.68
×
1
0
-
6
1.47
×
1
0
-
2
1.24
×
1
0
-
2
3.26
×
1
0
-
5
0.9
2.03
×
1
0
-
18
9.71
×
1
0
-
9
4.01
×
1
0
-
6
1.52
×
1
0
-
2
1.09
×
1
0
-
2
1.72
×
1
0
-
5Figure 3
Plot of exact and approximated solutions forλ=2.Figure 4
Plot of absolute errors forλ=2.Example 4.
Consider the Bratu problem forλ=3.51.
In this example, we setM=10 and k=3. The absolute errors in solutions are tabulated in Table 7. As can be seen in Table 7, when λ is close to the critical value λc, some of the mentioned methods are not able to handle the problem very well. However, using wavelet analysis method, we get the approximate solution which is much more accurate than nonpolynomial spline method and Lie-group shooting method. We display the exact and obtained solutions in Figure 5. Absolute errors in solutions are illustrated in Figure 6.Table 7
Obtained absolute errors forλ=3.51.
t
Present method
NPSM
LGSM
B-spline
M
=
10
,
k
=
3
[31]
[35]
[32]
0.1
2.34
×
1
0
-
10
6.61
×
1
0
-
6
4.45
×
1
0
-
5
3.84
×
1
0
-
2
0.2
3.20
×
1
0
-
10
5.83
×
1
0
-
6
7.12
×
1
0
-
5
7.48
×
1
0
-
2
0.3
7.88
×
1
0
-
10
6.19
×
1
0
-
6
7.30
×
1
0
-
5
1.06
×
1
0
-
1
0.4
1.11
×
1
0
-
9
6.89
×
1
0
-
6
4.47
×
1
0
-
5
1.27
×
1
0
-
1
0.5
1.22
×
1
0
-
9
7.31
×
1
0
-
6
6.76
×
1
0
-
7
1.35
×
1
0
-
1
0.6
1.11
×
1
0
-
9
6.89
×
1
0
-
6
4.56
×
1
0
-
5
1.27
×
1
0
-
1
0.7
7.88
×
1
0
-
10
6.19
×
1
0
-
6
7.20
×
1
0
-
5
1.06
×
1
0
-
1
0.8
3.20
×
1
0
-
10
5.83
×
1
0
-
6
7.05
×
1
0
-
5
7.48
×
1
0
-
2
0.9
2.34
×
1
0
-
10
6.61
×
1
0
-
6
4.41
×
1
0
-
5
3.84
×
1
0
-
2Figure 5
Plot of exact and approximated solutions forλ=3.51.Figure 6
Plot of absolute errors forλ=3.51.The maximum absolute errors in solutions for different values ofM, k, and λ are tabulated in Table 8. According to Table 8, we can conclude that more accurate results can be obtained by increasing the values of M and k properly.Table 8
Obtained maximum absolute errors.
M
=
8
,
k
=
1
M
=
8
,
k
=
2
M
=
8
,
k
=
3
M
=
10
,
k
=
1
M
=
10
,
k
=
2
M
=
10
,
k
=
3
λ
=
1
2.5
×
1
0
-
10
5.0
×
1
0
-
12
3.0
×
1
0
-
15
1.2
×
1
0
-
12
8.0
×
1
0
-
16
8.0
×
1
0
-
19
λ
=
2
1.8
×
1
0
-
8
1.5
×
1
0
-
10
1.6
×
1
0
-
13
1.5
×
1
0
-
10
7.0
×
1
0
-
14
6.9
×
1
0
-
17
λ
=
3.51
3.0
×
1
0
-
5
1.8
×
1
0
-
8
1.0
×
1
0
-
9
4.0
×
1
0
-
7
2.0
×
1
0
-
9
1.2
×
1
0
-
9


## 6. Conclusion

The well-known nonlinear Troesch and Bratu problems arise in a different variety of applications, and many researchers have drawn attention to solve them. The difficulty in this type of problems, due to existing strong nonlinear terms, is overcome here. The main characteristic of the proposed method is reducing the given problems to those of solving a system of algebraic equations, thus greatly simplifying the problems. Sparseness of the coefficients matrix of algebraic equations makes it computationally efficient to solve these problems using the current method. It is also seen that increasing the number of subintervals or the number of collocation points in subintervals results in improving the accuracy. Numerical results confirm that our method is much better than other reported ones in the literature in the sense of accuracy and efficiency. According to Tables1–4, our approach is applicable to solve Troesch’s problem especially when λ is large while some other methods fail to do so. As shown in Tables 5–8, we can obtain the results for Bratu’s problem only by using a small number of Chebyshev wavelet basis functions. When λ is close to the critical value λc, the wavelet analysis method was also accurate to the ninth order, whereas other methods especially the B-spline method yielded poorer results.



---

*Source: 825817-2013-08-29.xml*