1.
Introduction
In this work, we take into consideration the following nonlinear system of ordinary differential equation [21]:
subject to the boundary conditions
where S,P1,P2,δ,β and γ are real finite constants.
We can see these problems in paper production, polymer extraction, aerodynamics, reaction-diffusion processes, fluid dynamics, biology and rheometry domains. These problems show up mainly due to the suction and injection effects on the unsteady magneto-hydrodynamic flow [24].
Many methods have been improved for the analytical and approximate solution of nonlinear ordinary differential systems. These techniques contain finite-difference methods [5,31,32,33], Adams-Bashforth method [20,23], B-spline approximation method [8], Chebyshev finite difference method [28], finite element method [6], He's homotopy perturbation method [27], G′/G- method [22], multi-step methods [14].
In recent years, much attempt has been done to the newly developed methods to introduce an analytic and approximate solution of nonlinear boundary value problems [10,11,12,13,15,16,17,18,19,25]. For more details see [1,2,3,26,34,35,36,37]. In this work, we present an approximate-analytical technique for solving a coupled system of second and fourth order boundary value problems.
The rest of this paper is organized as follows. In Section 2, an overview of shifted Legendre polynomials and their relevant properties required henceforward are presented. Also in this section, we will recall a brief review of the reproducing kernel spaces. In Section 3, we construct an orthogonal basis in the Legendre reproducing kernel space and construct a reproducing kernel space which includes boundary conditions. In Section 4, our method to approximate the solution of nonlinear system via shifted Legendre reproducing kernel basis function is considered. We present the convergence analysis and error estimation in Section 5. We demonstrate the numerical results in Section 6. We give the conclusion in the last section.
2.
Legendre reproducing kernel functions
In this section, we will recall some basic polynomial functionals and define some new reproducing kernel functions. The well-known shifted Legendre polynomials are described on [0, 1] and can be obtained by the following iterative formula
The polynomials Pn(x) are orthogonal on [0,1] with ρ(x)=1, in the sense that
where
We use shifted Jacobi basis functions which provide the homogeneous boundary conditions as:
Lemma 2.1. Let α,β≥1 and α,β∈Z. We have {aj} such that
where Pj(x) are the shifted Legender polynomial of degree j and J−α,−βn(x) is the shifted Jacobi polynomial on [0,1]. Then, we have
Proof. For the proof of Lemma 2.1 (see [30], Lemma 1.4.3).
Now, by utilizing the shifted Jacobi basis function and shifted Legendre functions, we will introduce a reproducing kernel Hilbert space method.
Since Pn(1)=1 and Pn(0)=(−1)n, we have
Therefore, we describe
and
Definition 2.2. [10] For a nonempty set E, let H be a Hilbert space of real value functions on some set E. A function K:E×E⟶R is said to be the reproducing kernel function of H if and only if:
(i) For every y∈E, K(⋅,y)∈H.
(ii) For every y∈E and f∈H,⟨f(⋅),K(⋅,y)⟩=f(y).
Also, a Hilbert space of function H that possesses a reproducing kernel K is a reproducing kernel Hilbert space; we represent the reproducing kernel Hilbert space and it's kernel by HK(E) and Ky respectively.
Theorem 2.3. [7] Let H be n-dimensional Hilbert space, {wi}ni=1 is an orthonormal basis of H, then the reproducing kernel of H as:
Theorem 2.4. ([29] Theorem 1.24) For the orthonormal system {wn}∞n=1, formula (2.7) yields the Christoffel-Darboux formula:
Where, kn>0 is the coefficient of xn in wn(x). We get
Definition 2.5. Let Hω,K1,n[0,1] be the weighted inner product space of Jacobi functions described as (2.5) on [0,1] with degree less than or equal to n. The inner product and norm are given respectively by
where ω(x)=(1−x)−1(1+x)−1 and K1,n(x,y) the reproducing kernel of Hω,K1,n[0,1] is constructed using (2.8) with wn(x):=un(x). From definition
for any fixed n, Hω,K1,n[0,1] is a subspace of L2ω[0,1] and
From Definition 2.5, Hω,K1,n[0,1] is a finite dimensional inner product space. Every finite dimensional inner product space is a Hilbert space. Therefore, from this result and Theorem 2.3, Hω,K1,n[0,1] is a reproducing kernel Hilbert space.
Definition 2.6. Let HK2,n[0,1] be the inner product space of Legendre functions described as (2.6) on [0,1] with degree less than or equal to n. The inner product and norm are given respectively by
where the reproducing kernel K2,n(x,y) of HK2,n[0,1] is constructed using (2.8) with wn(x):=vn(x). From definition
for any fixed n, HK2,n[0,1] is a subspace of L2[0,1] and
3.
Construction of reproducing kernel spaces
Hω,R1[0,1] and HR2[0,1] are described by:
Clearly, Hω,R1[0,1] and HR2[0,1] are closed subspaces of Hω,K1,n[0,1] and HK2,n[0,1], respectively.
Let T1f=f′(0)−βf′′(0) and T2f=f′(1)+βf′′(1) be the boundary condition of function f(x). Put
and
where, the symbol T1,x shows that the operator T1 implements to the function of x.
Theorem 3.1. If T1,xT1,yK1,n(x,y)≠0 and T2,xT2,yR1,1(x,y)≠0, then R1(x,y) given by (3.2) satisfies the boundary conditions T1f=0 and T2f=0 exactly.
Proof. By applying the operator T1,x to R1,1(x,y) in Eq (3.1), we get
Furthermore, by applying the operator T1,xT2,y to R1,1(x,y), we have
Then, by applying the operator T1,x to R1(x,y) in Eq (3.2) and using Eqs (3.3) and (3.4), we get
Also, by applying the operator T2,x to R1(x,y) in Eq (3.2), we have
Theorem 3.2. [9] If T1,xT1,yK1,n(x,y)≠0 and T2,xT2,yR1,1(x,y)≠0, then, we obtain
Let T3θ=θ(0)−γθ′ and T4θ=θ(1)+γθ′(1)=0 be the boundary condition of function θ(x). Put
and
Theorem 3.3. If T3,xT3,yK2,n(x,y)≠0 and T4,xT4,yR2,2(x,y)≠0, then R2(x,y) given by (3.6) satisfies the boundary conditions T3θ=0 and T4θ=0 exactly.
Proof. The proof of this theorem is similar to the proof of Theorem 3.1.
Theorem 3.4. If T3,xT3,yK2,n(x,y)≠0 and T4,xT4,yR2,2(x,y)≠0, then HR2[0,1] is a reproducing kernel space and its reproducing kernel is
Note that Rx(y)=R(x,y), R1,x(y)=R1(x,y) and R2,x(y)=R2(x,y). Henceforth and not to conflict unless stated otherwise, we denote H[0,1]=Hω,R1⊕HR2, L[0,1]=L2ω[0,1]⊕L2[0,1] and Rx(y)=(R1,x(y),R2,x(y))T.
Definition 3.5. (a) The Hilbert space H[0,1] is described by:
The inner product in H[0,1] is building as
and the norm is ‖z‖H=‖z1‖Hω,Kn+‖z2‖HKn where z,w∈H[0,1].
(b) The Hilbert space L[0,1] is described by:
The inner product in L[0,1] is building as
and the norm is ‖z‖L=‖z1‖L2ω+‖z2‖L2 where z,w∈L[0,1].
4.
Representation of approximate solutions
We assume
and
where
and γ1=12γ+1, then Eqs (1.1) and (1.2) changes to the following problem:
and the boundary conditions changes to the following conditions:
where
Put
then, the coupled differential systems of Eqs (1.1) and (1.2) can be written as follows:
with boundary conditions:
where g=(g1,g2)T, N=(N1,N2)T, Φ∈H[0,1], g−N∈L[0,1], e1=(1,0)T, e2=(0,1)T and L:H[0,1]→L[0,1].
Here, (eT1Φ(i))e1=(F(i),0)T and (eT2Φ(i))e2=(0,Θ(i))T,i=0,1.
Lemma 4.1. ([10], Lemma 4.1) The operators L22:HR2[0,1]→L2[0,1] and Li1[0,1]:Hω,R1→L2ω[0,1],i=1,2, are linear bounded operators.
Theorem 4.2. The operator L:H[0,1]→L[0,1] is bounded linear operator.
Proof. For each Φ∈H[0,1], using Definition 3.5, we have
The boundedness of L22 and Li1 for i=1,2, shows that L is bounded. The proof is complete.
Let D={xi}∞i=1 is countable dense subset in the domain [0,1], then for any fixed xi∈[0,1], we have
where L∗=(L∗11L∗210L∗22) is the adjoint operator of L and the subscript y in the operator Ly indicates that the operator L applied to the function y. For any fixed xi∈(0,1), Ψij(x)∈H[0,1].
Theorem 4.3. If {xi}∞i=1 is distinct points dense on [0,1] and L−1 is existent, then
Proof. Clearly ψij(x)∈Hω,R1([0,1])⊕HR2([0,1]). For any Φ∈(ImL∗)⊥, since ψij(x)=L∗Rxi(x)ej, we have
On the other hand,
Thus, by Eq (4.8), we get
Note that {xi}∞i=1 is dense on [0,1]. Hence (LΦ)(x)=0. So from the existence L−1, we have Φ(x)=0. That is (ImL∗)⊥=0. Therefore ImL∗=Hω,R1([0,1])⊕HR2([0,1]). Similarly, we can show (KerL∗)⊥=L2ω([0,1])⊕L2([0,1]).
Corollary 4.4. For Eqs (1.1)–(1.4), if {xi}∞i=1 is distinct points dense on [0,1] and L−1 is existent, then {ψij(x)}(∞,2)(i,j)=(1,1) is the complete function system of the space H([0,1]).
By Gram-Schmidt process, we acquire an orthogonal basis {¯ψij(x)}(∞,2)(i,j)=(1,1) of H([0,1]), such that
where αijlk represents orthogonal coefficients, which are given by the following relations [4]:
such that aijlk=√‖ψlk‖2H−∑l−1s=i(csjlk)2 and csjlk=⟨ψlk,¯ψsk⟩2H.
Lemma 4.5. Let {¯ψij(x)}(∞,2)(i,j)=(1,1) be an orthonormal basis of H then we have
Proof. Let g∈H, then
Theorem 4.6. If {xi}∞i=1 is dense on [0,1] and L−1 is existent, then the solution of Eq (4.6) satisfies the form
where
Proof. Since {¯ψij(x)}(∞,2)(i,j)=(1,1) is orthonormal system, Φ(x) is expressed as
where rlk(y)=Rxl(y)ek.This completes the proof.
Now, let
Define H[0,1]−orthogonal projection TN:H[0,1]→HN[0,1] such that for Φ∈H[0,1],
or equivalently,
Then, we get the approximate solution as:
Here, T0Φ(x) is any fixed function in H([0,1]).
5.
Convergence and error estimation
Theorem 5.1. Assume that the problem (4.6) has a unique solution. If {xi}∞i=1 is dense on [0,1], then ΦN(x) in (4.10) is convergence to the Φ(x) and for any fixed Φ0(x)∈H([0,1]),ΦN(x) is also represented by
Proof. We have
where
Then for s≤N and p≤2, we have
Therefore
If s=1, we get
that is,
For s=2, we have
that is,
Hence it can be obtained by induction,
Since {xn}∞n=1 is dense, for any x∈[0,1] there exists a subsequence {xni}∞i=1 such that xni→x, as i→∞. Then, we reach:
Moreover, according to (4.10) we have
So, from Eqs (5.2) and (5.3), we conclude that
Thus, we obtain
Theorem 5.2. Let Φn(x)=(Fn(x),Θn(x))T be approximate solution that has obtained from the present method in the space H[0,1] and Φ(x)=(F(x),Θ(x))T be exact solution for the differential equation (4.6) with boundary conditions (4.7). Also, assume that xn→x(n→∞), ‖Φn‖H is bounded and G(t,Φ(t),Φ′(t),Φ′′(t)) is continuous for t∈[0,1], then
as n→∞.
Proof. For any x∈[0,1], using the boundedness of ‖∂ixR1(x,y)‖Hw,R1(i=0,1,2) and reproducing property of R1(x,y), we have
where for i=0,1,2, αi are positive constants.
Similarly, for each x∈[0,1] and i=0,1, we get
where for i=0,1,2, βi are positive constants.
Furthermore, if Φ∈H[0,1], then Φ(x)=(F(x),Θ(x))T where F(x)∈Hw,R1[0,1] and Θ(x)∈HR2[0,1]. Thus for i=0,1,2, we have
Note that, since Φn∈H[0,1], exist a constant c1 such that
Therefore
where y1 lies between xn and x. Now will show that Φ′n−1(xn)→Φ′(x). Since Φn(x)∈H[0,1], exist a constant c2 such that |Φ′′n−1(x)|≤c2, so we get
where y2 lies between xn and x. Similarly, we can write
Now, from the continuation of G(t,Φ(t),Φ′(t),Φ′′(t)), it is implies that
6.
Numerical experiment
In this section, some illustrative examples demonstrate the applicability, efficiency and utility of the proposed technique. The computations associated with the examples were performed using Maple16 on a personal computer.
Let us consider Eqs (1.1)–(1.4), using the shifted Legendre reproducing kernel Hilbert space method. We apply the technique on this problem with N=12 and
Table 1 demonstrate the obtained solutions of f′′(x) and at x=1 for various values of S, M, β and compares the results with homotopy analysis method (HAM) presented in [21]. Table 2 demonstrates the approximate solutions of velocity θ′(x) at x=1 with N=12 and P1=M=P2=1.0, δ=0.1 for different values of S, β, γ and compares the result with the HAM presented in [21]. In [21], there is no analysis about the convergence or error estimate of results, whereas in the current work we discussed about the convergence of method and residual errors. Hence, we can claim from the error analysis that out obtained results are more accurate than [21]. For example, the result of θ′(1) with respect to S=4.00 in [21] is 0.281319, but in the present techniqe we get 0.2880499297. It is evident that there is little difference between the obtained results, which the present method gives more accurate results.
The effect of Hartmann number M on the radial velocity f′(x) is exhibited in Figure 1. The radial velocity f′(x), decreased for higher values of the Hartmann number on 0.24≤x≤0.76. The influence of parameter β on f′(x) is plotted in Figure 2 with M=S=1.0. This Figure suggests that the f′(x) show decreasing behavior with an increase in β. Figures 3 and 4 display the temperature profiles θ(x) for the various embedded parameters viz thermal slip parameter γ and Eckert number P2 on interval [0,1]. It is seen that when γ=0, which corresponds to no thermal slip, the temperature of the fluid and that of the disks surfaces is the same, which in this case is 0 and 1 for lower and upper disks, respectively.
Since the exact solution of problems (1.1)–(1.4) is not known, we discuss the absolute residual error function which is a measure of how well the approximation satisfies the Eq (4.6) with S=P1=M=P2=1.0 and β=γ=δ=0.1 as
Note that the norm 2 of the residual function on the domain is
and it is employed in this paper to check the accuracy and the convergence of the proposed method. The absolute residual errors are plotted in Figure 5.
7.
Conclusions and perspectives
In this paper, the shifted Legendre reproducing kernel method is employed to compute approximate solutions of a nonlinear system of ordinary differential equation. In this approach, a truncated series based on shifted Legendre reproducing kernel functions with easily computable components. The convergence analysis and error estimation of the approximate solution using the proposed method are investigated. The validity and applicability of the method is demonstrated by solving several numerical examples. The main advantage of the present method lies in the lower computational cost and high accuracy. System of differential equations appear in various branches of science and technology. Results of current study show that the shifted Legendre reproducing kernel method is a reliable technique for the physical models in the system of differential equations form. Moreover, this method could be developed for systems of differential equations with fractional order derivatives or system of integro-differential equations.
Acknowledgments
The authors wish to express their thanks to the referees for comments which improved the paper.
Conflict of interest
The authors declare that they have no conflicts of interest.