Processing math: 32%
Research article

A faster iterative scheme for solving nonlinear fractional differential equations of the Caputo type

  • In this paper, we introduce a new fixed point iterative scheme called the AG iterative scheme that is used to approximate the fixed point of a contraction mapping in a uniformly convex Banach space. The iterative scheme is used to prove some convergence result. The stability of the new scheme is shown. Furthermore, weak convergence of Suzuki's generalized non-expansive mapping satisfying condition (C) is shown. The rate of convergence result is proved and it is demonstrated via an illustrative example which shows that our iterative scheme converges faster than the Picard, Mann, Noor, Picard-Mann, M and Thakur iterative schemes. Data dependence results for the iterative scheme are shown. Finally, our result is used to approximate the solution of a nonlinear fractional differential equation of Caputo type.

    Citation: Godwin Amechi Okeke, Akanimo Victor Udo, Rubayyi T. Alqahtani, Nadiyah Hussain Alharthi. A faster iterative scheme for solving nonlinear fractional differential equations of the Caputo type[J]. AIMS Mathematics, 2023, 8(12): 28488-28516. doi: 10.3934/math.20231458

    Related Papers:

    [1] Meshari Alesemi . Innovative approaches of a time-fractional system of Boussinesq equations within a Mohand transform. AIMS Mathematics, 2024, 9(10): 29269-29295. doi: 10.3934/math.20241419
    [2] Azzh Saad Alshehry, Humaira Yasmin, Ali M. Mahnashi . Exploring fractional Advection-Dispersion equations with computational methods: Caputo operator and Mohand techniques. AIMS Mathematics, 2025, 10(1): 234-269. doi: 10.3934/math.2025012
    [3] Shabir Ahmad, Aman Ullah, Ali Akgül, Fahd Jarad . A hybrid analytical technique for solving nonlinear fractional order PDEs of power law kernel: Application to KdV and Fornberg-Witham equations. AIMS Mathematics, 2022, 7(5): 9389-9404. doi: 10.3934/math.2022521
    [4] Abdul Samad, Imran Siddique, Fahd Jarad . Meshfree numerical integration for some challenging multi-term fractional order PDEs. AIMS Mathematics, 2022, 7(8): 14249-14269. doi: 10.3934/math.2022785
    [5] Mamta Kapoor, Nehad Ali Shah, Wajaree Weera . Analytical solution of time-fractional Schrödinger equations via Shehu Adomian Decomposition Method. AIMS Mathematics, 2022, 7(10): 19562-19596. doi: 10.3934/math.20221074
    [6] Abdul Samad, Imran Siddique, Zareen A. Khan . Meshfree numerical approach for some time-space dependent order partial differential equations in porous media. AIMS Mathematics, 2023, 8(6): 13162-13180. doi: 10.3934/math.2023665
    [7] M. S. Alqurashi, Saima Rashid, Bushra Kanwal, Fahd Jarad, S. K. Elagan . A novel formulation of the fuzzy hybrid transform for dealing nonlinear partial differential equations via fuzzy fractional derivative involving general order. AIMS Mathematics, 2022, 7(8): 14946-14974. doi: 10.3934/math.2022819
    [8] Asif Khan, Tayyaba Akram, Arshad Khan, Shabir Ahmad, Kamsing Nonlaopon . Investigation of time fractional nonlinear KdV-Burgers equation under fractional operators with nonsingular kernels. AIMS Mathematics, 2023, 8(1): 1251-1268. doi: 10.3934/math.2023063
    [9] Muhammad Imran Liaqat, Sina Etemad, Shahram Rezapour, Choonkil Park . A novel analytical Aboodh residual power series method for solving linear and nonlinear time-fractional partial differential equations with variable coefficients. AIMS Mathematics, 2022, 7(9): 16917-16948. doi: 10.3934/math.2022929
    [10] Aliaa Burqan, Mohammed Shqair, Ahmad El-Ajou, Sherif M. E. Ismaeel, Zeyad AlZhour . Analytical solutions to the coupled fractional neutron diffusion equations with delayed neutrons system using Laplace transform method. AIMS Mathematics, 2023, 8(8): 19297-19312. doi: 10.3934/math.2023984
  • In this paper, we introduce a new fixed point iterative scheme called the AG iterative scheme that is used to approximate the fixed point of a contraction mapping in a uniformly convex Banach space. The iterative scheme is used to prove some convergence result. The stability of the new scheme is shown. Furthermore, weak convergence of Suzuki's generalized non-expansive mapping satisfying condition (C) is shown. The rate of convergence result is proved and it is demonstrated via an illustrative example which shows that our iterative scheme converges faster than the Picard, Mann, Noor, Picard-Mann, M and Thakur iterative schemes. Data dependence results for the iterative scheme are shown. Finally, our result is used to approximate the solution of a nonlinear fractional differential equation of Caputo type.



    Mathematical methods have been used to represent a variety of real-world issues. For example, we can approximate a body's speed for a given distance and time by using the concept of rate of change. Specifically, we use the notion of differential calculus. Many complicated phenomena, such as chaos, solitons, asymptotic properties, singular formation, and others, are either poorly projected or have not yet been discovered [1,2,3]. Furthermore, the notion of calculus with differential operators and integrals is essential for describing physical phenomena and divining natural events connected to variation and changes. However, while researching issues with hereditary characteristics or memory, numerous researchers found numerous shortcomings and restrictions in integer-order calculus [4,5]. Later, new operators defined with the aid of fractional-order were proposed by mathematicians and physicists. Many researchers are drawn to fractional calculus (FC) while looking at different models [6,7,8].

    In many branches of physical science and engineering, fractional calculus, which deals with arbitrary order derivatives and integrals, is crucial [9]. Fractional calculus and its applications have developed rapidly in the last few years [10,11]. Significant issues in acoustics, fluid mechanics, electromagnetic, analytical chemistry, signal processing, biology, and many other engineering and physical science branches are modeled by nonlinear and linear partial differential equations (PDEs) [12]. Both nonlinear and linear FDEs have been solved analytically and numerically in recent years using a variety of techniques, including the Yang-Laplace transform [13], the Adomian decomposition method [14], the homotopy analysis method [15], and the Laplace decomposition method [16]. Furthermore, nonlinear and linear FDEs are also subjected to the local fractional variational iteration approach [17,18], the fractional complex transform method [19], the modified Laplace decomposition approach [16,20], and the cylindrical-coordinate method [21].

    Mathematical models known as fractional partial differential equations (FPDEs) depict physical processes that exhibit complicated dynamics and non-local effects. FPDEs represent an expansion of the traditional theory of partial differential equations. They enable non-integer orders of differentiation, which more accurately capture the non-local and nonlinear characteristics of an extensive range of physical systems [22,23]. These formulas are being used more and more frequently in several fields, such as biology, engineering, economics, and physics. These formulas are valuable resources for constructing intricate systems and examining the behavior of those operations. This article explores the concept of fractional-order partial differential equations, their applications, and the challenges associated with their analysis and numerical solution [24,25,26].

    In 2013, Al-Smadi proposed the Residual Power Series Method (RPSM) [27]. It is generated from the residual error function mixed with the Taylor series. The solution to the problem is an infinite convergence series [28,29,30]. Many DEs have inspired fresh RPSM algorithms [31,32,33]. Among these DEs are several Boussinesq DEs, fuzzy DEs, and KdV Burger's equation, among many others. These systems are built to generate exact and efficient approximations. We provide a technique to investigate the approximation of solutions to fractional PDEs and systems of PDEs using RPSM in the Mohand transform (MT) formulation. The computational series finds the exact solution after a few iterations [34,35,36,37].

    The computational complexity and effort necessary to implement the methods that were previously discussed are among the most significant constraints. The Mohand distinguishes our work transform iterative methodology (MTIM), which we developed as an iterative approach to addressing fractional PDEs and systems of PDEs. This technique is highly effective in reducing the amount of computational work and complexity necessary due to integrating the MT with the new iterative process.

    In this study, the Mohand residual power series method (MRPSM) and MTIM are used to solve fractional PDEs and systems of PDEs. The numerical values produced by these techniques are more precise when compared to those of other numerical procedures. This study includes a comparison study of the numerical data. A strong indicator of the efficacy and reliability of these methods is the fact that the results of the many approaches presented are compatible with one another. The attractiveness of fractional-order derivatives grows in direct correlation with their worth. Because of this, the algorithms can withstand spikes in computational error, are easy to use, and are quick and accurate. Discovering this will make solving many partial differential equations much easier for mathematicians.

    The portions that follow will cover the basic elements and ideas of the MT, providing the foundation for this operation.

    Definition 2.1. The MT of the function P(t) is defined as [38]

    M[P(t)]=R(s)=s2t0P(t)estdt,  k1sk2.

    The inverse Mohand transform (IMT) is defined as

    M1[R(s)]=P(t).

    Definition 2.2. ([39]). The derivative of fractional-order in the framework of MT is defined as

    M[PF(t)]=sFR(s)n1k=0Pk(0)sk(F+1), 0<Fn.

    Definition 2.3. The properties of MT are given as follows:

    (1) M[P(t)]=sR(s)s2R(0).

    (2) M[P(t)]=s2R(s)s3R(0)s2R(0).

    (3) M[Pn(t)]=snR(s)sn+1R(0)snR(0)snRn1(0).

    Lemma 2.4. Suppose there exists a function represented by P(R,t), having exponential order. M[R(s)]=P(R,t) denotes the MT in this case:

    M[DrFtP(R,t)]=srFR(s)r1j=0sF(rj)1DjFtP(R,0),0<F1, (2.1)

    where R=(R1,R2,,RF)RF, FN, and DrFt=DFt.DFt..DFt(rtimes).

    Proof. To validate Eq (2.4), we use the induction method. Taking r=1 in Eq (2.4):

    M[D2FtP(R,t)]=s2FR(s)s2F1P(R,0)sF1DFtP(R,0).

    Equation (2.4) is true for r=1 on the basis of Definition 2.2. Now, put r=2 in Eq (2.4) to obtain the following outcome:

    M[D2FrP(R,t)]=s2FR(s)s2F1P(R,0)sF1DFtP(R,0). (2.2)

    We obtain the next result from the LHS of Eq (2.2):

    L.H.S=M[D2FtP(R,t)]. (2.3)

    We may also write Eq (2.3) as

    L.H.S=M[DFtDFtP(R,t)]. (2.4)

    Assume

    z(R,t)=DFtP(R,t). (2.5)

    Putting Eq (2.5) in Eq (2.4),

    L.H.S=M[DFtz(R,t)]. (2.6)

    Using the derivative of Caputo, Eq (2.6) becomes

    L.H.S=M[J1Fz(R,t)]. (2.7)

    Applying the RL integral on Eq (2.7),

    L.H.S=M[z(R,t)]s1F. (2.8)

    The derivative property of MT is applied on Eq (2.8) to obtain the following result:

    L.H.S=sFZ(R,s)z(R,0)s1F. (2.9)

    Using Eq (2.5), we obtain

    Z(R,s)=sFR(s)P(R,0)s1F.

    As M[z(t,R)]=Z(R,s), we can write Eq (2.9) as

    L.H.S=s2FR(s)P(R,0)s12FDFtP(R,0)s1F. (2.10)

    Assume that Eq (2.4) is true for r=K. Taking r=K in Eq (2.4),

    M[DKFtP(R,t)]=sKFR(s)K1j=0sF(Kj)1DjFtDjFtP(R,0), 0<F1. (2.11)

    Next, we will have to show that Eq (2.4) for r=K+1 holds. Taking r=K+1 in Eq (2.4),

    M[D(K+1)FtP(R,t)]=s(K+1)FR(s)Kj=0sF((K+1)j)1DjFtP(R,0). (2.12)

    From the left-hand side of Eq (2.12), we derive

    L.H.S=M[DKFt(DKFt)]. (2.13)

    Letting DKFt=g(R,t), Eq (2.13) gives us

    L.H.S=M[DFtg(R,t)]. (2.14)

    Applying Caputo's derivative and the RL integral on Eq (2.14),

    L.H.S=sFM[DKFtP(R,t)]g(R,0)s1F. (2.15)

    On the basis of Eq (2.11), we can write Eq (2.15) as

    L.H.S=srFR(s)r1j=0sF(rj)1DjFtP(R,0). (2.16)

    Equation (2.16) can also be written as

    L.H.S=M[DrFtP(R,0)].

    Using mathematical induction, Eq (2.4) is true for r=K+1. Hence, it is proved that for all positive integers, Eq (2.4) holds.

    Lemma 2.5. Let assume that there exists an exponential-order function P(R,t). M[P(R,t)]=R(s) denotes the MT of P(R,t). The multiple fractional power series (MFPS) in MT is given as

    R(s)=r=0r(R)srF+1,s>0, (2.17)

    where, R=(s1,R2,,RF)RF, FN.

    Proof. Let us consider the Taylor series

    P(R,t)=0(R)+1(R)tFΓ[F+1]++2(R)t2FΓ[2F+1]+. (2.18)

    MT is subjected to Eq (2.18) to obtain

    M[P(R,t)]=M[0(R)]+M[1(R)tFΓ[F+1]]+M[1(R)t2FΓ[2F+1]]+.

    Utilizing the features of MT, we derive

    M[P(R,t)]=0(R)1s+1(R)Γ[F+1]Γ[F+1]1sF+1+2(R)Γ[2F+1]Γ[2F+1]1s2F+1.

    Thus, a new Taylor series form is obtained.

    Lemma 2.6. If M[P(R,t)]=R(s) denotes MT, then the new Taylor series form in MFPS is given as

    0(R)=limssR(s)=P(R,0). (2.19)

    Proof. Assume the Taylor's series

    0(R)=sR(s)1(R)sF2(R)s2F. (2.20)

    When the limit in Eq (2.19) is calculated and simplified, we get Eq (2.20).

    In this part, we construct the framework of the proposed method for the solution of fractional PDEs.

    Step 1. Let us assume the fractional PDE

    DFtP(R,t)+K(R)N(P)δ(R,P)=0. (3.1)

    Step 2. Applying the MT on both sides of Eq (3.1),

    M[DFtP(R,t)+K(R)N(P)δ(R,P)]=0. (3.2)

    On the basis of Lemma 2.4, we derive

    R(s)=q1j=0DjtP(R,0)sjF+1K(R)Y(s)sjF+F(R,s)sjF, (3.3)

    where, M[δ(R,P)]=F(R,s),M[N(P)]=Y(s).

    Step 3. The subsequent result is derived from Eq (3.3):

    R(s)=r=0r(R)srF+1, s>0.

    Step 4. To obtain series form solution use the following procedure step by step:

    0(R)=limssR(s)=P(R,0).

    Subsequently, we obtain

    1(R)=DFtP(R,0),2(R)=D2FtP(R,0),w(R)=DwFtP(R,0).

    Step 5. To obtain R(s) as a Kth truncated series, we use

    RK(s)=Kr=0r(R)srF+1, s>0,
    RK(s)=0(R)s+1(R)sF+1++w(R)swF+1+Kr=w+1r(R)srF+1.

    Step 6. The Mohand residual function (MRF) from (3.3) is solved separately from the Kth-truncated Mohand residual function

    MRes(R,s)=R(s)q1j=0DjtP(R,0)sjF+1+K(R)Y(s)sjFF(R,s)sjF,

    and

    MResK(R,s)=RK(s)q1j=0DjtP(R,0)sjF+1+K(R)Y(s)sjFF(R,s)sjF. (3.4)

    Step 7. In Eq (3.4), use RK(s) in place of its expansion form:

    MResK(R,s)=(0(R)s+1(R)sF+1++w(R)swF+1+Kr=w+1r(R)srF+1)q1j=0DjtP(R,0)sjF+1+K(R)Y(s)sjFF(R,s)sjF. (3.5)

    Step 8. Multiplying sKF+1 with Eq (3.5),

    sKF+1MResK(R,s)=sKF+1(0(R)s+1(R)sF+1++w(R)swF+1+Kr=w+1r(R)srF+1q1j=0DjtP(R,0)sjF+1+K(R)Y(s)sjFF(R,s)sjF). (3.6)

    Step 9. Taking the limit s of Eq (3.6),

    limssKF+1MResK(R,s)=limssKF+1(0(R)s+1(R)sF+1++w(R)swF+1+Kr=w+1r(R)srF+1q1j=0DjtP(R,0)sjF+1+K(R)Y(s)sjFF(R,s)sjF).

    Step 10. The values of K(R) are obtained by solving the following expression:

    lims(sKF+1MResK(R,s))=0,

    where K=1+w,2+w,.

    Step 11. Put K(R) in Eq (3.3).

    Step 12. To determine the required solution, take IMT to obtain RK(s) as PK(R,t).

    Mohand transform iterative method

    Suppose the PDE

    DFtP(R,t)=Υ(P(R,t),DηRP(R,t),D2ηRP(R,t),D3ηRP(R,t)), 0<F,η1, (3.7)

    with IC's

    P(k)(R,0)=hk, k=0,1,2,,m1, (3.8)

    where P(R,t) is a function to be determined and Υ(P(R,t),DηRP(R,t),D2ηRP(R,t),D3ηRP(R,t)) is operator of P(R,t),DηRP(R,t),D2ηRP(R,t) and D3ηRP(R,t). Equation (3.7) is subjected to MT to obtain

    M[P(R,t)]=1sF(m1k=0P(k)(R,0)s1F+k+M[Υ(P(R,t),DηRP(R,t),D2ηRP(R,t),D3ηRP(R,t))]). (3.9)

    The IMT gives us

    P(R,t)=M1[1sF(m1k=0P(k)(R,0)s1F+k+M[Υ(P(R,t),DηRP(R,t),D2ηRP(R,t),D3ηRP(R,t))])]. (3.10)

    The solution via the MTIM technique is represented as

    P(R,t)=i=0Pi. (3.11)

    The decomposition of the operator Υ(P,DηRP,D2ηRP,D3ηRP) is

    Υ(P,DηRP,D2ηRP,D3ηRP)=Υ(P0,DηRP0,D2ηRP0,D3ηRP0)+i=0(Υ(ik=0(Pk,DηRPk,D2ηRPk,D3ηRPk))Υ(i1k=1(Pk,DηRPk,D2ηRPk,D3ηRPk))). (3.12)

    Putting Eqs (3.11) and (3.12) into Eq (3.10), we obtain

    i=0Pi(R,t)=M1[1sF(m1k=0P(k)(R,0)s2F+k+M[Υ(P0,DηRP0,D2ηRP0,D3ηRP0)])]+M1[1sF(M[i=0(Υik=0(Pk,DηRPk,D2ηRPk,D3ηRPk))])]M1[1sF(M[(Υi1k=1(Pk,DηRPk,D2ηRPk,D3ηRPk))])] (3.13)
    P0(R,t)=M1[1sF(m1k=0P(k)(R,0)s2F+k)],P1(R,t)=M1[1sF(M[Υ(P0,DηRP0,D2ηRP0,D3ηRP0)])],Pm+1(R,t)=M1[1sF(M[i=0(Υik=0(Pk,DηRPk,D2ηRPk,D3ηRPk))])]M1[1sF(M[(Υi1k=1(Pk,DηRPk,D2ηRPk,D3ηRPk))])], m=1,2,. (3.14)

    The general solution of Eq (3.7) is given as

    P(R,t)=m1i=0Pi. (3.15)

    Example 4.1. Implementation of MRPSM

    Let us consider the fractional PDE

    DFtP(R,K,Z,t)+2P(R,K,Z,t)R2+2P(R,K,Z,t)K2+2P(R,K,Z,t)Z2=0, where  0<F1. (4.1)

    The initial condition is

    P(R,K,Z,0)=eR+K+Z, (4.2)

    with exact solution

    P(R,K,t)=eR+K+Z3t. (4.3)

    Equation (4.1) is subjected to MT, and using Eq (4.2) we get the following result:

    P(R,K,Z,s)eR+K+Zs+1sF[2P(R,K,Z,s)R2]+1sF[2P(R,K,Z,s)K2]+1sF[2P(R,K,Z,s)Z2]=0. (4.4)

    The kth term's series is represented as

    P(R,K,Z,s)=eR+K+Zs+kr=1fr(R,K,Z,s)srF+1,  r=1,2,3,4. (4.5)

    The residual function of Mohand is given by

    MtRes(R,K,Z,s)=P(R,K,Z,s)eR+K+Zs+1sF[2P(R,K,Z,s)R2]+1sF[2P(R,K,Z,s)K2]+1sF[2P(R,K,Z,s)Z2]=0, (4.6)

    and the kth-MRFs as

    MtResk(R,K,Z,s)=Pk(R,K,Z,s)eR+K+Zs+1sF[2Pk(R,K,Z,s)R2]+1sF[2Pk(R,K,Z,s)K2]+1sF[2Pk(R,K,Z,s)Z2]=0. (4.7)

    Now, we use these steps to find the values of fr(R,K,Z,s) for r=1,2,3,...: Take the rth-Mohand residual function Eq (4.7) for the rth-truncated series Eq (4.5), and then multiply the equation by srF+1 and solve lims(srF+1)MtResP,r(R,K,Z,s))=0 for r=1,2,3,. Using this procedure, we obtain the following terms:

    f1(R,K,Z,s)=3eR+K+Z, (4.8)
    f2(R,K,Z,s)=9eR+K+Z, (4.9)
    f3(R,K,Z,s)=27eR+K+Z, (4.10)

    and so on.

    The values of Eqs (4.9) and (4.10) are inserted in Eq (4.5) to obtain the following result:

    P(R,K,Z,s)=eR+K+Zs3eR+K+ZsF+1+9eR+K+Zs2F+127eR+K+Zs3F+1+. (4.11)

    Using IMT, we obtain the final solution

    P1(R,K,Z,t)=eR+K+Z3tFeR+K+ZΓ(F+1)+9t2FeR+K+ZΓ(2F+1)27t3FeR+K+ZΓ(3F+1). (4.12)

    Implementation of MTIM

    Consider the fractional PDE

    DFtP(R,K,Z,t)=2P(R,K,Z,t)R22P(R,K,Z,t)K22P(R,K,Z,t)Z2, where  0<F1. (4.13)

    The initial condition is

    P(R,K,Z,0)=eR+K+Z. (4.14)

    MT is used on Eq (4.13), giving

    M[DFtP(R,K,Z,t)]=1sF(m1k=0P(k)(R,K,Z,0)s2F+k+M[2P(R,K,Z,t)R22P(R,K,Z,t)K22P(R,K,Z,t)Z2)]). (4.15)

    Applying IMT on Eq (4.15), we obtain

    P(R,K,Z,t)=M1[1sF(m1k=0P(k)(R,K,Z,0)s2F+k+M[2P(R,K,Z,t)R22P(R,K,Z,t)K22P(R,K,Z,t)Z2])]. (4.16)

    Recursively applying the MT, we obtain

    P0(R,K,Z,t)=M1[1sF(m1k=0P(k)(R,K,Z,0)s2F+k)]=M1[P(R,K,Z,0)s2]=eR+K+Z.

    The RL integral is implemented on Eq (4.13), giving

    P(R,K,Z,t)=eR+K+Z+M[2P(R,K,Z,t)R22P(R,K,Z,t)K22P(R,K,Z,t)Z2]. (4.17)

    By using MTIM approach, we obtain the following terms:

    P0(R,K,Z,t)=eR+K+Z, (4.18)
    P1(R,K,Z,t)=3tFeR+K+ZΓ(F+1), (4.19)
    P2(R,K,Z,t)=9t2FeR+K+ZΓ(2F+1), (4.20)
    P3(R,K,Z,t)=27t3FeR+K+ZΓ(3F+1). (4.21)

    The final solution is represented as follows:

    P(R,K,Z,t)=P0(R,K,Z,t)+P1(R,Z,K,t)+P2(R,K,Z,t)+P3(R,K,Z,t)+, (4.22)
    P(R,K,Z,t)=eR+K+Z3tFeR+K+ZΓ(F+1)+9t2FeR+K+ZΓ(2F+1)27t3FeR+K+ZΓ(3F+1)+. (4.23)

    Example 4.2. Implementation of MRPSM

    Consider the system of nonlinear PDEs

    DFtP1(R,t)+3P1(R,t)R33P2(R,t)P2(R,t)R+6P1(R,t)P1(R,t)R=0,DFtP2(R,t)+3P2(R,t)R3+3P1(R,t)P2(R,t)R=0   where   0<F1. (4.24)

    The IC's are given as

    P1(R,0)=4c2ecR(ecR+1)2,P2(R,0)=4c2ecR(ecR+1)2. (4.25)

    Equation (4.24) is subjected to MT, and using Eq (4.25), we get the following result:

    P1(R,s)+4c2ecR(ecR+1)2s+1sF[3P1(R,s)R3]3sFMt[M1tP2(R,s)×M1tP2(R,s)R]+6sFMt[M1tP1(R,s)×M1tP1(R,s)R]=0,P2(R,s)4c2ecR(ecR+1)2s+1sF[3P2(R,s)R3]+3sFMt[M1tP1(R,s)×M1tP2(R,s)R]=0. (4.26)

    The kth term's series is represented as

    P1(R,s)=4c2ecR(ecR+1)2s+kr=1fr(R,s)srF+1,P2(R,s)=4c2ecR(ecR+1)2s+kr=1gr(R,s)srF+1,  r=1,2,3,4. (4.27)

    The residual function of Mohand is given by

    AtRes(R,s)=P1(R,s)+4c2ecR(ecR+1)2s+1sF[3P1(R,s)R3]3sFMt[M1tP2(R,s)×M1tP2(R,s)R]+6sFMt[M1tP1(R,s)×M1tP1(R,s)R]=0,AtRes(R,s)=P2(R,s)4c2ecR(ecR+1)2s+1sF[3P2(R,s)R3]+3sFMt[M1tP1(R,s)×M1tP2(R,s)R]=0, (4.28)

    and the kth-MRFs as

    AtResk(R,s)=P1k(R,s)+4c2ecR(ecR+1)2s+1sF[3P1k(R,s)R3]3sFMt[M1tP2k(R,s)×M1tP2k(R,s)R]+6sFMt[M1tP1k(R,s)×M1tP1k(R,s)R]=0,AtResk(R,s)=P2k(R,s)4c2ecR(ecR+1)2s+1sF[3P2k(R,s)R3]+3sFMt[M1tP1k(R,s)×M1tP2k(R,s)R]=0. (4.29)

    Now, we use these steps to find the values of fr(R,K,Z,s) and gr(R,K,Z,s) for r=1,2,3,...: Put the rth-Mohand residual function Eq (4.29) for the rth-truncated series Eq (4.27), and then multiply the equation by srF+1, and solve MtResP1,r(R,s)=0 and MtResP2,r(R,s)=0 for r=1,2,3,. Using this procedure, we obtain

    f1(R,s)=4c5ecR(ecR1)(ecR+1)3,g1(R,s)=4c5ecR(ecR1)(ecR+1)3, (4.30)
    f2(R,s)=4c8ecR(4ecR+e2cR+1)(ecR+1)4,g2(R,s)=4c8ecR(4ecR+e2cR+1)(ecR+1)4, (4.31)

    and so on.

    The values of Eqs (4.30) and (4.31) are inserted into Eq (4.27) to obtain the following result:

    P1(R,s)=4c2ecRs(ecR+1)2+4c5ecR(ecR1)sF+1(ecR+1)3+4c8ecR(4ecR+e2cR+1)s2F+1(ecR+1)4+,P2(R,s)=4c2ecRs(ecR+1)2+4c5ecR(ecR1)sF+1(ecR+1)3+4c8ecR(4ecR+e2cR+1)s2F+1(ecR+1)4+. (4.32)

    Using IMT, we obtain the final solution:

    P1(R,t)=4c2ecR(ecR+1)2+4c5tFecR(ecR1)Γ(F+1)(ecR+1)3+4c8t2FecR(4ecR+e2cR+1)Γ(2F+1)(ecR+1)4+,P2(R,t)=4c2ecR(ecR+1)2+4c5tFecR(ecR1)Γ(F+1)(ecR+1)3+4c8t2FecR(4ecR+e2cR+1)Γ(2F+1)(ecR+1)4+. (4.33)

    Implementation of MTIM

    Consider the system of nonlinear PDEs

    DFtP1(R,t)=3P1(R,t)R3+3P2(R,t)P2(R,t)R6P1(R,t)P1(R,t)R,DFtP2(R,t)=3P2(R,t)R33P1(R,t)P2(R,t)R,   where   0<F1. (4.34)

    The IC's are given as

    P1(R,0)=4c2ecR(ecR+1)2,P2(R,0)=4c2ecR(ecR+1)2. (4.35)

    MT is used on Eq (4.34), giving

    M[DFtP1(R,t)]=1sF(m1k=0P(k)1(R,0)s2F+k+M[3P1(R,t)R3+3P2(R,t)P2(R,t)R6P1(R,t)P1(R,t)R]),M[DFtP2(R,t)]=1sF(m1k=0P(k)2(R,0)s2F+k+M[3P2(R,t)R33P1(R,t)P2(R,t)R]). (4.36)

    Applying IMT on Eq (4.36), we obtain

    P1(R,t)=M1[1sF(m1k=0P(k)1(R,0)s2F+k+M[3P1(R,t)R3+3P2(R,t)P2(R,t)R6P1(R,t)P1(R,t)R])],P2(R,t)=M1[1sF(m1k=0P(k)2(R,0)s2F+k+M[3P2(R,t)R33P1(R,t)P2(R,t)R])]. (4.37)

    Recursively applying the MT, we obtain

    P10(R,t)=M1[1sF(m1k=0P(k)1(R,0)s2F+k)]=M1[P1(R,0)s2]=4c2ecR(ecR+1)2,
    P20(R,t)=M1[1sF(m1k=0P(k)2(R,0)s2F+k)]=M1[P2(R,0)s2]=4c2ecR(ecR+1)2.

    The RL integral is implemented on Eq (4.34), giving

    P1(R,t)=4c2ecR(ecR+1)2M[3P1(R,t)R3+3P2(R,t)P2(R,t)R6P1(R,t)P1(R,t)R],P2(R,t)=4c2ecR(ecR+1)2M[3P2(R,t)R33P1(R,t)P2(R,t)R]. (4.38)

    By using the MTIM approach, we obtain the following terms:

    P10(R,t)=4c2ecR(ecR+1)2,P11(R,t)=c5tFtanh(cR2)sech2(cR2)Γ(F+1),P12(R,t)=c8t2F(3sech2(cR2)2)(3c3tFΓ(2F+1)2tanh(cR2)sech2(cR2)+Γ(F+1)2Γ(3F+1))Γ(F+1)2Γ(2F+1)Γ(3F+1)(cosh(cR)+1). (4.39)
    P20(R,t)=4c2ecR(ecR+1)2,P21(R,t)=c5tFtanh(cR2)sech2(cR2)Γ(F+1),P22(R,t)=c8t2F(3sech2(cR2)2)(3c3tFΓ(2F+1)2tanh(cR2)sech2(cR2)+Γ(F+1)2Γ(3F+1))Γ(F+1)2Γ(2F+1)Γ(3F+1)(cosh(cR)+1). (4.40)

    The final solution is represented as follows:

    \begin{equation} \begin{split} {\mathfrak{P}}_{1}({{\mathfrak{R}}},{{\mathfrak{t}}}) = {{\mathfrak{P}}_{1}}_{0}({{\mathfrak{R}}},{{\mathfrak{t}}})+{{\mathfrak{P}}_{1}}_{1}({{\mathfrak{R}}},{{\mathfrak{t}}})+{{\mathfrak{P}}_{1}}_{2}({{\mathfrak{R}}},{{\mathfrak{t}}})+\cdots, \end{split} \end{equation} (4.41)
    \begin{equation} \begin{split} {\mathfrak{P}}_{2}({{\mathfrak{R}}},{{\mathfrak{t}}}) = {{\mathfrak{P}}_{2}}_{0}({{\mathfrak{R}}},{{\mathfrak{t}}})+{{\mathfrak{P}}_{2}}_{1}({{\mathfrak{R}}},{{\mathfrak{t}}})+{{\mathfrak{P}}_{2}}_{2}({{\mathfrak{R}}},{{\mathfrak{t}}})+\cdots.\\ \end{split} \end{equation} (4.42)
    \begin{equation} \begin{split} &{\mathfrak{P}}_{1}({{\mathfrak{R}}},{{\mathfrak{t}}}) = \frac{4 c^2 e^{c \mathfrak{R}}}{\left(e^{c \mathfrak{R}}+1\right)^2}+\frac{c^5 {{\mathfrak{t}}}^\mathfrak{F} \tanh \left(\frac{c {{\mathfrak{R}}}}{2}\right) \text{sech}^2\left(\frac{c {{\mathfrak{R}}}}{2}\right)}{\Gamma (\mathfrak{F}+1)}\\&-\frac{c^8 {{\mathfrak{t}}}^{2 \mathfrak{F}} \left(3 \text{sech}^2\left(\frac{c {{\mathfrak{R}}}}{2}\right)-2\right) \left(3 c^3 {{\mathfrak{t}}}^\mathfrak{F} \Gamma (2 \mathfrak{F}+1)^2 \tanh \left(\frac{c {{\mathfrak{R}}}}{2}\right) \text{sech}^2\left(\frac{c {{\mathfrak{R}}}}{2}\right)+\Gamma (\mathfrak{F}+1)^2 \Gamma (3 \mathfrak{F}+1)\right)}{\Gamma (\mathfrak{F}+1)^2 \Gamma (2 \mathfrak{F}+1) \Gamma (3 \mathfrak{F}+1) (\cosh (c {{\mathfrak{R}}})+1)}+\cdots, \end{split} \end{equation} (4.43)
    \begin{equation} \begin{split} &{\mathfrak{P}}_{2}({{\mathfrak{R}}},{{\mathfrak{t}}}) = \frac{4 c^2 e^{c \mathfrak{R}}}{\left(e^{c \mathfrak{R}}+1\right)^2}+\frac{c^5 {{\mathfrak{t}}}^\mathfrak{F} \tanh \left(\frac{c {{\mathfrak{R}}}}{2}\right) \text{sech}^2\left(\frac{c {{\mathfrak{R}}}}{2}\right)}{\Gamma (\mathfrak{F}+1)}\\&-\frac{c^8 {{\mathfrak{t}}}^{2 \mathfrak{F}} \left(3 \text{sech}^2\left(\frac{c {{\mathfrak{R}}}}{2}\right)-2\right) \left(3 c^3 {{\mathfrak{t}}}^\mathfrak{F} \Gamma (2 \mathfrak{F}+1)^2 \tanh \left(\frac{c {{\mathfrak{R}}}}{2}\right) \text{sech}^2\left(\frac{c {{\mathfrak{R}}}}{2}\right)+\Gamma (\mathfrak{F}+1)^2 \Gamma (3 \mathfrak{F}+1)\right)}{\Gamma (\mathfrak{F}+1)^2 \Gamma (2 \mathfrak{F}+1) \Gamma (3 \mathfrak{F}+1) (\cosh (c {{\mathfrak{R}}})+1)}+\cdots.\\ \end{split} \end{equation} (4.44)

    The graphical and tabular results offer a comprehensive evaluation of the effectiveness and accuracy of the MTIM and MRPSM for solving FPDEs.

    Figures 1 and 2 demonstrate the influence of fractional order on the solutions of the equation \mathfrak{P}(\mathfrak{R}, \mathfrak{K}, \mathfrak{Z}, \mathfrak{t}) for specific values of the parameters \mathfrak{K} , \mathfrak{Z} , and \mathfrak{t} . Both 3D and 2D plots highlight the effectiveness of MTIM and MRPSM in accurately capturing the behavior of the solution for varying fractional orders. Figures 3 and 4 provide a comparison between the exact solution and the solutions obtained via MTIM and MRPSM. The close agreement between these solutions demonstrates the reliability of the proposed methods for fractional PDEs. Figures 5 and 6 offer further insights into the effect of fractional order on MRPSM solutions for two distinct cases, \mathfrak{P}{1} and \mathfrak{P}{2} . These plots indicate that MRPSM is highly sensitive to fractional-order variations, which enhances its adaptability for different problems. Figures 7 and 8 depict the results for MTIM in comparison with MRPSM for \mathfrak{P}{1} and \mathfrak{P}{2} under different conditions. The strong correlation between the solutions obtained by the two methods further validates the applicability of both techniques. Figures 9 and 10 show a direct comparison of MRPSM and MTIM for the same fractional order, demonstrating their consistency across both 2D and 3D perspectives. The graphical results affirm that the methods provide nearly identical results, emphasizing their robustness.

    Figure 1.  Graphical comparison of the fractional-order effect on our proposed method's solutions of \mathfrak{P}(\mathfrak{R}, \mathfrak{K}, \mathfrak{Z}, \mathfrak{t}) for \mathfrak{K} = \mathfrak{Z} = 0.1 and \mathfrak{t} = 0.01 in 3D.
    Figure 2.  Graphical comparison of the fractional-order effect on our proposed method's solutions of \mathfrak{P}(\mathfrak{R}, \mathfrak{K}, \mathfrak{Z}, \mathfrak{t}) for \mathfrak{K} = \mathfrak{Z} = 0.1 and \mathfrak{t} = 0.01 in 2D.
    Figure 3.  Graphical depiction of the exact solution and our proposed method's solutions of \mathfrak{P}(\mathfrak{R}, \mathfrak{K}, \mathfrak{Z}, \mathfrak{t}) for \mathfrak{K} = \mathfrak{Z} = 0.1 and \mathfrak{t} = 0.01 in 3D.
    Figure 4.  Graphical depiction of the exact solution and our proposed method's solutions of \mathfrak{P}(\mathfrak{R}, \mathfrak{K}, \mathfrak{Z}, \mathfrak{t}) for \mathfrak{K} = \mathfrak{Z} = 0.1 and \mathfrak{t} = 0.01 in 2D.
    Figure 5.  Graphical comparison of the fractional-order effect on the MRPSM solution of \mathfrak{P}_{1}(\mathfrak{R}, \mathfrak{t}) and \mathfrak{P}_{2}(\mathfrak{R}, \mathfrak{t}) for \mathfrak{t} = 0.1 in 3D.
    Figure 6.  Graphical comparison of the fractional-order effect on the MRPSM solution of \mathfrak{P}_{1}(\mathfrak{R}, \mathfrak{t}) and \mathfrak{P}_{2}(\mathfrak{R}, \mathfrak{t}) for \mathfrak{t} = 0.1 in 2D.
    Figure 7.  Graphical comparison of the fractional-order effect on the MTIM solution of \mathfrak{P}_{1}(\mathfrak{R}, \mathfrak{t}) and \mathfrak{P}_{2}(\mathfrak{R}, \mathfrak{t}) for \mathfrak{t} = 0.1 in 3D.
    Figure 8.  Graphical comparison of the fractional-order effect on the MTIM solution of \mathfrak{P}_{1}(\mathfrak{R}, \mathfrak{t}) and \mathfrak{P}_{2}(\mathfrak{R}, \mathfrak{t}) for \mathfrak{t} = 0.1 in 2D.
    Figure 9.  Graphical comparison of the MRPSM and MTIM solutions for \mathfrak{t} = 0.1 in 3D.
    Figure 10.  Graphical comparison of the MRPSM and MTIM solutions for \mathfrak{t} = 0.1 in 2D.

    Table 1 presents an absolute error comparison for the solutions of example 1 using MTIM and MRPSM. The minimal error values indicate that both methods provide highly accurate solutions, making them practical for solving complex fractional PDEs. Table 2 extends this error comparison to example 2, where both \mathfrak{P}{1} and \mathfrak{P}{2} are evaluated. Once again, the absolute errors are minimal, supporting the precision and reliability of MTIM and MRPSM for different cases. In conclusion, the graphical and tabular results strongly support the efficacy of the proposed methods. MTIM and MRPSM not only simplify the solution process for fractional PDEs, but also provide highly accurate and adaptable solutions. The methods demonstrate strong potential for application in various scientific and engineering fields requiring the analysis of fractional-order systems.

    Table 1.  Absolute error comparison for our proposed method's solutions for \mathfrak{P}(\mathfrak{R}, \mathfrak{K}, \mathfrak{Z}, \mathfrak{t}) for \mathfrak{K} = \mathfrak{Z} = 0.1 .
    \mathfrak{t} \mathfrak{R} MRPSM_{\mathfrak{F}=1} MTIM_{\mathfrak{F}=1} Exact MRPSM\ Error_{\mathfrak{F}=1} MTIM\ Error_{\mathfrak{F}=1}
    0.01 0.10 1.30996440544749 1.30996440544749 1.30996445073324 4.528574915063 \times 10^{-8} 4.528574915063 \times 10^{-8}
    0.35 1.68202759155083 1.68202759155083 1.68202764969888 5.814805303927 \times 10^{-8} 5.814805303927 \times 10^{-8}
    0.60 2.15976617912133 2.15976617912133 2.15976625378491 7.466357798691 \times 10^{-8} 7.466357798691 \times 10^{-8}
    0.85 2.77319466809436 2.77319466809436 2.77319476396429 9.586993199306 \times 10^{-8} 9.586993199306 \times 10^{-8}
    0.03 0.10 1.23367443521972 1.23367443521972 1.23367805995674 3.624737017871 \times 10^{-6} 3.624737017871 \times 10^{-6}
    0.35 1.58406933074002 1.58406933074002 1.58407398499448 4.654254460056 \times 10^{-6} 4.654254460056 \times 10^{-6}
    0.60 2.03398528246572 2.03398528246572 2.03399125864675 5.976181022049 \times 10^{-6} 5.976181022049 \times 10^{-6}
    0.85 2.61168879985479 2.61168879985479 2.61169647342311 7.673568327426 \times 10^{-6} 7.673568327426 \times 10^{-6}
    0.05 0.10 1.16180660244557 1.16180660244557 1.16183424272828 2.764028271173 \times 10^{-5} 2.764028271173 \times 10^{-5}
    0.35 1.49178920681574 1.49178920681574 1.49182469764127 3.549082552645 \times 10^{-5} 3.549082552645 \times 10^{-5}
    0.60 1.91549525789186 1.91549525789186 1.91554082901389 4.557112203484 \times 10^{-5} 4.557112203484 \times 10^{-5}
    0.85 2.45954459667798 2.45954459667798 2.45960311115694 5.851447895999 \times 10^{-5} 5.851447895999 \times 10^{-5}
    0.07 0.10 1.09406933762259 1.09406933762259 1.09417428370521 1.049460826105 \times 10^{-4} 1.049460826105 \times 10^{-4}
    0.35 1.40481283712613 1.40481283712613 1.40494759056359 1.347534374536 \times 10^{-4} 1.347534374536 \times 10^{-4}
    0.60 1.80381538855917 1.80381538855917 1.80398841539785 1.730268386763 \times 10^{-4} 1.730268386763 \times 10^{-4}
    0.85 2.31614480592246 2.31614480592246 2.31636697678109 2.221708586298 \times 10^{-4} 2.221708586298 \times 10^{-4}
    0.10 0.10 0.99957044701003 0.99957044701003 1.00000000000000 4.295529899697 \times 10^{-4} 4.295529899697 \times 10^{-4}
    0.35 1.28347385973080 1.28347385973080 1.28402541668774 5.515569569352 \times 10^{-4} 5.515569569352 \times 10^{-4}
    0.60 1.64801305754867 1.64801305754867 1.64872127070012 7.082131514557 \times 10^{-4} 7.082131514557 \times 10^{-4}
    0.85 2.11609065292577 2.11609065292577 2.11700001661267 9.093636869019 \times 10^{-4} 9.093636869019 \times 10^{-4}

     | Show Table
    DownLoad: CSV
    Table 2.  Absolute error comparison for our proposed method's solutions for {{\mathfrak{P}}_{1}}({\mathfrak{R}}, {\mathfrak{t}}) and {{\mathfrak{P}}_{2}}({\mathfrak{R}}, {\mathfrak{t}}) .
    {\mathfrak{t}} {\mathfrak{R}} MRPSM_{\mathfrak{F}=0.7} MTIM_{\mathfrak{F}=0.7} MRPSM_{\mathfrak{F}=1.0} MTIM_{\mathfrak{F}=1.0} |MRPSM-MTIM|_{\mathfrak{F}=0.7} |MRPSM-MTIM|_{\mathfrak{F}=1.0}
    0.1 0.10 0.2499527853 0.2499526861 0.2499121337 0.2499121276 9.9242792095 \times 10^{-8} 6.0831994996 \times 10^{-8}
    0.35 0.2486293113 0.2486289768 0.2483568594 0.2483568389 3.3452402567 \times 10^{-7} 2.0505029479 \times 10^{-8}
    0.60 0.2454001942 0.2453996649 0.2449043498 0.2449043174 5.2929990035 \times 10^{-7} 3.2444037623 \times 10^{-8}
    0.85 0.2403639798 0.2403633177 0.2396597476 0.2396597070 6.6212486968 \times 10^{-7} 4.0585694638 \times 10^{-8}
    0.3 0.10 0.2499229699 0.2499219730 0.2499903237 0.2499901595 9.9690462096 \times 10^{-7} 1.6424638585 \times 10^{-7}
    0.35 0.2490954767 0.2490921164 0.2488224297 0.2488218760 3.3603301558 \times 10^{-6} 5.5363579581 \times 10^{-7}
    0.60 0.2463478586 0.2463425417 0.2457429414 0.2457420654 5.3168749624 \times 10^{-6} 8.7598901432 \times 10^{-7}
    0.85 0.2417642150 0.2417575638 0.2408460059 0.2408449101 6.6511162011 \times 10^{-6} 1.0958137564 \times 10^{-6}
    0.5 0.10 0.2497783238 0.2497754095 0.2499905839 0.2499898235 2.9143115888 \times 10^{-6} 7.6039993426 \times 10^{-7}
    0.35 0.2493515651 0.2493417416 0.2492122418 0.2492096786 9.8234564366 \times 10^{-6} 2.5631286842 \times 10^{-6}
    0.60 0.2469966017 0.2469810585 0.2465102198 0.2465061643 1.5543142236 \times 10^{-5} 4.0555046959 \times 10^{-6}
    0.85 0.2427855197 0.2427660760 0.2419673860 0.2419623128 1.9443610367 \times 10^{-5} 5.0732118353 \times 10^{-6}
    0.7 0.10 0.2495611717 0.2495552642 0.2499129141 0.2499108276 5.9075153423 \times 10^{-6} 2.0865374195 \times 10^{-6}
    0.35 0.2494909149 0.2494710021 0.2495262957 0.2495192624 1.9912839737 \times 10^{-5} 7.0332251095 \times 10^{-6}
    0.60 0.2474879230 0.2474564159 0.2472061853 0.2471950570 3.1507046666 \times 10^{-5} 1.1128304885 \times 10^{-5}
    0.85 0.2436133438 0.2435739303 0.2430238880 0.2430099671 3.9413570944 \times 10^{-5} 1.3920893276 \times 10^{-5}
    1.0 0.10 0.2491344789 0.2491219850 0.2496502911 0.2496442079 1.2493927289 \times 10^{-5} 6.0831994737 \times 10^{-6}
    0.35 0.2495497378 0.2495076238 0.2498553300 0.2498348249 4.2114079676 \times 10^{-5} 2.0505029473 \times 10^{-5}
    0.60 0.2480300251 0.2479633902 0.2481164215 0.2480839774 6.6634909492 \times 10^{-5} 3.2444037567 \times 10^{-5}
    0.85 0.2446212213 0.2445378648 0.2444869946 0.2444464089 8.3356582432 \times 10^{-5} 4.0585694683 \times 10^{-5}

     | Show Table
    DownLoad: CSV

    In conclusion, this study has demonstrated the efficacy of MTIM and MRPSM in solving fractional-order PDEs and systems of PDEs. By employing the Caputo operator to define fractional derivatives, we have shown that these methods provide a powerful and flexible framework for tackling complex problems in applied mathematics. The results obtained through our examples confirm that MTIM and MRPSM not only simplify the solution process, but also improve the accuracy and reliability of the solutions. These methods hold significant potential for application in various scientific and engineering disciplines, particularly in situations where traditional approaches may fall short. Future work can extend these techniques to more complex and higher-dimensional problems, further establishing their utility in the field of fractional calculus and beyond.

    A.S.A and H.Y Conceptualization, A.M.M; formal analysis, A.S.A. investigation, A.S.A. project administration, A.S.A. validation, visualization, H.Y. writing-review & editing; A.M.M; Data curation, H.Y. resources, A.M.M; validation, H.Y. software, H.Y. visualization, A.M.M; resources, H.Y. project administration, H.Y. writing-review & editing, H.Y. funding. All authors have read and agreed to the published version of the manuscript.

    This work was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2024R183), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia (KFU242276).

    This work was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2024R183), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia (KFU242276).

    The authors declare that they have no conflicts of interest.



    [1] A. Atangana, D. Baleanu, Application of fixed point theorem for stability analysis of a nonlinear Schrodinger with Caputo-Liouville derivative, Filomat, 31 (2017), 2243–2248. https://doi.org/10.2298/FIL1708243A doi: 10.2298/FIL1708243A
    [2] E. Karapinar, T. Abdeljawad, F. Jarad, Applying new fixed point theorems on fractional and ordinary differential equations, Adv. Differ. Equ., 2019 (2019), 421. https://doi.org/10.1186/s13662-019-2354-3
    [3] G. A. Okeke, D. Francis, C. A. Nse, A generalized contraction mapping applied in solving modified implicit \phi-Hilfer pantograph fractional differential equations, J. Anal., 31 (2023), 1143–1173.
    [4] M. Syam, M. Al-Refai, Fractional differential equations with Atangana–Baleanu fractional derivative: Analysis and applications, Chaos Soliton. Fract. X, 2 (2019), 100013. https://doi.org/10.1016/j.csfx.2019.100013 doi: 10.1016/j.csfx.2019.100013
    [5] X. Zhang, P. Chen, Y. Wu, B. Wiwatanapataphee, A necessary and sufficient condition for the existence of entire large solutions to a k-Hessian system, Appl. Math. Lett., 145 (2023), 108745. https://doi.org/10.1016/j.aml.2023.108745 doi: 10.1016/j.aml.2023.108745
    [6] X. Zhang, P. Xu, Y. Wu, B. Wiwatanapataphee, The uniqueness and iterative properties of solutions for a general Hadamard-type singular fractional turbulent flow model, Nonlinear Anal.-Model., 27 (2022), 428–444. https://doi.org/10.15388/namc.2022.27.25473 doi: 10.15388/namc.2022.27.25473
    [7] X. Zhang, J. Jiang, Y. Wu, B. Wiwatanapataphee, Iterative properties of solution for a general singular n-Hessian equation with decreasing nonlinearity, Appl. Math. Lett., 112 (2021), 106826. https://doi.org/10.1016/j.aml.2020.106826 doi: 10.1016/j.aml.2020.106826
    [8] X. Zhang, J. Jiang, L. Liu, Y. Wu, Extremal solutions for a class of tempered fractional turbulent flow equations in a porous medium, Math. Probl. Eng., 2020 (2020), 2492193. https://doi.org/10.1155/2020/2492193
    [9] X. Zhang, L. Liu, Y. Wu, Y. Cui, A sufficient and necessary condition of existenceof blow-up radial solutions for a k-Hessian equationwith a nonlinear operator, Nonlinear Anal.-Model., 25 (2020), 126–143. https://doi.org/10.15388/namc.2020.25.15736 doi: 10.15388/namc.2020.25.15736
    [10] X. Zhang, J. Xu, J. Jiang, Y. Wu, Y. Cui, The convergence analysis and uniqueness of blow-up solutions for a Dirichlet problem of the general k-Hessian equations, Appl. Math. Lett., 102 (2020), 106124. https://doi.org/10.1016/j.aml.2019.106124 doi: 10.1016/j.aml.2019.106124
    [11] J. Wu, X. Zhang, L. Liu, Y. Wu, Y. Cui, The convergence analysis and error estimation for unique solution of a p-Laplacian fractional differential equation with singular decreasing nonlinearity, Bound. Value Probl. 2018 (2018), 82. https://doi.org/10.1186/s13661-018-1003-1
    [12] J. Ali, M. Jubair, F. Ali, Stability and convergence of F iterative scheme with an application to the fractional differential equation, Eng. Comput., 38 (2022), 693–702. https://doi.org/10.1007/s00366-020-01172-y doi: 10.1007/s00366-020-01172-y
    [13] M. Jubair, J. Ali, S. Kumar, Estimating fixed points via new iterative scheme with an application, J. Funct. Space., 2022 (2022), 3740809. https://doi.org/10.1155/2022/3740809 doi: 10.1155/2022/3740809
    [14] J. Ahmad, K. Ullah, H. A. Hammad, R. George, A solution of a fractional differential equation via novel fixed-point approaches in Banach spaces, AIMS Mathematics, 8 (2023), 12657–12670. https://doi.org/10.3934/math.2023636 doi: 10.3934/math.2023636
    [15] S. Khatoon, I. Uddin, D. Baleanu, Approximation of fixed point and its application to fractional to fractional differential equation, J. Appl. Math. Comput., 66 (2021), 507–525. http://doi.org/10.1007/s12190-020-01445-1 doi: 10.1007/s12190-020-01445-1
    [16] M. Kaur, S. Chandok, Convergence and stability of a novel \mathfrak{M}-iterative algorithm with application, Math. Probl. Eng., 2022 (2022), 9327527. https://doi.org/10.1155/2022/9327527
    [17] G. A. Okeke, A. E. Ofem, H. Isik, A faster iterative method for solving nonlinear third-order BVPs based on Green's function, Bound. Value Probl., 2022 (2022), 103. https://doi.org/10.1186/s13661-022-01686-y doi: 10.1186/s13661-022-01686-y
    [18] G. A. Okeke, A. E. Ofem, T. Abdeljawad, M. A. Alqudah, A. Khan, A solution of a nonlinear Volterra integral equation with delay via a faster iteration method, AIMS Mathematics, 8 (2023), 102–124. https://doi.org/10.3934/math.2023005
    [19] S. Panja, K. Roy, M. V. Paunovic, M. Saha, V. Parvaneh, Fixed points of weakly K-nonexpansive mappings and a stability result for fixed point iterative process with an application, J. Inequal. Appl., 2022 (2022), 90. https://doi.org/10.1186/s13660-022-02826-9 doi: 10.1186/s13660-022-02826-9
    [20] I. Uddin, C. Garodia, T. Abdelwajad, N. Mlaiki, Convergence analysis of a novel iteration process with application to a fractional differential equation, Adv. Cont. Discr. Mod., 2022 (2022), 16. https://doi.org/10.1186/s13662-022-03690-z
    [21] K. Ullah, S. T. M. Thabet, A. Kamal, J. Ahmad, Convergence analysis of an iteration process for a class of generalized nonexpansive mappings with application to fractional differential equations, Discrete Dyn. Nat. Soc., 2023 (2023), 8432560. https://doi.org/10.1155/2023/8432560 doi: 10.1155/2023/8432560
    [22] F. A. Khan, Approximating fixed points and the solution of a nonlinear fractional difference equation via an iterative method, J. Math., 2022 (2022), 6962430. https://doi.org/10.1155/2022/6962430 doi: 10.1155/2022/6962430
    [23] T. Suzuki, Fixed point theorems and convergence theorems for some generalized nonexpansive mappings, J. Math. Anal. Appl., 340 (2008), 1088–1095. https://doi.org/10.1016/j.jmaa.2007.09.023 doi: 10.1016/j.jmaa.2007.09.023
    [24] K. Goebel, W. A. Kirk, Topics in metric fixed theory, Cambridge: Cambridge University Press, 1990. https://doi.org/10.1017/CBO9780511526152
    [25] W. Phuengrattana, Approximating fixed points of Suzuki-generalized nonexpansive mappings, Nonlinear Anal.-Hybri., 5 (2011), 583–590. https://doi.org/10.1016/j.nahs.2010.12.006 doi: 10.1016/j.nahs.2010.12.006
    [26] Z. Opial, Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bull. Amer. Math. Soc., 73 (1967), 591–597. https://doi.org/10.1090/S0002-9904-1967-11761-0 doi: 10.1090/S0002-9904-1967-11761-0
    [27] V. Berinde, Picard iteration converges faster than Mann iteration for a class of quasi-contractive operator, Fixed Point Theory Appl., 2004 (2004), 716359, http://doi.org/10.1155/s1687182004311058 doi: 10.1155/s1687182004311058
    [28] A. M. Harder, T. L. Hicks, A stable iteration procedure for nonexpansive mappings, Math. Japon, 33 (1988), 687–692.
    [29] V. Berinde, On the stability of some fixed procedure, Bul. Ştiinţ. Univ. Baia Mare, Ser. B, 18 (2002), 7–14.
    [30] J. Schu, Weak and strong convergence to fixed points of asymptotically nonexpansive mappings, B. Aust. Math. Soc., 43 (1991), 153–159. https://doi.org/10.1017/S0004972700028884 doi: 10.1017/S0004972700028884
    [31] Ş. M. Şultuz, T. Grosan, Data dependence for Ishikawa iteration when dealing with contractive-like operators, Fixed Point Theory Appl., 2008 (2008), 242916. https://doi.org/10.1155/2008/242916 doi: 10.1155/2008/242916
    [32] X. Weng, Fixed point iteration for local strictly pseudo-contractive mapping, P. Am. Math. Soc., 113 (1991), 727–731.
    [33] W. R. Mann, Mean value method in iteration, Proc. Amer. Math. Soc., 4 (1953), 506–510.
    [34] S. H. Khan, A Picard-Mann hybrid iterative process, Fixed Point Theory Appl., 2013 (2013), 69. https://doi.org/10.1186/1687-1812-2013-69 doi: 10.1186/1687-1812-2013-69
    [35] B. S. Thakur, D. Thakur, M. Postolache, A new iterative scheme for numerical reckoning fixed points of Suzuki's generalized nonexpansive mappings, Appl. Math. Comput., 275 (2016), 147–155, http://doi.org/10.1016/j.amc.2015.11.065 doi: 10.1016/j.amc.2015.11.065
    [36] K. Ullah, M. Arshad, Numerical reckoning fixed points for Suzuki's generalized nonexpansive mapping via new iteration process, Filomat, 32 (2018), 187–196. https://doi.org/10.2298/FIL1801187U doi: 10.2298/FIL1801187U
    [37] M. A. Noor, New approximation scheme for general variational inequalities, J. Math. Anal. Appl., 251 (2000), 217–229. https://doi.org/10.1006/jmaa.2000.7042 doi: 10.1006/jmaa.2000.7042
    [38] G. A. Okeke, Convergence of the Picard-Ishikawa hybrid iterative process with applications, Afr. Mat., 30 (2019), 817–835. https://doi.org/10.1007/s13370-019-00686-z doi: 10.1007/s13370-019-00686-z
    [39] M. A. Krasnosel'skii, Two observations about the method of successive approximations, Uspeh Mat. Nauk., 10 (1957), 131–140.
    [40] S. Ishikawa, Fixed points by a new iteration method, P. Am. Math. Soc., 44 (1974), 147–150.
    [41] G. A. Okeke, M. Abbas, A solution of delay differential equation via Picard-Krasnoselskii hybrid iterative process, Arab. J. Math., 6 (2017), 21–29. https://doi.org/10.1007/s40065-017-0162-8 doi: 10.1007/s40065-017-0162-8
    [42] E. Ameer, H. Aydi, H. Işik, M. Nazam, V. Parvaneh, M. Arshad, Some existence results for a system of nonlinear fractional differential equations, J. Math., 2020 (2020), 4786053. https://doi.org/10.1155/2020/4786053 doi: 10.1155/2020/4786053
    [43] S. Kuma, A. Kumar, J. J. Nieto, B. Sharma, Atangana–Baleanu derivative with fractional order applied to the gas dynamics equations, In: Fractional derivatives with Mittag-Leffler Kernel, Springer, 2019,235–251. https://doi.org/10.1007/978-3-030-11662-0_14
    [44] N. A. Sheikh, F. Ali, M. Saqib, I. Khan, S. A. A. Jan, A. S. Alshomrani, et al., Comparison and analysis of the Atangana–Baleanu and Caputo–Fabrizio fractional derivatives for generalized Casson fluid model with heat generation and chemical reaction, Results phys., 7 (2017), 789–800. https://doi.org/10.1016/j.rinp.2017.01.025 doi: 10.1016/j.rinp.2017.01.025
  • This article has been cited by:

    1. Yousef Jawarneh, Humaira Yasmin, Ali M. Mahnashi, A new solitary wave solution of the fractional phenomena Bogoyavlenskii equation via Bäcklund transformation, 2024, 9, 2473-6988, 35308, 10.3934/math.20241678
  • Reader Comments
  • © 2023 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(1794) PDF downloads(88) Cited by(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog