Numerical solution of Bratu’s boundary value problem based on Green’s function and a novel iterative scheme

We compute the numerical solution of the Bratu’s boundary value problem (BVP) on a Banach space setting. To do this, we embed a Green’s function into a new two-step iteration scheme. After this, under some assumptions, we show that this new iterative scheme converges to a sought solution of the one-dimensional non-linear Bratu’s BVP. Furthermore, we show that the suggested new iterative scheme is essentially weak w2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$w^{2}$\end{document}-stable in this setting. We perform some numerical computations and compare our findings with some other iterative schemes of the literature. Numerical results show that our new approach is numerically highly accurate and stable with respect to different set of parameters.


Introduction
In 1914, Bratu [1] suggested an important BVP as follows: x (t) + λe x(t) = 0, ( with the boundary condition (BC): Bratu's Problem (1.1)-(1.2) attracted the attention of many researchers due to its fruitful applications in many areas of applied science.Thus in [2], Ascher et al. first time successfully obtained the exact solution for the Bratu's problem (1.1)-(1.2) as follows: x(t) = -2 ln cosh 0.5(t -0.5)θ cosh( θ 4 ) , (1.3) where the number θ involved in (1.3) solves essentially θ = √ 2λ cosh( θ 4 ).Suppose, λ c is a number that satisfies the following equation: Then we remark as follows.2) has many important applications in various fields of applied sciences, (see, e.g., [3][4][5][6] and others).The exact solution of this problem comes from Ascher et al. [2].Using this exact solution, various researchers investigated different numerical techniques and compared their findings with this exact solution [7][8][9].However, we note that these techniques do not guarantee the existence of solution and the methods used have slow speed of convergence and require too much complicated set of parameters.Our alternative approach in this research is to study the existence and iterative approximation for the Bratu's BVP (1.1)-(1.2) using fixed point and Green function combination technique.We first show that the sought solution of (1.1)-(1.2) can be set as a fixed point of a continuous operator.We will show that this operator has a unique fixed point which solves our problem.Moreover, we use this operator in the well-known Ishikawa [10] iterative scheme to obtain the convergence.The stability result with a comparative numerical experiment is provided that validates the results and shows the high accuracy of the proposed approach.
Often real world problems can be described in the form of differential equations.However, finding analytical solutions for such problems is very difficult (or may be impossible in some cases), and hence one needs approximate solutions for these problems.In such cases, fixed-point theory provides alternative approaches to these problems, since the sought solution to such problem can be in the form of a fixed point of a certain linear or nonlinear operator T, whose domain is normally a suitable Banach space.Hence, once the existence of a fixed point for the involved operator is established, it follows immediately that the solution for the problem under the consideration has been established.The famous Banach Contraction Principle (BCP) [11] proved that if X is any given Banach space and T : X → X is essentially a contraction map, that is, Tx -Ty ≤ ν xy for all x, y ∈ X and ν ∈ (0, 1), then T admits essentially a unique fixed point, namely, x * ∈ X, which solves the operator equation x = Tx.Once the existence of a fixed point (sought solution for the operator equation x = Tx), one asks for an iterative scheme to approximate value of the fixed point.The proof of the BCP suggests an iterative scheme of Picard [12], x k+1 = Tx k , for finding the approximate value of the unique fixed point of T. It is known that when T is nonexpanansive, that is, Tx -Ty ≤ xy for all x, y ∈ X, then T has a fixed point under some restrictions (see, e.g., [13][14][15] and others), but the Picard iteration of T generally fails to converge to the fixed point of T. Example of nonexpansive mapping for which Picard iteration is not convergent is the following.
Example 1 Assume that X = [-1, 1] and define the selfmap T on X by Tx = -x for all x ∈ X.It follows that the selfmap T is nonexpansive on X and has a unique fixed point, but if x 0 = 0, then we have a divergent sequence from the Picard iterative scheme.
On the other hand, the speed of convergence of Picard iteration is slow.Thus to overcome these difficulties, Mann [16] and Ishikawa [10] generalized the Picard iterative scheme and proved the convergence for nonexpansive mappings.In this paper, we consider the following iterative scheme, which is independent of both the Mann [16] and Ishikawa [10] iterative schemes: (1.4) where α k , β k ∈ (0, 1).
Recently, some authors suggested novel approaches to different classes of BVPs by embedding a Green's function into the Picard, Mann, and Ishikawa iterative schemes.They called these new modified schemes Picard-Green's, Mann-Green's, and Ishikawa-Green's iterative schemes, respectively.In particular, Kafri and Khuri [17] suggested Picard-Green's and Mann-Green's iterative schemes for solving the Bratu problem (1.1)-(1.2).They compared the speed of convergence of these new schemes with some classical methods and observed that these new schemes are too much better than the corresponding old techniques.Motivated by Kafri and Khuri [17], first we embed a Green's function into the scheme (1.4) and prove its strong convergence for the Bratu's problem BVP (1.1)-(1.2).Similar results can be proved for Picard-Green's and Mann-Green's iterative schemes.We then show that our new iterative scheme is essentially weakly w 2 -stable.Some numerical experiments to support the main outcome are given.These numerical experiments also suggest a high numerical accuracy of the our new iterative scheme.

Description of the iterative method
We shall now provide a Green's function associated with a general class of BVPs having second order.After this, we embed this Green's function into the iterative scheme (1.4) in order to obtain the desirable new iterative scheme.We now split this section into some sub-sections as follows.

Solution of BVPs by Green's functions
We first assume the following BVP with second order: and assume its BCs as follows: where the value t lies between 0 and 1, that is, 0 ≤ t ≤ 1.Now we decopose the equation (2.1) into linear and nonlinear terms respectively as L[x] = x + y(t)x + z(t)x and N [x] = q(t, , x, x , x ) and our aim is to construct a Green's function for L. Now we assume that the Problem (2.1)-(2.2) essentially admits a general solution as follows: where the notations x h denote a solution for L[x] = 0 (homogeneous part) and x p is any particular solution for L[x] = q(t, x, x , x ).According to [18, pp. 568], the particular solution x p can be expressed as follows: The notation G(t, s) in (2.4) denotes the Green's function obtained from L[x] = 0. Notice that when δ denotes essentially the direct delta function, then from [18, pp.572], we have Also, using the definition of L and keeping (2.1), we have Subsequently, from (2.5) and (2.6), we have where the new BCs are given as: Hence it follows that for the given problem (2.1)-(2.2),x p must obey the homogeneous BCs and x h must satisfy the nonhomogeneous BCs B Now we want to show that the proposed solution satisfies the BCs as well as the differential equation, provided that certain assumptions are imposed on q.Now we apply the operator L on (2.3) and keeping (2.4) and (2.7) in mind, we have (2.9) We assume that q is essentially a function in t only or if it satisfies the following: then subsequently, one can see that (2.1) is satisfied such that: Note that the for our Problem (1.1)-(1.2), the sought solution of (1.1) endowed with the BCs (1.2) takes the form x h = 0.It follows that the Condition (2.10) is essentially satisfied and so (2.11) is true.Now consider (2.8), one has Next we list some basic axioms of a given Green's function as follows, which can be found in [18].
(a1.)If we denote two linear independent solutions for L[x] = 0 by x 1 and x 2 , then the associated Green's function can be written in the following form: ) (a3.) G (t, s) admits a unit jump discontinuity.
We are now going to obtain the jump assumption as concerns the terms x 1 as well as the term x 2 .To do this, we first compute essentially the value of the jump.Therefore, we must integrate (2.7) with lower limit s -to the upper limit s + as follows:

It follows that
Now the function G is essentially continuous, and also G admits only the jump discontinuity.Thus, the following equations hold: (2.17) Hence, from (2.16) and (2.17), we have Evaluating integrals in Equation (2.18) gives the value of the required jump as follows: where H is the well-known Heaviside function, where more details on this can be found in the book [18].Notice that from the jump condition one can write as follows: where the constants c i , d i (i = 1, 2) can be found by solving (2.15), (2.20), and the BCs given in (2.8).

Green's functions and novel fixed-point scheme
Now we derive our desired new iterative scheme.To do this, we embed a Green's function into an integral operator and then apply this operator on the new iterative scheme (1.4).
For this purpose, we set Now if we add and subtract q(s, x, x , x ) within the integrand, then one has Now we suppose that q is either a function of t only or it satisfies (2.10), then the last integral in (2.22) is equivalent to that in (2.4), so can be replaced by x p .Since x = x h + x p , (2.22) becomes: Now applying new fixed-point iterative scheme (1.4) to the latter integral operator and simplifying, we obtain our new Green's iterative scheme as follows: (2.25) Finally, we derive calculation for the starting iterate x 0 .To do this, we use a property of the Green's function in (2.8) to get where i = 1, 2. It now follows that the starting iterate x 0 should be select so that it can solve Now the analysis which helps us in constructing the iterative scheme (2.25) is restricted essentially to case when either q is a function of the t only or it satisfies (2.10).However, if q is a function of x, then x p satisfies the following: (2.29) Now similar calculations are made as for (2.21), but the term f (s, , x p , x p ) is subtracted from and added to the given integral in (2.29), one has G(t, s) x p + y(s)x p + z(s)x pq s, x p , x p , x p ds. (2.30) Now using the operator T in (2.30), we apply our new fixed-point scheme (1.4).

Convergence result
Now we are going to prove our main convergence result.We use our proposed scheme (2.25) and assume some possible mild conditions, to obtain the approximate solution for the Bratu's problem (1.1)-(1.2).For this purpose, we first establish a Green's function to the term x = 0 involved in (1.1).The two independent solutions to this x = 0 are x 1 (t) = 1 and x 2 (t) = t.Hence using (2.13), the Green's function attains the following form: where c i and d i (i = 1, 2) are unknowns to be determined using the basic axioms of Green's functions.Using the homogeneous BCs, we get Moreover, the jump discontinuity of G at t = s suggests the following equations Now solving (3.2) and (3.3), (3.1) becomes as: Now using the Green's function above, we set the operator Hence, iterative scheme (2.25) becomes: where α k , β k ∈ (0, 1).The iterative scheme (3.5) is the desired new iterative scheme.The main convergence result of the paper is now ready to be established.Theorem 3.1 Consider a Banach space X = C[0, 1] with the supremum norm.Let T G : X → X be the operator defined in (3.4) and {x k } be the sequence produced by (3.5).Assume that the following conditions hold:

the unique fixed point of T G and hence to the unique sought solution of the given Problem (1.1)-(1.2).
Proof Put λ 2 L c 8 = ν, accordingly it follows from the condition (i), that T G is a ν-contraction.Thanks to BCP, T G has a unique fixed point in X = C[0, 1], namely, x * which is the unique solution for the given problem (1.1)-(1.2).Now using the condition (ii), we prove that the sequence of our new iterative scheme converges strongly to x * .First we consider the case when α k = ∞.For this, we have Accordingly, we get Inductively, we obtain

Weak w 2 -stability result
In some cases, a numerical scheme may not stable when we implement it on a certain operator in order to find a sought solution of a given problem (see, e.g., [19][20][21] and others).A numerical iterative scheme is said to be stable if the error obtained from any two successive iteration steps do not disturb the convergence of the scheme towards a sought solution.The concept of stability for an iterative scheme has its roots in the work of Urabe [22].Soon the authors Harder and Hicks [23] suggested the formal notion of stability.Here we need some of their definitions and concepts, which will be used in the sequel.Definition 4.1 [23] Suppose T is a selfmap on a Banach space X and {x k } is a sequence of iterates of T generated by where the point x 0 essentially denotes a starting value and h is a function.If {x k } converges to a point x * ∈ F T , then {x k } is called stable if for every other sequence {u k } in X, one has the following Definition 4.2 [24] Two sequence {u k } and {x k } in a Banach space are said to be equivalent if the following property holds In [25], Timis suggested the natural notion of stability, which he named as weak w 2stability.He used the concept of equivalent sequences opposed to the of concept of arbitrary sequences in Definition 4.1.Definition 4.3 [25] Suppose T be a selfmap on a Banach space X and {x k } is a sequence of iterates of T generated by (4.1).If {x k } converges to a point x * ∈ F T , then {x k } is called weakly w 2 -stable if for every equivalent sequence {u k } ⊆ X of {x k } one has the following Finally, we are in the position to obtain the weak w 2 -stability for our proposed scheme (3.5).Theorem 4.4 Let X, T G and {x k } be as given in the Theorem 3.1.Subsequently, {x k } is weakly w 2 -stable with respect to T G .Proof To complete the proof, we consider any equivalent sequence Assume that lim k→∞ k = 0.The need is to prove that lim k→∞ u kx * = 0.For this, we have Subsequently, we obtained Since lim k→∞ k = 0 by assumption, lim k→∞ u kx k = 0 as {u k } is an equivalent sequence for {x k } and lim k→∞ x kx * = 0 as {x k } is convergent to x * .Accordingly, from (4.2), lim k→∞ u kx * = 0.This means that {x k } generated by the iterative scheme (3.5) is weakly w 2 -stable with respect to T G .

Numerical computions
We now choose different values of λ and connect the Mann-Green's and Ishikawa-Green's, our new iterative scheme with the Bratu's problem (1.1)-(1.2).First, we take α k = β k = 0.9 and x 0 = 0 that satisifies the equation x = 0 and the BCs (1.2).The results are   displayed in the Tables 1-2.Notice that we assume x kx * < 10 -6 is our stopping criterion, where x * is the requested sough solution.These results confirm the convergence of the all schemes towards the sought solution.Moreover, it is easy to observe that our new scheme is faster than the other two schemes.Graphical convergence is shown in Figs.1-4.Eventually, we compare our results with some other numerical methods of the literature in the following Table 3.We now compare our new approach with the the DM scheme [7], LDM scheme [26], B-spline scheme [27], LGSM [28], Spline approach [29], DTM scheme [30], GVM scheme [31], and CW scheme [32] as follows.Clearly, in all the cases, our new approach is highly accurate.Now we list the following observations.

Conclusion
We constructed a new highly accurate numerical scheme based on Green's function for numerical solutions of Bratu's BVPs in a Banach space framework.We investigated a convergence result under suitable conditions for the mapping and parameters in our scheme.
We proved that our new scheme is weakly w 2 -stable in this new setting.We provide a numerical simulation to support our claims and results.It has been shown that the convergence of our new scheme is very accurate and can be used effectively for all values of parameters involved in our scheme.

Table 3
Influence of parameters: comparison of various iteration processes