Next Article in Journal
Selection of Cold Chain Logistics Service Providers Based on a Grey AHP and Grey COPRAS Framework: A Case Study in Vietnam
Previous Article in Journal
Nearly Cosymplectic Manifolds of Constant Type
Previous Article in Special Issue
Asymptotic Behavior of Resolvents of a Convergent Sequence of Convex Functions on Complete Geodesic Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Iterative Approximation Results of F Iteration Process in Banach Spaces

1
Department of Mathematics, International Islamic University, H-10, Islamabad 44000, Pakistan
2
Department of Mathematical Sciences, University of Lakki Marwat, Lakki Marwat 28420, Pakistan
3
Information Technology Application and Research Center, Istanbul Ticaret University, 34445 Istanbul, Turkey
4
Department of Mathematics, University of Swabi, Swabi 23640, Pakistan
5
Department of General Education, Faculty of Science and Health Technology, Navamindradhiraj University, Bangkok 10300, Thailand
6
Department of Statistics, Faculty of Science, Ramkhamhaeng University, Bangkok 10240, Thailand
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(4), 153; https://doi.org/10.3390/axioms11040153
Submission received: 8 September 2021 / Revised: 18 March 2022 / Accepted: 21 March 2022 / Published: 25 March 2022
(This article belongs to the Special Issue Theory and Application of Fixed Point)

Abstract

:
In this research, we suggest some convergence results for operators having ( R C S C ) condition in Banach space setting under F iterative scheme. We establish weak convergence under Opials condition and also establish some important strong convergence results under some appropriate assumptions on the domain or on the mapping. We furnish a non-trivial example of mappings having ( R C S C ) condition and show that its F iterative scheme is more effective than the corresponding well known iterative schemes on this particular example.
MSC:
Primary 47H09; Secondary 47H10

1. Introduction

Many problems in applied sciences can not solved by ordinary analytical methods even the problem has known to have a solution. In such situations, we first rewrite such problems in the form of fixed point problems and then suggest some iterative methods to obtain approximate solutions for such type of problems. The well known and important facts due to Banach [1] asserts the existence and uniqueness of fixed point for contractions in metric spaces and suggest the Picard iterative method [2] to find this fixed point. However, in the case of nonexpansive mappings, the well known result of Browder-Gohde-Kirk [3,4,5] asserts the existence of fixed point for nonexpansive mappings in Banach spaces but the Picard iterative method [2] does not converge to this fixed point in general (see for details [6]). The class of nonexpansive mappings is properly more general then the notion of contraction mappings and has many fruitful applications in many areas of applied mathematics [7,8,9].
On the other hand, Suzuki suggested the notion of generalized nonexpansive mappings. A self-map T of a subset D of a Banach space is said to have Suzuki ( C ) condition (also called Suzuki nonexpansive) if every two elements v , v D , follow that
1 2 | | v T v | | | | v v | | | | T v T v | | | | v v | | .
Since the above definition requires the inequality | | T v T v | | | | v v | | only for those v , v D which satisfy 1 2 | | v T v | | | | v v | | . Hence it is obvious that if T is any nonexpansive mapping, that is, | | T v T v | | | | v v | | for each two element v , v D , then T enjoys the Suzuki ( C ) condition. On the other hand, an example in [10] clearly shows that the converse is not valid in general. In the current literature, lot of papers have been published by the both of the topics nonexpansive and Suzuki nonexpansive (see, e.g., refs. [11,12,13] and references cited therein).
In 2012, keeping Suzuki ( C ) condition in mind, Karapinar [14] introduced the notion of ( R C S C ) condition. A self-map T of a subset D of a Banach space is said to have ( C ) condition (some-times called Reich-Chatterjea-Suzuki ( C ) condition) if every two elements v , v D , follow that
1 2 | | v T v | | | | v v | | | | T v T v | | 1 3 ( | | v v | | + | | v T v | | + | | v T v | | ) .
One of the interesting and important fields of research is the iterative construction of fixed points under the appropriate assumptions on the operator or on the domain. The well known result of the so-called Banach Contraction Principle uses Picard iteration for computations of fixed points of contraction. But the fixed points of nonexpansive and generalized nonexpansive mappings we can not compute by using Picard iteration in general. To compute fixed points of nonexpansive and generalized nonexpansive operators and to find a relatively better speed of convergence to the desired fixed point, one can deal with the different steps of iterative processes in the current literature (see e.g., Mann [15], Ishikawa [16], Noor [17], Agarwal [18], Abbas [7], Thakur et al. [12] and others).
In 2018, Ullah and Arshad were the first who suggested the well-known M iteration scheme as provided below and noted that this scheme is more better than the schemes mentioned above for mappings with Suzuki ( C ) condition. The scheme reads as follows:
x 1 = x D , z k = ( 1 α k ) x k + α k T x k , y k = T z k , x k + 1 = T y k ,
where α k ( 0 , 1 ) .
However, very recently, Ali and Ali [19] introduced an up-to-date iterative method, and call it F iteration: which reads as follows:
x 1 = x D , z k = T ( ( 1 α k ) x k + α k T x k ) , y k = T z k , x k + 1 = T y k ,
where α k ( 0 , 1 ) . In [19], Ali and Ali observed that the F iteration (2) is stable with respect to any generalized contraction operator and converges to the solution of delay differential equations. Recently, Abdeljawad et al. [20] used M iteration process (1) for finding fixed points of mappings having (RCSC) condition. In this paper, we re-analyze F iteration with the connection of mappings having ( R C S C ) condition. We also construct an example of a self-map T which has ( R C S C ) condition but not ( C ) . By using this example, we suggest some numerical observations and commutations in the form of graphs and tables. This will validate the provided theoretical outcome of this research. Our results generalizes the idea of Ali and Ali [19] from the setting of contraction operators to the more general setting of operators having ( R C S C ) condition. Our results also improve and extend the corresponding results of Abdeljawad et al. [20] and many other well known results of the current literature.

2. Preliminaries

Let D be a subset of a Banach space X. An element u in a set D is called fixed point of T : D D whenever u = T u . The well known notation F ( T ) will throughout in the research represent the fixed point set of T. A Banach space X = ( X , | | . | | ) is said to satisfy Opial property (see for details [21]) if any given sequence { x k } X having weak limit w * X is such that
lim inf k | | x k w * | | < lim inf k | | x k v | | for every element v X { w * } .
Moreover, a given self-map T on a subset D of a Banach space is said to satisfy Condition I [22] if some one find a nondecreasing map n : [ 0 , ) [ 0 , ) such that n ( 0 ) = 0 , n ( s ) > 0 for every choice of s > 0 and | | v T v | | n ( d ( v , F ( T ) ) for every element v of D. Notice that, d ( v , F ( T ) ) = inf { | | v u | | : u F ( T ) } .
Definition 1.
Assume that D is a nonempty subset of Banach space X and { x k } any bounded sequence in X. If we fix s X , then
( a 1 )
the asymptotic radius r of the sequence { x k } at the point s is the real number r ( s , { x k } ) : = lim sup k | | s x k | | ;
( a 2 )
the asymptotic radius of the sequence { x k } in the connection with D is given by inf { r ( s , { x k } ) : s D } = r ( D , { x k } )
( a 3 )
the asymptotic center A of the sequence { x k } in the connection with D is given by { s D : r ( s , { x k } ) = r ( D , { x k } ) } = A ( D , { x k } ) .
One of the well-known characterization of the set, A ( D , { x k } ) is that its cardinality is equal to one if the underlying space X is uniformly convex [23]. We also know from [24,25]) that A ( D , { x k } ) is nonempty and convex in the case when D is weakly compact and convex.
We now collect some very useful and important characterizations of (RCSC) conditions which are established one by one in [14].
Proposition 1.
Suppose a self map T of D subset of a Banach space X and assume that T has (RCSC) condition. Then
(i)
For every choice of v D and u F ( T ) , follow that | | T v T u | | | | v u | | .
(ii)
The set F ( T ) is always closed. However if X is strictly convex and the domain D is convex, then the set F ( T ) also enjoys convexity.
(iii)
For every choice of v , v in D, it follows that
| | v T v | | 9 | | v T v | | + | | v v | | .
(iv)
If we assume that X has Opial property, and { x k } is a weakly convergent to some element u with lim k | | T x k x k | | = 0 , then u is the point of of the set F ( T ) .
We also state the following characterizations of uniform convexity, which is needed for our main outcome.
Lemma 1.
[26] Assume that ζ k [ i , j ] ( 0 , 1 ) for every natural number k. Suppose that { v k } and { w k } are two sequences in a uniformly convex Banach space X with lim sup k | | v k | | ζ , lim sup k | | w k | | ζ and lim k | | ζ k v k + ( 1 ζ k ) w k | | = ζ for some ζ 0 , then lim k | | v k w k | | = 0 .

3. Approximation Results

In this section, we state and prove several important iterative approximation results concerning F iterative scheme (2) for the class of maps with ( R C S C ) property. For the sake of simplicity, throughout the section, we will write only X instead of uniformly convex Banach space.
We begin the main outcome by state and prove a lemma, which will play a significant roll in every main result.
Lemma 2.
Suppose T is a self-map on a nonempty convex closed subset D of X satisfying ( R C S C ) condition. Assume that F ( T ) and { x k } be a sequence of F iteration (2). Then lim k | | x k u | | exists for every choice of u F ( T ) .
Proof. 
Choose any u F ( T ) and k N . By Proposition 1(i), we have
| | z k u | | = | | T ( 1 α k ) x k + α k T x k ) u | | | | ( 1 α k ) x k + α k T x k u | | ( 1 α k ) | | x k u | | + α k | | T x k u | | ( 1 α k ) | | x k u | | + α k | | x k u | | = | | x k u | | .
Which implies that
| | x k + 1 u | | = | | T y k u | | | | y k u | | = | | T z k u | | | | z k u | | | | x k u | | .
Thus, from the above, we obtained | | x k + 1 u | | | | x k u | | for every choice of k N and u F ( T ) . Hence in particular, { | | x k u | | } is bounded and nonincreasing, and lim k | | x k u | | exists for every chosen u F ( T ) . □
We now establish an important result as follows which will play key roll in establishing the weak and strong convergence results.
Theorem 1.
Suppose T is a self-map of a closed convex subset D of X satisfying ( R C S C ) condition. Assume that { x k } be a sequence of F iteration (2). Then, { x k } is bounded and lim k | | x k T x k | | = 0 if and only if F ( T ) .
Proof. 
We consider lim k | | x k T x k | | = 0 and { x k } be bounded and prove F ( T ) . Choose any u A ( D , { x k } ) . Then by Proposition 1(iii), we have
r ( T u , { x k } ) = lim sup k | | x k T u | | 9 lim sup n | | T x k x k | | + lim sup k | | x k u | | = lim sup k | | x k u | | = r ( u , { x k } ) .
From the above, one can conclude that T u is also the element of A ( D , { x k } . But in uniformly convex Banach spaces, A ( D , { x k } ) is always singleton and thus T u = u . Hence u F ( T ) , which now shows that F ( T ) .
Next we consider the set F ( T ) and try to show that { x k } is bounded and lim n | | x k T x k | | = 0 . Boundedness of { x k } follows from the proof of Lemma 2. Moreover, since F ( T ) is nonempty, we can choose any element p in F ( T ) . Hence, by Lemma 2, lim k | | x k u | | exists. Let this limit be equal to some real number ζ . That is,
ζ = lim k | | x k u | | .
Keeping (3) in mind, we have
| | z k u | | | | x k u | |
lim sup k | | z k u | | lim sup k | | x k u | | = ζ .
By Proposition 1(i), we have
| | T x k u | | | | x k u | |
lim sup k | | T x k u | | lim sup k | | x k u | | = ζ .
Similarly, from (4), we have
| | x k + 1 u | | | | z k u | |
ζ = lim inf k | | x k + 1 u | | lim inf k | | z k u | | .
By combining (6) and (8), we obtain
ζ = lim k | | z k u | | .
From (9), we have
ζ = lim k | | z k u | | = lim k | | T ( ( 1 α k ) x k + α k T x k ) u | | lim k | | ( 1 α k ) x k + α k T x k u | | = lim k | | ( 1 α k ) ( x k u ) + α k ( T x k u ) | | lim k ( 1 α k ) | | x k u | | + lim k α k | | T x k u | | lim k ( 1 α k ) | | x k u | | + lim k α k | | x k u | | = lim k | | x k u | | = ζ .
ζ = lim k | | ( 1 α k ) ( x k u ) + α n ( T x k u ) | | .
If we apply Lemma 1, we must have
lim k | | T x k x k | | = 0 .
This completes the proof. □
First we suggest a weak convergence result under the assumption that the ground space satisfies Opial’s property.
Theorem 2.
Suppose T is a self-map on a nonempty convex closed subset D of X satisfying ( R C S C ) condition. Assume that F ( T ) and { x k } be a sequence of F iteration (2). In addition, if X has the Opial’s property then { x k } converges weakly to a fixed point of T.
Proof. 
Keeping the uniform convexity of X in mind, we can say that X is reflexive. By Theorem 1, the sequence { x k } is bounded and lim k | | T x k x k | | = 0 for every natural number k. By the reflexivity of X, a weakly convergent subsequence { x k i } of { x k } with limit u D exists. By Proposition 1(iv), the element u is the fixed point of T. Thus, it is remaining to show that u is the unique weak limit of sequence { x k } . Contrary assume that the element u is not a weak limit of { x k } , that is, there exists another weakly convergent subsequence { x k j } of { x k } having weak limit say v such that u v . Again by Proposition 1(iv), v F ( T ) . Keeping Opial’s property in mind and Lemma 2, we have
lim k | | x k u | | = lim i | | w k i u | | < lim i | | x k i v | | = lim k | | x k v | | = lim j | | x k j v | | < lim j | | x k j u | | = lim k | | x k u | | .
The strict inequality above provides a contradiction. We thus conclude that the element u is a weak limit of { x k } . □
Now we suggest a strong convergence result under the assumption that the domain is compact.
Theorem 3.
Suppose T is a self-map on a nonempty convex compact subset D of X satisfying ( R C S C ) condition. Assume that F ( T ) and { x k } be a sequence of F iteration (2). Then { x k } converges strongly to a fixed point of T.
Proof. 
By compactness assumption, a strongly convergent subsequence { x k j } of { x k } with a strong limit say v D exists. By Proposition 1(iii), we have
| | x k j T v | | 9 | | x k j T x k j | | + | | x k j v | | 0 .
Because in the view of Theorem 1, lim j | | T x k j x k j | | = 0 . By uniqueness of limits of convergent sequences in Banach spaces, we conclude that v = T v . By Lemma 2, lim k | | x k v | | exists. Thus v is also a strong limit of { x k } . □
A strong convergence result without compactness assumption is stated below. The proof is elementary and therefore omitted.
Theorem 4.
Suppose T is a self-map on a nonempty convex closed subset D of X satisfying ( R C S C ) condition. Assume that F ( T ) and { x k } be a sequence of F iteration (2). Then { x k } converges strongly to a fixed point of T whenever lim k d ( x k , F ( T ) ) = 0 .
Now we suggest a strong convergence result under the assumption that the mapping satisfies condition ( I ) .
Theorem 5.
Suppose T is a self-map on a nonempty convex closed subset D of X satisfying ( R C S C ) condition. Assume that F ( T ) and { x k } be a sequence of F iteration (2). Then { x k } converges strongly to a fixed point of T whenever T satisfies condition ( I ) .
Proof. 
In the view of Theorem 1, we can write lim inf k | | x k T x k | | = 0 . Now the condition I, suggests lim inf k d ( x k , F ( T ) ) = 0 . By Theorem 4, { x k } converges strongly to a fixed point of T. □

4. Example

Now we give an example of mappings having ( R C S C ) condition but not ( C ) . We shall use this example, to support the main outcome. We show by many different choices of starting points and by choosing different values of parameters that F iteration is better than the many other well known iterative processes in the frame work of mappings having ( R C S C ) condition.
Example 1.
Suppose D = [ 3 , 6 ] and define T : D D by T v = 3 if v = 6 and T v = v + 3 2 if v 6 . Then
Case(a):when v , v [ 3 , 6 ) . Then T v = v + 3 2 and T v = v + 3 2 . Keeping triangle inequality in mind, we have
1 3 | v v | + | v T v | + | v T v | = 1 3 | v v | + 1 3 | v T v | + 1 3 | v T v | = 1 3 | v v | + 1 3 | v ( 3 + v 2 ) | + 1 3 | v ( 3 + v 2 ) | 1 3 | v v | + 1 3 | ( 3 v + 3 2 ) ( 3 v + 3 2 ) | = 1 3 | v v | + 1 3 | 3 v 2 3 v 2 | = 1 3 | v v | + 1 2 | v v | 1 2 | v v | | T v T v | .
Case(b):when v [ 3 , 6 ) and v { 6 } . Then T v = v + 3 2 and T v = 3 . Now
1 3 | v v | + | v T v | + | v T v | = 1 3 | v v | + 1 3 | v T v | + 1 3 | v T v | = 1 3 | v v | + 1 3 | v 3 | + 1 3 | v ( v + 3 2 ) | 1 3 | ( v v ) + ( v ( v + 3 2 ) ) | + 1 3 | v 3 | = 1 3 | ( v ( v + 3 2 ) ) | + 1 3 | v 3 | = 1 3 | v 3 2 | + 1 3 | v 3 | 1 3 | ( v 3 2 ) + ( v 3 ) | = 1 3 | 3 v 9 2 | = 1 2 | v 3 | = | T v T v | .
Case(c):finally, for v = v = 6 . Then T v = T v = 3 . Now
1 3 | v v | + | v T v | + | v T v | > 0 = | T v T v | .
The above cases suggest that the self map T has ( R C S C ) condition. Nevertheless, T does not satisfy Suzuki ( C ) -condition. Because, if v = 5.2 and v = 6 , then 1 2 | v T v | < | v v | and | T v T v | > | v v | . Suppose α k = 0.70 , β k = 0.65 and γ k = 0.90 . The Table 1 shows the strong convergence of F [19], M [13], Thakur [12], Abbas [7], Agarwal [18], Noor [17], Ishikawa [16] and Mann [15] iteration processes to a fixed point v = 3 of the mapping T.
Remark 1.
The Table 1 and Figure 1, suggest that F iterative process converges faster to a fixed point v = 3 of the mapping T than the other iterations.
Now we further show the effectiveness of F iterative process by choosing different values of parameters and starting points. Assume that | | x k v | | < 10 10 be the stopping criterion where v = 3 is a fixed point of the mapping T. The iteration numbers to get fixed point 3 for the iteration process F [19] are compared with leading three-steps M [13] and Agarwal [18] iterations. The Bold numbers in the Table 2, Table 3 and Table 4 suggests that F iteration is better than both of the Thakur and Agarwal.

Author Contributions

Conceptualization, K.U.; Data curation, K.U. and M.A.; Formal analysis, J.A. and M.A.; Investigation, J.A. and N.J.; Methodology, J.A.; Project administration, K.U., W.S. and I.A.; Resources, I.A.; Supervision, N.J., W.S. and I.A.; Funding acquisition, N.J. All authors have read and agreed to the published version of the manuscript.

Funding

We have received no external funds.

Data Availability Statement

No data were used to support this study.

Acknowledgments

This research work was completed, while J.A. was visiting to the Department of Mathematics, UST, Bannu. J.A. is very thankful to the K.U. for giving a wonderful hospitality. N.J. would like to acknowledge financial support by Navamindradhiraj University through the Navamindradhiraj University Research Fund (NURF).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Banach, S. Sur les operations dans les ensembles abstraits et leur application aux equations integrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  2. Picard, E.M. Memorie sur la theorie des equations aux derivees partielles et la methode des approximation ssuccessives. J. Math. Pure Appl. 1890, 6, 145–210. [Google Scholar]
  3. Browder, F.E. Nonexpansive nonlinear operators in a Banach space. Proc. Nat. Acad. Sci. USA 1965, 54, 1041–1044. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  4. Gohde, D. Zum Prinzip der Kontraktiven Abbildung. Math. Nachr. 1965, 30, 251–258. [Google Scholar] [CrossRef]
  5. Kirk, W.A. A fixed point theorem for mappings which do not increase distance. Am. Math. Monthly 1965, 72, 1004–1006. [Google Scholar] [CrossRef] [Green Version]
  6. Berinde, V. Iterative Approximation of Fixed Points. Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  7. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Math. Vesnik 2014, 66, 223–234. [Google Scholar]
  8. Delfani, M.; Farajzadeh, A.; Wen, C.F. Some fixed point theorems of generalized-contraction mappings in metric spaces. J. Nonlinear Var. Anal. 2021, 5, 615–625. [Google Scholar]
  9. Podilchuk, C.I.; Mammone, R.J. Image recovery by convex projections using a least squares constraint. J. Opt. Soc. Am. 1990, 7, 517–521. [Google Scholar] [CrossRef]
  10. Suzuki, T. Fixed point theorems and convergence theorems for some generalized nonexpansive mapping. J. Math. Anal. Appl. 2008, 340, 1088–1095. [Google Scholar] [CrossRef] [Green Version]
  11. Nanjaras, B.; Panyanak, B.; Phuengrattana, W. Fixed point theorems and convergence theorems for Suzuki generalized nonexpansive mappings in CAT(0) spaces. Nonlinear Anal. Hybrid Syst. 2010, 4, 25–31. [Google Scholar] [CrossRef]
  12. Thakur, B.S.; Thakur, D.; Postolache, M. A new iterative scheme for numerical reckoning fixed points of Suzuki’s generalized nonexpansive mappings. Appl. Math. Comput. 2016, 275, 147–155. [Google Scholar] [CrossRef]
  13. Ullah, K.; Arshad, M. Numerical reckoning fixed points for Suzuki’s generalized nonexpansive mappings via new iteration process. Filomat 2018, 32, 187–196. [Google Scholar] [CrossRef] [Green Version]
  14. Karapinar, E. Remarks on Suzuki (C)-condition. In Dynamical Systems and Methods; Springer: New York, NY, USA, 2012. [Google Scholar]
  15. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  16. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  17. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef] [Green Version]
  18. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
  19. Ali, J.; Ali, F. A new iterative scheme to approximating fixed points and the solution of a delay differential equation. J. Nonlinear Convex Anal. 2020, 9, 1251–1263. [Google Scholar]
  20. Abdeljawad, T.; Ullah, K.; Ahmad, J.; de la Sen, M.; Khan, J. Approximating fixed points of operators satisfying (RCSC) condition in Banach spaces. J. Func. Spaces 2020, 2020, 9851063. [Google Scholar] [CrossRef]
  21. Opial, Z. Weak and strong convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Amer. Math. Soc. 1967, 73, 591–597. [Google Scholar] [CrossRef] [Green Version]
  22. Senter, H.F.; Dotson, W.G. Approximating fixed points of nonexpansive mappings. Proc. Amer. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
  23. Clarkson, J.A. Uniformly convex spaces. Trans. Am. Math. Soc. 1936, 40, 396–414. [Google Scholar] [CrossRef]
  24. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Fixed Point Theory for Lipschitzian-type Mappings with Applications Series. In Topological Fixed Point Theory and Its Applications; Springer: New York, NY, USA, 2009; Volume 6. [Google Scholar]
  25. Takahashi, W. Nonlinear Functional Analysis; Yokohoma Publishers: Yokohoma, Japan, 2000. [Google Scholar]
  26. Schu, J. Weak and strong convergence to fixed points of asymptotically nonexpansive mappings. Bull. Austral. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Convergence behaviors of F (red), M (brown), Thakur (green), Abbas (yellow), Agarwal (blue), Noor (cyan), Ishikawa (magenta) and Mann (black) iterative schemes.
Figure 1. Convergence behaviors of F (red), M (brown), Thakur (green), Abbas (yellow), Agarwal (blue), Noor (cyan), Ishikawa (magenta) and Mann (black) iterative schemes.
Axioms 11 00153 g001
Table 1. Some values generated by F, M, Thakur, Abbas, S, Noor, Ishikawa and Mann iterations for the mapping T of Example 1.
Table 1. Some values generated by F, M, Thakur, Abbas, S, Noor, Ishikawa and Mann iterations for the mapping T of Example 1.
kFMThakurAbbasAgarwalNoorIshikawaMann
144444444
23.08133.16253.19313.24563.38633.48513.53633.6500
33.00663.02643.03733.06033.14923.23533.28763.4225
43.00053.00433.00723.01483.05763.11413.15423.2746
533.00073.00143.00363.02233.05543.08273.1785
633.00013.00033.00093.00863.02693.04433.1160
7333.00013.00023.00333.01303.02383.0754
83333.00013.00133.00633.01233.0490
933333.00053.00313.00683.0318
1033333.00023.00153.00373.0207
1133333.00013.00073.00203.0134
12333333.00033.00113.0088
13333333.00023.00063.0057
14333333.00013.00033.0037
153333333.00023.0024
163333333.00013.0016
1733333333.0010
1833333333.0007
1933333333.0004
2033333333.0003
2133333333.0002
2233333333.0001
2333333333
Table 2. α k = k ( k + 7 ) 11 9 and β k = 1 ( k + 2 ) 2 5 .
Table 2. α k = k ( k + 7 ) 11 9 and β k = 1 ( k + 2 ) 2 5 .
Number of Iterates for Obtaining Fixed Point.
Starting PointsAgarwalMF
3.2 2814 10
3.7 3014 10
4.3 3015 10
4.8 3115 10
5.3 3115 11
5.8 3215 11
Table 3. α k = k ( k + 6 ) 17 14 and β k = k k + 3 .
Table 3. α k = k ( k + 6 ) 17 14 and β k = k k + 3 .
Number of Iterates for Obtaining Fixed Point.
Starting PointsAgarwalMF
3.2         24        13        9
3.7         26        14        10
4.3         26        15        10
4.8         27        15        10
5.3         27        15        11
5.8         27        15        11
Table 4. α k = 1 ( 3 k + 5 ) 1 5 and β k = k 7 k + 9 .
Table 4. α k = 1 ( 3 k + 5 ) 1 5 and β k = k 7 k + 9 .
Number of Iterates for Obtaining Fixed Point.
Starting PointsAgarwalMF
3.2         28        12        9
3.7         29        13        9
4.3         30        13        9
4.8         31        13        10
5.3         31        14        10
5.8         31        14        10
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ahmad, J.; Ullah, K.; Ahmad, I.; Arshad, M.; Jarasthitikulchai, N.; Sudsutad, W. Some Iterative Approximation Results of F Iteration Process in Banach Spaces. Axioms 2022, 11, 153. https://doi.org/10.3390/axioms11040153

AMA Style

Ahmad J, Ullah K, Ahmad I, Arshad M, Jarasthitikulchai N, Sudsutad W. Some Iterative Approximation Results of F Iteration Process in Banach Spaces. Axioms. 2022; 11(4):153. https://doi.org/10.3390/axioms11040153

Chicago/Turabian Style

Ahmad, Junaid, Kifayat Ullah, Imtiaz Ahmad, Muhammad Arshad, Nantapat Jarasthitikulchai, and Weerawat Sudsutad. 2022. "Some Iterative Approximation Results of F Iteration Process in Banach Spaces" Axioms 11, no. 4: 153. https://doi.org/10.3390/axioms11040153

APA Style

Ahmad, J., Ullah, K., Ahmad, I., Arshad, M., Jarasthitikulchai, N., & Sudsutad, W. (2022). Some Iterative Approximation Results of F Iteration Process in Banach Spaces. Axioms, 11(4), 153. https://doi.org/10.3390/axioms11040153

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop