Research article

Numerical solution of fractional differential equations with temporal two-point BVPs using reproducing kernal Hilbert space method

  • Received: 07 September 2020 Accepted: 17 December 2020 Published: 20 January 2021
  • MSC : 34A08, 34B15, 46E22, 65R10

  • In this paper, the reproducing kernel Hilbert space method had been extended to model a numerical solution with two-point temporal boundary conditions for the fractional derivative in the Caputo sense, convergent analysis and error bounds are discussed to verify the theoretical results. Numerical examples are given to illustrate the accuracy and efficiency of the presented approach.

    Citation: Yassamine Chellouf, Banan Maayah, Shaher Momani, Ahmad Alawneh, Salam Alnabulsi. Numerical solution of fractional differential equations with temporal two-point BVPs using reproducing kernal Hilbert space method[J]. AIMS Mathematics, 2021, 6(4): 3465-3485. doi: 10.3934/math.2021207

    Related Papers:

    [1] Boyu Liu, Wenyan Wang . An efficient numerical scheme in reproducing kernel space for space fractional partial differential equations. AIMS Mathematics, 2024, 9(11): 33286-33300. doi: 10.3934/math.20241588
    [2] Shiyv Wang, Xueqin Lv, Songyan He . The reproducing kernel method for nonlinear fourth-order BVPs. AIMS Mathematics, 2023, 8(11): 25371-25381. doi: 10.3934/math.20231294
    [3] Yingchao Zhang, Yingzhen Lin . An $ {\varepsilon} $-approximation solution of time-fractional diffusion equations based on Legendre polynomials. AIMS Mathematics, 2024, 9(6): 16773-16789. doi: 10.3934/math.2024813
    [4] Zhi-Yuan Li, Mei-Chun Wang, Yu-Lan Wang . Solving a class of variable order nonlinear fractional integral differential equations by using reproducing kernel function. AIMS Mathematics, 2022, 7(7): 12935-12951. doi: 10.3934/math.2022716
    [5] Xiangyun Qiu, Xingxing Yue . Solving time fractional partial differential equations with variable coefficients using a spatio-temporal meshless method. AIMS Mathematics, 2024, 9(10): 27150-27166. doi: 10.3934/math.20241320
    [6] Haroon Ahmad, Om Prakash Chauhan, Tania Angelica Lazăr, Vasile Lucian Lazăr . Some convergence results on proximal contractions with application to nonlinear fractional differential equation. AIMS Mathematics, 2025, 10(3): 5353-5372. doi: 10.3934/math.2025247
    [7] Wei Fan, Kangqun Zhang . Local well-posedness results for the nonlinear fractional diffusion equation involving a Erdélyi-Kober operator. AIMS Mathematics, 2024, 9(9): 25494-25512. doi: 10.3934/math.20241245
    [8] Fethi Bouzeffour . Inversion formulas for space-fractional Bessel heat diffusion through Tikhonov regularization. AIMS Mathematics, 2024, 9(8): 20826-20842. doi: 10.3934/math.20241013
    [9] Siyu Tian, Boyu Liu, Wenyan Wang . A novel numerical scheme for reproducing kernel space of 2D fractional diffusion equations. AIMS Mathematics, 2023, 8(12): 29058-29072. doi: 10.3934/math.20231488
    [10] Amnah E. Shammaky, Eslam M. Youssef . Analytical and numerical techniques for solving a fractional integro-differential equation in complex space. AIMS Mathematics, 2024, 9(11): 32138-32156. doi: 10.3934/math.20241543
  • In this paper, the reproducing kernel Hilbert space method had been extended to model a numerical solution with two-point temporal boundary conditions for the fractional derivative in the Caputo sense, convergent analysis and error bounds are discussed to verify the theoretical results. Numerical examples are given to illustrate the accuracy and efficiency of the presented approach.


    In recent years, the study of fractional derivatives has been an important topic. It has been used to model many phenomena in numerous fields such as science and engineering. There are many interpretations for fractional derivatives, such as the definition of Caputo [1], the definition of Riemann-Liouville [2], the definition of Grunwald-Letnikov [3], and most recently, Conformable [4], Atangana-Baleanu [5], Wallström [6], Jumarie [7], Klimek [8] and others.

    In practice, where quantitative results are needed for given real-world problems, numerically approximate solutions can often be demonstrably better, more reliable, more detailed, efficient and cost-effective than analytical ones for certain fractional structures. A number of studies [9,10,11,12,13,14] were therefore involved in developing approaches for providing estimated solutions. One of these approaches is the Hilbert space kernel reproduction (RKHS) method used for the first time by S. Zaremba for the harmonic and biharmonic functions at the beginning of the 20th century to find solutions for boundary value problems (BVPs).

    The RKHS precede the Dirac delta function in many ways, among which we mention providing an important structure for random distribution of multi-round data and, providing accurate approximation of multi-dimensional general functions and the possibility to pick any point in the integration interval.

    The RKHS algorithm has been successfully applied to various fields of numerical analysis, computational mathematics, probability and statistics [15,16], biology [17], quantum mechanics and wave mechanics [18]. Therefore wide range of research works have been directed to its applications in various stochastic categories [19], and defined problems involving operator equations [20], partial differential equations [21,22], integrative equations [23,24], and differential integration equations [24,25,26,27,28,29]. In addition, many studies have focused in recent years on the use of the RKHS method as a framework for seeking approximate numerical solutions to different problems [30,31,32,33,34,35,36,37,38,39].

    Moreover, the numerical solution of the different groups of BVP can be found in [40,41,42]. The two-point BVPs has a strong interest in applied mathematics, this kind of problems arise directly from mathematical models or by turning partial differential equations into ordinary differential equations. As this type of problems does not have an exact solution, many special techniques have been used to solve it, including the shooting method [43,44], the collocation method [45,46], the finite difference method [47,48], and the quasilinearization method [49,50]. The continuous genetic algorithm approach was used to solve these schemes in [51,52,53].

    The present paper is structured as follows: in Section 2, we set out some basic concepts and results from fractional calculus theory. In Section 3, the iterative form of the reproducing kernel algorithm is used to build and measure the solution of the fractional differential method with temporal two points. In Section 4 and 5, the convergence and error estimator are discussed to provide a number of numerical results to demonstrate the efficiency and accuracy of the reproducing kernel Hilbert space method. At last in section 6, a conclusion of the results is made.

    In applied mathematics and mathematical analysis, there are several definitions of fractional derivatives, Riemann-Liouville and Caputo are the most popular of all [54]. In this section, we list some of these definitions in addition to reproducing kernel spaces on finite domain [t0,tf].

    Definition 2.1. [55] Let nR+. The operator Jnt0 defined on L1[t0,tf] by

    Jnt0f(x):=1Γ(n)xt0(xζ)n1f(ζ)dζ,

    for t0xtf, is called the Riemann-Liouville fractional integral operator of order n. For n=0, we set J0t0:=I, the identity operator.

    Definition 2.2. [55] Let nR+ and m=[n]. The operator Dnt0 defined by

    Dnt0f:=DmJmnt0f=1Γ(mn)(ddx)mxt0(xζ)mn1f(ζ)dζ,

    is called the Riemann-Liouville fractional differential operator of order n. For n=0, we set D0t0:=I, the identity operator.

    Definition 2.3. [55] Let αR+ and n1<α<n. The operator Dαt0 defined by

    Dαt0f(x)=Jnαt0Dnf(x)=1Γ(nα)xt0(xζ)nα1(ddζ)nf(ζ)dζ,

    for t0xtf, is called the Caputo differential operator of order α.

    Definition 2.4. [35] Let M be nonempty set, the function K:M×MC is a reproducing kernel of the Hilbert space H if the following conditions are met:

    (1) K(.,t)M,tM,

    (2) the reproducing property: tM,zH:z(.),K(.,t)=z(t).

    The second condition means that the value of z at the point t is reproduced by the inner product of z with K.

    Note: The reproducing kernel is unique, symmetric and positive definite.

    Definition 2.5. L2[t0,tf]={ϑ|tft0ϑ2(t)dt<}.

    Definition 2.6. The space W12[t0,tf] is defined as:

    W12[t0,tf]={ϑ|ϑisabsolutelycontinuousrealvaluefunction,ϑL2[t0,tf]}.

    The inner product and its norm are given by:

    {ϑ1(t),ϑ2(t)W12=ϑ1(t0)ϑ2(t0)+tft0ϑ1(t)ϑ2(t)dt,ϑW12=ϑ(t),ϑ(t)W12.

    Definition 2.7. The space W22[t0,tf] is defined by:

    W22[t0,tf]={ϑ|ϑ,ϑareabsolutelycontinuousrealvaluefunctions,ϑL2[t0,tf],ϑ(t0)=0}.

    The inner product and its norm are given by:

    {ϑ1(t),ϑ2(t)W22=ϑ1(t0)ϑ2(t0)+ϑ1(t0)ϑ2(t0)+tft0ϑ1(t)ϑ2(t)dt,ϑW22=ϑ(t),ϑ(t)W22.

    Definition 2.8. W32[t0,tf]={ϑ|ϑ,ϑ,ϑareabsolutelycontinuous,ϑ(3)L2[t0,tf],ϑ(t0)=0,ϑ(tf)=0}.

    The inner product and its norm in W32[t0,tf] are given by:

    {ϑ1(t),ϑ2(t)W32=2i=0ϑ(i)1(t0)ϑ(i)2(t0)+tft0ϑ(3)1(t)ϑ(3)2(t)dt,ϑW32=ϑ(t),ϑ(t)W32,ϑW32.

    Remark 2.1. The Hilbert space Wm2[t0,tf] is called a reproducing kernel if for any fixed t[t0,tf], Kt(s)Wm2[t0,tf] such that ϑ(s),Kt(s)Wm2=ϑ(t) for any ϑ(s)Wm2[t0,tf] and s[t0,tf].

    Remark 2.2.

    (1) In [56], W12 is RKHS and its reproducing kernel is:

    K1(t,s)=12sinh1[cosh(t+s1)+cosh|ts|1].

    (2) In [57], W22 is RKHS and its reproducing kernel is:

    K2(s,t)=16{t(t2+3s(2+t)) ts,s(s2+3t(2+s)) t>s.

    In this section, we develop an iterative method for constructing and calculating fractional differential equations with a temporal two-point solution. In order to emphasize the idea, we start by considering the general form of the BVP:

    {Dαt0X(t)=F(t,X(t),Y(t)),Dαt0Y(t)=G(t,X(t),Y(t)),t0ttf,0α1. (3.1)

    Subject to BC's:

    X(t0)=δ,Y(tf)=β. (3.2)

    where:

    δ, β R, and Dα denotes the Caputo fractional derivative of order α and

    {X(t)=[x1(t),x2(t),...,xm(t)],Y(t)=[y1(t),y2(t),...,yl(t)], and {δ=[δ1(t),δ2(t),...,δm(t)],β=[β1(t),β2(t),...,βl(t)],F=[f1(t),f2(t),...,fm(t)],G=[g1(t),g2(t),...,gl(t)].

    We use the RKHS method to obtain a solution of BVPs (3.1) and (3.2) based on the following methodology:

    ● To attain a problem with homogenous BC's, we first assume that: Y(t0)=γ, (γ arbitrary) and

    {U(t)=X(t)X(t0),V(t)=Y(t)Y(t0). (3.3)

    We get:

    {Dαt0U(t)=Dαt0X(t),Dαt0V(t)=Dαt0Y(t). (3.4)

    Subject to:

    {U(t0)=0,V(t0)=Y(t0)γ=0. (3.5)

    ● Then, we construct the reproducing kernel space W22[t0,tf] in which each function satisfies the homogeneous boundary conditions of (3.5) using the space W12[t0,tf].

    Take Kt(τ) and Rt(τ) to be the reproducing kernel functions of the spaces W22[t0,tf] and W12[t0,tf] respectively.

    ● Next, we define the invertible bounded linear operator L:W22[t0,tf]W12[t0,tf] such that:

    {LU(t)=Dαt0U(t),LV(t)=Dαt0V(t). (3.6)

    The BVPs (3.4), (3.5) can therefore be transformed to the following form:

    {LU(t)=F(t,X(t),Y(t)),LV(t)=G(t,X(t),Y(t)),U(t0)=0,V(t0)=0. (3.7)

    Where U(t) and V(t) are in W22[t0,tf] and F,GW12[t0,tf].

    Applying Riemann-Liouville fractional integral operator Jαt0 to both sides using U(t0)=0 and V(t0)=0, we get:

    U(t)=1Γ(t0)tt0(tτ)α1F(τ,X(τ),Y(τ))dτ=F(t,X(t),Y(t)),V(t)=1Γ(t0)tt0(tτ)α1G(τ,X(τ),Y(τ))dτ=G(t,X(t),Y(t)).

    Thus, we can notice that: LU(t)=U(t), and so the BVPs are transformed to the equivalent form:

    {U(t)=F(t,X(t),Y(t)),V(t)=G(t,X(t),Y(t)),U(t0)=0,V(t0)=0. (3.8)

    ● When choosing a countable dense set {ti}i=1 from [t0,tf] for the reproducing kernel of the space W22[t0,tf], we define a complete system on W22[t0,tf] as: Ψi(t)=LΦi(t) where Φi(t)=Rti(τ), and L is the adjoint operator of L.

    Lemma 3.1. Ψi(t) can be written on the following form:

    Ψi(t)=LτKt(τ)|τ=ti.

    Proof. It is clear that:

    Ψi(t)=LΦi(t)=LΦi(τ),Kt(τ)W22,=Φi(τ),LKt(τ)W12=LτKt|τ=ti.

    ● The orthonormal function system {¯Ψηi(t)}i=1, η=1,2 of the space W22[t0,tf] can be derived from Gram-Schmidt orthogonalization process of {Ψηi(t)}i=1 as follows:

    ¯Ψηi(t)=ik=1BηikΨηk(t),i=1,2,...,η=1,2,

    where Bηik are positive orthogonalization coefficients such that:

    Bη11=1Ψη1,Bηii=1Ψηi2i1k=1(Cηik)2,Bηij=i1k=1CηikBηkjΨηi2i1k=1(Cηik)2,j<i. (3.9)

    Cηik given by: Ψηi,ΨηkW22.

    Theorem 3.1. If the operator L is invertible i.e: L1 exist, and if {ti}i=1 is dense on [t0,tf], then {Ψηi}i=1, η=1,2 is the complete function system of the space W22[t0,tf].

    Proof. For each fixed U(t),V(t)W22[t0,tf], let U(t),Ψ1i(t)=0,and V(t),Ψ2i(t)=0,i=1,2,... that is:

    U(t),Ψ1i(t)W22=U(t),LΦ1i(τ)W22=LU(t),Φ1i(t)W12=LU(ti)=0,V(t),Ψ2i(t)W22=V(t),LΦ2i(τ)W22=LV(t),Φ2i(t)W12=LV(ti)=0,

    since {ti}i=1 is dense on [t0,tf] then LU(t)=0, and LV(t)=0 it follows that U(t)=0,V(t)=0 since L1 exist and U(t),V(t) are continuous.

    Theorem 3.2. For each U(t),V(t)W22[t0,tf] the series

    {i=0U(t),¯Ψ1i(t)W22¯Ψ1i(t),i=0V(t),¯Ψ2i(t)W22¯Ψ2i(t),

    are convergent in the sense of the norm of W22[t0,tf]. In contrast if {ti}i=1 is dense subset on [t0,tf] then the solutions of (3.8) given by:

    {U(t)=i=1ik=1B1ikF(tk,U(tk),V(tk))¯Ψ1i(t),V(t)=i=1ik=1B2ikG(tk,U(tk),V(tk))¯Ψ2i(t). (3.10)

    Proof. Let U(t),V(t)W22[t0,tf] be the solutions of (3.8), since U(t),V(t)W22[t0,tf], and i=1U(t),¯Ψ1i(t)W22[t0,tf]¯Ψ1i(t) and i=1V(t),¯Ψ2i(t)W22[t0,tf]¯Ψ2i(t) represent the Fourier series expansion about normal orthogonal system {¯Ψηi(t)}i=1, η=1,2, and W22[t0,tf] is Hilbert space, then the series i=1U(t),¯Ψ1i(t)W22[t0,tf]¯Ψ1i(t),i=1V(t),¯Ψ2i(t)W22[t0,tf]¯Ψ2i(t) are convergent in the sense of .W22[t0,tf]. In contrast, according to the orthogonal basis {¯Ψηi(t)}i=1, we have:

    U(t)=i=1U(t),¯Ψ1i(t)W22¯Ψ1i(t),=i=1U(t),ik=1B1ikΨ1k(t)W22¯Ψ1i(t),=i=1ik=1B1ikU(t),Ψ1k(t)W22¯Ψ1i(t),=i=1ik=1B1ikU(t),LΦ1k(t)W22¯Ψ1i(t),=i=1ik=1B1ikLU(t),Φ1k(t)W12¯Ψ1i(t),=i=1ik=1B1ikF(tk,U(t),V(t)),Φ1k(t)W12¯Ψ1i(t),=i=1ik=1B1ikF(tk,U(tk),V(tk)))¯Ψ1i(t).

    The same for finding V(t):

    V(t)=i=1ik=1B2ikG(tk,U(tk),V(tk))¯Ψ2i(t).

    The theorem is proved.

    Since W22 is Hilbert space we get:

    i=1ik=1B1ikLU(t),Φ1k(t)W12¯Ψ1i(t)< and i=1ik=1B2ikLV(t),Φ2k(t)W12¯Ψ2i(t)<.

    Hence:

    {Un(t)=ni=1ik=1B1ikF(tk,U(tk),V(tk))¯Ψ1i(t),Vn(t)=ni=1ik=1B2ikG(tk,U(tk),V(tk))¯Ψ2i(t), (3.11)

    are convergent in the sense of .W22 and (3.11) represents the numerical solution of (3.8).

    Remark 3.1.

    (1) If the system (3.7) is linear, then the exact solutions can be found directly from (3.10).

    (2) If the system (3.7) is non linear, then the exact and numerical solutions can be obtained by:

    {U(t)=i=1A1i¯Ψ1i(t),V(t)=i=1A2i¯Ψ2i(t), (3.12)

    where:

    {A1i=ik=1B1ikF(tk,Uk1(tk),Vk1(tk)),A2i=ik=1B2ikG(tk,Uk1(tk),Vk1(tk)). (3.13)

    We use the known quantities ληi,η=1,2 to approximate the unknowns Aηi,η=1,2 as follows: we put t1=t0 and set U0(t1)=U(t1),V0(t1)=V(t1) then U0(t1)=V0(t1)=0 from the conditions of (3.8), and define the n-term approximation to U(t),V(t) by:

    {Un(t)=ni=1λ1i¯Ψ1i(t),Vn(t)=ni=1λ2i¯Ψ2i(t), (3.14)

    where the coefficient ληi(η=1,2,i=1,2,...,n), are presented as follows:

    {λ1n=nk=1B1ikF(tk,Uk1(tk),Vk1(tk)),λ2n=nk=1B2ikG(tk,Uk1(tk),Vk1(tk)), (3.15)

    and so:

    {Un(t)=ni=1λ1i¯Ψ1i(t),Vn(t)=ni=1λ2i¯Ψ2i(t). (3.16)

    We can guarantee that the approximations Un(t),Vn(t) satisfies the conditions enjoined by (3.7) through the iterative process of (3.16).

    In this section, we present some convergence theories to emphasize that the approximate solution we got is close to the exact solution. Indeed, this finding is very powerful and efficient to RKHS theory and its applications.

    Lemma 4.1. Un(t)n=1, and Vn(t)n=1 are monotone increasing in the sense of the norm of .2W22.

    Proof. Since ¯Ψηi(t)i=1,η=1,2 are the complete orthonormal systems in the space W22[t0,tf] then we have:

    {Un(t)2W22=Un(t),Un(t)W22=ni=1λ1i¯Ψ1i(t),ni=1λ1i¯Ψ1i(t)W22=ni=1(λ1i)2,Vn(t)2W22=Vn(t),Vn(t)W22=ni=1λ2i¯Ψ2i(t),ni=1λ2i¯Ψ2i(t)W22=ni=1(λ2i)2.

    Thus Un(t)W22,Vn(t)W22 are monotone increasing.

    Lemma 4.2. As n, the approximate solutions Un(t),Vn(t) and its derivatives Un(t),Vn(t) are uniformly convergent to the exact solutions U(t),V(t) and its derivatives U(t),V(t) respectively.

    Proof. For any t[t0,tf]:

    |Un(t)U(t)|=|Un(t)U(t),Kt(τ)W22|,Kt(τ)W22Un(t)U(t)W22,N1Un(t)U(t)W22,N1R,

    and

    |Vn(t)V(t)|N2Vn(t)V(t)W22,N2R,

    if Un(t)U(t)W220,Vn(t)V(t)W220 as n, then the approximate solutions U(i)n(t),V(i)n(t) are uniformly converges to the exact solutions U(i)(t),V(i)(t)i=1,2 respectively.

    Theorem 4.1. If

    {Un(t)U(t),Vn(t)V(t),

    and F(t,U(t),V(t)),G(t,U(t),V(t)) are continuous in [t0,tf], then:

    {F(tn,Un1(tn),Vn1(tn))F(t,U(t),V(t))G(tn,Un1(tn),Vn1(tn))G(t,U(t),V(t))asn. (4.1)

    Proof. For the first part, we will prove that:

    {Un1(tn)U(t),Vn1(tn))V(t),

    it is easy to see that:

    {|Un1(tn)U(t)|=|Un1(tn)Un1(t)+Un1(t)U(t)||Un1(tn)Un1(t)|+|Un1(t)U(t)|,|Vn1(tn)V(t)|=|Vn1(tn)Vn1(t)+Vn1(t)V(t)||Vn1(tn)Vn1(t)|+|Vn1(t)V(t)|,

    by reproducing property of Kt(τ) we have:

    {Un1(tn)=Un1(τ),Ktn(τ),Vn1(tn)=Vn1(τ),Ktn(τ),

    and

    {Un1(t)=Un1(τ),Kt(τ),Vn1(t)=Vn1(τ),Kt(τ),

    thus

    {|Un1(tn)Un1(t)|=|Un1(τ),Ktn(τ)Kt(τ)W22|Un1(τ)W22Ktn(τ)Kt(τ)W22,|Vn1(tn)Vn1(t)|=|Vn1(τ),Ktn(τ)Kt(τ)W22|Vn1(τ)W22Ktn(τ)Kt(τ)W22,

    and from the symmetric property of Kt(τ) we get:

    Ktn(τ)Kt(τ)W220n,

    hence: |Un1(tn)Un1(t)|0 as tnt.

    By lemma (4.2)

    {Un(t)c.uU(t),Vn(t)c.uV(t),

    thus:

    {|Un1(t)U(t)|0|Vn1(t)V(t)|0 as n.

    Therefore

    {Un1(tn)U(t),Vn1(tn)V(t),

    in the sense of the .W22 as tnt and n for any t[t0,tf].

    Moreover, since F and G are continuous, we obtain:

    {F(tn,Un1(tn),Vn1(tn))F(t,U(t),V(t))G(tn,Un1(tn),Vn1(tn))G(t,U(t),V(t)) as n.

    Theorem 4.2. Suppose that UnW22 and VnW22 are bounded in Eq (3.14), if {ti}i=1 is dense on [t0,tf], then the approximate solutions Un(t), Vn(t) in Eq (3.14) convergent to the exact solutions U(t),V(t) of Eq (3.7) in the space W22[t0,tf] and U(t),V(t) given by (3.12).

    Proof. We first start by proving the convergence of Un(t) and Vn(t) from Eq (3.14) we conclude that:

    {Un+1(t)=Un(t)+λ1n+1¯Ψ1n+1(t),Vn+1(t)=Vn(t)+λ2n+1¯Ψ2n+1(t),

    by orthogonality of {¯Ψηi(t)}i=1,(η)=1,2 we get:

    {Un+1(t)2W22=Un(t)2W22+(λ1n+1)2==U0(t)2W22+n+1i=1(λ1i)2,Vn+1(t)2W22=Vn(t)2W22+(λ2n+1)2==V0(t)2W22+n+1i=1(λ2i)2,

    Un(t)W22,Vn(t)W22 are monotone increasing by Lemma (2). From the assymption that Un(t)W22,Vn(t)W22 are bounded, Un(t)W22,Vn(t)W22 are convergent as n, then c,d constants such that

    {i=1(λ1i)2=c,i=1(λ2i)2=d,

    if m>n using

    {(UmUm1)(Um1Um2)(Un+1Un),(VmVm1)(Vm1Vm2)(Vn+1Vn),

    further that

    {Um(t)Um1(t)2W22=(λ1m)2,Vm(t)Vm1(t)2W22=(λ2m)2,

    so:

    {Um(t)Un(t)2W22=mi=n+1(λ1i)20Vm(t)Vn(t)2W22=mi=n+1(λ2i)20 as n,m,

    since W22[t0,tf] is complete, U(t),V(t) in W22[t0,tf] such that

    {Un(t)U(t)Vn(t)V(t) as n,

    in the sense of the norm of W22[t0,tf].

    Now, we prove that U(t),V(t) are solutions of Eq (3.7). Since {ti}i=1 is dense on [t0,tf],t[t0,tf], subsequence {tnj} such that tnjjt. From lemma (3) and (4) in [25] we have:

    {LU(tnj)=F(tnj,Unj1(tnj),Vnj1(tnj)),LV(tnj)=G(tnj,Unj1(tnj),Vnj1(tnj)),

    let j goes to , by theorem (4.1) and the continuity of F and G we have:

    {LU(t)=F(t,U(t),V(t)),LV(t)=G(t,U(t),V(t)),

    that is U(t),V(t) are solutions of Eq (3.7).

    Theorem 4.3. Let ξn=|Un(t)U(t)|, ξn=|Vn(t)V(t)|, where: Un(t),Vn(t),U(t),V(t) denote the approximate and the exact solutions respectively, then the sequences of numbers {ξn},{ξn} are decreasing in the sense of the norm .W22 and ξnn0,ξnn0.

    Proof. From the extension form of U(t),V(t) and Un(t),Vn(t) in Eqs (3.12), (3.14) and (3.15) we can write:

    {ξn2W22=i=n+1λ1i¯Ψ1i(t)2W22=i=n+1(λ1i)2,ξn2W22=i=n+1λ2i¯Ψ2i(t)2W22=i=n+1(λ2i)2,

    and

    {ξn12W22=i=nλ1i¯Ψ1i(t)2W22=i=n(λ1i)2,ξn12W22=i=nλ2i¯Ψ2i(t)2W22=i=n(λ2i)2.

    Clearly: ξnn=1,ξnn=1 are decreasing in a sense of .W22 from theorem (3.2) the series i=1λ1i¯Ψ1i(t),i=1λ2i¯Ψ2i(t) are convergent, thus ξnW220,ξnW220 as n.

    Theorem 4.4. The approximate solutions Un(t),Vn(t) of (3.7) converge to its exact solutions U(t),V(t) with not less than the second order convergence. That is: |UnU|Mk2 and |VnV|Nk2, where k=tft0n.

    Proof. See [36].

    Numerical examples are conducted in order to verify the accuracy of this method. Computations are performed using Mathematica 11.0.

    Algorithm 1: Use the following stages to approximate the solutions of BVPs (3.4) and (3.5) based on RKHS method.

    Stage A: Fixed t[t0,tf] and set τ[t0,tf]

    for i=1,...,n do the following stages:

    - stage 1: set ti=t0+(tft0)in;

    - stage 2: if τt let

    Kτ(t)=3i=0pi(t)τi;

    else let

    Kτ(t)=3i=0qi(t)τi.

    - stage 3: For η=1,2;

    set

    Ψηi(t)=LτKt(τ)|τ=ti.

    Output the orthogonal functions system Ψηi(t).

    Stage B: Obtain the orthogonalization coefficients Bηij as follows:

    For η=1,2;

    For i=1,...,n;

    For j=1,...,i set Cηik=Ψηi,ΨηjW22 and B11=1Sqrt(Cη11).

    Output Cηij and B11.

    Stage C: For η=1,2;

    For i=1,...,n, set Bηii=(Ψηi2W22i1k=1(Cηik)2)12;

    else if ji set Bηij=(i1k=1CηikBηkj).(Ψηi2W22i1k=1(Cηik)2)12.

    Output the orthogonalization coefficients Bηij.

    Stage D: For η=1,2;

    For i=1,...,n set ¯Ψηi(t)=ik=1BηikΨηi(t).

    Output the orthonormal functions system ¯Ψηi(t).

    Stage E: Set t1=0 and choose U0(t1)=0,V0(t1)=0;

    For η=1,2;

    For i=1 set

    {λ11=B111F(t1,U0(t1),V0(t1)),λ21=B211G(t1,U0(t1),V0(t1)), and {U1(t)=λ11¯Ψ11(t),V1(t)=λ21¯Ψ21(t).

    For i=2,3,...,n set

    {λ1i=ik=1B1nkF(tk,Uk1(tk),Vk1(tk)),λ2i=ik=1B2nkG(tk,Uk1(tk),Vk1(tk)),

    set

    {Un(t)=ni=1λ1i¯Ψ1i(t),Vn(t)=ni=1λ2i¯Ψ2i(t).

    Outcome the numerical solutions Un(t),Vn(t).

    Then we implement the above algorithm using numerical simulations. We arrange the resulting data in tables and graphs for examples discussed on [t0,tf] as follows:

    Example 5.1. Consider the following system:

    {Dαω(t)=4ω+3Θ+6,DαΘ(t)=2.4ω+1.6Θ+3.6,0t0.5,0α1,

    subject to:

    {ω(0)=0,Θ(0.5)=2.25e1+2.25e0.2,

    with exact solution when α=1 is:

    {ω(t)=3.375e2t+1.875e0.4t+1.5,Θ(t)=2.25e2t+2.25e0.4t.

    After the initial conditions have been homogenised and algorithm 1 used, apply ti=0.5in, ¯i=1,n and n=40, the tables 1 and 2 describe the exact solutions of ω(t) and Θ(t) and approximate solutions for different values of α.

    Table 1.  Numerical results for ω(t) of example 5.1.
    t Exact Sol of ω(t) App Sol of ω(t) α=0.9 α=0.8 α=0.7 Abs Error Rel Error
    0. 0. 0. 0. 0. 0. 0. Indeterminate
    0.1 0.538264 0.538235 0.672451 0.820896 0.975714 2.8979×105 5.3838×105
    0.2 0.968513 0.968496 1.10364 1.22992 1.34045 1.6912×105 1.7462×105
    0.3 1.31074 1.31073 1.41427 1.49734 1.55882 7.6470×106 5.8341×106
    0.4 1.58128 1.58128 1.64374 1.68334 1.70372 5.4565×107 3.4507×107
    0.5 1.79353 1.79353 1.81496 1.8167 1.805 4.8467×106 2.7023×106

     | Show Table
    DownLoad: CSV
    Table 2.  Numerical results for Θ(t) of example 5.1.
    t Exact Sol Θ(t) App Sol of Θ(t) α=0.9 α=0.8 α=0.7 Abs Error Rel Error
    0. 0. 0. 0. 0. 0. 0. Complex Infinity
    0.1 0.319632 0.31963 0.397424 0.48192 0.56754 1.7129×106 5.3589×106
    0.2 0.568792 0.568797 0.643125 0.70952 0.76353 5.6398×106 9.9154×106
    0.3 0.760745 0.760756 0.812467 0.84948 0.87141 1.1152×105 1.4659×105
    0.4 0.906333 0.906349 0.930619 0.93950 0.93585 1.5248×105 1.6823×105
    0.5 1.01442 1.01443 1.01229 0.99765 0.97506 1.8229×105 1.7970×105

     | Show Table
    DownLoad: CSV

    Graphs of the approximate solutions of ω(t) are plotted in Figure 1 (a), for different values of α. It is obvious from Figure 1 (a) that the approximate solutions are in reasonable alignment with the exact solution when α=1 and the solutions are continuously based on a fractional derivative. The graph in Figure 1 (b) represent the absolute errors of θ(t).

    Figure 1.  Solution and graphical curves of Example 5.1.

    Example 5.2. Consider the following system:

    {Dαω=ω24(ω1)cos2(t)sin(t),DαΘ=ωΘ2Θt2cos(t)+2t,0t1,

    with conditions:

    {ω(0)=3,Θ(1)=1,

    when α=1 the exact solution is:

    {ω(t)=cos(t)+2,Θ(t)=t2.

    After homogenizing the initial conditions and using algorithm 1, apply ti=in, ¯i=1,n and n=35, the tables 3 and 4 describe the exact solutions of ω(t) and Θ(t) and approximate solutions for different values of α.

    Table 3.  Numerical results for ω(t) of example 5.2.
    t Exact Sol of ω(t) App Sol of ω(t) α=0.9 α=0.8 α=0.7 Abs Error
    0. 3. 3. 3. 3. 3. 0.
    0.2 2.98007 2.98008 2.97308 2.96301 2.94782 1.71231717×105
    0.4 2.92106 2.92108 2.89745 2.86363 2.81286 2.336775593×105
    0.6 2.82534 2.82537 2.77748 2.71004 2.61271 3.05778094×105
    0.8 2.69671 2.69675 2.6203 2.51736 2.38161 3.84719926×105
    1. 2.5403 2.54035 2.43686 2.3082 2.15981 4.636294967×105

     | Show Table
    DownLoad: CSV
    Table 4.  Numerical results for Θ(t) of example 5.2.
    t Exact Sol of Θ(t) App Sol of Θ(t) α=0.9 α=0.8 α=0.7 Abs Error
    0. 0. 0. 0. 0. 0. 0.
    0.2 0.04 0.0399862 0.0526074 0.0695245 0.0925163 1.379651819×105
    0.4 0.16 0.159985 0.198264 0.246476 0.306978 1.465169064×105
    0.6 0.36 0.359987 0.428814 0.509138 0.597815 1.348748932×105
    0.8 0.64 0.639991 0.735269 0.833398 0.919358 9.089432173×106
    1. 1. 1. 1.10687 1.19567 1.24369 0.

     | Show Table
    DownLoad: CSV

    Graphs of the approximate solutions of θ(t) are plotted in Figure 2 (b) for different values of α. The graph in Figure 2 (a) represent the absolute errors of ω(t).

    Figure 2.  Solution and graphical curves of Example 5.2.

    Example 5.3. Consider the following fractional system:

    {Dαω=Θρ+t,DαΘ=3t2,Dαρ=Θ+et,0t1,

    subject to:

    {ω(0)=1,Θ(0)=1,ρ(1)=1.25e1,

    with exact solution:

    {ω(t)=0.05t5+0.25t4+t+2et,Θ(t)=t3+1,ρ(t)=0.25t4+tet.

    After the initial conditions have been homogenised and algorithm 1 used, apply ti=in, ¯i=1,n and n=30, the tables 5-7 describe the exact solutions of ω(t), Θ(t) and ρ and approximate solutions for different values of α.

    Table 5.  Numerical results for ω(t) of example 5.3.
    t Exact Sol of ω(t) App Sol of ω(t) α=0.9 α=0.8 α=0.7 Absolute Error
    0. 1. 1. 1. 1. 1. 0.
    0.2 1.38165 1.38163 1.45132 1.52412 1.59527 2.778531454×105
    0.4 1.73557 1.73552 1.80231 1.85993 1.90359 4.434730105×105
    0.6 2.0797 2.07964 2.12935 2.16496 2.18472 5.613341879×105
    0.8 2.43669 2.43662 2.46954 2.48922 2.49658 6.305905268×105
    1. 2.83212 2.83206 2.8543 2.86685 2.87146 6.508054219×105

     | Show Table
    DownLoad: CSV
    Table 6.  Numerical results for Θ(t) of example 5.3.
    t Exact Sol of Θ(t) App Sol of Θ(t) α=0.9 α=0.8 α=0.7 Absolute Error
    0. 1. 1. 1. 1. 1. 0.
    0.2 1.008 1.38163 1.01064 1.01411 1.01865 7.327471963×1015
    0.4 1.064 1.73552 1.07942 1.09826 1.1212 1.720845688×1013
    0.6 1.216 2.07964 1.25738 1.30578 1.36221 8.968381593×1013
    0.8 1.512 2.43662 1.59278 1.6843 1.78757 1.98951966×1012
    1. 2. 2.83206 2.13222 2.27818 2.43862 1.869615573×1012

     | Show Table
    DownLoad: CSV
    Table 7.  Numerical results for ρ(t) of example 5.3.
    t Exact Sol of ρ(t) App Sol of ρ(t) α=0.9 α=0.8 α=0.7 Absolute Error
    0. -1. -1. -1. -1. -1. 0.
    0.2 -0.618331 -0.61828 -0.534717 -0.436751 -0.323107 5.101539186×105
    0.4 -0.26392 -0.263882 -0.161995 -0.0516111 0.0670132 3.825972939×105
    0.6 0.0835884 0.0836139 0.191075 0.304226 0.423533 2.55064838×105
    0.8 0.453071 0.453084 0.568489 0.69138 0.823913 1.275324046×105
    1. 0.882121 0.882121 1.01733 1.16604 1.3321 0.

     | Show Table
    DownLoad: CSV
    Table 8.  Error in ω(t) of the first example.
    t Error in ω(t) Error in ω(t) Error in ω(t) Error in ω(t)
    by RKHS for n=40 by RKHS for n=100 by Finite difference by Collocation
    0 0. Indeterminate 0. 0.
    0.1 2.89×105 3.93×106 2.08×102 1.62×104
    0.2 1.69×105 1.65×106 3.25×102 8.06×104
    0.3 7.64×106 8.48×107 3.79×102 4.04×104
    0.4 5.45×107 4.29×109 3.89×102 1.61×104
    0.5 4.84×106 4.19×107 3.70×102 1.73×104

     | Show Table
    DownLoad: CSV
    Table 9.  Error in Θ(t) of the first example.
    t Error in Θ(t) Error in Θ(t) Error in Θ(t) Error in Θ(t)
    by RKHS for n=40 by RKHS for n=100 by Finite difference by Collocation
    0 0. Indeterminate 2.81×102 1.41×104
    0.1 1.71×106 4.40×106 1.40×102 2.77×105
    0.2 5.63×106 1.86×106 5.01×103 7.64×105
    0.3 1.11×105 8.21×107 7.39×104 9.81×105
    0.4 1.52×105 9.84×107 6.04×104 1.31×104
    0.5 1.82×105 1.14×106 0. 0.

     | Show Table
    DownLoad: CSV
    Table 10.  Error in ω(t) of the second example.
    t Error in ω(t) Error in ω(t) Error in ω(t) Error in ω(t) Error in ω(t)
    by RKHS for n=35 by RKHS for n=60 by RKHS for n=100 by Finite difference by Collocation
    0 0. 0. 0. 0. Failed
    0.2 1.71×105 3.44×106 2.51×107 1.09×102 Failed
    0.4 2.33×105 4.69×106 3.49×107 2.62×102 Failed
    0.6 3.05×105 6.14×106 4.73×107 4.63×102 Failed
    0.8 3.84×105 7.73×106 5.98×107 7.11×102 Failed
    1 4.63×105 9.73×106 7.45×107 9.91×102 Failed

     | Show Table
    DownLoad: CSV
    Table 11.  Error in Θ(t) of the second example.
    t Error in Θ(t) Error in Θ(t) Error in Θ(t) Error in Θ(t) Error in Θ(t)
    by RKHS for n=35 by RKHS for n=60 by RKHS for n=100 by Finite difference by Collocation
    0 0. 0. 0. 5.54×102 Failed
    0.2 1.37×105 2.82×106 2.51×107 4.49×102 Failed
    0.4 1.46×105 3.00×106 3.49×107 3.34×102 Failed
    0.6 1.34×105 2.79×106 4.73×107 2.04×102 Failed
    0.8 9.08×106 2.03×106 5.98×107 7.77×103 Failed
    1 0. 0. 0. 0. Failed

     | Show Table
    DownLoad: CSV
    Table 12.  Error in ω(t) of the third example.
    t Error in ω(t) Error in ω(t) Error in ω(t) Error in ω(t)
    by RKHS for n=30 by RKHS for n=60 by Finite difference by Collocation
    0 0. 0. 0. 0.
    0.2 2.77×105 1.43×106 2.83×103 5.86×104
    0.4 4.43×105 1.42×106 1.24×102 5.29×104
    0.6 5.61×105 1.12×106 3.13×102 5.44×104
    0.8 6.30×105 6.62×106 6.06×102 4.86×104
    1 6.50×105 9.69×106 1.00×102 1.08×103

     | Show Table
    DownLoad: CSV
    Table 13.  Error in Θ(t) of the third example.
    t Error in Θ(t) Error in Θ(t) Error in Θ(t) Error in Θ(t)
    by RKHS for n=30 by RKHS for n=60 by Finite difference by Collocation
    0 0. 0. 0. 0.
    0.2 7.32×1015 6.28×1013 5.00×103 0.
    0.4 1.72×1013 2.80×1013 2.20×102 0.
    0.6 8.96×1013 4.10×1013 5.10×102 0.
    0.8 1.98×1012 5.94×1013 9.20×102 0.
    1 1.86×1012 5.37×1014 1.45×101 0.

     | Show Table
    DownLoad: CSV
    Table 14.  Error in ρ(t) of the third example.
    t Error in ρ(t) Error in ρ(t) Error in ρ(t) Error in ρ(t)
    by RKHS for n=30 by RKHS for n=60 by Finite difference by Collocation
    0 0. 0. 5.59×102 1.29×104
    0.2 5.10×105 1.48×106 6.47×102 5.49×105
    0.4 3.82×105 3.07×106 6.80×102 6.03×105
    0.6 2.55×105 4.66×106 6.14×102 5.73×105
    0.8 1.27×105 6.26×106 4.03×102 6.23×105
    1 0. 0. 0. 0.

     | Show Table
    DownLoad: CSV

    Graphs of the approximate solutions of ω(t) and θ(t) are plotted in Figure 3 (a), Figure 3 (b) for different values of α. The graph in Figure 3 (c) represent the absolute errors of ρ(t).

    Figure 3.  Solution and graphical curves of Example 5.3.

    Now, we consider the following tables where the RKHS method has been applied in order to give numerical approximations with other values of n, and then compare it with finite difference and collocation methods.

    In this article, we effectively utilize the RKHSM to develop an approximate solution of differential fractional equations with temporal two-point BVP. The results of examples demonstrate reliability and consistency of the method. In the future, we recommend further research on the RKHS method, as solving the temporal two-point boundary value problems with the conformable and the Atangana-Baleanu derivatives. We expect to achieve better results and good approximations for the solutions.

    The authors state that they have no conflict of interest. All authors have worked in an equal sense to find these results.



    [1] C. Li, D. Qian, Y. Chen, On Riemann-Liouville and Caputo derivatives, Discrete Dyn. Nat. Soc., 2011 (2011), 1-15.
    [2] R. Hilfer, Y. Luchko, Z. Tomovski, Operational method for the solution of fractional differential equations with generalized Riemann-Liouville fractional derivatives, Fract. Calc. Appl. Anal., 12 (2009), 299-318.
    [3] M. D. Ortigueira, L. Rodríguez-Germá, J. J. Trujillo, Complex Grünwald-Letnikov, Liouville, Riemann-Liouville, and Caputo derivatives for analytic functions, Commun. Nonlinear Sci., 16 (2011), 4174-4182. doi: 10.1016/j.cnsns.2011.02.022
    [4] R. Khalil, M. Al Horani, A. Yousef, M. Sababheh, A new definition of fractional derivative, J. Comput. Appl. Math., 264 (2014), 65-70. doi: 10.1016/j.cam.2014.01.002
    [5] O. A. Arqub, B. Maayah, Modulation of reproducing kernel Hilbert space method for numerical solutions of Riccati and Bernoulli equations in the Atangana-Baleanu fractional sense, Chaos Soliton. Fract., 125 (2019), 163-170. doi: 10.1016/j.chaos.2019.05.025
    [6] J. Cresson, P. Inizan, Variational formulations of differential equations and asymmetric fractional embedding, J. Math. Anal. Appl., 385 (2012), 975-997. doi: 10.1016/j.jmaa.2011.07.022
    [7] G. Jumarie, Table of some basic fractional calculus formulae derived from a modified Riemann-Liouville derivative for non-differentiable functions, Appl. Math. Lett, 22 (2009), 378-385. doi: 10.1016/j.aml.2008.06.003
    [8] B. S. H. Kashkari, M. I. Syam, Reproducing Kernel Method for Solving Nonlinear Fractional Fredholm Integrodifferential Equation, Complexity, 2018 (2018), 1-7.
    [9] O. A. Arqub, B. Maayah, Solutions of Bagley-Torvik and Painlevé equations of fractional order using iterative reproducing kernel algorithm with error estimates, Neural Comput. Appl., 29 (2018), 1465-1479. doi: 10.1007/s00521-016-2484-4
    [10] A. K. Albzeirat, M. Z. Ahmad, S. M. Momani, B. Maayah, Numerical solution of second-order fuzzy differential equation of integer and fractional order using reproducing kernel Hilbert space method tools, Far East Journal of Mathematical Sciences, 101 (2017), 1327-1351. doi: 10.17654/MS101061327
    [11] Y. Ren, Y. Qin, R. Sakthivel, Existence results for fractional order semilinear integro-diffrential evolution equations with infinite delay, Integr. Equat. Oper. Th., 67 (2010), 33-49. doi: 10.1007/s00020-010-1767-x
    [12] L. Xu, X. Chu, H. Hu, Exponential ultimate boundedness of non-autonomous fractional differential systems with time delay and impulses, Appl. Math. Lett., 99 (2020), 106000. doi: 10.1016/j.aml.2019.106000
    [13] L. Xu, H. Hu, F. Qin, Ultimate boundedness of impulsive fractional differential equations, Appl. Math. Lett., 62 (2016), 110-117. doi: 10.1016/j.aml.2016.06.011
    [14] X. Chu, L. Xu, H. Hu, Exponential quasi-synchronization of conformable fractional-order complex dynamical networks, Chaos Soliton. Fract., 144 (2020), 110268.
    [15] A. Berlinet, C. Thomas-Agnan, Reproducing Kernel Hilbert Spaces in Probability and Statistics, Springer US, 2004.
    [16] B. Sriperumbudur, A. Gretton, K. Fukumizu, Hilbert space embeddings and metrics on probability measures, J. Mach. Learn. Res., 11 (2010), 1517--1561.
    [17] R. Magin, Fractional calculus models of complex dynamics in biological tissues, Comput. Math. Appl., 59 (2010), 1586-1593. doi: 10.1016/j.camwa.2009.08.039
    [18] R. Almeida, A. B. Malinowska, A fractional calculus of variations for multiple integrals with application to vibrating string, J. Math. Phys., 51 (2010), 1-12.
    [19] J. Lin, L. Rosasco, Generalization properties of doubly stochastic learning algorithms, J. Complexity, 47 (2018), 42-61. doi: 10.1016/j.jco.2018.02.004
    [20] O. A. Arqub, B. Maayah, Numerical solutions of integrodifferential equations of Fredholm operator type in the sense of the Atangana-Baleanu fractional operator, Chaos Soliton. Fract., 117 (2018), 117-124. doi: 10.1016/j.chaos.2018.10.007
    [21] O. A. Arqub, Fitted reproducing kernel Hilbert space method for the solutions of some certain classes of time-fractional partial differential equations subject to initial and Neumann boundary conditions, Appl. Math. Comput., 73 (2007), 1243-1261.
    [22] M. Klimek, Stationarity-conservation laws for fractional differential equations with variable coefficients, J. Phys. A-Math. Gen., 35 (2002), 6675-6693. doi: 10.1088/0305-4470/35/31/311
    [23] H. Beyrami, T. Lotfi, K. Mahdiani, Stability and error analysis of the reproducing kernel Hilbert space method for the solution of weakly singular Volterra integral equation on graded mesh, Appl. Numer. Math., 120 (2017), 197-214. doi: 10.1016/j.apnum.2017.05.010
    [24] S. Javan, S. Abbasbandy, M. Araghi, Application of Reproducing Kernel Hilbert Space Method for Solving a Class of Nonlinear Integral Equations, Math. Probl. Eng., 2017 (2017), 1-10.
    [25] O. A. Arqub, M. Al-Smadi, N. Shawagfeh, Solving Fredholm integrodifferential equations using reproducing kernel Hilbert space method, Appl. Math. Comput., 219 (2013), 8938-8948.
    [26] M. Al-Smadi, O. A. Arqub, S. Momani, A computational method for two-point boundary value problems of fourth-order mixed integrodifferential equations, Math. Probl. Eng., 2013 (2013), 1-10.
    [27] S. Bushnaq, B. Maayah, M. Ahmad, Reproducing kernel Hilbert space method for solving fredholm integrodifferential equations of fractional order, Italian Journal of Pure and Applied Mathematics, 36 (2016), 307-318.
    [28] A. AlHabees, B. Maayah, S. Bushnaq, Solving fractional proportional delay integrodifferential equations of first order by reproducing kernel Hilbert space method, Global Journal of Pure and Applied Mathematics, 12 (2016), 3499-3516.
    [29] S. Bushnaq, B. Maayah, S. Momani, A. Alsaedi, A reproducing kernel Hilbert space method for solving systems of fractional integrodifferential equations, Abstr. Appl. Anal., 2014 (2014), 1-6.
    [30] Z. Altawallbeh, M. Al-Smadi, R. Abu-Gdairi, Approximate solution of second-order integrodifferential equation of Volterra type in RKHS method, Int. Journal of Math. Analysis, 7 (2013), 2145-2160. doi: 10.12988/ijma.2013.36136
    [31] B. Maayah, S. Bushnaq, M. Ahmad, S. Momani, Computational method for solving nonlinear voltera integro-differential equations, J. Comput. Theor. Nanos., 13 (2016), 7802-7806. doi: 10.1166/jctn.2016.5642
    [32] O. A. Arqub, Reproducing kernel algorithm for the analytical-numerical solutions of nonlinear systems of singular periodic boundary value problems, Math. Probl. Eng., 2015 (2015), 1-13.
    [33] Z. Altawallbeh, M. Al-Smadi, I. Komashynska, A. Ateiwi, Numerical Solutions of Fractional Systems of Two-Point BVPs by Using the Iterative Reproducing Kernel Algorithm, Ukrainian Mathematical Journal, 70 (2018), 687-701. doi: 10.1007/s11253-018-1526-8
    [34] S. Bushnaq, B. Maayah, A. AlHabees, Application of multistep reproducing kernel Hilbert space method for solving giving up smoking model, International Journal of Pure and Applied Mathematics, 109 (2016), 311-324.
    [35] M. Inc, A. Akgùl, The reproducing kernel Hilbert space method for solving Troesch's problem, Journal of the Association of Arab Universities for Basic and Applied Sciences, 14 (2013), 19-27.
    [36] Z. Zhao, Y. Lin, J. Niu, Convergence Order of the Reproducing Kernel Method for Solving Boundary Value Problems, Math. Model. Anal., 21 (2016), 466-477. doi: 10.3846/13926292.2016.1183240
    [37] X. Lù, M. Cui, Existence and numerical method for nonlinear third-order boundary value problem in the reproducing kernel space, Bound. Value Probl., 2010 (2010), 1-19. doi: 10.1155/2010/728101
    [38] B. Maayah, S. Bushnaq, A. Alsaedi, S. Momani, An efficient numerical method for solving chaotic and non-chaotic systems, J. Ramanujan Math. Soc., 33 (2018), 219-231.
    [39] B. Maayah, S. Bushnaq, S. Momani, O. A. Arqub, Iterative multistep reproducing kernel Hilbert space method for solving strongly nonlinear oscillators, Adv. Math. Phys., 2014 (2014), 1-7.
    [40] M. Al-Smadi, A. Freihat, H. Khalil, Numerical Multistep Approach for Solving Fractional Partial Differential Equations, Int. J. Comput. Meth., 14 (2017), 1-15.
    [41] S. Bushnaq, B. Maayah, S. M. Momani, O. A. Arqub, Analytical simulation of singular second-order, three points boundary value problems for fredholm operator using computational kernel algorithm, J. Comput. Theor. Nanos., 13 (2016), 7816-7824. doi: 10.1166/jctn.2016.5783
    [42] K. Moaddy, A. Freihat, M. Al-Smadi, E. Abuteen, I. Hashim, Numerical investigation for handling fractional-order Rabinovich-Fabrikant model using the multistep approach, Soft Comput., 22 (2018), 773-782. doi: 10.1007/s00500-016-2378-5
    [43] D. Morrison, J. Riley, J. Zancanaro, Multiple shooting method for two-point boundary value problems, Commun. ACM, 5 (1962), 613-614. doi: 10.1145/355580.369128
    [44] S. Filipov, I. Gospodinov, I. Faragó, Shooting-projection method for two-point boundary value problems, Appl. Math. Lett., 72 (2017), 10-15. doi: 10.1016/j.aml.2017.04.002
    [45] R. Russell, L. Shampine, A collocation method for boundary value problems, Numer. Math., 19 (1972), 1-28. doi: 10.1007/BF01395926
    [46] H. Liang, M. Stynes, Collocation Methods for General Caputo Two-Point Boundary Value Problems, J. Sci. Comput., 76 (2018), 390-425. doi: 10.1007/s10915-017-0622-5
    [47] R. P. Agarwal, Y. M. Chow, Finite-difference methods for boundary-value problems of differential equations with deviating arguments, Comput. Math. Appl., 12 (1986), 1143-1153. doi: 10.1016/0898-1221(86)90018-0
    [48] M. M. Chawla, C. P. Katti, Finite difference methods for two-point boundary value problems involving high order differential equations, BIT Numerical Mathematics, 19 (1979), 27-33. doi: 10.1007/BF01931218
    [49] A. Miele, R. Iyer, Modified quasilinearization method for solving nonlinear, two-point boundary-value problems, J. Math. Anal. Appl., 36 (1971), 674-692. doi: 10.1016/0022-247X(71)90048-5
    [50] R. Sylvester, F. Meyer, Two Point Boundary Problems by Quasilinearization, Journal of the Society for Industrial and Applied Mathematics, 13 (1965), 586-602. doi: 10.1137/0113038
    [51] O. A. Arqub, Z. Abo-Hammour, S. Momani, N. Shawagfeh, Solving singular two-point boundary value problems using continuous genetic algorithm, Abstr. Appl. Anal., 2012 (2012), 1-25.
    [52] Z. Abo-Hammour, M. Yusuf, N. Mirza, S. Mirza, Numerical solution of second-order, two-point boundary value problems using continuous genetic algorithms, Int. J. Numer. Meth. Eng., 61 (2004), 1219-1242. doi: 10.1002/nme.1108
    [53] H. Jaradat, Numerical solution of temporal two-point boundary value problems using continuous genetic algorithms, University of jordan, 2006.
    [54] I. Podlubny, Fractional differential equations: An introduction to fractional derivatives, fractional differential equations, to methods of their solution and some of their applications, Academic Press, 1998.
    [55] K. Diethelm, The analysis of fractional differential equations, Springer Verlag, Berlin, Heidelberg, 2010.
    [56] C. Li, M. Cui, The exact solution for solving a class nonlinear operator equations in the reproducing kernel space, Appl. Math. Comput., 143 (2003), 393-399.
    [57] M. Cui, Y. Lin, Nonlinear Numerical Analysis in Reproducing Kernel Space, Nova Science Publishers, 2009.
  • This article has been cited by:

    1. Shuoshi Liu, Yu Qian, Dan Li, Jiří Jaromír Klemeš, Siyu Yang, Multi-Scenario scheduling optimisation for a novel Double-Stage ammonia absorption refrigeration system incorporating an organic Rankine cycle, 2022, 270, 01968904, 116170, 10.1016/j.enconman.2022.116170
    2. Ali Akgül, Nourhane Attia, Advancing differential equation solutions: A novel Laplace-reproducing kernel Hilbert space method for nonlinear fractional Riccati equations, 2024, 0129-1831, 10.1142/S0129183124501869
    3. Nourhane Attia, Ali Akgül, 2023, Chapter 5, 978-981-99-5000-3, 117, 10.1007/978-981-99-5001-0_5
    4. Nourhane Attia, Ali Akgül, Abdon Atangana, Yusuf Gurefe, Reproducing Kernel Method with Global Derivative, 2023, 2023, 2314-8888, 1, 10.1155/2023/2726735
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3045) PDF downloads(143) Cited by(4)

Figures and Tables

Figures(3)  /  Tables(14)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog