Research article

A solution of a nonlinear Volterra integral equation with delay via a faster iteration method

  • Received: 21 May 2022 Revised: 02 September 2022 Accepted: 15 September 2022 Published: 27 September 2022
  • MSC : 34B10, 34B15, 26A33

  • The purpose of this article is to study the convergence, stability and data dependence results of an iterative method for contractive-like mappings. The concept of stability considered in this study is known as w2-stability, which is larger than the simple notion of stability considered by several prominent authors. Some illustrative examples on w2-stability of the iterative method have been presented for different choices of parameters and initial guesses. As an application of our results, we establish the existence, uniqueness and approximation results for solutions of a nonlinear Volterra integral equation with delay. Finally, we provide an illustrative example to support the application of our results. The novel results of this article extend and generalize several well known results in existing literature.

    Citation: Godwin Amechi Okeke, Austine Efut Ofem, Thabet Abdeljawad, Manar A. Alqudah, Aziz Khan. A solution of a nonlinear Volterra integral equation with delay via a faster iteration method[J]. AIMS Mathematics, 2023, 8(1): 102-124. doi: 10.3934/math.2023005

    Related Papers:

    [1] Lale Cona . Convergence and data dependence results of the nonlinear Volterra integral equation by the Picard's three step iteration. AIMS Mathematics, 2024, 9(7): 18048-18063. doi: 10.3934/math.2024880
    [2] 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. AIMS Mathematics, 2023, 8(12): 28488-28516. doi: 10.3934/math.20231458
    [3] Mohammed Shehu Shagari, Qiu-Hong Shi, Saima Rashid, Usamot Idayat Foluke, Khadijah M. Abualnaja . Fixed points of nonlinear contractions with applications. AIMS Mathematics, 2021, 6(9): 9378-9396. doi: 10.3934/math.2021545
    [4] R. T. Matoog, M. A. Abdou, M. A. Abdel-Aty . New algorithms for solving nonlinear mixed integral equations. AIMS Mathematics, 2023, 8(11): 27488-27512. doi: 10.3934/math.20231406
    [5] Austine Efut Ofem, Hüseyin Işik, Godwin Chidi Ugwunnadi, Reny George, Ojen Kumar Narain . Approximating the solution of a nonlinear delay integral equation by an efficient iterative algorithm in hyperbolic spaces. AIMS Mathematics, 2023, 8(7): 14919-14950. doi: 10.3934/math.2023762
    [6] Hawsar Ali Hama Rashid, Mudhafar Fattah Hama . Approximate solutions for a class of nonlinear Volterra-Fredholm integro-differential equations under Dirichlet boundary conditions. AIMS Mathematics, 2023, 8(1): 463-483. doi: 10.3934/math.2023022
    [7] 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
    [8] Pakhshan M. Hasan, Nejmaddin A. Sulaiman, Fazlollah Soleymani, Ali Akgül . The existence and uniqueness of solution for linear system of mixed Volterra-Fredholm integral equations in Banach space. AIMS Mathematics, 2020, 5(1): 226-235. doi: 10.3934/math.2020014
    [9] Choukri Derbazi, Zidane Baitiche, Mohammed S. Abdo, Thabet Abdeljawad . Qualitative analysis of fractional relaxation equation and coupled system with Ψ-Caputo fractional derivative in Banach spaces. AIMS Mathematics, 2021, 6(3): 2486-2509. doi: 10.3934/math.2021151
    [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
  • The purpose of this article is to study the convergence, stability and data dependence results of an iterative method for contractive-like mappings. The concept of stability considered in this study is known as w2-stability, which is larger than the simple notion of stability considered by several prominent authors. Some illustrative examples on w2-stability of the iterative method have been presented for different choices of parameters and initial guesses. As an application of our results, we establish the existence, uniqueness and approximation results for solutions of a nonlinear Volterra integral equation with delay. Finally, we provide an illustrative example to support the application of our results. The novel results of this article extend and generalize several well known results in existing literature.



    Let B be a Banach space and A a nonempty closed convex subset of B. Let F:AA be a mapping. A member mA is called a fixed points of F if Fm=m. We denote the set of all fixed point of F by F(F).

    In [6], Berinde introduced a new class of mappings statisfying

    FmFqγmq+LmFm, (1.1)

    for all m,qA, γ(0,1) and L0.

    The author established that the class of mappings satisfying (1.1) is larger than the class of mappings introduced and studied by Zamfirescu in [41].

    In [15], Imoru and Olantiwo gave a definition of a mapping considered to be generalization of the classes of mappings considered by Berinde [6], Osilike et al. [33] and some other existing contraction-type mappings as follows:

    Definition 1.1. [15] A mapping F:AA is called contractive-like if there exists a constant γ[0,1) and a strictly increasing continuous function ψ:[0,)[0,) with ψ(0)=0 such that

    FmFqγmq+ψ(mFm), (1.2)

    for all m,qA.

    Remark 1.1. If ψ(m)=Lm, then (1.2) reduces to (1.1).

    Problems in so many fields of mathematics and other subjects in sciences can be transformed into an equation for a suitable operator. Furthermore, the existence of a solution to this equation is tantamount to the existence of a fixed point of the suitable operator. Basically, fixed point theory is a nice mixture of functional analysis, topology and geometry. Translating the real-life or theoretical problem into the fixed point problem is a good approach to find the corresponding solution. In general, fixed point theory plays a vital role in almost all areas of applied sciences and engineering such as: economics, game theory, theoretical computer science, biology, chemistry, physics and many more, see e.g. [8,19,20,24,25,26,27,28,29,30,31].

    Proving the existence of a fixed point is an important step in finding a solution of a given problem, but it is also necessary to find the solution of a given problem when it exists. One valuable way of finding the desired fixed point is to utilize iterative method. For this reason, so many iterative methods for approximating the fixed points of different classes of operators have been introduced and studied by so many authors for the past two decades. Some widely used iterative methods in the literature are: Mann [21], Ishikawa [16], Noor [23], S [2], Abbas and Nazir [1], Tharkur [36] and many more.

    Throughout this paper, the set of all natural numbers is denoted by N and the set of real numbers is donted by R. For the sequences {ϑn},{ϖn} and {ϱn} in [0, 1], the following iterative methods are known as Noor, S and M, respectively:

    {m1A,pn=(1ϱn)mn+ϱnFmn,qn=(1ϑn)mn+ϑnFpn,mn+1=(1ϖn)mn+ϖnFqn,nN, (1.3)
    {m1A,qn=(1ϑn)mn+ϑnFmn,mn+1=(1ϖn)Fmn+ϖnFqn,nN, (1.4)
    {m1A,pn=(1ϖn)mn+ϖnFmn,qn=Fpn,mn+1=Fqn,nN. (1.5)

    Very recently, Akutsah et al. [4] introduced the following three steps iterative method:

    {m1A,pn=(1ϑn)mn+ϑnFmn,qn=Fpn,mn+1=F((1ϖn)qn+ϖnFqn),nN, (1.6)

    where {ϑn} and {ϖn} are sequences in [0, 1]. The authors analytically and numerically showed that the iterative method (1.6) converges faster than those of Ullah and Arshad [39], Karakaya et al. [18] and Thakur et al. [37], respectively for contractive-like mappings.

    The preference of an iterative method over another is based on some crucial criteria such as fastness, stability and dependence. Data dependency of fixed points iterative methods has become an area that has attracted many researchers for several decades now. There exists several recent results on data dependency of fixed point, see e.g. [3,5,10,11,14,22,25,32].

    Due to the importance of data dependency in fixed point theory, Akutsah et al. [4] raised the following question:

    Open Question: Is it possible to obtain the data dependence result of the iterative method (1.6) for contractive-like mappings?

    On other hand, a fixed point iterative method is said to be numerically stable if small modifications in the initial data involved in a computation process will produce a small impact on the computed value of the fixed point. The concept of stability was first considered by Ostrowski [34] for Banach contraction mappings. In 1988, Harder and Hicks [12,13] illustrated the importance of studying the stability of various iterative methods.

    Definition 1.2. [12,13] Let {tn} be any sequence in A. Then, an iterative method tn+1=f(F,tn), which converges to fixed point m, is said to be F-stable or stable with respect to F, if for εn=tn+1f(F,tn), nN, we have

    limnεn=0limntn=m.

    In the last few years, many authors have studied the stability of several iterative methods for different classes of operators (see e.g. [11,17,22,25] and the references in them). Very recently, Akutsah et al. [4] established the following convergence and stability results for contractive-like mapping in Banach spaces.

    Theorem 1.1. [4] Let A be a nonempty closed convex subset of a uniformly convex Banach space B. Let F be a mapping satisfying (1.2). Let {mn} be the iterative method defined in (1.6) with sequences {ϑn}, {ϖn}[0,1] such that n=0ϖn=. Then, {mn} converges strongly to a unique fixed point of F.

    Theorem 1.2. [4] Let A be a nonempty closed convex subset of a uniformly convex Banach space B. Let F be a mapping satisfying (1.2). Let {mn} be the iterative method defined by (1.6) with sequences {ϑn} and {ϖn} in [0, 1] such that n=0ϖn=. Then, {mn} is F-stable.

    In 2007, Berinde [8] showed throughout an example that taking an arbitrary sequence {tn} in Definition 1.2 led to an inconsistency. For this reason, Berinde [8] redefined the Definition 1.2 and gave a weaker, but more natural notion of stability known as weak stability. According the author, an approximate sequence of {mn} instead of arbitrary sequence {tn} in Definition 1.2 should be taken.

    In 2012, Timi [38] introduced a wider concept of stability known as weak w2-stability by adopting equivalent sequences instead of arbitrary sequences in Definition 1.2.

    Definition 1.3. [38] Let {mn} be an iterative sequence given by mn+1=f(F,mn). Assume that {mn} converges to an mF(F). Set

    ϵn=tn+1f(F,tn),nN.

    If for any equivalent sequence {tn}A of {mn},

    limnϵn=0implies limntn=m,

    then the iterative sequence {mn} is said to be weak w2-stable with respect to F.

    Motivated by the above results, we prove the strong convergence theorem of the iterative method (1.6) for contractive-like mappings without the necessity of the assumption: n=0ϖn= as considered in [4]. Also, we demonstrate the numerical convergence of (1.6) using a nontrivial example in higher dimensional space. Further, we prove analytically that the iterative method (1.6) is w2-stable and the analytical proof is supported with some illustrative examples. Also, we give an affirmative answer to the open question above which was raised in [4] by showing that the iterative method (1.6) is data dependent for contractive-like mappings. Furthermore, by applying our main results, we establish the existence, uniqueness and approximation results for the solutions of a nonlinear Volterra integral equation with delay. We also provide an example which supports the application of our results.

    This paper is organized as follows: In Section 2, we list some definitions and lemmmas which will be used for further proof. In Section 3, we establish the convergence result of the iterative method (1.6) for contractive-like mappings. A supporting example is also provided. In Section 4, we show that the iterative algorithm (1.6) is weak w2-stable with respect to contractive-like mappings. The analytic result is supported with a numerical example. In Section 5, we prove the data dependence result of the iterative algorithm (1.6). In Section 6, we apply our main results to solve a nonlinear Volterra integral equation with delay and Section 7 gives the conclusion of our artilce.

    In this section, we give some definitions and lemmas that will be useful in proving our main results.

    Definition 2.1. [8] Let {mn} and {tn} be sequences in A. We say that {tn} is an approximate sequence of {mn}, if for any rN, there exists ε(r) such that

    mntnε(r),nr.

    Definition 2.2. [7] Let F, ˜F:AA be two operators. We say that ˜F is an approximate operator for F if for some ε>0, we have

    Fm˜Fmε,mA. (2.1)

    Definition 2.3. [9] Let {mn} and {tn} be sequences in A. We say that these sequences are equivalent if

    limnmntn=0.

    Lemma 2.1. [40] Let {θn} and {λn} be nonnegative real sequences satisfying the following inequalities:

    θn+1(1σn)θn+λn,

    where σn(0,1) for all nN, n=0σn= and limnλnσn=0, then limnθn=0.

    Lemma 2.2. [35] Let {θn} be a nonnegative real sequence such that for all nn0N, the following condition holds:

    θn+1(1σn)θn+σnλn,

    where σn(0,1) for all nN, n=0σn= and λn0 for all nN, then

    0lim supnθnlim supnλn.

    In this section, we will prove a strong convergence result of the iterative method (1.6) for contractive-like mapping by weakening some conditions imposed on the control parameters by Akutsah et al. [4]. We also provide an example in three dimensional space to compare the convergence of various iterative methods.

    Theorem 3.1. Let F be a mapping satisfying (1.2) defined on a nonempty closed convex subset A of a Banach space B with F(F). Let {mn} be the iterative sequence defined by (1.6), then {mn} converges strongly to the unique fixed point of F.

    Proof. From (1.6), for any mF(F), we have

    pnm(1ϑn)mnm+ϑnFmnm=(1ϑn)mnm+ϑnFmFmn(1ϑn)mnm+γϑnmnm+ϑnψ(mFm)=(1(1γ)ϑn)mnm. (3.1)
    qnm=Fpnmγpnmγ(1(1γ)ϑn)mnm. (3.2)
    mn+1m=F((1ϖn)qn+ϖnFqn)mγ(1ϖn)qn+ϖnFqnmγ((1ϖn)qnm+ϖnFqnm)γ((1ϖn)qnm+ϖnγqnm)=γ(1(1γ)ϖn)qnmγ2(1(1γ)ϖn)(1(1γ)ϑn)mnm. (3.3)

    Since {ϑn}, {ϖn}[0,1] and γ[0,1), then it follows that (1(1γ)ϑn)<1 and (1(1γ)ϖn)<1. Hence, (3.3) yields

    mn+1mγ2mnmγ2nm1m. (3.4)

    Taking limit on both sides of the above inequality (3.4), we get limnmnm=0. Indeed, γ[0,1) and so limnγ2n=0.

    Remark 3.1. Clearly, the condition n=0ϖn= on the sequence {ϖn}(0,1) in Theorem 1.1 is superfluous.

    Now we give the following example to validate the analytical proof in Theorem 6.1 and also carry out a numerical experiment to test the efficiency of the iterative method (1.6).

    Example 3.1. Let A=[0,8]×[0,8]×[0,8] be the subset of a Banach space B=R3 with the texicap norm. Let F:AA be defined by

    F(m1,m2,m3)={(m17,m27,m37),if(m1,m2,m3)[0,4)×[0,4)×[0,4),(m114,m214,m314),if(m1,m2,m3)[4,8]×[4,8]×[4,8].

    Clearly, the only fixed point of F is (0,0,0). We will now show that F is a contraction-like mapping. To see this, we define a function ψ:R+R+ by ψ(m)=m12. Clearly, ψ is a strictly increasing and continuous function satisfying ψ(0)=0. We show that

    FmFq=γmq+ψ(mFm), (3.5)

    for all p,qA and γ[0,1). It will be useful to note the following. If m=(m1,m2,m3)[0,4)×[0,4)×[0,4), then

    mFm=(m1,m2,m3)(m17,m27,m37)=(6m17,6m27,6m37)

    and

    ψ(mFm)=ψ((6m17,6m27,6m37))=(m114,m214,m314)=|m114|+|m214|+|m314|. (3.6)

    Similarly, if m=(m1,m2,m3)[4,8]×[4,8]×[4,8], we have

    mFm=(m1,m2,m3)(m114,m214,m314)=(13m114,13m214,13m314)

    and

    ψ(mFm)=ψ((13m114,13m214,13m314))=(13m1168,13m2168,13m3168)=|13m1168|+|13m2168|+|13m3168|. (3.7)

    Next, we consider the following cases:

    Case Ⅰ: If m=(m1,m2,m3),q=(q1,q2,q3)[0,4)×[0,4)×[0,4), then using (3.6), we have

    FmFq=(m17,m27,m37)(q17,q27,q37)=17|m1q1|+17|m2q2|+17|m3q3|=17(m1,m2,m3)(q1,q2,q3)17mq+|m114|+|m214|+|m314|=17mq+ψ(mFm).

    Case Ⅱ: If m=(m1,m2,m3),q=(q1,q2,q3)[4,8]×[4,8]×[4,8], then using (3.7), we get

    FmFq=(m114,m214,m314)(q114,q214,q314)=114|m1q1|+114|m2q2|+114|m3q3|=114(m1,m2,m3)(q1,q2,q3)17mq+|13m1168|+|13m2168|+|13m3168|=17mq+ψ(mFm).

    Case Ⅲ: If m=(m1,m2,m3)[0,4)×[0,4)×[0,4) and q=(q1,q2,q3)[4,8]×[4,8]×[4,8], then using (3.6), we have

    FmFq=(m17,m27,m37)(m114,m214,m314)=(m17q114),(m27q214),(m37q314)=(m114+m114q114),(m214+m214q214),(m314+m314q314)=|m114+m114q114|+|m214+m214q214|+|m314+m314q314||m114|+|m214|+|m314|+|m114q114|+|m214q214|+|m314q314|=114(|m1q1|+|m2q2|+|m3q3|)+ψ(mFm)17(m1,m2,m3)(q1,q2,q3)+ψ(mFm)=17mq+ψ(mFm).

    Case Ⅳ: If m=(m1,m2,m3)[4,8]×[4,8]×[4,8] and q=(q1,q2,q3)[0,4)×[0,4)×[0,4), then using (3.6), we get

    FmFq=(m114,m214,m314)(m17,m27,m37)=(m114q17),(m214q27),(m314q37)=(m17m114q17),(m27m214q27),(m37m314q37)=|m17m114q17|+|m27m214q27|+|m37m314q37||m114|+|m214|+|m314|+|m17q17|+|m27q27|+|m37q37|=17(|m1q1|+|m2q2|+|m3q3|)+ψ(mFm)=17(m1,m2,m3)(q1,q2,q3)+ψ(mFm)=17mq+ψ(mFm).

    So, (3.5) is fulfilled with γ=17. Thus, F is a contractive-like mapping.

    It is worthy mentioning that the above example is more interesting and not as simple as that of Akutsah et al. [4].

    Using MATLAB R2015a, we obtain the following Tables 13 and Figures 13. Clearly, for control sequences ϖn=ϑn=ϱn=0.8 and starting value m0=(2,2.5,3.5), the iterative method (1.6) converges faster than a number of iterative methods. We also notice that M, Thakur and Karakaya iterative methods converge almost at the same rate.

    Table 1.  Convergence behavior of various iterative methods.
    Step Noor Akutsah
    1 (2.000000, 2.500000, 3.500000) (2.000000, 2.500000, 3.500000)
    2 (0.453924, 0.567405, 0.794367) (0.004032, 0.005040, 0.007055)
    3 (0.103024, 0.128779, 0.180291) (0.000008, 0.000010, 0.000014)
    4 (0.023382, 0.029228, 0.040919) (0.000000, 0.000000, 0.000000)
    5 (0.005307, 0.006634, 0.009287) (0.000000, 0.000000, 0.000000)
    6 (0.001204, 0.001506, 0.002108) (0.000000, 0.000000, 0.000000)
    7 (0.000273, 0.000342, 0.000478) (0.000000, 0.000000, 0.000000)
    8 (0.000062, 0.000078, 0.000109) (0.000000, 0.000000, 0.000000)
    9 (0.000014, 0.000018, 0.000025) (0.000000, 0.000000, 0.000000)
    10 (0.000003, 0.000004, 0.000006) (0.000000, 0.000000, 0.000000)
    11 (0.000001, 0.000001, 0.000001) (0.000000, 0.000000, 0.000000)
    12 (0.000000, 0.000000, 0.000000) (0.000000, 0.000000, 0.000000)

     | Show Table
    DownLoad: CSV
    Table 2.  Convergence behavior of various iterative methods.
    Step S Akutsah
    1 (2.000000, 2.500000, 3.500000) (2.000000, 2.500000, 3.500000)
    2 (0.128980, 0.161224, 0.225714) (0.004032, 0.005040, 0.007055)
    3 (0.008318, 0.010397, 0.014556) (0.000008, 0.000010, 0.000014)
    4 (0.000536, 0.000671, 0.000939) (0.000000, 0.000000, 0.000000)
    5 (0.000035, 0.000043, 0.000061) (0.000000, 0.000000, 0.000000)
    6 (0.000002, 0.000003, 0.000004) (0.000000, 0.000000, 0.000000)
    7 (0.000000, 0.000000, 0.000000) (0.000000, 0.000000, 0.000000)

     | Show Table
    DownLoad: CSV
    Table 3.  Convergence behavior of various iterative methods.
    Step Noor M
    1 (2.000000, 2.500000, 3.500000) (2.000000, 2.500000, 3.500000)
    2 (0.012828, 0.016035, 0.022449) (0.004032, 0.005040, 0.007055)
    3 (0.000082, 0.000103, 0.000144) (0.000008, 0.000010, 0.000014)
    4 (0.000001, 0.000001, 0.000001) (0.000000, 0.000000, 0.000000)
    5 (0.000000, 0.000000, 0.000000) (0.000000, 0.000000, 0.000000)

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

    In this section, we prove a stability result and provide some numerical examples to support our analytical proof.

    Theorem 4.1. Let F be a mapping satisfying (1.2) defined on a nonempty closed convex subset A of a Banach space B with F(F)0. Let {mn} be the iterative sequence defined by (1.6), then {mn} is weak w2-stable with respect to F.

    Proof. Let {tn}A be an equivalent sequence of {mn}. Define a sequence {ϵn} in R+ by

    {ϵn=tn+1F((1ϖn)rn+ϖnFrn),rn=Fdn,dn=(1ϑn)tn+ϑnFtn,nN, (4.1)

    where {ϑn} and {ϖn} are sequences in [0, 1]. Let limnϵn=0, then from (1.2), (1.6) and (4.1), we have

    tn+1mtn+1mn+1+mn+1mtn+1F((1ϖn)rn+ϖnFrn)+F((1ϖn)rn+ϖnFrn)mn+1+mn+1m=ϵn+F((1ϖn)qn+ϖnFqn)F((1ϖn)rn+ϖnFrn)+mn+1mϵn+γ(1ϖn)qn+ϖnFqn(1ϖn)rnϖnFrn+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+mn+1mϵn+γ(1ϖn)qnrn+γϖnFqnFrn+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+mn+1mϵn+γ(1ϖn)qnrn+γ2ϖnqnrn+γϖnψ(qnFqn)+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+mn+1m=ϵn+γ(1(1γ)ϖn)qnrn+γϖnψ(qnFqn)+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+mn+1m. (4.2)
    qnrn=FpnFdnγpndn+ψ(pnFpn). (4.3)
    pndn=(1ϑn)mn+ϑnFmn(1ϑn)tnϑnFtn(1ϑn)mntn+ϑnFmnFtn(1ϑn)mntn+γϑnmntn+ϑn(mnFmn)=(1(1γ)ϑn)mntn+ϑnψ(mnFmn). (4.4)

    Using (4.2)–(4.4), we have

    tn+1mϵn+γ2(1(1γ)ϖn)(1(1γ)ϑn)mntn+γ(1(1γ)ϖn)ϑnψ(mnFmn)+(1(1γ)ϖn)ψ(pnFpn)+γϖnψ(qnFqn)+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+mn+1m. (4.5)

    Since {tn}A and its equivalence to {mn} yields limnmntn=0. We have shown in Theorem 3.1 that mnm=0, consequently limnmn+1m=0. This implies that

    mnFmnmnm+FmFmn(1+γ)mnm0,asn.

    Following similar argument as above, we have that

    limnmnFmn=limnpnFpn=limnqnFqn=0. (4.6)

    Since limnmnFmn=ψ(limnmnFmn)=0. It follows that

    limnmnFmn=ψ(limnmnFmn)=limnpnFpn=ψ(limnlimnpnFpn)=limnqnFqn=ψ(limnqnFqn)=0. (4.7)

    Also,

    (1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖsFqn)(1ϖn)qn+ϖnFqnFm+FmF((1ϖn)qn+ϖsFqn)(1ϖn)qnm+γϖnqnm+ϖnψ(qnFqn)+γm((1ϖn)qn+ϖnFqn)(1ϖn)qnm+γϖnqnm+ϖnψ(qnFqn)+γm((1ϖn)qn+ϖnFqn)(1ϖn)qnm+γϖnqnm+ϖnψ(qnFqn)+γ(1ϖn)qnm+γ2ϖnqnm+γϖnψ(qnFqn)=(1+γ)(1(1γ)ϖn)qnm+ϖn(1+γ)ψ(qnFqn)0,asn. (4.8)

    Therefore, from (4.8), we have

    limnψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))=0. (4.9)

    Thus, taking the limit on both sides of (4.5), we get

    limntnm=0. (4.10)

    Hence, {mn} is weak w2-stable with respect to F.

    Now, we furnish the following examples in support of the above claim.

    Example 4.1. Let B=R with the usual norm and A=[0,1] be a subset of B. Define a mapping F:AA by

    Fm=12sinm. (4.11)

    Clearly, zero is the fixed point of F. Now we show that F is a weak contractive-like mapping satisfying (1.2). For this, let γ=12 and given as increasing function ψ:[0,)[0,) with ψ(0)=0, then we obtain

    |FmFq|γ|mq|ψ(|mFm)=12|sinmsinq|12|mq|ψ(|m12sinm|)12|mq|12|mqψ(|2msinm2|)=ψ(|2msinm2|)0.

    The iterative method (1.6) corresponding to the operator F in (4.11) is defined as follows:

    {m1A,pn=(1ϑn)mn+ϑn12sin(mn),qn=12sin(pn),mn+1=12sin((1ϖn)qn+ϖn12sin(qn)),nN, (4.12)

    where {ϑn} and {ϖn} are sequences in [0, 1].

    Let ϑn=ϖn=1n+2. Using MATLAB R2015a, the following Table 4 and Figure 4 are obtained. They show that the iterative method {mn} in (4.12) converges to m=0 for different choices of starting point m1[0,1].

    Table 4.  Convergence behavior of iterative method (1.6) for different choices of starting value m1 in [0, 1].
    Step/Ⅳ 0.2 0.4 0.6 0.8
    1 0.2000000000 0.4000000000 0.6000000000 0.8000000000
    2 0.0344808485 0.0675512472 0.0979783982 0.1248374991
    3 0.0059850135 0.0117182915 0.0169816155 0.0216142376
    4 0.0010390583 0.0020343767 0.0029480484 0.0037521651
    5 0.0001803920 0.0003531901 0.0005118132 0.0006514160
    6 0.0000313181 0.0000613177 0.0000888565 0.0001130930
    7 0.0000054372 0.0000106454 0.0000154265 0.0000196342
    8 0.0000009440 0.0000018482 0.0000026782 0.0000034087
    9 0.0000001639 0.0000003209 0.0000004650 0.0000005918
    10 0.0000000285 0.0000000557 0.0000000807 0.0000001027

     | Show Table
    DownLoad: CSV
    Figure 4.  Graph corresponding to Table 4.

    From the above table and graph, it is evident that limnmn=0=mF(F). On the other hand, we obtain limnmn=limnmn=0. If we take the sequence {tn} as tn=1n+3 for all nN, then we have

    0limnmntnlimnmn+limntn=0,

    which yields limnmntn=0. This implies that the sequences {mn} and {tn} are equivalent.

    Now, we show that (1.6) is weak w2-stable with respect to F.

    ϵn=|tn+1f(F,tn)|=|1n+4(12sin{n+1n+212sin((n+1n+2)(1n+3)+1n+212sin(1n+3))+1n+212sin(12sin((n+1n+2)(1n+3)+1n+212sin(1n+3)))})|.

    Clearly, limnϵn=0. Therefore, the iterative method {mn} is weak w2-stable with respect to F.

    Example 4.2. Let B=R with the usual norm and A=[0,1] be a subset of B. Define a mapping F:AA by

    Fm=m5. (4.13)

    Apparently, zero is the fixed point of F and F satisfies (1.2) with γ=15.

    Now, we show that the iterative sequence {mn}n=0 in (1.6) converges to p=0F(F) for different choices of real sequences in {ϖn},{ϑn} in [0, 1]. Let {m(1)n}n=0,{m(2)n}n=0,{m(3)n}n=0 be the iterative method (1.6) with control parameters (ϖn=ϑn=1n+1), (ϖn=ϑn=12n+1) and (ϖn=1n+2,ϑn=n+12n+1) for all nN, respectively.

    For arbitrary x1[0,1], it follows that

    p(1)n=(145(n+1))mn,q(1)n=15(145(n+1))mn,m(1)n+1=125(185(n+1)+1625(n+1)2)mn=[1(2452+853(n+1)1654(n+1)2)]mn. (4.14)

    Also,

    p(2)n=(145(2n+1))mn,q(2)n=15(145(2n+1))mn,m(2)n+1=125(185(2n+1)+1625(2n+1)2)mn=[1(2452+853(2n+1)1654(2n+1)2)]mn. (4.15)

    Finally,

    p(3)n=(14(n+1)5(2n+1))mn,q(3)n=15(14(n+1)5(2n+1))mn,m(3)n+1=125(145(n+2)4(n+1)5(2n+1)+16(n+1)25(n+2)(2n+1))mn=[1(2452+453(n+2)+4(n+1)53(2n+1)16(n+1)54(n+2)(2n+1))]mn. (4.16)

    From (4.14)–(4.16), set

    σ(1)n=[1(2452+853(n+1)1654(n+1)2)]mn,σ(2)=[1(2452+853(2n+1)1654(2n+1)2)]mn,σ(3)n=[1(2452+453(n+2)+4(n+1)53(2n+1)16(n+1)54(n+2)(2n+1))]mn.

    Then clearly, σ(i)n(0,1) for each i{1,2,3} and nσ(i)n= for each i{1,2,3}. Thus, by Lemma 2.1, we have that limnm(i)n=p=0F(F) for each i{1,2,3}.

    On the other hand, we have limnm(i)=limnm(i)=0 for each i{1,2,3}. Taking the sequence {tn}n=0 to be tn=1n+4 for all nN, then we get

    0limnm(i)tnlimnm(i)+limntn=0,for each i{1,2,3},

    which shows that limnm(i)tn=0 for each i{1,2,3}, in other words, each of {m(i)n}n=0, i{1,2,3} and {tn}n=0={1n+4}n=0 are equivalent sequences.

    Let ϵ(1)n, ϵ(2)n and ϵ(3)n be the corresponding sequences to the iterative algorithms {m(1)n}n=0, {m(2)n}n=0 and {m(3)n}n=0, respectively. Then we have

    ϵ(1)n=|1n+5152(n+4)+853(n+1)(n+4)1654(n+1)2(n+4)|,ϵ(2)n=|1n+5152(n+4)+853(2n+1)(n+4)1654(2n+1)2(n+4)|,ϵ(3)=|15152(n+4)+453(n+2)(n+4)+4(n+1)53(2n+1)(n+4)16(n+1)54(n+2)(2n+1)(n+4)|.

    Obviously, limnϵ(i)n=0 for each i{1,2,3}. Hence, all the iterative sequences {m(i)n}n=0, i{1,2,3} are w2-stable with respect to F.

    In this section, the data dependence result of (1.6) for contractive-like mapping is obtained, hence, giving an affirmative answer to the above open question raised by Akutsah et al. [4].

    Theorem 5.1. Let ˜F be an approximate operator of a mapping F satisfying (1.2). Let {mn} be an iterative method generated by (1.6) for F and define an iterative method as follows:

    {˜m1A,˜pn=(1ϑn)˜mn+ϑn˜F˜mn,˜qn=˜F˜pn,˜mn+1=˜F((1ϖn)˜qn+ϖn˜F˜qn),nN, (5.1)

    where {ϑn} and {ϖn} are sequences in [0,1] satisfying the following conditions:

    (i) 12ϖn,nN,

    (ii) n=0ϖn=.

    If Fm=m and ˜F~m=~m such that limn˜mn=~m, we have

    m~m7ϵ1γ, (5.2)

    where ϵ>0 is a fixed number.

    Proof. Using (1.2), (1.6) and (5.1), we obtain

    pn˜pn(1ϑn)mn˜mn+ϑnFmn˜F˜mn(1ϑn)mn˜mn+ϑn{FmnF˜mn+F˜mn˜F˜mn}(1ϑn)mn˜mn+ϑn{γmn˜mn+ψ(mnFmn)+ϵ}=[1(1γ)ϑn]mn˜mn+ϑnψ(mnFmn)+ϑnϵ. (5.3)
    qn˜qn=Fpn˜F˜pn=FpnF˜pn+F˜pn˜F˜pnFpnF˜pn+F˜pn˜F˜pnγpn˜pn+ψ(pnFpn)+ϵ. (5.4)

    Using (5.3) and (5.4),

    qn˜qn=γ(1(1γ)ϑn)mn˜mn+γϑnψ(mnFmn)+γϑnϵ+ψ(pnFpn)+ϵ. (5.5)
    mn+1˜mn+1=F((1ϖn)qn+ϖnFqn)˜F((1ϖn)˜qn+ϖn˜F˜qn)F((1ϖn)qn+ϖnFqn)F((1ϖn)˜qn+ϖn˜F˜qn)+F((1ϖn)˜qn+ϖn˜F˜qn)˜F((1ϖn)˜qn+ϖn˜F˜qn)γ((1ϖn)qn˜qn+ϖnFqn˜F˜qn)+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+ϵγ((1ϖn)qn˜qn+ϖn(FqnF˜qn+F˜qn˜F˜qn))+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+ϵγ((1ϖn)qn˜qn+γϖnqn˜qn+ϖnψ(qnFqn)+ϖnϵ)+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+ϵγ(1(1γ)ϖn)qn˜qn+γϖnψ(qnFqn)+γϖnϵ+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+ϵ. (5.6)

    Putting (5.5) into (5.6), we obtain

    mn+1˜mn+1γ2(1(1γ)ϖn)(1(1γ)ϑn)mn˜mn+γ2(1(1γ)ϖn)ϑnψ(mnFmn)+γ2ϑnϵγ2ϖnϑnϵ+γ3ϖnϑnϵ+(1(1γ)ϖn)ψ(pnFpn)+γϵγϖnϵ+γ2ϖnϵ+γϖnψ(qnFqn)+γϖnϵ+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+ϵ=γ2(1(1γ)ϖn)(1(1γ)ϑn)mn˜mn+γ2(1(1γ)ϖn)ϑnψ(mnFmn)+γ2ϑnϵ+γ2ϖnϑnϵ(γ1)+(1(1γ)ϖn)ψ(pnFpn)+γϵ+γ2ϖnϵ+γϖnψ(qnFqn)+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+ϵ. (5.7)

    Since ϖn, ϑn [0,1] and γ[0,1), it follows that

    {(1(1γ)ϖn)<1,(1(1γ)ϑn)<1,γ1<0,γ2<1,γ2ϖn,γ2ϖn<1. (5.8)

    From (5.7) and (5.8), we have

    mn+1˜mn+1(1(1γ)ϖn)mn˜mn+ψ(mnFmn)+ψ(pnFpn)+ψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))+ϖnψ(qnFqn)+ϖnϵ+3ϵ. (5.9)

    By our assumption (ⅰ), we have

    1ϖnϖn1=1ϖn+ϖnϖn+ϖn=2ϖn.

    This yields

    mn+1˜mn+1(1(1γ)ϖn)mn˜mn+(1γ)×{2ϖnψ(mnFmn)+2ϖnψ(pnFpn)(1γ)+ϖnψ(qnFqn)+7ϵ(1γ)+2ϖnψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))(1γ)}. (5.10)

    Set

    θn=mn˜mn,σn=(1γ)ϖn(0,1),λn={2ϖnψ(mnFmn)+2ϖnψ(pnFpn)(1γ)+ϖnψ(qnFqn)+7ϵ(1γ)+2ϖnψ((1ϖn)qn+ϖnFqnF((1ϖn)qn+ϖnFqn))(1γ)}.

    From Theorem 3.1, we know that limnmm=m and since Fm=m, then from (4.7), (4.9) and Lemma 2.2, we obtain

    0lim supnmn˜mnlim supn7ϵ(1γ). (5.11)

    Since by Theorem 3.1, we have that limnmn=m and using the hypothesis limn˜mn=~m, it follows from (5.11) that

    m˜m7ϵ(1γ).

    In this section, we discuss an application to nonlinear Volterra integral equation with delay. Consider the integral equation

    m(t)=g(t)+λtaf(t,s,m(s),m(sτ))dstI=[a,b], (6.1)

    with initial function

    m(t)=ϕ(t),t[aτ,a], (6.2)

    where ϕC[aτ,a],R), a,bR and τ>0.

    Let C[a,b] denote the set all of continuous functions defined on [a,b] endowed with infinity norm mp=maxatbm(t)p(t). It is well known that (C[a,b],R),) is a Banach space.

    Theorem 6.1. Let K be a nonempty closed convex subset of a Banach space M=(C([a,b],R),). Let {mn} be the iterative method (1.6) with ϖn,ϑn[0,1]. Let F:KK be the operator defined by

    Fm(t)=g(t)+λtaf(t,s,m(s),m(sτ))dstI=[a,b],λ0.
    Fm(t)=ϕ(t),t[aτ,a].

    Suppose the following assumptions hold:

    (a) g:IR is continuous;

    (b) f:I×I×R×RR is continuous in the sense that there exists a constant Lf>0 such that

    |f(t,s,u1,u2)f(t,s,v1,v2)|Lf(|u1v1|+|u2v2|),

    for all t,sI, ui,viR(i=1,2);

    (d) 2λLf(ba)<1.

    Then, the problem (6.1) with (6.2) has a unique solution, say mC[a,b]. Moreover, if F is a mapping satisfying (1.2). Then, {mn} converges strongly to m.

    Proof. Now, using the contraction principle, we show that F has a fixed point. Note that

    |Fm(t)Fp(t)|=0,m,pC([aτ,a],R),t[aτ,b].

    Next, for any tI, we have

    |Fm(t)Fp(t)|=|g(t)+λtaf(t,s,m(s),m(sτ))dsg(t)λtaf(t,s,p(s),p(sτ))ds|λtaLf{|m(s)p(s)|+|m(sτ)p(sτ)|}dsλtaLf{maxaτsb|m(s)p(s)|+maxaτsb|m(sτ)p(sτ)|}ds=λtaLf{mp+mp}ds2λLf(ba)mp,

    therefore,

    FmFp2λLf(ba)mp.

    From condition (d), the operator F is a contraction and using the contraction principle we deduce that the operator F has a unique fixed point, F(F)={m}, i.e. the problem (6.1) with (6.2) has a unique solution mC[a,b].

    Next, we show that {mn} converges strongly to m. For m,pA, we have

    |Fm(t)Fp(t)||Fm(t)m(t)|+|m(t)Fp(t)|=|Fm(t)m(t)|+|g(t)+λtaf(t,s,m(s),m(sτ))dsg(t)λtaf(t,s,p(s),p(sτ))ds||Fm(t)m(t)|+λtaLf{|m(s)p(s)|+|m(sτ)p(sτ)|}dsmaxaτtb|Fm(t)m(t)|+λtaLf{maxaτsb|m(s)p(s)|+maxaτsb|m(α(s))p(α(s))|}dsmaxaτtb|Fm(t)m(t)|+λtaLf{maxaτd1b|m(d1)p(d1)|+maxaτr1b|m(r1)p(r1)|}ds=Fmm+λtaLf{mp+mp}dsFmm+2λLf(ba)mp, (6.3)

    therefore,

    FmFpFmm+2λLf(ba)mp. (6.4)

    From (6.4), it is clear that F is a mapping satisfying (1.1). Set γ=2λLf(ba), and by assumption (d), we have γ<1. Thus, the operator F is a contractive-like mapping satisfying (1.2) on K with L=1 since for ψ(m)=Lm, (1.2) reduces to (1.1). Taking A=K and B=M, then all the assumptions of Theorem 4.2 are satisfied. Therefore, the sequence {mn} defined by the iterative algorithm (1.6) converges strongly to the unique solution of the problem (6.1) with (6.2).

    In this study, we have proved the strong convergence results of the iterative scheme (1.6) for fixed points of contractive-like mapping under mild conditions. We have presented some interesting and nontrivial examples in three dimensional space to compare the efficiency of the iterative method (1.6) with some existing iterative methods. Also, we have shown analytically and numerically that the iterative method (1.6) is w2-stable for different choices of parameters and initial guesses. Again, our data dependence result gives an affirmative answer to the open question raised by Akutsah et al [4]. As an application of our results, we have established the existence, uniqueness and approximation results for the solutions of a nonlinear Volterra integral equation with delay (6.1) with (6.2).

    The work was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project (No. PNURSP2022R14). The authors A. Khan and T. Abdeljawad would like to thank Prince Sultan University for paying the APC and for the support through the TAS research lab.

    The authors declare no conflicts of interest.



    [1] M. Abbas, T. Nazir, A new faster iteration process applied to constrained minimization and feasibility problems, Mat. Vesnik, 66 (2014), 223–234.
    [2] R. P. Agarwal, D. O'Regan, D. R. Sahu, Iterative construction of fixed points of nearly asymptotically nonexpansive mappings, J. Nonlinear Convex Anal., 8 (2007), 61–79.
    [3] F. Ali, J. Ali, Convergence, stability, and data dependence of a new iterative algorithm with an application, Comput. Appl. Math., 39 (2020), 1–15. https://doi.org/10.1007/s40314-020-01316-2 doi: 10.1007/s40314-020-01316-2
    [4] F. Akutsah, O. K. Narain, K. Afassinou, A. A. Mebawondu, An iterative scheme for fixed point problems, Adv. Math. Sci. J., 10 (2021), 2295–2316. https://doi.org/10.37418/amsj.10.5.2 doi: 10.37418/amsj.10.5.2
    [5] Y. Atalan, V. Karakaya, Iterative solution of functional Volterra-Fredholm integral equation with deviating argument, J. Nonlinear Convex Anal., 18 (2017), 675–684.
    [6] V. Berinde, On the approximation of fixed points of weak contractive mapping, Carpath. J. Math., 19 (2003), 7–22. Available from: https://www.jstor.org/stable/43996763.
    [7] V. Berinde, Picard iteration converges faster than Mann iteration for a class of quasi-contractive operators, Fixed Point Theory Appl., 2004 (2004), 97–105.
    [8] V. Berinde, Iterative approximation of fixed points, Berlin, Heidelberg: Springer, 2007. https://doi.org/10.1007/978-3-540-72234-2
    [9] T. Cardinali, P. Rubbioni, A generalization of the Caristi fixed point theorem in metric spaces, Fixed Point Theory, 11 (2010), 3–10.
    [10] F. Ö. Çeliker, Convergence analysis for a modified SP iterative method, Sci. World J., 2014 (2014), 1–5. https://doi.org/10.1155/2014/840504 doi: 10.1155/2014/840504
    [11] F. Gürsoy, V. Karakaya, A Picard-S hybrid type iteration method for solving a differential equation with retarded argument, 2014.
    [12] A. M. Harder, T. L. Hicks, A stable iteration procedure for nonexpansive mappings, Math. Japon, 33 (1988), 687–692.
    [13] A. M. Harder, T. L. Hicks, Stability results for fixed point iteration procedures, Math. Japon, 33 (1988), 693–706.
    [14] A. Hudson, O. Joshua, A. Adefemi, On modified Picard-S-AK hybrid iterative algorithm for approximating fixed point of Banach contraction map, MathLAB J., 4 (2019), 111–125.
    [15] C. O. Imoru, M. O. Olantiwo, On the stability of Picard and Mann iteration processes, Carpath. J. Math., 19 (2003), 155–160.
    [16] S. Ishikawa, Fixed points by a new iteration method, Proc. Amer. Math. Soc., 44 (1974), 147–150. https://doi.org/10.1090/S0002-9939-1974-0336469-5 doi: 10.1090/S0002-9939-1974-0336469-5
    [17] H. Iqbal, M. Abbas, S. M. Husnine, Existence and approximation of fixed points of multivalued generalized α-nonexpansive mappings in Banach spaces, Numer. Algorithms, 85 (2020), 1029–1049. https://doi.org/10.1007/s11075-019-00854-z doi: 10.1007/s11075-019-00854-z
    [18] V. Karakaya, Y. Atalan, K. Dogan, N. E. H. Bouzara, Some fixed point results for a new three steps iteration process in Banach spaces, Fixed Point Theory, 18 (2017), 625–640. https://doi.org/10.24193/FPT-RO.2017.2.50 doi: 10.24193/FPT-RO.2017.2.50
    [19] E. Karapınar, T. Abdeljawad, F. Jarad, Applying new fixed point theorems on fractional and ordinary differential equations, Adv. Differ. Equ., 2019 (2019), 1–25. https://doi.org/10.1186/s13662-019-2354-3 doi: 10.1186/s13662-019-2354-3
    [20] S. H. Khan, A Picard-Mann hybrid iterative process, Fixed Point Theory Appl., 2013 (2013), 1–10. https://doi.org/10.1186/1687-1812-2013-69 doi: 10.1186/1687-1812-2013-69
    [21] W. R. Mann, Mean value methods in iteration, Proc. Amer. Math. Soc., 4 (1953), 506–510. https://doi.org/10.1090/S0002-9939-1953-0054846-3 doi: 10.1090/S0002-9939-1953-0054846-3
    [22] A. A. Mebawondu, O. T. Mewomo, Fixed point results for a new three steps iteration process, Ann. Univ. Craiova Math. Comput. Sci. Ser., 46 (2019), 298–319.
    [23] M. A. Noor, New approximation schemes 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
    [24] A. E. Ofem, U. E. Udofia, Iterative solutions for common fixed points of nonexpansive mappings and strongly pseudocontractive mappings with applications, Canad. J. Appl. Math., 3 (2021), 18–36.
    [25] A. E. Ofem, D. I. Igbokwe, An efficient iterative method and its applications to a nonlinear integral equation and a delay differential equation in Banach spaces, Turkish J. Ineq., 4 (2020), 79–107.
    [26] A. E. Ofem, D. I. Igbokwe, A new faster four step iterative algorithm for Suzuki generalized nonexpansive mappings with an application, Adv. Theory Nonlinear Anal. Appl., 5 (2021), 482–506.
    [27] A. E. Ofem, H. Ișik, F. Ali, J. Ahmad, A new iterative approximation scheme for Reich-Suzuki-type nonexpansive operators with an application, J. Inequal. Appl., 2022 (2022), 1–26. https://doi.org/101186/s13660-022-02762-8
    [28] A. E. Ofem, U. E. Udofia, D. I. Igbokwe, A robust iterative approach for solving nonlinear Volterra delay integro-differential equations, Ural Math. J., 7 (2021), 59–85. https://doi.org/10.15826/umj.2021.2.005 doi: 10.15826/umj.2021.2.005
    [29] G. A. Okeke, M. Abbas, A solution of delay differential equations 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
    [30] G. A. Okeke, Convergence analysis 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
    [31] G. A. Okeke, M. Abbas, M. de la Sen, Approximation of the fixed point of multivalued quasi-nonexpansive mappings via a faster iterative process with applications, Discrete Dyn. Nat. Soc., 2020 (2020), 1–11. https://doi.org/10.1155/2020/8634050 doi: 10.1155/2020/8634050
    [32] G. A. Okeke, A. E. Ofem, A novel iterative scheme for solving delay differential equations and nonlinear integral equations in Banach spaces, Math. Methods Appl. Sci., 45 (2022), 5111–5134. https://doi.org/10.1002/mma.8095 doi: 10.1002/mma.8095
    [33] M. O. Osilike, A. Udomene, Short proofs of stability results for fixed point iteration procedures for a class of contractive-type mappings, Indian J. Pure Appl. Math., 30 (1999), 1229–1234.
    [34] A. M. Ostrowski, The round-off stability of iterations, Z. Angew. Math. Mech., 47 (1967), 77–81. https://doi.org/10.1002/zamm.19670470202 doi: 10.1002/zamm.19670470202
    [35] Ş. M. Şoltuz, T. Grosan, Data dependence for Ishikawa iteration when dealing with contractive like operators, Fixed Point Theory Appl., 2008 (2008), 1–7. https://doi.org/10.1155/2008/242916 doi: 10.1155/2008/242916
    [36] B. S. Thakur, D. Thakur, M. Postolache, A new iteration scheme for approximating fixed points of nonexpansive mappings, Filomat, 30 (2016), 2711–2720. https://doi.org/10.2298/FIL1610711T doi: 10.2298/FIL1610711T
    [37] 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. https://doi.org/10.1016/j.amc.2015.11.065 doi: 10.1016/j.amc.2015.11.065
    [38] I. Timis, On the weak stability of Picard iteration for some contractive type mappings and coincidence theorems, Int. J. Comput. Appl., 37 (2012), 9–13. https://doi.org/10.5120/4595-6549 doi: 10.5120/4595-6549
    [39] K. Ullah, M. Arshad, Numerical reckoning fixed points for Suzuki's generalized nonexpansive mappings via new iteration process, Filomat, 32 (2018), 187–196. https://doi.org/10.2298/FIL1801187U doi: 10.2298/FIL1801187U
    [40] X. L. Weng, Fixed point iteration for local strictly pseudo-contractive mapping, Proc. Amer. Math. Soc., 113 (1991), 727–731. https://doi.org/10.1090/S0002-9939-1991-1086345-8 doi: 10.1090/S0002-9939-1991-1086345-8
    [41] T. Zamfirescu, Fixed point theorems in metric spaces, Arch. Math., 23 (1972), 292–298. https://doi.org/10.1007/BF01304884 doi: 10.1007/BF01304884
  • This article has been cited by:

    1. Marimuthu Mohan Raja, Velusamy Vijayakumar, Anurag Shukla, Kottakkaran Sooppy Nisar, Wedad Albalawi, Abdel-Haleem Abdel-Aty, A new discussion concerning to exact controllability for fractional mixed Volterra-Fredholm integrodifferential equations of order r(1,2) with impulses, 2023, 8, 2473-6988, 10802, 10.3934/math.2023548
    2. Austine Efut Ofem, Hüseyin Işik, Godwin Chidi Ugwunnadi, Reny George, Ojen Kumar Narain, Approximating the solution of a nonlinear delay integral equation by an efficient iterative algorithm in hyperbolic spaces, 2023, 8, 2473-6988, 14919, 10.3934/math.2023762
    3. Austine Efut Ofem, Akindele Adebayo Mebawondu, Godwin Chidi Ugwunnadi, Prasit Cholamjiak, Ojen Kumar Narain, Relaxed Tseng splitting method with double inertial steps for solving monotone inclusions and fixed point problems, 2024, 96, 1017-1398, 1465, 10.1007/s11075-023-01674-y
    4. Austine Efut Ofem, Jacob Ashiwere Abuchu, Hossam A. Nabwey, Godwin Chidi Ugwunnadi, Ojen Kumar Narain, On Bilevel Monotone Inclusion and Variational Inequality Problems, 2023, 11, 2227-7390, 4643, 10.3390/math11224643
    5. Godwin Amechi Okeke, Akanimo Victor Udo, Zaur Rasulov, A novel Picard–Ishikawa–Green's iterative scheme for solving third‐order boundary value problems, 2024, 47, 0170-4214, 7255, 10.1002/mma.9971
    6. Austine Efut Ofem, Jacob Ashiwere Abuchu, Godwin Chidi Ugwunnadi, Hossam A. Nabwey, Abubakar Adamu, Ojen Kumar Narain, Double inertial steps extragadient-type methods for solving optimal control and image restoration problems, 2024, 9, 2473-6988, 12870, 10.3934/math.2024629
    7. Ahmed Alamer, Faizan Ahmad Khan, Boyd-Wong type functional contractions under locally transitive binary relation with applications to boundary value problems, 2024, 9, 2473-6988, 6266, 10.3934/math.2024305
    8. 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, 2023, 8, 2473-6988, 28488, 10.3934/math.20231458
    9. Godwin Amechi Okeke, Cyril Ifeanyichukwu Ugwuogor, Rubayyi T. Alqahtani, Melike Kaplan, W. Eltayeb Ahmed, A novel fixed point iteration process applied in solving the Caputo type fractional differential equations in Banach spaces, 2024, 0129-1831, 10.1142/S0129183124501766
    10. Saiful Marom, Muhammad Istiqlal, Fixed Point Theorems for Semigroups of Lipschitzian Mappings, 2023, 4, 2774-3047, 90, 10.47352/jmans.2774-3047.191
    11. James Abah Ugboh, Joseph Oboyi, Mfon Okon Udo, Hossam A. Nabwey, Austine Efut Ofem, Ojen Kumar Narain, On a Faster Iterative Method for Solving Fractional Delay Differential Equations in Banach Spaces, 2024, 8, 2504-3110, 166, 10.3390/fractalfract8030166
    12. A. Murali, K. Muthunagai, Disquisition on convergence, stability, and data dependence for a new fast iterative process, 2024, 14, 2045-2322, 10.1038/s41598-024-73261-7
    13. Tehreem Ishtiaq, Afshan Batool, Aftab Hussain, Hamed Alsulami, Fixed point approximation of nonexpansive mappings and its application to delay integral equation, 2025, 2025, 1029-242X, 10.1186/s13660-025-03263-0
  • 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(2123) PDF downloads(198) Cited by(13)

Figures and Tables

Figures(4)  /  Tables(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog