Research article Special Issues

A modified iteration for total asymptotically nonexpansive mappings in Hadamard spaces

  • The motive of this paper is to study the convergence analysis of a modified iteration procedure for total asymptotically nonexpansive mapping under some suitable conditions in the setting of CAT(0) spaces. By using MATLAB R2018a, we also illustrate numerical experiment to compare the rate of convergence of the new iteration process with some existing iteration processes.

    Citation: Izhar Uddin, Sabiya Khatoon, Nabil Mlaiki, Thabet Abdeljawad. A modified iteration for total asymptotically nonexpansive mappings in Hadamard spaces[J]. AIMS Mathematics, 2021, 6(5): 4758-4770. doi: 10.3934/math.2021279

    Related Papers:

    [1] Sani Salisu, Vasile Berinde, Songpon Sriwongsa, Poom Kumam . Approximating fixed points of demicontractive mappings in metric spaces by geodesic averaged perturbation techniques. AIMS Mathematics, 2023, 8(12): 28582-28600. doi: 10.3934/math.20231463
    [2] Buthinah A. Bin Dehaish, Rawan K. Alharbi . On fixed point results for some generalized nonexpansive mappings. AIMS Mathematics, 2023, 8(3): 5763-5778. doi: 10.3934/math.2023290
    [3] 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
    [4] Shahram Rezapour, Maryam Iqbal, Afshan Batool, Sina Etemad, Thongchai Botmart . A new modified iterative scheme for finding common fixed points in Banach spaces: application in variational inequality problems. AIMS Mathematics, 2023, 8(3): 5980-5997. doi: 10.3934/math.2023301
    [5] Lu-Chuan Ceng, Yeong-Cheng Liou, Tzu-Chien Yin . On Mann-type accelerated projection methods for pseudomonotone variational inequalities and common fixed points in Banach spaces. AIMS Mathematics, 2023, 8(9): 21138-21160. doi: 10.3934/math.20231077
    [6] Maryam Iqbal, Afshan Batool, Aftab Hussain, Hamed Al-Sulami . A faster iterative scheme for common fixed points of G-nonexpansive mappings via directed graphs: application in split feasibility problems. AIMS Mathematics, 2024, 9(5): 11941-11957. doi: 10.3934/math.2024583
    [7] Asima Razzaque, Imo Kalu Agwu, Naeem Saleem, Donatus Ikechi Igbokwe, Maggie Aphane . Novel fixed point results for a class of enriched nonspreading mappings in real Banach spaces. AIMS Mathematics, 2025, 10(2): 3884-3909. doi: 10.3934/math.2025181
    [8] Damrongsak Yambangwai, Tanakit Thianwan . An efficient iterative algorithm for common solutions of three G-nonexpansive mappings in Banach spaces involving a graph with applications to signal and image restoration problems. AIMS Mathematics, 2022, 7(1): 1366-1398. doi: 10.3934/math.2022081
    [9] Lu-Chuan Ceng, Li-Jun Zhu, Tzu-Chien Yin . Modified subgradient extragradient algorithms for systems of generalized equilibria with constraints. AIMS Mathematics, 2023, 8(2): 2961-2994. doi: 10.3934/math.2023154
    [10] Juan Rafael Acosta-Portilla, Lizbeth Yolanda Garrido-Ramírez . On minimal asymptotically nonexpansive mappings. AIMS Mathematics, 2023, 8(4): 9416-9435. doi: 10.3934/math.2023474
  • The motive of this paper is to study the convergence analysis of a modified iteration procedure for total asymptotically nonexpansive mapping under some suitable conditions in the setting of CAT(0) spaces. By using MATLAB R2018a, we also illustrate numerical experiment to compare the rate of convergence of the new iteration process with some existing iteration processes.



    Let C be a nonempty closed subset of a CAT(0) space, M and T be a self map defined on C. Then T is said to be:

    (i) nonexpansive if d(Tu,Tv)d(u,v),u,vC;

    (ii) asymptotically nonexpansive if there exists a sequence {ζn} in [1,) with limnζn=1 such that d(Tnu,Tnv)ζnd(u,v)u,vC and n1;

    (iii) uniformly L-Lipschitzian if there exists a constant L>0 such that d(Tnu,Tnv)Ld(u,v)u,vC and n1.

    In 2006, Alber et al. [3] introduced a new generalized mapping named as total asymptotically nonexpansive mapping, defined as follows:

    Definition 1.1. A self mapping T on C is called ({ϑn},{κn},φ) total asymptotically nonexpansive mapping if there exist nonnegative real sequences {ϑn} and {κn} with ϑn0, κn0 as n and a continuous strictly increasing function φ:[0,)[0,) with φ(0)=0 such that

    d(Tnu,Tnv)d(u,v)+ϑnφ(d(u,v))+κn

    u,vC and n1.

    They showed that this mapping generalizes several classes of mappings which are extensions of asymptotically nonexpansive mappings and also approximated fixed points of the above mapping by using modified Mann iteration process.

    It can be directly seen by above definitions that, asymptotically nonexpansive mappings contain nonexpansive mappings with {ζn=1}, n1 and total asymptotically nonexpansive mappings contain asymptotically nonexpansive mappings with {ϑn=ζn1}, {κn=0}, n1 and φ(t)=t, t0. Furthermore, every asymptotically nonexpansive mapping is a uniformly L-Lipschitzian mapping with L=supnN{ζn}.

    A mapping T is said to have a fixed point ρ if Tρ=ρ and a sequence {un} is said to be asymptotic fixed point sequence if limnd(un,Tun)=0.

    In the background of iteration processes, Mann [20], Ishikawa [10] and Halpern [8] are the three basic iterations utilized to approximate the fixed points of nonexpansive mapping.

    After these three basic iterative schemes, several researchers came up with the idea of generalized iterative schemes to approximate the fixed points of nonlinear mappings. Here, we have few iterations among the number of new itarative schemes, Noor iteration [21], Agarwal et al. iteration (S-iteration) [2], Abbas and Nazir iteration [1], Thakur New iteration [28], Garodia and Uddin [12], Garodia et al.[13] and so on.

    In 2015, Cholamjiak [4] proposed a modified proximal point algorithm for solving minimization problems in CAT(0) spaces.

    In the same year, Thakur et al. [28] presented modified Picard-Mann hybrid iteration process {un} to approximate the fixed points of total asymptotically nonexpansive mappings in the framework of Hadamard spaces and the sequence {un} is defined as follows:

    u1C,
    vn=(1ηn)unηnTnun,
    un+1=Tnvn, (1.1)

    n1, where {ηn} is an appropriate sequence in the interval (0,1). They also proved its convergence analysis under some certain conditions.

    In 2017, Suparatulatorn et al. [26] proposed a modified proximal point algorithm using Halpern's iteration process for nonexpansive mappings in CAT(0) spaces and prove some convergence theorems. For more details see ([9,14,15]) and refences therein.

    Recently, Kuman et al. [18] presented modified Picard-S hybrid iteration process {un} as follows:

    u1C,
    wn=(1ηn)unηnTnun,
    vn=(1ςn)TnunςnTnwn,
    un+1=Tnvn, (1.2)

    n1, where {ηn} and {ςn} are appropriate sequences in the interval (0,1) and they established some convergence theorems to approximate the fixed points of total asymptotically nonexpansive mapping in the setting CAT(0) spaces.

    Motivated by above work, we introduce a new iterative scheme, which is defined as follows:

    u1C,
    wn=Tn((1ηn)unηnTnun),
    vn=Tn((1ςn)wnςnTnwn),
    un+1=Tnvn, (1.3)

    for all n1, where {ηn} and {ςn} are appropriate sequences in the interval (0,1). We prove some convergence theorems of the sequence generated by iterative scheme (1.3) to approximate the fixed point of total asymptotically nonexpansive mapping in Hadamard space. We also provide a numerical experiment to show the convergence rate of iterative scheme (1.3) and its fastness over the other existing iterative processes.

    This section contains some well-known concepts and results which will be used frequently in the paper.

    Lemma 2.1.([6]) Let M be a CAT(0) space, x,yM and t[0,1]. Then

    d(tu(1t)v,w)td(u,w)+(1t)d(v,w).

    Let {un} be a bounded sequence in M, complete CAT(0) spaces. For uM set:

    r(u,{un})=lim supnd(u,un).

    The asymptotic radius r({un}) is given by

    r({un})=inf{r(u,un):uM},

    and the asymptotic center A({un}) of {un} is defined as:

    A({un})={uM:r(u,un)=r({un})}.

    A({un}) consists of exactly one point in CAT(0) spaces see ([5], Proposition 7).

    A sequence {un} in M is said to Δ-converges to uM if u is the unique asymptotic center for every subsequence {zn} of {un}. In this case we write Δlimnun=u and read as u is the Δlimit of {un}.

    Lemma 2.2.([7]) Let M be a complete CAT(0) space and {un} be a bounded sequence in M. If A({un})={ρ}, {zn} is a subsequence of {un} such that A({zn})={z} and d(un,z) converges, then ρ=z.

    Recalling the existence theorem for the fixed point and demiclosedness principle for the mappings satisfy Definition 1.1 in CAT(0) spaces due to Karapinar et al. [11].

    Lemma 2.3. ([11]) Let a self map T defined on a convex closed nonempty and bounded set, C of M, a complete CAT(0) space. Let T be uniformly continuous and total asymptotically nonexpansive mapping. Then, T has a fixed point, and set of fixed points F(T) is convex and closed.

    Lemma 2.4. ([11]) Let T be a self map defined on C, a nonempty closed, convex subset of M, a complete CAT(0) space. Let T be a uniformly continuous and total asymptotically nonexpansive mapping. For every bounded sequence {un}C such that, limnd(un,Tun)=0 and limnun=q implies that Tq=q.

    The next lemma due to Schu [23] is useful in our subsequent discussion.

    Lemma 2.5. ([23]) Let M be a complete CAT(0) space and let uM. Suppose {tn} is a sequence in [b,c] for some b,c(0,1) and {un}, {vn} are sequences in M such that lim supnd(un,u)r, lim supnd(vn,u)r, and limnd((1tn)untnvn,u)=r for some r0. Then

    limnd(un,vn)=0.

    Lemma 2.6.([22]) Let {αn}, {βn} and {ξn} be the sequences of nonnegative numbers such that

    αn+1(1+βn)αn+ξn,

    for all n1. If n=1βn< and n=1ξn<, then limnαn exists. Whenever, if there exists a subsequence {αnk}{αn} such that αnk0 as k, then limnαn=0.

    Theorem 3.1. Let C be a closed bounded and convex subset of M, a complete CAT(0) space and a self map T defined on C is uniformly L-Lipschitzian and ({ϑn},{κn},φ)-total asymptotically nonexpansive mapping. Assume that the following conditions hold:

    (a)n=1ϑn<andn=1κn<;

    (b) there exist constants m, n with 0<mηnn<1 for each nN;

    (c) there exist constants p, q with 0<pςnq<1 for each nN;

    (d) there exist a constant M1 such that φ(ω)M1ω for each ω0.

    Then the sequence {un} defined by (1.3) -converges to a point of F(T).

    Proof. By using Lemma 2.5, we have F(T). We start with proving that limnd(un,ρ) exists for any ρF(T), where {un} is defined by (1.3).

    Let ρF(T). Then we have

    d(wn,ρ)=d(Tn((1ςn)unςnTnun),ρ)d((1ςn)unςnTnun),ρ)+ϑnφ(d((1ςn)unςnTnun),ρ)+κn(1+ϑnM1)d((1ςn)unςnTnun),ρ)+κn(1+ϑnM1)[(1ςn)d(un,ρ)+ςnTnd(un,ρ)]+κn(1+ϑnM1)[(1ςn)d(un,ρ)+ςn(d(un,ρ)+ϑnφ(d(un,ρ))+κn)]+κn(1+ϑnM1)[(1+ϑnM1)d(un,ρ)+κn]+κn(1+ϑnM1)2d(un,ρ)+(2+ϑnM1)κn, (3.1)

    for each nN. Also we have

    d(vn,ρ)=d(Tn((1ηn)wnηnTnwn,ρ))d((1ηn)wnηnTnwn,ρ)+ϑnφ(d((1ηn)wnηnTnwn,ρ))+κn(1+ϑnM1)d((1ηn)wnηnTnwn),ρ)+κn(1+ϑnM1)((1ηn)d(wn,ρ)+ηnd(Tnwn,ρ))+κn(1+ϑnM1)((1ηn)d(wn,ρ)+ηn(d(wn,ρ)+ϑnφd(wn,ρ)+κn))+κn(1+ϑnM1)((1+ϑnM1)d(wn,ρ)+κn)+κn(1+ϑnM1)2d(wn,ρ)+(2+ϑnM1)κn(1+ϑnM1)2[(1+ϑnM1)2d(un,ρ)+(2+ϑnM1)κn]+(2+ϑnM1)κn(1+ϑnM1)4d(un,ρ)+(1+ϑnM1)2(2+ϑnM1)κn+(2+ϑnM1)κn(1+ϑnM1)4d(un,ρ)+(2+ϑnM1)(1+(1+ϑnM1)2)κn (3.2)

    for each nN. From (1.3), (3.1) and (3.2), we get

    d(un+1,ρ)=d(Tnvn,ρ)d(vn,ρ)+ϑnφd(vn,ρ)+κn(1+ϑnM1)d(vn,ρ)+κn(1+ϑnM1)[(1+ϑnM1)4d(un,ρ)+(2+ϑnM1)(1+(1+ϑnM1)2)κn]+κn(1+ϑnM1)5d(un,ρ)+(1+ϑnM1)(2+ϑnM1)(1+(1+ϑnM1)2)κn+κn(1+ϑnM1)5d(un,ρ)+[1+(1+ϑnM1)(2+ϑnM1)(1+(1+ϑnM1)2)]κn (3.3)

    where

    ξn:=(1+ϑnM1)5andδn:=1+(1+ϑnM1)(2+ϑnM1)(1+(1+ϑnM1)2).

    By assumption (a), we have

    n=1ξn<andn=1δn< (3.4)

    By assertion (3.3), (3.4) and Lemma 2.8, we obtain limnd(un,ρ) exists.

    Next, we prove that limnd(un,Tun)=0.

    Suppose

    limnd(un,ρ)=ω0. (3.5)

    From (3.1), we have

    limnsupd(wn,ρ)ω. (3.6)

    Since T satisfies Definition 1.1

    d(Tnwn,ρ)d(wn,ρ)+ϑnφd(wn,ρ)+κn(1+ϑnM1)d(wn,ρ)+κn. (3.7)

    From (3.6) and (3.7), we have

    limnsupd(Tnwn,ρ)ω. (3.8)

    In the same way, we get

    limnsupd(Tnun,ρ)ω. (3.9)

    Since

    d(un+1,ρ)(1+ϑnM1)5d(un,ρ)+[1+(1+ϑnM1)(2+ϑnM1)(1+(1+ϑnM1)2)]κn.

    By taking limit infimum both sides, we obtain,

    ωlimninfd(wn,ρ). (3.10)

    From (3.6) and (3.10), we obtain

    ω=limnsupd(wn,ρ)=limnsupd(Tn((1ηn)unηnTnun),ρ)). (3.11)
    d(Tn((1ηn)unηnTnun),ρ),d((1ηn)unηnTnun,ρ)+ϑnφ[d((1ηn)unηnTnun,ρ)]+κn,
    d(Tn((1ηn)unηnTnun),ρ)[1+ϑnM1]d((1ηn)unηnTnun,ρ)+κn
    limnsupd(Tn((1ηn)unηnTnun),ρ)limnsupd((1ηn)wnηnTnun,ρ),
    ωlimnsupd((1ηn)unηnTnun,ρ). (3.12)

    By using (3.5) and (3.9), we have

    d((1ηn)unηnTnun,ρ)(1ηn)d(un,ρ)+ηnd(Tnun,ρ)
    limnsupd((1ηn)unηnTnun,ρ)ω. (3.13)

    Applying (3.12) and (3.13), we have,

    limnsupd((1ηn)unηnTnun,ρ)=ω. (3.14)

    By using (3.5), (3.9), (3.14) and Lemma 2.5, we can conclude that

    limnd(un,Tnun)=0. (3.15)

    We also have,

    d(un+1,ρ)(1+ϑnM1)d(vn,ρ)+κn.

    By taking limit infimum both sides, we obtain

    ωlimninfd(vn,ρ). (3.16)

    By (3.2), we have

    d(vn,ρ)(1+ϑnM1)4d(un,ρ)+(2+ϑnM1)(1+(1+ϑnM1)2)κn

    By taking limit suprimum both sides, we obtain

    limnsupd(vn,ρ)ω. (3.17)

    By using (3.16) and (3.17), we get

    ω=limnsupd(vn,ρ)=limnsup(Tn((1ςn)wnςnTnwn),ρ). (3.18)
    d(Tn((1ςn)wnςnTnwn),ρ)d((1ςn)wnςnTnwn,ρ)+ϑnφ[d((1ςn)wnςnTnwn,ρ)]+κn,
    d(Tn((1ςn)wnςnTnwn),ρ)[1+ϑnM1]d((1ςn)wnςnTnwn,ρ)+κn,
    limnsupd(Tn((1ςn)wnςnTnwn),ρ)limnsupd((1ςn)wnςnTnwn,ρ),
    ωlimninfd((1ςn)wnςnTnwn,ρ). (3.19)

    Also we have

    d((1ςn)wnςnTnwn,ρ)(1ςn)d(wn,ρ)+ςnd(Tnwn,ρ)
    limnsupd((1ςn)wnςnTnwn,ρ)ω. (3.20)

    By using (3.8), (3.11), (3.20) and Lemma 2.5, we can conclude that

    limnd(wn,Tnwn)=0. (3.21)

    Since T is ({ϑn},{κn},φ)-total asymptotically nonexpansive mapping.

    d(Tnwn,Tnun)d(wn,un)+ϑnφd(wn,un)+κn(1+ϑnM1)d(wn,un)+κn(1+ϑnM1)d(Tn((1ηn)unηnTnun),un)+κn(1+ϑnM1)d(Tn((1ηn)unηnTnun),Tnun)+(1+ϑnM1)d(Tnun,un)+κn(1+ϑnM1)[d((1ηn)unηnTnun),un)+ϑnM1d((1ηn)unηnTnun),un)+κn]+(1+ϑnM1)d(Tnun,un)+κn(1+ϑnM1)2[ηnd(Tnun,un)]+(1+ϑnM1)d(Tnun,un)+(2+ϑnM1)κn.nN.

    By taking limit n and using (3.15), we get

    limnd(Tnwn,Tnun)=0. (3.22)

    We have

    d(Tnvn,Tnwn)d(vn,wn)+ϑnφd(vn,wn)+κn(1+ϑnM1)d(vn,wn)+κn(1+ϑnM1)d(Tn((1ηn)wnηnTnwn),wn)+κn(1+ϑnM1)d(Tn((1ηn)wnηnTnwn),Tnwn)+(1+ϑnM1)d(Tnwn,wn)+κn(1+ϑnM1)[d((1ηn)wnηnTnwn),wn)+ϑnM1d((1ηn)wnηnTnwn),wn)+κn]+(1+ϑnM1)d(Tnwn,wn)+κn(1+ϑnM1)2[ηnd(Tnwn,wn)]+(1+ϑnM1)d(Tnwn,wn)+(2+ϑnM1)κn.nN.

    By taking limit as n and using (3.21), we obtain

    limnd(Tnvn,Tnwn)=0. (3.23)

    From (3.15), (3.22) and (3.23), we get

    d(un,un+1)=d(un,Tnvn),d(un,Tnun)+d(Tnun,Tnwn)+d(Tnwn,Tnvn),0asn.

    Since T satisfies Definition 1.1 and uniformly L-Lipshitzian, we obtain

    d(un,Tun)=d(un,un+1)+d(un+1,Tn+1un+1)+d(Tn+1un+1,Tn+1xn)+d(Tn+1xn,Txn),d(un,un+1)+d(un+1,Tn+1un+1)+Ld(un+1,xn)+Ld(Tnxn,xn),0asn.

    Let xWΔ(un). Then, there exists a subsequence {zn} of {un} such that A({zn})={x}. By using Lemma 2.3, there exists a subsequence {yn} of {zn} such that {yn}Δ-converges to yC. By Lemma 2.4, yF(T). Since {d(zn,y)} converges, by Lemma 2.2, x = y. This implies that WΔ(un)F(T).

    Next we will prove that WΔ(un) consists of exactly one point. Let {zn} be a subsequence of {un} with A({zn})={x} and A({un})={u}. We have seen that x=y and yF(T). Finally, since {d(un,y)} converges, by Lemma 2.2, we have u=yF(T). This shows that WΔ(un)={u}.

    Theorem 3.2. Let M, T, C, (a), (b), (c), (d), {ηn}, {ςn} same as in Theorem 3.1. Then, the sequence {un}, defined by (1.3) strongly converges to a fixed point of T iff

    lim infnd(un,F(T))=0,

    where d(x,F(T))=inf{d(x,ρ):ρF(T)}.

    Senter and Dotson [24] introduced a mapping satisying condition (Ⅰ) as follows:

    A mapping T defined on C is said to satisfy the Condition (Ⅰ) ([24]) if there exists a nondecreasing function f:[0,)[0,) with f(0)=0 and f(ω)>0 for all ω(0,) such that uTuf(d(u,F(T))) for all uC, where d(u,F(T))=inf{uρ:ρF(T)}.

    By using the similar technique as in the proof of Theorem 3.3 by Thakur et. al [28], we get the following result:

    Theorem 3.3. Let M, T, C, (a), (b), (c), (d), {ηn}, {ςn} be same as in Theorem 3.1 with T satisfies Condition (I). Then, {un}, defined by (1.3) converges to a point of F(T).

    Recalling the definition of semi-compact mapping;

    A map T defined on C is said to be semi-compact [27] if for a sequence {un} in C with limnd(un,Tun)=0, there exists a subsequence {unj} of {un} such that unjρC.

    By using the same steps used by Karapinar et al. [11] in the proof of Theorem 22, we get the next result.

    Theorem 3.4. Let M, T, C, (a), (b), (c), (d), {ηn}, {ςn} be same as in Theorem 3.1. Let T be semi-compact. Then the sequence {un} defined by (1.3) converges to a point of F(T).

    Example 4.1. Let M=R with usual metric and C=[1,10]. Let a self map T on C as follows:

    Tu=3(u2+4)

    for all uC.

    It can be clearly seen that T is a continuous uniformly L-Lipschitzian mapping with F(T)={2}. Next, we will show that T satisfies Definition 1.1 on [1, 10].

    We notice that the function g(u)=3(u2+4)u,u[1,10] has the derivative

    g(u)=13(1(u2+4)2/3)(2u)1,

    for all u[1,10]. Since u1, we have g(u)=13(1(u2+4)2/3)(2u)1 and hence

    g(u)0,

    for all u[1,10] which shows that the above function is decreasing on [1,10]. Let u,v[1,10] with uv shows that

    g(v)g(u)

    we get

    3v2+4v3u2+4u,
    3v2+43u2+4vu,|3v2+43u2+4||vu|,|3u2+43v2+4||uv|.

    Hence, we get

    TuTvuv.

    This shows that T satisfies Definition 1.1 as it is nonexpansive mapping.

    By using the initial value u1=0.5 and setting the stopping criteria un21015, reckoning the iterative values of (1.1), (1.2) and (1.3) for two choices, Choice 1:ηn=1n2n2+1,ςn=nn+1 and Choice 2:ηn=1n3n+1,ςn=n16n+1, as shown in Tables 1 and 2 respectively.

    Table 1.  Comparative Sequences for the Choice 1: ηn=1n2n2+1,ςn=nn+1.
    Iteration No. Picard-Mann Picard-S Proposed iteration
    - CPU Time (.9051 sec) CPU Time (1.0945 sec) CPU Time (1.4011 sec)
    1 0.500000000000000 0.500000000000000 0.500000000000000
    2 1.673351078473488 1.911305694206785 2.013019344428651
    3 1.968319842982687 1.999118643774929 1.999987398484048
    4 1.998888729762473 1.999998910601895 2.000000000563505
    5 1.999986686957856 1.999999999843751 1.999999999999999
    6 1.999999946273438 1.999999999999998 2.000000000000000
    7 1.999999999927302 2.000000000000000 2.000000000000000
    8 1.999999999999967 2.000000000000000 2.000000000000000
    9 2.000000000000000 2.000000000000000 2.000000000000000
    10 2.000000000000000 2.000000000000000 2.000000000000000

     | Show Table
    DownLoad: CSV
    Table 2.  Comparative Sequences for the Choice 2: ηn=1n3n+1 and ςn=n16n+1.
    Iteration No. Picard-Mann Picard-S Proposed iteration
    - CPU Time (.9319 sec) CPU Time (1.0828 sec) CPU Time (1.3286 sec)
    1 0.500000000000000 0.500000000000000 0.500000000000000
    2 1.796207021392586 1.930011948409510 1.991766910503178
    3 1.991846068832765 1.999653199729716 1.999999320143441
    4 1.999901610410224 1.999999825321212 1.999999999998919
    5 1.999999615870039 1.999999999990460 2.000000000000000
    6 1.999999999501533 2.000000000000000 2.000000000000000
    7 1.999999999999784 2.000000000000000 2.000000000000000
    8 2.000000000000000 2.000000000000000 2.000000000000000
    9 2.000000000000000 2.000000000000000 2.000000000000000
    10 2.000000000000000 2.000000000000000 2.000000000000000

     | Show Table
    DownLoad: CSV

    Figures 1 and 2 clearly shows the fastness of sequence (1.3) over the other existing iterative schemes with different control conditions.

    Figure 1.  Convergence of the sequences for the Choice 1.
    Figure 2.  Convergence of sequences for the Choice 2.

    In this article, we have presented a new type of iteration procedure for total asymptotically nonexpansive mapping under some new conditions in CAT(0) spaces. We showed that our new type of iteration are more efficient than some of the existing iteration. Also, we have provided the reader with a numerical experiment to support our claim.

    We wish to pay our sincere thanks to learned referees for pointing out many omission and motivating us to study deeply. The second author is also grateful to University Grants Commission, India for providing financial assistance in the form of Junior Research Fellowship. The authors N. Mlaiki and T. Abdeljawad would to thank Prince Sultan University for funding this work through research group Nonlinear Analysis Methods in Applied Mathematics (NAMAM) Group No. RG-DES-2017-01-17.

    The authors declare that they have no competing interests.



    [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 A., 8 (2007), 61–79.
    [3] Y. I. Alber, C. E. Chidume, H. Zegeye, Approximating fixed points of total asymptotically nonexpansive mappings, Fixed Point Theory Appl., 10673 (2006).
    [4] P. Cholamjiak, The modified proximal point algorithm in CAT(0) spaces, Optim. Lett., 9 (2015), 1401–1410. doi: 10.1007/s11590-014-0841-8
    [5] S. Dhompongsa, W. A. Kirk, B. Sims, Fixed points of uniformly Lipschitzian mappings, Nonlinear Anal.: Theory Methods Appl., 65 (2006), 762–772. doi: 10.1016/j.na.2005.09.044
    [6] S. Dhompongsa, B. Panyanak, On Δ-convergence theorems in CAT(0) spaces, Comput. Math. Appl., 56 (2008), 2572–2579. doi: 10.1016/j.camwa.2008.05.036
    [7] S. Dhompongsa, W. A. Kirk, B. Panyanak, Nonexpansive set-valued mappings in metric and Banach spaces, J. Nonlinear Convex Anal., 8 (2007), 35–45.
    [8] B. Halpern, Fixed points of nonexpanding maps, B. Am. Math. Soc., 73 (1967), 957–961. doi: 10.1090/S0002-9904-1967-11864-0
    [9] S. Husain, N. Singh, Δ-convergence for proximal point algorithm and fixed point problem in CAT(0) spaces, Fixed Point Theory Appl., 8 (2019). Available from: https://doi.org/10.1186/s13663-019-0658-3.
    [10] S. Ishikawa, Fixed points by a new iteration method, Proc. Amer. Math. Soc., 44 (1974), 147–150. doi: 10.1090/S0002-9939-1974-0336469-5
    [11] E. Karapinar, H. Salahifard, S. M. Vaezpour, Demiclosedness principle for total asymptoticallty nonexpansive mappings in CAT(0) spaces, J. Appl. Math., (38150) (2014).
    [12] C. Garodia, I. Uddin, A new fixed point algorithm for finding the solution of a delay differential equation, AIMS Mathematics, 5 (2020), 3182–3200. doi: 10.3934/math.2020205
    [13] C. Garodia, I. Uddin, S. H. Khan, Approximating common fixed points by a new faster iteration process, Filomat, 34 (2020), 2047–2060. doi: 10.2298/FIL2006047G
    [14] I. Uddin, S. Khatoon, V. Colao, Approximating fixed points of generalized alpha-Reich-Suzuki nonexpansive mappings in CAT(0) space, J. Nonlinear Convex Anal., 21 (2020).
    [15] M. A. A. Khan, P. Cholamjiak, A multi-step approximant for fixed point problem and convex optimization problem in Hadamard spaces, J. Fixed Point Theory Appl., 22 (2020).
    [16] W. A. Kirk, A Fixed point theorem for mappings which do not increase distances, Math. Monthly, 72 (1965), 1004–1006. doi: 10.2307/2313345
    [17] W. A. Kirk, B. Panyanak, A concept of convergence in geodesic spaces, Nonlinear Anal., 68 (2008), 3689–3696. doi: 10.1016/j.na.2007.04.011
    [18] W. Kumam, N. Pakkaranang, P. Kumam, P. Cholamjiak, Convergence analysis of modified Picard-S hybrid iterative algorithms for total asymptotically nonexpansive mappings in Hadamard spaces, Int. J. Comput. Math., 97 (2020), 175–188. doi: 10.1080/00207160.2018.1476685
    [19] T. C. Lim, Remarks on some fixed point theorems, Proc. Amer. Math. Soc., 60 (1976), 179–182. doi: 10.1090/S0002-9939-1976-0423139-X
    [20] W. R. Mann, Mean value methods in iteration, Proc. Amer. Math. Soc., 4 (1953), 506–510. doi: 10.1090/S0002-9939-1953-0054846-3
    [21] M. A. Noor, New approximation schemes for general variational inequalities, J. Math. Anal. Appl., 251 (2000), 217–229. doi: 10.1006/jmaa.2000.7042
    [22] L. Qihou, Iterative sequences for asymptotically quasi-nonexpansive mappings with error member, J. Math. Anal. Appl., 259 (2001), 18–24. doi: 10.1006/jmaa.2000.7353
    [23] J. Schu, Weak and strong convergence to fixed points of asymptotically nonexpansive mappings, Bull. Aust. Math. Soc., 43 (1991), 153–159. doi: 10.1017/S0004972700028884
    [24] H. F. Senter, W. G. Dotson, Approximating fixed points of nonexpansive mappings, Proc. Am. Math. Soc., 44 (1974), 370–385.
    [25] S. Suantai, Weak and strong convergence criteria of Noor iterations for asymptotically nonexpansive mappings, J. Math. Anal. Appl., 331 (2005), 506–517.
    [26] R. Suparatulatorn, P. Cholamjiak, S. Suantai, On solving the minimization problem and the fixed-point problem for nonexpansive mappings in CAT(0) spaces, Optim. Meth. Soft., 32 (2017), 182–192. doi: 10.1080/10556788.2016.1219908
    [27] S. Shahzad, R. Al-Dubiban, Approximating common fixed points of nonexpansive mappings in Banach spaces, Georgian Math. J., 13 (2006), 529–537.
    [28] B. S. Thakur, D. Thakur, M. Postolache, Modified Picard-Mann hybrid iteration process for total asymptotically nonexpansive mappings, Fixed Point Theory Appl., 140 (2015).
  • This article has been cited by:

    1. Monairah Alansari, An iterative scheme for split equality equilibrium problems and split equality hierarchical fixed point problem, 2021, 2021, 1687-1847, 10.1186/s13662-021-03384-y
    2. Sabiya Khatoon, Izhar Uddin, Metin Basarir, A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application, 2021, 40, 2238-3603, 10.1007/s40314-021-01646-9
    3. Javad Balooee, Shih-sen Chang, Chingfeng Wen, Generalized nearly asymptotically nonexpansive mappings and a system of generalized variational-like inclusions: iterative method and approximation of common solutions, 2022, 13, 2639-7390, 10.1007/s43034-022-00201-9
    4. Javad Balooee, Giuseppe Marino, Generalized Nearly Asymptotically Nonexpansive Mappings and a System of Variational Inclusions: Iterative Schemes and Convergence Analysis, 2023, 20, 1660-5446, 10.1007/s00009-023-02302-8
    5. Samet Maldar, Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem, 2022, 68, 1598-5865, 1841, 10.1007/s12190-021-01593-y
    6. Amna Kalsoom, Maliha Rashid, Tian-Chuan Sun, Amna Bibi, Abdul Ghaffar, Mustafa Inc, Ayman A. Aly, Nawab Hussain, Fixed Points of Monotone Total Asymptotically Nonexpansive Mapping in Hyperbolic Space via New Algorithm, 2021, 2021, 2314-8888, 1, 10.1155/2021/8482676
    7. Javad Balooee, Mihai Postolache, Yonghong Yao, System of generalized nonlinear variational-like inequalities and nearly asymptotically nonexpansive mappings: graph convergence and fixed point problems, 2022, 13, 2639-7390, 10.1007/s43034-022-00212-6
    8. Haishu Lu, Rong Li, A fuzzy fixed-point theorem and its applications to maximal elements and Nash equilibria in noncompact CAT(0) spaces, 2022, 42, 10641246, 6045, 10.3233/JIFS-212194
    9. Hamza El Bazi, Abdellatif Sadrati, Fixed point theorem for mixed monotone nearly asymptotically nonexpansive mappings and applications to integral equations, 2022, 2022, 1072-6691, 66, 10.58997/ejde.2022.66
    10. Asifa Tassaddiq, Wakeel Ahmed, Shahid Zaman, Asma Raza, Usman Islam, Kwara Nantomah, Abdul Rauf Khan, A Modified Iterative Approach for Fixed Point Problem in Hadamard Spaces, 2024, 2024, 2314-8888, 1, 10.1155/2024/5583824
    11. Aynur Şahin, Metin Başarır, 2024, Chapter 3, 978-981-99-9206-5, 25, 10.1007/978-981-99-9207-2_3
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

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

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

Metrics

Article views(2948) PDF downloads(240) Cited by(11)

Figures and Tables

Figures(2)  /  Tables(2)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog