Loading [MathJax]/jax/output/SVG/jax.js
Research article

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

  • Received: 07 August 2023 Revised: 05 September 2023 Accepted: 07 October 2023 Published: 19 October 2023
  • MSC : 34A08, 47J25, 47J26

  • 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] Junaid Ahmad, Kifayat Ullah, Hasanen A. Hammad, Reny George . A solution of a fractional differential equation via novel fixed-point approaches in Banach spaces. AIMS Mathematics, 2023, 8(6): 12657-12670. doi: 10.3934/math.2023636
    [2] Godwin Amechi Okeke, Akanimo Victor Udo, Rubayyi T. Alqahtani, Melike Kaplan, W. Eltayeb Ahmed . A novel iterative scheme for solving delay differential equations and third order boundary value problems via Green's functions. AIMS Mathematics, 2024, 9(3): 6468-6498. doi: 10.3934/math.2024315
    [3] Junaid Ahmad, Kifayat Ullah, Hasanen A. Hammad, Reny George . On fixed-point approximations for a class of nonlinear mappings based on the JK iterative scheme with application. AIMS Mathematics, 2023, 8(6): 13663-13679. doi: 10.3934/math.2023694
    [4] Najat Almutairi, Sayed Saber . Chaos control and numerical solution of time-varying fractional Newton-Leipnik system using fractional Atangana-Baleanu derivatives. AIMS Mathematics, 2023, 8(11): 25863-25887. doi: 10.3934/math.20231319
    [5] Zhongdi Cen, Jian Huang, Aimin Xu, Anbo Le . An iterative method for solving a PDE with free boundary arising from pricing corporate bond with credit rating migration. AIMS Mathematics, 2023, 8(2): 3286-3302. doi: 10.3934/math.2023169
    [6] Adisorn Kittisopaporn, Pattrawut Chansangiam . Approximate solutions of the 2D space-time fractional diffusion equation via a gradient-descent iterative algorithm with Grünwald-Letnikov approximation. AIMS Mathematics, 2022, 7(5): 8471-8490. doi: 10.3934/math.2022472
    [7] Xumei Zhang, Junying Cao . A high order numerical method for solving Caputo nonlinear fractional ordinary differential equations. AIMS Mathematics, 2021, 6(12): 13187-13209. doi: 10.3934/math.2021762
    [8] Hamza Bashir, Junaid Ahmad, Walid Emam, Zhenhua Ma, Muhammad Arshad . A faster fixed point iterative algorithm and its application to optimization problems. AIMS Mathematics, 2024, 9(9): 23724-23751. doi: 10.3934/math.20241153
    [9] Liliana Guran, Khushdil Ahmad, Khurram Shabbir, Monica-Felicia Bota . Computational comparative analysis of fixed point approximations of generalized α-nonexpansive mappings in hyperbolic spaces. AIMS Mathematics, 2023, 8(2): 2489-2507. doi: 10.3934/math.2023129
    [10] Xiaopeng Yi, Chongyang Liu, Huey Tyng Cheong, Kok Lay Teo, Song Wang . A third-order numerical method for solving fractional ordinary differential equations. AIMS Mathematics, 2024, 9(8): 21125-21143. doi: 10.3934/math.20241026
  • 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.



    Fixed point theory is widely becoming an indispensable area of mathematics in its right and the tools involved are used to solve nonlinear problems that sometimes appear unsolvable with the traditional analytical methods [1]. Practically, invoking some tools in fixed point theory have helped to circumvent the challenge encountered while trying to obtain the analytical solution of certain nonlinear problems. The reader can refer to [2]. Ways to address the challenge include the transformation of the nonlinear problem into a fixed point operator equation that is subsequently solved via approximation of the fixed point operator equation by using any suitable fixed point iterative scheme.

    Many physical problems are usually formulated as differential equations (which could be ordinary or partial) and subsequently transformed into an integral equation of any type or kind. It is in this manner that the majority of physical problems have been formulated and represented as fractional differential equations. It is common knowledge through research, that fractional differential equations tend to have wider a range of application to real life situations (see, e.g., [3,4,5,6,7,8,9,10,11] and the references therein). As mentioned in the previous paragraph, it has been observed in several studies that obtaining the analytical solutions of quite a large number of nonlinear problems has been difficult and sometimes, impossible. Therefore, as a measure to circumvent this challenge, many methods including the fixed point method have been adopted by many researchers in an effort to obtain solutions to nonlinear fractional differential equations (NFDEs). Specifically, fixed point iterative schemes have been applied to solve nonlinear differential equations (see, e.g., [3,12,13,14,15,16,17,18,19,20,21,22]

    It is our purpose in this paper to introduce a new fixed point iterative scheme called the AG iterative scheme that approximates the fixed point of a contraction mapping in a uniformly convex Banach space. We use the new scheme to prove some convergence, stability and data dependence results. Also, we show that our scheme converges faster than some existing schemes in literature, and we use a numerical example to substantiate our result. We show that our scheme converges weakly to a fixed point of Suzuki's generalized nonexpansive mapping that satisfies condition (C). As an application, we use the new scheme (2.9) to approximate the solution of an NFDEs of the Caputo type. Our result generalizes and extends many existing results in literature.

    Let X be a Banach space and D be a nonempty, closed and convex subset of X. Assume that N, in this section and elsewhere, is the set of natural numbers and R represents the set of real numbers. The mapping J:DD is called a contraction mapping if it satisfies the following condition:

    JωJνδων (2.1)

    for δ[0,1). If condition (2.1) reduces to

    JωJνων,

    then the mapping J is said to be a nonexpansive mapping having a fixed point pF(J).

    Alternatively, Suzuki in 2008 (see [23]), gave the following definition for a generalized nonexpansive mapping.

    Definition 2.1. [23] Let D be a nonempty closed convex subset of a Banach space X. Let J:DD be a mapping. Then, J is said to satisfy condition (C) if the following condition holds

    12ωJωωνJωJνων (C)

    for all ω,νD.

    Let D be a nonempty closed convex subset of a Banach space X and {un} be a bounded sequence in X. For each uX, we define the following (see, for example, [24])

    (a) asymptotic radius of {un} at u according to R(u,{un})=lim supnuun,

    (b) asymptotic radius of {un} relative to the set D according to

    R(D,{un})=inf{R(u,{un}):uD}and

    (c) asymptotic center of {un} relative to the set X according to

    A(D,{un})={uX:R(u,{un})=R(D,{un})}.

    Remark 2.1. [25] It is obvious that the set A(D,{un}) is a singleton in a uniformly convex Banach space.

    Definition 2.2. [24] A Banach space X is said to satisfy the Opial condition [26] if for each sequence {un} in X, converging weakly to uX, we have

    lim supnunu<lim supnunw (2.2)

    for all wX such that uw.

    Definition 2.3. [27] Let {an}n=0 and {bn}n=0 be two iterative schemes converging respectively to a and b. Suppose that there exists

    limnanabnb=0;

    then, {an}n=0 converges faster to a than {bn}n=0 to b.

    Definition 2.4. [27] Suppose that for two fixed point iterations {un}n=0 and {vn}n=0 converging to the same fixed point y, the error estimates

    unyan,n=0,1,2,,
    vnybn,n=0,1,2,,

    hold, where {an}n=0 and {bn}n=0 are two sequences of positive numbers converging to zero. Furthermore, if {an}n=0 converges faster than {bn}n=0, then {un}n=0 converges faster than {vn}n=0 to a fixed point p.

    Definition 2.5. [28] Let {sn} be any arbitrary sequence in C[0,1]. Then an iterative scheme un+1=f(J,un), converging to a fixed point p, is said to be J-stable, or stable with respect to J, if, for ϵn=sn+1f(J,sn), nN, limnϵn=0 iff limnsn=p.

    Lemma 2.1. [29] If ρ[0,1) is a real number and {ϵn}n=0 is a sequence of positive numbers such that limnϵn=0, then, for any sequence of positive numbers, {sn}n=0 satisfies that sn+1ρsn+ϵn(n=0,1,2,...) such that limnsn=0.

    Lemma 2.2. [30] Let X be a uniformly convex Banach space and {γn}n=0 be any sequence of numbers such that 0<aγnb<1, n1, for a,bR. Let {un}n=0 and {vn}n=0 be sequences in X such that lim supnunφ, lim supnrnφ and lim supnγnun+(1γn)rn=φ for some φ0. Then, limnunrn=0.

    Lemma 2.3. [23] Let J be a self mapping on a uniformly convex subset D of a Banach space X. Suppose that J satisfies condition (C). Then

    ωJν3Jωω+ων

    holds for ω,νD.

    Lemma 2.4. [23] Let J be a mapping on a subset D of a Banach space X with the Opial condition satisfying (2.2). Suppose that J is a Suzuki generalized nonexpansive mapping satisfying condition (C). If {un} converges weakly to p and limnJunun=0, then Jp=p. That is, IJ is demiclosed at zero.

    Lemma 2.5. [31] Let {σn} be a nonnegative sequence for which one assumes that there exists n0N such that for all nn0, we can suppose that the following inequality is satisfied:

    σn+1(1ϖn)σn+ϖnηn

    where ϖn(0,1), nN, n=0ϖn= and ηn0nN. Then,

    0lim supnσnlim supnηn.

    Lemma 2.6. [32] Let σn be a nonnegative sequence satisfying the inequality

    σn+1(1ηn)σn+λn

    with ηn[0,1], j=0ηj= and λn=o(ηn). Then limnσn=0.

    Lemma 2.7. [23] Let D be a nonempty subset of a Banach space X and J:DD. If J is a Suzuki generalized nonexpansive mapping, then for all xD and pF(J), JxJpxp holds.

    Approximation via a fixed point iterative scheme has been adopted by several researchers as a method to approximate several classes of operators. For example, Mann [33], in 1953, introduced the following iterative scheme:

    {t0Dtn+1=(1αn)tn+αnJtn,nN, (2.3)

    where {αn} is a sequence in [0,1].

    Khan [34] and Thakur et al. [35], in 2013 and 2016, respectively constructed the following schemes, called the Picard-Mann hybrid and Thakur iterative schemes:

    {s0Dsn+1=Jtntn=(1αn)sn+αnJsn,nN, (2.4)
    {p0Dpn+1=Jqnqn=J[(1αn)pn+αnrn]rn=(1βn)pn+βnJpn,nN, (2.5)

    where {αn} and {βn} are real sequences in (0,1). Khan proved that (2.4) converges faster than the Picard, Mann and Ishikawa iterative schemes.

    In 2018, Ullah and Arshad [36] introduced the M iterative scheme as follows:

    {m0Dmn+1=Jdndn=Jcncn=(1αn)mn+αnJmn,nN, (2.6)

    where {αn} is a real sequence in [0,1]. The scheme was used to prove weak and strong convergence theorems for Suzuki generalized nonexpansive mappings in the framework of uniformly convex Banach spaces.

    Noor [37], in 2000, introduced an iterative scheme that included both the Mann and the Ishikawa iterative schemes as special cases. The scheme was defined as follows:

    {u0=uDun+1=(1αn)un+αnJwnwn=(1βn)un+βnJynyn=(1γn)un+γnJun,nN, (2.7)

    where {αn}, {βn} and {γn} are real sequences in [0,1].

    Recently in 2019, Okeke [38] introduced the following iterative scheme:

    {x0=xDxn+1=Jvnvn=(1αn)xn+Junun=(1βn)xn+βnJxn,nN, (2.8)

    where {αn} and {βn} are sequences in (0,1) and it was shown that the scheme converges faster than the Picard, Krasnoselskii [39], Mann, Ishikawa [40], Noor, Picard-Mann and Picard-Krasnoselkii [41] iterative schemes.

    Motivated by the aforementioned developments, it is our aim in this paper to introduce a new fixed point iterative scheme that is more efficient than the ones highlighted above and others in literature. To achieve this, the AG fixed point iterative scheme is defined by the sequence {un} as follows:

    {u0=uDun+1=Jvnvn=J[(1αn)wn+αnJwn]wn=(1βn)Jun+βnJxnxn=(1γn)un+γnJun,nN, (2.9)

    where {αn}, {βn} and {γn} are sequences of real numbers in [0,1].

    In this section, we consider and prove the main results of this paper.

    Theorem 3.1. Let D be a nonempty closed convex subset of a Banach space X and J:DD be a contraction mapping satisfying condition (2.1) such that F(J). Suppose that {un}n=0 is an iterative sequence generated by the AG iterative scheme (2.9) satisfying n=0αn=. Then {un}n=0 converges to a unique fixed point p of J.

    Proof. Let pF(J) be a fixed point of a contraction mapping J. The Banach contraction mapping principle guarantees the existence and uniqueness of the fixed point p. So, we want to show that unp as n.

    From (2.1) and (2.9), we have

    xnp=(1γn)un+γnJunp(1γn)unp+γnJunp(1γn)unp+δγnunp=[(1γn)+δγn]unp=[1(1δ)γn]unp. (3.1)

    Using (2.1), (2.9) and (3.1), we have

    wnp=(1βn)Jun+βnJxnp(1βn)Junp+βnJxnpδ(1βn)unp+δβnxnp=δ(1βn)unp+δβn[1(1δ)γn]unp={δ(1βn)+δβn[1(1δ)γn(1δ)]}unpδ[1βnγn(1δ)]unp. (3.2)

    Again, using (2.1), (2.9) and (3.2), we have

    vnp=J[(1αn)wn+αnJwn]pδ[(1αn)wn+αnJwn]pδ{(1αn)wnp+αnJwnp}δ{(1αn)wnp+δαnwnp}=δ{[(1αn)+δαn]wnp}=δ[(1αn)+δαn]wnpδ2[1(1δ)αn][1(1δ)βnγn]unp. (3.3)

    Using (2.1), (2.9) and (3.3), we have

    un+1p=Jvnpδvnpδ3[1(1δ)αn][1(1δ)βnγn]unp.

    Since βn,γn[0,1] and δ(0,1), then

    un+1pδ3[1(1δ)αn]unp.

    Repeating the process, we have

    unpδ3[1(1δ)αn1]un1pun1pδ3[1(1δ)αn2]un2pun2pδ3[1(1δ)αn3]un3pu1pδ3[1(1δ)α0]u0p

    Hence,

    un+1pδ3(n+1)u0pnk=0[1αk(1δ)] (3.4)

    δ[0,1) and αn[0,1]; thus, 1αn(1δ)<1 for all nN.

    It is obvious from classical analysis that 1x=ex for x(0,1). Thus,

    un+1pδ3(n+1)u0pnk=0e(1δ)αkδ3(n+1)u0pn+1e(1δ)k=0αk.

    From the hypothesis of the theorem, k=0αk= such that e(1δ)k=0αk0 as n, that is,

    limnunp=0.

    This completes the proof.

    Theorem 3.2. Let D be a nonempty closed convex subset of a Banach space X and J:DD be a contraction mapping satisfying condition (2.1) with the fixed point pF(J). Let x0D generate the sequence {xn}n=0D, as defined in (2.3), and u0D, given {un}n=0D as defined by (2.9) with real sequences {αn}n=0, {βn}n=0, {γ}n=0[0,1] satisfying n=0αn=. Then, the following statements are equivalent:

    (i) The Mann iterative scheme (2.3) converges to the fixed point pF(J).

    (ii) The AG iterative scheme (2.9) converges to the fixed point pF(J).

    Proof. We shall show that (i) (ii), that is, if the Mann iterative scheme (2.3) converges to a fixed point p, then the AG iterative scheme (2.9) also converges.

    Using (2.3), (2.9) and condition (2.1), we have

    xn+1un+1=(1αn)xn+αnJxnJvn(1αn)xnJvn+αnJxnJvn(1αn)xnJxn+JxnJvn+αnJxnJvn(1αn){xnJxn+JxnJvn}+αnJxnJvn(1αn)xnJxn+δ(1αn)xnvn+αnδxnvn=(1αn)xnJxn+δxnvn, (3.5)
    xnvn=xnJ[(1αn)wn+αnJwn]xnJxn+JxnJ[(1αn)wn+αnJwn]xnJxn+JxnJ[(1αn)wn+αnJwn]xnJxn+δxn(1αn)wnαnJwnxnJxn+δ{(1αn)xnwn+αnxnJwn}xnJxn+δ{(1αn)xnwn+αnxnJxn+JxnJwn}xnJxn+δ{(1αn)xnwn+αnxnJxn+αnδxnwn}xnJxn+δ(1αn)xnwn+δαnxnJwn+αnδ2xnwn=xnJxn+δαnxnJxn+[δ(1αn)+δ2αn]xnwn=xnJxn+δαnxnJxn+δ[1(1δ)αn]xnwn, (3.6)
    xnwn=xn(1βn)JunβnJxn(1βn)xnJun+βnxnJxn(1βn)xnJxn+JxnJun+βnxnJxn(1βn){xnJxn+JxnJun}+βnxnJxnxnJxn+(1βn)JxnJunxnJxn+δ(1βn)xnun. (3.7)

    Putting (3.7) in (3.6), we have

    xnvnxnJxn+δαnxnJxn+δ[1(1δ)αn]{xnJxn+δ(1βn)xnun}xnJxn+δαnxnJxn+δ[1(1δ)αn]xnJxn+δ2[1(1δ)αn](1βn)xnun=δ2(1βn)[1(1δ)αn]xnun+{(1+δαn)+δ[1(1δ)αn]}xnJxn. (3.8)

    Since δ(0,1) and βn[0,1], then for each nN, δ2(1βn)<1 such that (3.8) reduces to

    xnvn[1(1δ)αn]xnun+{(1+δαn)+δ[1(1δ)αn]}xnJxn. (3.9)

    Putting (3.9) in (3.5), we have

    xn+1un+1(1αn)xnJxn+δ{[1(1δ)αn]xnun+{(1+δαn)+δ[1(1δ)αn]}xnJxn}=(1αn)xnJxn+δ[1(1δ)αn]xnun+[δ(1+δαn)+δ2[1(1δ)αn]]xnJxn[1(1δ)αn]xnun+[(1αn)+δ(1+δαn)+δ2[1(1δ)αn]]xnJxn. (3.10)

    Let σn:=xnun, ηn:=αn(1δ)(0,1) and λn:=[(1αn)+δ(1+δαn)+δ2[1(1δ)αn]]xnJxn.

    Using the fact that Jp=p and xnp0 as n, we have that

    xnJxn=xnJp+JpJxnxnJp+JpJxnxnJp+δxnp=(1+δ)xnp;

    thus,

    xnJxn(1+δ)xnp0asn.

    This implies that λn0 as n. By Lemma 2.6, we have that limnxnun=0.

    Since

    unp=unxn+xnpunxn+xnpxnun+xnp,

    we have that unp0 as n.

    Next, we shall show that (ii) (i). Using (2.3), (2.9) and condition (2.1), we have

    un+1xn+1=Jvn(1αn)xnαnJxn(1αn)Jvnxn+αnJvnJxn(1αn)JvnJxn+Jxnxn+αnJvnJxn(1αn)JvnJxn+(1αn)Jxnxn+αnJvnJxnJvnJxn+(1αn)Jxnxnδvnxn+(1αn)Jxnxn, (3.11)
    vnxn=J[(1αn)wn+αnJwn]xnJ[(1αn)wn+αnJwn]Jun+JunxnJ[(1αn)wn+αnJwn]Jun+Junxnδ(1αn)wn+αnJwnun+Junxnδ[1(1δ)αn]{Junun+δβnunxn}+δαnJunun+Junxn. (3.12)

    Combining (3.11) and (3.12), we have

    un+1xn+1(1αn)Jxnxn+δ2[1(1δ)αn]Junun+δ3[1(1δ)αn]βnunxn+δ2αnJunun+δJunxn=δ2[1(1δ)αn+αn]Junun+(1αn)Jxnxn+δJunxn+[1(1δ)αn]βnδ3unxn=[1(1δ)αn]βnδ3unxn+[1δαn]δ2Junun+(1αn)Jxnxn+δJunxn[1(1δ)αn]unxn+[1δαn]δ2Junun+(1αn)Jxnxn+δJunxn.

    Let σn:=unxn, ηn:=(1δ)αn(0,1) and λn:=[δ2δ3αn]Junun+(1αn)Jxnxn+δJunxn.

    Since Jp=p and unp0, as n, then

    Junun=JunJp+Jpunδunp+pun(1+δ)unp;

    thus, Junun0 as n.

    Also, if

    JxnxnJxnJp+Jpxn(1+δ)xnp

    then xnp0 as n; thus, Jxnxn0 as n. Similarly, Junxn0 as n, which is consequent to the fact that

    JunxnJunJp+Jpxnδunp+xnpδunJun+Junp+xnJxn+Jxnpδ{unJun+δunp}+xnJxn+δxnp.

    Thus, from Lemma 2.6, σn=unxn and limnunxn=0.

    Since

    xnpunxn+unp0asn,

    we have that limnxnp=0. Hence, we have completed the proof.

    Theorem 3.3. Let X be a Banach space and J:DD be a contraction mapping satisfying condition (2.1) with δ[0,1). Assume that J has a fixed point pF(J). Let {un}n=0 be a sequence generated by the AG iterative scheme (2.9) satisfying n=0αn=, nN, and that converges to p. Then, the AG iterative scheme is J-stable.

    Proof. Suppose that {sn}n=0X is an arbitrary sequence in D and suppose that the sequence generated by (2.9) is un+1=f(J,un) converging to a unique fixed point p.

    Let ϵn=sn+1f(J,sn). We want to show that limnϵn=0 if and only if limnsnp=0.

    Suppose that limnϵn=0. Using the triangle inequality, we have

    sn+1p=sn+1f(J,sn)+f(J,sn)psn+1f(J,sn)+f(J,sn)pϵn+f(J,sn)pϵn+Jvnpϵn+δvnp, (3.13)
    vnp=J[(1αn)wn+αnJwn]pδ(1αn)wn+αnJwnpδ{(1αn)wnp+αnJwnp}δ(1αn)wnp+αnδ2wnp=[δ(1αn)+αnδ2]wnp, (3.14)
    wnp=(1βn)Jsn+βnJxnp(1βn)Jsnp+βnJxnp(1βn)δsnp+βnδxnp, (3.15)
    xnp=(1γn)sn+γnJsnp(1γn)snp+γnJsnp(1γn)snp+γnδsnp=[(1γn)+γnδ]snp[1(1δ)γn]snp. (3.16)

    Combining (3.13)–(3.16), we have

    sn+1pϵn+{(1βn)δ+βnδ[1(1δ)γn]}[δ2(1αn)+αnδ3]snp.

    Since δ(0,1) and {αn},{βn},{γn}[0,1], then {(1βn)δ+βnδ[1(1δ)γn]}[δ2(1αn)+αnδ3]<1;

    thus,

    sn+1pϵn+snp.

    By Lemma 2.1, we have that limnsnp=0, that is, limnsn=p.

    Conversely, suppose that limnsn=p; then,

    ϵn=sn+1f(J,sn)sn+1p+pf(J,sn)sn+1p+pJvnsn+1p+δvnpsn+1p+δ[δ(1αn)+αnδ2]wnpsn+1p+δ[δ(1αn)+αnδ2]{(1βn)δsnp+βnδxnp}sn+1p+δ[δ(1αn)+αnδ2]{(1βn)δsnp+βnδ[1(1δ)γn]snp}sn+1p+δ[δ(1αn)+αnδ2]{(1βn)δ+βnδ[1(1δ)γn]}snpsn+1p+{δ2[δ(1αn)+αnδ2](1βn)+βnδ2[δ(1αn)+αnδ2][1(1δγn)]}snp.

    By assumption, we have that limnsnp=0. On taking the limit as n, limnϵn=0. Hence, the AG iterative scheme (2.9) is J-stable.

    Before we continue with the next result in this section, it would be necessary to outline the following lemmas, as they will be important in proving subsequent results.

    Lemma 3.1. Let D be a nonempty closed convex subset of a Banach space X and J:DD be a Suzuki generalized nonexpansive mapping satisfying condition (C) with F(J). Let {un}n=0 be a sequence generated by the AG iterative scheme (2.9) for u0D; then, limnunp exists for all pF(J).

    Proof. Let pF(J) and {un}n=0 for all nN. Since J is a Suzuki generalized nonexpansive mapping, by Lemma 2.7, we have that for xD and pF(J), JxJpxp.

    Using (2.9), we have

    xnp=(1γn)un+γnJunp(1γn)unp+γnJunp(1γn)unp+γnunp=unp; (3.17)

    using (2.9) and (3.17), we have

    wnp=(1βn)Jun+βnJxnp(1βn)Junp+βnJxnp(1βn)unp+βnxnp=unp (3.18)

    and

    vnp=J[(1αn)wn+αnJwn]p[(1αn)wn+αnJwn]p(1αn)wnp+αnJwnp=wnpunp. (3.19)

    And using (3.19) and (2.9), we have

    un+1p=Jvnpvnpunp.

    Hence, {unp} is bounded and a non-increasing sequence for pF(J). Therefore, limnunp exists.

    Lemma 3.2. Let D be a nonempty closed convex subset of a Banach space X. Assume that J:DD is a Suzuki generalized nonexpansive mapping satisfying condition (C). Let {un}n=0 be a sequence generated by the AG iterative scheme (2.9). Then, F(J) if and only if {un} is bounded and limnJunun=0.

    Proof. Suppose that F(J) and pF(J). Then, by Lemma 3.1, we have that limnunp exists and {un}n=0 is bounded.

    Let

    limnunp=φ. (3.20)

    From (3.17), (3.18) and (3.19),

    lim supnxnplim supnunpφ, (3.21)
    lim supnwnplim supnunpφ (3.22)

    and

    lim supnvnplim supnunpφ. (3.23)

    Since J satisfies condition (C), we have that

    Junp=JunJpunp

    and

    lim supnJunplim supunpφ. (3.24)

    Now,

    un+1p=Jvnpvnp.

    Taking the lim inf on both sides, we have

    φ=lim infnun+1plim infnvnp. (3.25)

    Thus, (3.23) and (3.25) will give

    φlim infnvnplim supnvnpφ,
    limnvnp=φ; (3.26)

    again,

    vnp=J[(1αn)wn+αnJwn]p(1αn)wn+αnJwnp(1αn)wnp+αnJwnp=wnp.

    Taking the lim inf on both sides, we have

    φ=lim infnvnplim infnwnp. (3.27)

    Thus, (3.22) and (3.27) will give

    φlim infnwnplim supwnpφ,
    limnwnp=φ (3.28)

    and

    wnp=(1βn)Jun+βnJxnp(1βn)Junp+βnJxnp(1βn)unp+βnxnp=unp+βn(xnpunp). (3.29)

    Obviously,

    wnpunpβn(xnpunp).

    Given that {βn}(0,1) and considering (3.29), it is convenient to have that

    wnpunpwnpunpβnxnpunp,

    which results in

    wnpxnp.

    Taking the lim inf on both sides, we have

    φlim infnwnplim infnxnp. (3.30)

    Thus, using (3.21) and (3.30), we have

    φlim infnxnplim supnxnpφ

    and

    limnxnp=φ. (3.31)

    From (3.31),

    φ=limnxnp=limn(1γn)un+γnJunplimn(1γn)(unp)+γn(Junp).

    Therefore,

    φ=limn(1γn)(unp)+γn(Junp). (3.32)

    Using (3.20), (3.24), (3.32) and Lemma 2.2, we end by stating that limnJunun=0. Conversely, suppose that {un} is bounded and limnunJun=0. We want to show that F(J). Let pA(D,{un}). By Lemma 2.3, we have that

    R(Jp,{un})=lim supnunJp3lim supnJunun+lim supnunp=lim supnunp=R(p,{un}).

    It follows that JpA(D,{un}). By Remark 2.1, we have that Jp=p. Hence the fixed point set F(J) is nonempty.

    At this point, we now consider the weak convergence result for a Suzuki generalized nonexpansive mapping satisfying condition (C).

    Theorem 3.4. Let D be a nonempty closed convex subset of a uniformly convex Banach space X. Let J:DD be a mapping satisfying condition (C). For any arbitrary u0D, the sequence {un}n=0 is generated by the AG iterative scheme (2.9) for n1, where {αn}, {βn} and {γn} are sequences of real numbers in [0,1] such that F(J). Assume that X satisfies the Opial condition (2.2). Then, {un} converges weakly to the fixed point pF(J).

    Proof. From Lemma 3.2, we have that {un} is bounded and limnJunun=0 is subject to the fact that F(J). Since X is uniformly convex, we can say that it is reflexive. By Eberlin's theorem there exists a subsequence {uni} of {un} such that unip1 for some p1D.

    By Lemma 2.4, p1F(J). We want to prove that p1 is a weak limit of {un}, that is, {un} converges weakly to p1. On the contrary, suppose that {un} does not converge weakly to p1; then, we can construct another subsequence {unj} of {un} such that unjp2 for some p2D and p1p2.

    Again by Lemma 2.4, p2F(J). Since limnunp exists for all pF(J), by Lemma 3.2 and Opial condition (2.2), we have

    limnunp1=limiunip1<limiunip2=limnunp2=limjunjp2<limjunjp1=limnunp1,

    which is a contradiction. So p1=p2. This implies that {un} converges weakly to a fixed point of J, thereby completing the proof.

    Theorem 3.5. Let D be a nonempty closed convex subset of a Banach space X and J:DD be a contraction mapping satisfying (2.1) with δ(0,1) such that F(J). If {sn}, {pn}, {mn} and {un} are sequences respectively defined by the Picard-Mann, Thakur, M and AG iterative schemes converging to a fixed point pF(J). Then, the AG iterative scheme is faster than (2.4)–(2.6).

    Proof. From (3.4) in Theorem 3.1, we have that

    un+1pu0pδ3(n+1)nk=0[1αk(1δ)]. (3.33)

    From Picard-Mann iterative scheme (2.4), we have

    sn+1p=Jtnpδtnp, (3.34)
    tnp=(1αn)sn+αnJsnp(1αn)snp+αnJsnp(1αn)snp+αnδsnp=[1αn+αnδ]snp[1(1δ)αn]snp. (3.35)

    Now, by combining (3.34) and (3.35), we have

    sn+1pδ[1(1δ)αn]snp

    such that, by induction, we have

    sn+1pδn+1nk=0[1(1δ)αk]s0p=s0pδn+1[1(1δ)αk]n+1.

    This implies that

    sn+1ps0pδn+1[1(1δ)α]n+1. (3.36)

    From Thakur iterative scheme (2.5), we have

    pn+1p=Jqnpδqnp (3.37)
    qnp=J[(1αn)pn+αnrn]pδ[(1αn)pn+αnrn]pδ{(1αn)pnp+αnrnp} (3.38)
    rnp=(1βn)pn+βnJpnp(1βn)pnp+βnJpnp(1βn)pnp+βnδJpnp={(1βn)+βnδ}pnp=[1(1δ)βn]pnp. (3.39)

    Combining (3.38) and (3.39), we have

    qnpδ(1αn)pnp+δαn[1(1δ)βn]pnp={δ(1αn)+δαn[1(1δ)βn]}pnpδ[1(1δ)αnβn]pnp. (3.40)

    Again, combining (3.37) and (3.40), we have

    pn+1pδ2[1(1δ)αnβn]pnp.

    By induction,

    pn+1pp0pδ2(n+1)nk=0[1(1δ)αkβk]=p0pδ2(n+1)[1(1δ)αkβk]n+1p0pδ2(n+1)[1(1δ)αβ]n+1. (3.41)

    From M iterative scheme (2.6), using the same approach as in (3.34)–(3.40), we have

    mn+1p=Jdnpδdnp, (3.42)
    dnp=Jcnpδcnp (3.43)

    and

    cnp=(1αn)mn+αnJmnp(1αn)mnp+αnJmnp(1αn)mnp+δαnmnp=[(1αn)+δαn]mnp[1(1δ)αn]mnp. (3.44)

    Combining (3.43) and (3.44), we have

    dnpδ[1(1δ)αn]mnp. (3.45)

    Combining (3.42) and (3.45), we have

    mn+1pδ2[1(1δ)αn]mnp.

    Inductively,

    mn+1p=δ2(n+1)nk=0[1(1δ)αk]m0p

    such that

    mn+1p=δ2(n+1)[1(1δ)αk]n+1m0pδ2(n+1)[1(1δ)α]n+1m0p. (3.46)

    From (3.33), (3.36) and (3.46), let

    an=δ3(n+1)[1(1δ)α]n+1u0p
    bn=δn+1[1(1δ)α]n+1s0p
    cn=δ2(n+1)[1(1δ)α]n+1m0p.

    Hence,

    anbn=δ3(n+1)[1(1δ)α]n+1u0pδn+1[1(1δ)α]n+1s0p0asn

    and

    ancn=δ3(n+1)[1(1δ)α]n+1u0pδ2(n+1)[1(1δ)α]n+1m0p0,asn.

    It can be concluded that the AG iterative scheme (2.9) converges to the fixed point p faster than (2.4)–(2.6), thus completing the proof.

    Example 3.1. Let X=R and D=[0,20]X. Let J:DD be a mapping defined by Ju=u29u+54 for all uD. Choose αn=βn=γn=34 for each nN with the initial value u0=10.J is a contraction mapping with contraction constant 9254 and F(J)={6}. Tables 1 and 2 show that the AG fixed point iterative scheme (2.9) converges faster than the Picard-Mann, Mann, Thakur, Picard, Noor and M iterative schemes. Again, Figures 1 and 2 graphically display the fast convergence of the AG iterative scheme.

    Table 1.  Comparison of speed of convergence of some iterative schemes for Example 3.1.
    Step AG Picard-Mann Mann Thakur
    1 10.0000000000 10.0000000000 10.0000000000 10.0000000000
    2 6.0521589007 7.0533679898 8.5000000000 6.4371793563
    3 6.0002097324 6.1515367954 7.4150259924 6.0180141243
    4 6.0000008289 6.0172649142 6.7286051421 6.0006544493
    5 6.0000000033 6.0018971898 6.3488560110 6.0000236518
    6 6.0000000000 6.0002076117 6.1596478250 6.0000008546
    7 6.0000000000 6.0000227088 6.0713292161 6.0000000309
    8 6.0000000000 6.0000024838 6.0315037555 6.0000000011
    9 6.0000000000 6.0000002717 6.0138409699 6.0000000000
    10 6.0000000000 6.0000000297 6.0060666428 6.0000000000
    11 6.0000000000 6.0000000032 6.0026563122 6.0000000000
    12 6.0000000000 6.0000000004 6.0011625500 6.0000000000
    13 6.0000000000 6.0000000000 6.0005086948 6.0000000000
    14 6.0000000000 6.0000000000 6.0002225691 6.0000000000
    15 6.0000000000 6.0000000000 6.0000973769 6.0000000000
    16 6.0000000000 6.0000000000 6.0000426029 6.0000000000
    17 6.0000000000 6.0000000000 6.0000186389 6.0000000000
    18 6.0000000000 6.0000000000 6.0000081545 6.0000000000
    19 6.0000000000 6.0000000000 6.0000035676 6.0000000000
    20 6.0000000000 6.0000000000 6.0000015608 6.0000000000
    21 6.0000000000 6.0000000000 6.0000006829 6.0000000000
    22 6.0000000000 6.0000000000 6.0000002988 6.0000000000

     | Show Table
    DownLoad: CSV
    Table 2.  Comparison of speed of convergence of some iterative schemes for Example 3.1.
    Step AG Picard Noor M
    1 10.0000000000 10.0000000000 10.0000000000 10.0000000000
    2 6.0521589007 8.0000000000 7.5072974202 6.3458402195
    3 6.0002097324 6.7823299831 6.4993253300 6.0105078956
    4 6.0000008289 6.2417169234 6.1587218874 6.0002882471
    5 6.0000000033 6.0649466478 6.0498343531 6.0000078824
    6 6.0000000000 6.0165653001 6.0155875999 6.0000002155
    7 6.0000000000 6.0041627484 6.0048699050 6.0000000059
    8 6.0000000000 6.0010420407 6.0015209084 6.0000000002
    9 6.0000000000 6.0002605950 6.0004749371 6.0000000000
    10 6.0000000000 6.0000651541 6.0001483043 6.0000000000
    11 6.0000000000 6.0000162888 6.0000463091 6.0000000000
    12 6.0000000000 6.0000040722 6.0000144603 6.0000000000
    13 6.0000000000 6.0000010181 6.0000045153 6.0000000000
    14 6.0000000000 6.0000002545 6.0000014099 6.0000000000
    15 6.0000000000 6.0000000636 6.0000004403 6.0000000000
    16 6.0000000000 6.0000000159 6.0000001375 6.0000000000
    17 6.0000000000 6.0000000040 6.0000000429 6.0000000000
    18 6.0000000000 6.0000000010 6.0000000134 6.0000000000
    19 6.0000000000 6.0000000002 6.0000000042 6.0000000000
    20 6.0000000000 6.0000000001 6.0000000013 6.0000000000
    21 6.0000000000 6.0000000000 6.0000000004 6.0000000000
    22 6.0000000000 6.0000000000 6.0000000001 6.0000000000

     | Show Table
    DownLoad: CSV
    Figure 1.  Graph corresponding to Table 1 results.
    Figure 2.  Graph corresponding to Table 2 results.

    Remark 3.1. (1) The graphs in Figures 1 and 2 compare the rate of convergence of various iterative schemes based on the values in Tables 1 and 2 for Example 3.1. The values in Tables 1 and 2 marked in blue indicate the fixed point at each step, and it can be seen that different iterative schemes converge at different steps. Moreover, where there is no such indication implies that the iterative scheme converges at a step beyond 22. Consequently, our iterative scheme converging at Step 6 which is faster than the Picard-Mann (Step 13), Mann (not visible within 22 steps), Picard (Step 21), Noor (not visible within 22 steps), Thakur and M (Step 9) schemes.

    Example 3.2. Let C=[1,6]X=R and J:DD be an operator defined by Ju=u2+1 for all uD. Choose αn=12, βn=13 and γn=14 for each nN with the initial value u0=2.5. J is a contraction mapping and the set of fixed points F(J)={2}. The values obtained via computation of the mapping for various iterative schemes are shown in Tables 3 and 4. And, the corresponding plots for the values are shown in Figure 3, indicating that the AG iterative converges faster than the Picard-Mann, Noor, Mann, Picard, M and Thakur iterative schemes.

    Table 3.  Comparison of the rate of convergence of several iteration processes for Example 2.
    Steps AG Picard-Mann Noor Mann
    1 2.5000000000 2.5000000000 2.5000000000 2.5000000000
    2 2.0449414063 2.2087500000 2.3278906250 2.3750000000
    3 2.0040394600 2.0871531250 2.2150245239 2.2812500000
    4 2.0003630780 2.0363864297 2.1410090511 2.2109375000
    5 2.0000326345 2.0151913344 2.0924710918 2.1582031250
    6 2.0000029333 2.0063423821 2.0606408082 2.1186523438
    7 2.0000002637 2.0026479445 2.0397671050 2.0889892578
    8 2.0000000237 2.0011055168 2.0260785218 2.0667419434
    9 2.0000000021 2.0004615533 2.0171018056 2.0500564575
    10 2.0000000002 2.0001926985 2.0112150435 2.0375423431
    11 2.0000000000 2.0000804516 2.0073546152 2.0281567574
    12 2.0000000000 2.0000335886 2.0048230188 2.0211175680
    13 2.0000000000 2.0000140232 2.0031628453 2.0158381760
    14 2.0000000000 2.0000058547 2.0020741346 2.0118786320
    15 2.0000000000 2.0000024443 2.0013601786 2.0089089740
    16 2.0000000000 2.0000010205 2.0008919796 2.0066817305
    17 2.0000000000 2.0000004261 2.0005849435 2.0050112979
    18 2.0000000000 2.0000001779 2.0003835950 2.0037584734
    19 2.0000000000 2.0000000743 2.0002515544 2.0028188551
    20 2.0000000000 2.0000000310 2.0001649647 2.0021141413
    21 2.0000000000 2.0000000129 2.0001081807 2.0015856060
    22 2.0000000000 2.0000000054 2.0000709429 2.0011892045
    23 2.0000000000 2.0000000023 2.0000465230 2.0008919034
    24 2.0000000000 2.0000000009 2.0000305089 2.0006689275
    25 2.0000000000 2.0000000004 2.0000200072 2.0005016956

     | Show Table
    DownLoad: CSV
    Table 4.  Comparison of the rate of convergence of several iteration processes for Example 2.
    Steps Thakur Picard M
    1 2.5000000000 2.5000000000 2.5000000000
    2 2.1146875000 2.2500000000 2.0937500000
    3 2.0263064453 2.1250000000 2.0175781250
    4 2.0060340409 2.0625000000 2.0032958984
    5 2.0013840581 2.0312500000 2.0006179810
    6 2.0003174683 2.0156250000 2.0001158714
    7 2.0000728193 2.0078125000 2.0000217259
    8 2.0000167029 2.0039062500 2.0000040736
    9 2.0000038312 2.0019531250 2.0000007638
    10 2.0000008788 2.0009765625 2.0000001432
    11 2.0000002016 2.0004882813 2.0000000269
    12 2.0000000462 2.0002441406 2.0000000050
    13 2.0000000106 2.0001220703 2.0000000009
    14 2.0000000024 2.0000610352 2.0000000002
    15 2.0000000006 2.0000305176 2.0000000000
    16 2.0000000001 2.0000152588 2.0000000000
    17 2.0000000000 2.0000076294 2.0000000000
    18 2.0000000000 2.0000038147 2.0000000000
    19 2.0000000000 2.0000019073 2.0000000000
    20 2.0000000000 2.0000009537 2.0000000000
    21 2.0000000000 2.0000004768 2.0000000000
    22 2.0000000000 2.0000002384 2.0000000000
    23 2.0000000000 2.0000001192 2.0000000000
    24 2.0000000000 2.0000000596 2.0000000000
    25 2.0000000000 2.0000000298 2.0000000000

     | Show Table
    DownLoad: CSV
    Figure 3.  Graph corresponding to results listed in Tables 3 and 4.

    Theorem 3.6. Let T be an approximate operator of J satisfying the contraction mapping condition (2.1). Let {un}n=0 be an iterative sequence generated by the AG iterative scheme (2.9) for J and define an iterative sequence {ϑ}n=0 as follows

    {ϑ0=ϑDϑn+1=Tμnμn=T[(1αn)λn+αnTλn]λn=(1βn)Tϑn+βnTθnθn=(1γn)ϑn+γnTϑn,nN, (3.47)

    where {αn}, {βn} and {γn} are real sequences in [0,1] satisfying the following conditions: (a) 12αn for all nN, and (b) n=0αn=. If Jp=p and T˜p=˜p such that limnϑn=˜p, then we have that p˜p9ϵ1δ where ϵ>0 is a fixed constant.

    Proof. Using (2.1), (2.9) and (3.47), we have

    xnθn=(1γn)un+γnJun(1γn)ϑnγnTϑn(1γn)unϑn+γnJunTϑn(1γn)unϑn+γnJunJϑn+JϑnTϑn(1γn)unϑn+γnJunJϑn+γnJϑnTϑn(1γn)unϑn+δγnunϑn+γnϵ=[1(1δ)γn]unϑn+γnϵ, (3.48)
    wnλn=(1βn)Jun+βnJxn(1βn)TϑnβnTθn(1βn)JunTϑn+βnJxnTθn(1βn)JunJϑn+JϑnTϑn+βnJxnJθn+JθnTθn(1βn)JunJϑn+(1βn)JϑnTϑn+βnJxnJθn+βnJθnTθn(1βn)δunϑn+βnδxnθn+(1βn)ϵ+βnϵ; (3.49)

    putting (3.48) in (3.49), we have

    wnλn(1βn)δunϑn+βnδ{[1(1δ)γn]unϑn+γnϵ}+(1βn)ϵ+βnϵ(1βn)δunϑn+βnδ[1(1δ)γn]unϑn+βnγnδϵ+ϵ=[δβnγnδ(1δ)]unϑn+βnγnδϵ+ϵ, (3.50)
    vnμn=J[(1αn)wn+αnJwn]T[(1αn)λn+αnTλn]J[(1αn)wn+αnJwn]J[(1αn)λn+αnTλn]+J[(1αn)λn+αnTλn]T[(1αn)λn+αnTλn]J[(1αn)wn+αnJwn]J[(1αn)λn+αnTλn]+J[(1αn)λn+αnTλn]T[(1αn)λn+αnTλn]δ(1αn)wn+αnJwn(1αn)λnαnTλn+ϵδ{(1αn)wnλn+αnJwnTλn}+ϵδ(1αn)wnλn+δαnJwnTλn+ϵδ(1αn)wnλn+δαnJwnJλn+JλnTλn+ϵδ(1αn)wnλn+δ2αnwnλn+δαnϵ+ϵ=[δ(1αn)+δ2αn]wnλn+δαnϵ+ϵ; (3.51)

    putting (3.50) into (3.51) yields

    vnμn[δ(1αn)+δ2αn]{[δβnγnδ(1δ)]unϑn+βnγnδϵ+ϵ}+δαnϵ+ϵδ[1(1δ)αn][δβnγnδ(1δ)]unϑn+[1(1δ)αn]δ2βnγnϵ+[1(1δ)αn]δ2ϵ+δαnϵ+ϵ. (3.52)

    Again,

    un+1ϑn+1=JvnTμnJvnJμn+JμnTμnJvnJμn+JμnTμnδvnμn+ϵδ2[1(1δ)αn][δβnγnδ(1δ)]unϑn+[1(1δ)αn]δ3βnγnϵ+[1(1δ)αn]δ3ϵ+δ2αnϵ+δϵ+ϵ. (3.53)

    Since δ[0,1) and αn,βn,γn[0,1], nN, then

    δ<1δ2<1δ3[1(1δ)βnγn]<1δ3[1(1δ)αn]βnγn<1δ3[1(1δ)αn]<1,

    and from assumption (a) where 1αnαn, we have that

    un+1ϑn+1[1(1δ)αn]unϑn+αnϵ+4ϵ[1(1δ)αn]unϑn+αnϵ+4(1αn+αn)ϵ[1(1δ)αn]unϑn+αn(1δ)9ϵ(1δ). (3.54)

    Let σn:=unϑn, ϖn:=αn(1δ)(0,1) and ηn:=9ϵ(1δ).

    From Lemma 2.5, it follows that

    0lim supnunϑnlim supn9ϵ1δ.

    From Theorem 3.1, we know that limnun=p. Using this fact alongside the assumption that limnϑn=˜p, we obtain

    p˜p9ϵ1δ.

    This completes the proof.

    The evolution of research involving fractional differential equations has been expansive since its discovery and the relevant significant studies in that area have been attributed to the fact that fractional differential equations have a wide range of applications in different domains. The extent of application of fractional differential equations include, but are not limited to the following areas: fluid flow, signal processing, electronics, biology, robotics, telecommunication systems, electrical networks, diffusive transport, traffic flow, gas dynamics, generalized Casson fluid modeling with heat generation and chemical reaction (see for example, [4,12,42,43,44] and the references therein).

    We want to consider approximation of the solution of an NFDE of the Caputo type by using the AG fixed point iterative scheme (2.9).

    To achieve our aim in this section, we consider the following NFDE of Caputo type with initial conditions:

    {DCDζx(t)+f((t,x(t)))=0,x(0)=x(1)=0,0t0,1<ζ<2, (4.1)

    where DCDζ is a Caputo fractional derivative of order ζ and f:[0,1]×RR is a continuous function.

    Let X=C[0,1] be a Banach space of continuous real functions from [0,1] into R, endowed with the usual supremum norm. The corresponding Green function associated with the NFDE (4.1) is given by

    G(t,s)={1Γ(ζ)(t(1s)ζ1(ts)ζ1)if0st1,t(1s)ζ1Γ(ζ)if0ts1.

    Lemma 4.1. Let X=C[0,1] be a Banach space with the supremum norm . Suppose that f:[0,1]×XX is a continuous function; also, for δ(0,1), assume the following condition:

    (C1):|f(t,g)f(t,h)|δ|gh|holds for allt[0,1]andg,hX.

    Theorem 4.1. Let X=C[0,1] be a Banach space endowed with the supremum norm as in Lemma 4.1. Let {un} be a sequence defined by AG iterative scheme (2.9) for the integral operator J:XX defined by

    J(y(t))=10G(t,s)f(s,y(s))ds,

    t[0,1],yX. Suppose that condition (C1) of Lemma 4.1 is satisfied. Then the sequence defined by the AG iterative scheme (2.9) converges to the solution of problem (4.1).

    Proof. It is obvious to note that yX is a solution of (4.1) if and only if yX is a solution of the integral equation

    y(t)=10G(t,s)f(t,y(s))ds.

    Let x,yX for all t[0,1]. Invoking Lemma 4.1, we have

    |Jy(t)Jz(t)|=|10G(t,s)f(s,y(s))ds10G(t,s)f(s,z(s))ds|10G(t,s)|f(s,y(s))f(s,z(s))|ds10G(t,s){δ|y(s)z(s)|}ds(supt[0,1]10G(t,s)ds)δyzδyz.

    Consequently, JyJzδyz. Therefore, J is a contraction mapping. By Theorem 3.1, the sequence {un}n=0 generated by the AG iterative scheme converges to a fixed point of J; hence, it converges to the solution of the NFDE (4.1).

    We have been able to show that the AG iterative scheme converges faster than the Picard, Mann, Picard-Mann, Thakur, Noor and M iterative schemes through the example given in Section 3, with the results presented in Tables 1 and 2 and Figures 1 and 2. Weak convergence result of AG iterative scheme for a Suzuki generalized nonexpansive mapping was presented. Moreover, the stability and data dependence results have been proved for the new scheme. Finally, the new scheme has been applied to approximate the solution of an NFDE of the Caputo type. Our result has generalized and extended other existing results.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This work was supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) (grant number IMSIU-RG23140).

    The authors wish to thank the editor and the reviewers for their useful comments and suggestions. This work was supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) (grant number IMSIU-RG23140).

    The authors declare no conflict 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 ϕ-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 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. Godwin Amechi Okeke, Akanimo Victor Udo, Rubayyi T. Alqahtani, Melike Kaplan, W. Eltayeb Ahmed, A novel iterative scheme for solving delay differential equations and third order boundary value problems via Green's functions, 2024, 9, 2473-6988, 6468, 10.3934/math.2024315
    2. Godwin Amechi Okeke, Akanimo Victor Udo, Nadiyah Hussain Alharthi, Rubayyi T. Alqahtani, A New Robust Iterative Scheme Applied in Solving a Fractional Diffusion Model for Oxygen Delivery via a Capillary of Tissues, 2024, 12, 2227-7390, 1339, 10.3390/math12091339
    3. Godwin Amechi Okeke, Akanimo Victor Udo, Rubayyi T. Alqahtani, Novel Method for Approximating Fixed Point of Generalized α-Nonexpansive Mappings with Applications to Dynamics of a HIV Model, 2025, 13, 2227-7390, 550, 10.3390/math13040550
    4. Godwin Amechi Okeke, Akanimo Victor Udo, Rubayyi T. Alqahtani, An Efficient Iterative Scheme for Approximating the Fixed Point of a Function Endowed with Condition (Bγ,μ) Applied for Solving Infectious Disease Models, 2025, 13, 2227-7390, 562, 10.3390/math13040562
  • 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(1435) PDF downloads(85) Cited by(4)

Figures and Tables

Figures(3)  /  Tables(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog