1.
Introduction
Nonlinear integro differential equations arise in various scientific phenomena in applied mathematics, mathematical physics, and biology. The delayed integro differential equations of the Volterra type are used to characterize the evolution of biological populations [1]. In physics, systems of integro differential equations are used to study continuous medium-nuclear reactors [2]. Further, some singular integral equations occur in the process of formulating mixed boundary value problems in mathematical physics [3]. Constructing different techniques to study the solutions of nonlinear integral equations dates back to the early 1980s [4].
Analytical solutions for the majority of nonlinear equations do not have a closed form. Consequently, there are many techniques such as the perturbation methods [5,6,7] and non-perturbation method [8] to find the solution to these types of equations. Perturbation methods are commonly based on transferring the nonlinear problem to an infinite number of linear sub-problems through the perturbation parameters which are introduced to get approximate solutions [9]. The modify Adomian decomposition method (MADM) [24] is a non-perturbation method that has became a remarkable technique to find the exact and approximate solutions for a large class of linear and nonlinear integral equations. Moreover, with this method, we provide a numerical algorithm based on the application of the so-called Adomian polynomial to solve nonlinear equations.
The focus has primarily been on obtaining approximate solutions to nonlinear integro-differential equations which are induced by converting initial and boundary value problems. In [10] Atkinson and Potra applied the discrete Galerkin method for solving nonlinear integral equations and gave a general framework and error analysis for the numerical method, while Yousefi and Razzaghi [11] used Legendre wavelets method together with Gaussian integration method
to evaluated the unknown coefficients and found an approximate solution to nonlinear Volterra-Fredholm integral equations. The nonexistence of global solutions of a nonlinear integral equation was studied in [12]. Maleknejad et al. [13] proposed an orthogonal triangular function to approximate the solution of nonlinear Volterra-Fredholm integral equations, and they used a collocation method to reduce it to the solution of algebraic equations. In [14], the authors studied the mean square convergence of the series solution for a stochastic integro-differential equation and evaluated the truncation error by using the Adomain decomposition method (ADM). Mashayekhi et al. [15] proposed the hybrid of block-pulse functions and Bernoulli polynomial for solving the nonlinear Volterr-Fredholm integral equation (NVFIE). Deniz [16] presented an optimal perturbation iteration method and employed it for solving an NVFIE, and he used new algorithms that were constructed for integral equations. Comparing their new algorithms with those in some earlier papers proved the excellent accuracy of the newly proposed technique. Abdou and Youssef [17] discussed the solvability of a nonlinear Fredholm integro-differential equation (NFIE) with boundary conditions and they applied the MADM and Liao's homotopy analysis method (HAM) [25] for solving the NFIE numerically. Also, in [18] they have used the same methods for solving an NFIE of order n. Abed et al. [19] applied the MADM and variational iteration method to investigate the numerical solution for an NVFIE with initial conditions. In this paper, the existence and uniqueness of the analytical solutions of the NVFIE with boundary conditions are investigated. We consider the solvability of a two-point boundary value problem for a nonlinear integro-differential equation of the form
with the boundary conditions
where p≥0 is a non negative integer. The parameters {ω,λ1,λ2} are nonzero real numbers. The functions A,B and f and the kernel ψ are known functions satisfying certain conditions, as is to be stated in Section 3, while x↦ϕ(x) is the required function to be found in the space C2(I,R).
The paper is structured as follows. In Section 2 some basic notations, definitions and theorems regarding the existence, uniqueness, and convergent results in Banach Space are recalled. In Section 3 we show that the NVFIE has at least one continuous solution. Then we provide sufficient conditions for which it has a unique solution. In Sections 4 and 5 the MADM and the HAM are applied respectively. Then some analytical and numerical examples are provided in Section 6. Finally, Section 7 concludes the paper.
2.
Preliminaries
Before driving integro-differential equations to the Volterra-Fredholm integral equation, we review some basic definitions and theorems, which have been given in [20,21,22,23]
Definition 2.1. (Contraction mapping)[20] Let (M,d) be a metric space and f:M→M be a function, which has the property that there is some nonnegative real number 0≤k<1 such that for all x,y∈M, d(f(x),f(y))≤kd(x,y).
Theorem 2.1. (Banach contraction principle)[22] Let (M,d) be a metric space; then, each contraction mapping τ:M→M has a unique fixed point x of τ in M.
Theorem 2.2. (Schauder fixed point Theorem)[23] Let X be a Banach space and A be a convex, closed subset of X. Let T:A⟶A be a map such that the set Tu:u∈A is relatively compact in X. Then T has at least one fixed point u∗∈A i.e., Tu∗=u∗.
Theorem 2.3. (Arzela-Ascoli theorem)[20] If a sequence {fn}∞n=0 in a closed and bounded interval [a,b] is a bounded and equicontinuous, then it has a uniformly convergent subsequence.
Theorem 2.4. (Krasnoselskii fixed point theorem)[21] Let μ be a closed convex non-empty subset of a Banach space X. Suppose that A and B map μ into X, and that
(1) A is continuous and compact,
(2) Ax+By∈μ for all x,y∈μ,
(3) B is a contraction mapping.
Then, there exists y in μ such that Ay+By=y.
3.
Outcomes for existence and uniqueness
In order to prove all theorems we suppose the following postulates:
p.1 The functions A and B are elements in the space C(I,R).
p.2 The known free function f belongs to the space C2(I,R).
p.3 For each y∈I the kernel (x,y)↦ψ(x,y) is continuous in x, with x taking values in R.
p.4 (α+(k1|λ1|+|λ2|)C∗(1))≤|ω|, where α=(b−a)(||A||∞+(b−a)||B||∞),
and
p.5 (α+(|λ1|+|λ2|)Λ)≤|ω|, where
where I=[a,b], and the bounded constant k1=1.
Theorem 3.1. Let the conditions (p.1) to (p.3) be satisfied. Then the boundary value problems (1.1) and (1.2) are equivalent to the following NVFIE,
where
Proof. Let ϕ″(x)=u(x), where the function x↦u(x) is an element in the space C(I,R). So, we have
and
Putting x=b in Eq (3.13) and then using the results of Eqs (3.12) and (3.13) gives
where
and
Substitution of Eqs (3.14)–(3.16) into Eq (1.1) gives
where W(x,t),R(x,y;l),μ(x) and F(x) are defined as shown in Eqs (3.7), (3.8), (3.10) and (3.11) respectively.
The following theorem tells if the NVFIE (3.17) satisfies the conditions (p.1)–(p.4); then, it has a continuous solution.
Theorem 3.2. If the NVFIE (3.17) satisfies the conditions (p.1) to (p.4), then it has a continuous solution.
Proof. Let Γr={u∈C(I,R):‖u‖∞=supx∈I|u(x)|≤r}. The radius r is a finite positive solution for the equation
where k1 is an upper bound of |H2(x,t)|.
For u1,u2∈Γr, we define the following two operators from Eq (3.5)
Now,
So
Using similar arguments as we used above implies
That is,
Using Eqs (3.21) and (3.22) gives
Therefore,
Now, suppose x1<x2 constitute two elements in [a,b]. The functions F, W1 and W2 are continuous in x from applying the conditions (p.1)–(p.3); therefore, we have
dy approaches zero whereas x2 approaches x1. Also,
dy approaches zero whereas x2 approaches x1.
Hence, Tu1 and Wu2 are elements in the space C([a,b],R). Consequently, the operator T+W is a self-operator on Γr. Let u and u∗ be any two functions in the set Γr. So,
Therefore, the operator T is a contraction operator on Γr according to the condition (p.4). Consider the sequence {un}n∈N with un∈Γr such that un approaches u when n aproaches ∞. It is clear that u∈Γr and supx∈[a,b]|un(x)|≤r,∀n∈N. Applying the Arzela convergence theorem implies
where e(l) is a finite positive constant dependent on l. Therefore, the operator W is a sequentially continuous operator on Γr; hence, it is continuous on Γr. It is clear from Eq (3.22) that
hence, the set WΓr is uniformly bounded. Consider the sequence (Wun)n∈N with (Wun)∈WΓr.
Using similar steps as we followed in Eq (3.25) implies
Therefore, there exists a sub-sequence {Wunk}k∈N which converges uniformly in WΓr as a result of applying the Arzela-Ascoli theorem; consequently, the set WΓr is compact. As a result, the operator W is completely continuous. Now all conditions of the Krasnoselskii theorem are satisfied; therefore, the operator T+W has at least one fixed point in the set Γr which is a solution for the NVFIE (3.17). The proof is completed.
Theorem 3.3. If the NVFIE (3.17) satisfies the conditions (p.1), (p.2), (p.3) and (p.5), then it has a unique solution.
Proof. It is clear that the operator T+W is a self-operator on Γr. Using similar steps as we have used in Eq (3.26) leads to
Using Eq (3.26) with the constant k1=1 and Eq (3.28) leads to
So, the operator T+W is a contraction on Γr according to the condition (p.5), consequently, the NVFIE (3.17) possesses a unique continuous solution in Γr based on application of the Banach fixed point theorem. The proof is completed.
4.
MADM for the NVFIE
This section is devoted to using the MADM to find an approximate solution to the NVFIE (3.17) which is subject to satisfying the conditions of Theorem 3.3. Assume the unknown function u(x) of Eq (3.17) can be approximated by using the formula
Let F(x)=F1(x)+F2(x). Then
where the Adomain polynomial, An for n=0,1,2,… is evaluated by using the equation as follows:
Theorem 4.1. The approximate solution determined by Eqs (4.2)–(4.4) for the NVFIE (3.17) converges to the exact solution u(x) while satisfying the conditions of Theorem 3.3.
Proof. Let {Sk(x)} be a sequence of partial sums where
Let n,m∈Z+ such that n>m≥1. Then
Let θ=(α+(|λ1|+|λ2|)Λ)|ω| and θ<1. Then
Take n=m+1; then,
Substituting the inequality of Eq (4.10) into the inequality of Eq (4.9), after applying the triangle inequality and setting n>m>N∈N, we get
where
Therefore,
So, the sequence Sn(x) is a Cauchy sequence in the Banach space C(I,R).
Therefore,
5.
HAM for the NVFIE
This section is devoted to applying the HAM to the NVFIE (3.17) while satisfying the conditions of Theorem 3.3 from Eq (1.2) as follows:
We define the nonlinear operator N by
From Eqs (5.1) and (5.2) we have
We define the homotopy of the unknown function u(x) as below
where
(1) the function u0(x) is the initial approximation of the unknown solution u(x);
(2) the parameter ℏ∈R−0 is used as a control tool to manage the convergence of the proposed technique;
(3) the parameter ι∈[0,1] is an embedding in Eq (5.4) and called the homotopy parameter;
(4) the operator L is an auxiliary linear operator satisfying the property L[ι(x)]=0 when ι(x)=0;
(5) the operator N denotes Eq (5.2), that is
Solving Eq (5.6) yields
where
6.
Numerical examples
In this section, several examples demonstrate the accuracy and efficiency of the proposed methods under the conditions of Theorems 3.2 and 3.3. All of them were performed on a computer using programs written in Matlab. It also contains a numerical comparison of the MADM and HAM. We report in tables the values of the exact solutions, approximate solutions and the ∞−norm of the error that was calculated at certain considered points; some figures might be included with each example for clarification.
Example 6.1. Consider the following boundary value problem:
where x∈[0,1],ψ(0)=0, and ψ(1)=1 and the exact solution is ψ(x)=x4.
Applying u(x)=ψ″(x), we get an NVFIE with the form of Eq (3.5). Since the kernel k(x,t)=t+tx is a real valued continuous function in x∀t∈[0,x] and (1∫0(t+tx)2dt)12=1+x√3≤2√3∀x∈[0,1], it is clear that (α+(|λ1|+|λ2|)C∗(1))=3.266. So Eq (3.5) has a solution from Theorem 3.2.
Table 1 presents the ∞−norm of the absolute errors between the exact solution and the approximate solutions obtained by using the MADM and HAM with ℏ=−0.089609, −0.089608 and −0.089607 where the initial value of u0 is x4−x2100.
Figure 1 illustrates the absolute errors of the MADM and HAM, where ℏ=−0.089607, corresponding to the exact solution at any considered point in Table 1.
The values of ℏ that ensure the convergence of the approximate solution are represented in Figure 2.
where
Example 6.2. Consider the following boundary value problem:
where x∈[0,π], ψ(0)=−1, and ψ(π)=1 and the exact solution is ψ(x)=sin(x)−cos(x).
Applying u(x)=ψ″(x), we get an NVFIE with the form of Eq (3.5). Since the kernel k(x,t)=sin(x−t) is a real valued continuous function in x∀t∈[0,x] and (π∫0sin(x−t)2dt)12=(π2)12=γ∀x∈[0,π], the value of (α+(|λ1|+|λ2|)C∗(1))=1.012664. So Eq (3.5) has a solution from Theorem 3.2.
Table 3 presents the ∞−norm of the absolute errors between the exact solution and the approximate solutions obtained by using the MADM and HAM with ℏ=−0.16579, −0.16578 and −0.16577 where the initial value of u0 is cos(x)200.
Figure 3 illustrates the absolute errors of the MADM and HAM corresponding to the exact solution at any considered point in Table 3.
The values of ℏ that ensure the convergence of the approximate solution are represented in Figure 4.
Example 6.3. Consider the following boundary value problem:
where x∈[0,1], ψ(0)=1 and ψ(1)=e−1 and the exact solution is ψ(x)=e−x.
The value of (α+(|λ1|+|λ2|)C∗(1))≈7.5. So Eq (3.5) has a solution from Theorem 3.2. And since the value of (α+(|λ1|+|λ2|)C∗(1))ω is close to zero, the approximate solution approaches the ue solution rapidly.
Table 4 presents the ∞−norm of the absolute errors between the exact solution and the approximate solutions obtained by using the MADM and HAM with ℏ=−0.16655, −0.16654 and −0.16653 where the initial value of u0 is x1000.
Figure 5 illustrates the absolute errors for the MADM and HAM corresponding to the exact solution at any considered point in Table 4.
The values of ℏ (see Table 5), that ensure the convergence of the approximate solution are represented in Figure 6.
7.
Conclusions
If the value of (α+(|λ1|+|λ2|)C∗(1))|ω| is near zero, then the approximate solution approaches the exact solution rapidly. As illustrated through the examples, the MADM gives a better approximate solution in case of a separate kernel of polynomial functions (Example 6.1), while for the case of different kernels of trigonometric functions the HAM gives the better approximate solution (Examples 6.2 and 6.3). In terms of the running time, in both cases, the HAM is significantly faster than the MADM.
Conflict of interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.