Next Article in Journal
Some Inequalities for Convex Sets
Next Article in Special Issue
Semilocal Convergence of the Extension of Chun’s Method
Previous Article in Journal
The Existence and Uniqueness of an Entropy Solution to Unilateral Orlicz Anisotropic Equations in an Unbounded Domain
Previous Article in Special Issue
An Accelerated Extragradient Method for Solving Pseudomonotone Equilibrium Problems with Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some New Results on a Three-Step Iteration Process

1
Department of Mathematics, University of Science and Technology, Bannu 28100, Khyber Pakhtunkhwa, Pakistan
2
Institute of Research and Development of Processes, University of the Basque Country, Campus of Leioa (Bizkaia), P.O. Box 644-Bilbao, Barrio Sarriena, 48940 Leioa, Spain
*
Author to whom correspondence should be addressed.
Axioms 2020, 9(3), 110; https://doi.org/10.3390/axioms9030110
Submission received: 22 July 2020 / Revised: 9 September 2020 / Accepted: 14 September 2020 / Published: 17 September 2020
(This article belongs to the Special Issue Iterative Processes for Nonlinear Problems with Applications)

Abstract

:
The purpose of this research work is to prove some weak and strong convergence results for maps satisfying (E)-condition through three-step Thakur (J. Inequal. Appl. 2014, 2014:328.) iterative process in Banach spaces. We also present a new example of maps satisfying (E)-condition, and prove that its three-step Thakur iterative process is more efficient than the other well-known three-step iterative processes. At the end of the paper, we apply our results for finding solutions of split feasibility problems. The presented research work updates some of the results of the current literature.

1. Introduction

Let T be a selfmap on a subset W of a Banach space U = ( U , . ) . Subsequently, T is called contraction map on W if for each pair of elements w , w W , there is some real constant α [ 0 , 1 ) , such that
T w T w α w w .
If (1) holds at α = 1 , then T is called non-expansive. When a point g W exists with the property T g = g , then g is called a fixed point of T. The fixed point set of T we often denote by the notation F i x ( T ) . In 1922, Banach [1] proved that any self contraction map of a closed subset W of a Banach space has a unique fixed point. Later, the Banach result [1] was extended by Caccioppoli [2] in complete metric spaces. In 1965, Browder [3] and Gohde [4] proved that any self non-expansive map of a convex bounded closed subset W of a uniformly convex Banach space U always admits a fixed point. The Browder-Gohde result was proved by Kirk [5] in the context of reflexive Banach spaces. We know that the class of non-expansive maps is important as an application point of view. Thus, it is very natural to consider larger classes of non-expansive maps. One of the larger class of non-expansive maps was introduced by Suzuki [6] in 2008. A selfmap T on a subset W of a Banach space is said to be Suzuki map (or said to satisfy ( C ) -condition), if for each pair of elements w , w W , it follows that
1 2 w T w w w T w T w w w .
Suzuki also proved that, if a map T satisfies ( C ) -condition, then for all w , w W , w T w 3 w T w + w w holds.
Inspired by Suzuki ( C ) -condition, Garcia-Falset et al. [7] introduced ( E ) -condition, as follows: a selfmap T on a subset W of a Banach space is said be Garcia-Falset map (or said to satisfy ( E ) -condition), if for each pair of elements w , w W , there is some real constant μ 1 , such that
w T w μ w T w + w w .
We see that any map T with ( C ) -condition satisfies ( E ) -condition with real constant μ = 3 . Nevertheless, an example in the Section 4 shows that there exists maps in the class of Garcia-Falset maps which does not belong to the class of Suzuki maps. Hence, the class of Garica-Falset maps properly includes the class of Suzuki maps. Garcia-Falset et al. [7] also proved some existence theorems of fixed points for maps satisfying ( E ) -condition. Recently, Usurelu et al. [8] studied some fixed point results for this class of maps and using an example, they studied the visualization of convergence behaviors of some iterative processes. In this paper, we use the three-step iterative process, which is different from the iterative process used in [8] for approximating fixed points of maps of this class. We also present a new example of maps satisfying ( E ) -condition, and prove that its under the consideration three-step iterative process is more efficient than the other well-known three-step iterative processes. In the last section, we shall apply our results for finding solutions of split feasibility problems.
However, once the existence of fixed point for an operator is established, then the finding of this fixed point is not easy work. One of the simplest iterative method for finding fixed points is the Picard iterative method, which is, w k + 1 = T w k . The Banach–Caccioppoli result states that the unique fixed point of contractions can be obtained by using the Picard iterative method. Nevertheless, the Picard iterative method does not always work properly in the finding of fixed points of non-expansive maps. For finding fixed points of non-expansive maps and to obtain relatively better convergence speed, one deals with the different iterative methods, e.g., Mann [9], Ishikawa [10], Agarwal [11], Noor [12], Abbas [13], and others. Among the other things, Thakur et al. [14] introduced the following three-step iterative process for finding fixed points of non-expansive maps in Banach spaces, as follows:
w 1 W , z k = ( 1 c k ) w k + c k T w k , y k = ( 1 b k ) z k + b k T z k , w k + 1 = ( 1 a k ) T w k + a k T y k , k N ,
where a k , b k , c k ( 0 , 1 ) .
In [14], Thakur et al. proved some important strong and weak convergence theorems of the iterative process (2) for the class of non-expansive maps in the context of uniformly convex Banach spaces. Recently in 2020, Maniu [15] extended the results of Thakur et al. [14] to the setting of Suzuki maps. The purpose of this research is to extend the results of Maniu [15] to the more general setting of Garcia–Falset maps. We also study the rate of convergence of the iterative process (2) with the some well-known three-step iterative processes in the setting of Garcia-Falset maps, under different initial points and set of parameters. At the end of the paper, we shall apply our results to find the solution of split feasibility problems.

2. Preliminaries

In this section, we shall deal with some basic definitions and early results. Let W be any nonempty subset of a Banach space U. Fix p U and assume that { w k } U is bounded. Define r ( p , { w k } ) by
r ( p , { w k } ) : = lim sup k p w k .
We denote the asymptotic radius of { w k } with respect to W by r ( W , { w k } ) and define, as follows:
r ( W , { w k } ) : = inf { r ( p , { w k } ) : p W } .
We denote the asymptotic center of { w k } with respect to W by A ( W , { w k } ) and define, as follows:
A ( W , { w k } ) : = { p W : r ( p , { w k } ) = r ( W , { w k } ) } .
The asymptotic center of { w k } with respect to W is nonempty and convex whenever W is convex weakly compact, (see, e.g., [16,17] and others). One of the well known property of the set A ( W , { w k } ) is the singletoness property in the frame work of uniformly convex Banach spaces [18].
Recall that a Banach space U is said to have Opial’s property [19], if, for any weakly convergent sequence { t k } in U with a weak limit t U , follows the following strict inequality
lim sup k t k t < lim sup k t k s for every s U { t } .
The following result shows that the class of Suzuki maps is a sub-class of Garcia–Falset maps.
Lemma 1.
[7] Let W be a nonempty subset of a Banach space and let T : W W satisfies ( C ) -condition. Subsequently, T satisfies ( E ) -condition with μ = 3 .
Lemma 2.
[7] Let W be a nonempty subset of a Banach space and let T : W W satisfies ( E ) -condition. Subsequently, for all g F i x ( T ) and w W , we have T g T w g w .
Lemma 3.
[7] Let T be a selfmap on a subset W of a Banach space having Opial property. Let T satisfy the ( E ) -condition. If { w k } is weakly convergent to g and lim k w k T w k = 0 , then g F i x ( T ) .
The following characterization is due to Schu [20].
Lemma 4.
Let U be a uniformly convex Banach space, 0 < a g k b < 1 for every natural number k 1 and η 0 be some real constant. If { q k } and { p k } are any two sequences in U, such that lim sup k q k η , lim sup k p k η and lim k g k q k + ( 1 g k ) p k = η , then lim k q k p k = 0 .

3. Convergence Results in Banach Spaces

This section contains some weak and strong convergence results of the iterative process (2) for operators satisfying ( E ) -condition. Throughout the section, U will stand for uniformly convex Banach space.
Lemma 5.
Let W be a nonempty convex closed subset of U and T : W W be a map satisfying ( E ) -condition with F i x ( T ) . If { w k } is generated by (2), then lim k w k g exists for every g F i x ( T ) .
Proof. 
Let g F i x ( T ) . By Lemma 2, we have
z k g = ( 1 c k ) w k + c k T w k g ( 1 c k ) w k g + c k T w k g ( 1 c k ) w k g + c k w k g w k g ,
and
y k g = ( 1 b k ) z k + b k T z k g ( 1 b k ) z k g + b k T z k g ( 1 b k ) z k g + b k z k g z k g .
While using the above inequilities, we have
w k + 1 g = ( 1 a k ) T w k + a k T y k g ( 1 a k ) T w k g + a k T y k g ( 1 a k ) w k g + a k y k g ( 1 a k ) w k g + a k z k g w k g .
Thus, { w k g } is bounded and non-increasing, which implies that lim k w k g exists for each g F i x ( T ) . □
Now, we establish the following result which will be used throughout in the upcoming theorems.
Theorem 1.
Let W be a nonempty closed convex subset of U and let T : W W be a map satisfying ( E ) -condition. Let { w k } be the sequence defined by (2). Subsequently, F i x ( T ) if and only if { w k } is bounded and lim k T w k w k = 0 .
Proof. 
Let { w k } be bounded and lim k T w k w k = 0 . Let g A ( W , { w k } ) . We shall prove that T g = g . Since T satisfies ( E ) -condition, we have
r ( T g , { w k } ) = lim sup k w k T g μ lim sup k T w k w k + lim sup k w k g = lim sup k w k g = r ( g , { w k } ) .
It follows that T g A ( W , { w k } ) . Since A ( W , { w k } ) is singleton set, we have T g = g . Hence, F i x ( T ) .
Conversely, we assume that F i x ( T ) and g F i x ( T ) . We shall prove that { w k } is bounded and lim k w k T w k = 0 . By Lemma 5, lim k w k g exists and { w k } is bounded. Put
lim k w k g = η .
From the proof of Lemma 5, it follows that
z k g w k g
lim sup k z k g lim sup k w k g = η .
By Lemma 2, we have
lim sup k T w k g lim sup k w k g = η .
Again, from the proof of Lemma 5,
w k + 1 g ( 1 a k ) w k g + a k z k g .
It follows that
w k + 1 g w k g w k + 1 g w k g a k z k w w k g .
Accordingly, we can get w k + 1 g z k g .
η lim inf k z k g .
From (4) and (6), we get
η = lim k z k g .
From (7), we have
η = lim k z k g = lim k ( 1 c k ) ( w k g ) + c k ( T w k g ) .
Applying Lemma 4, we obtain
lim k T w k w k = 0 .
 □
Using compactness of the domain W, we establish the following strong convergence of { w k } generated by (2) for maps satisfying ( E ) -condition.
Theorem 2.
Let W be a nonempty convex compact subset of U and let T and { w k } be as in Theorem 1 and F i x ( T ) . Subsequently, { w k } converges strongly to a fixed point of T.
Proof. 
By compactness of W we can construct a subsequence { w k l } of { w k } such that lim k w k l u = 0 , for some u W . Because the map T satisfies ( E ) -condition, one can find some real constant μ 1 , such that
w k l T u μ w k l T w k l + w k l u .
In the view of Theorem 1, lim k w k l T w k l = 0 . Now, using lim k w k l T w k l = 0 and lim k w k l u = 0 , we have from (8), lim k w k l T u = 0 . Now, the uniqueness of limits in Banach space follows that T u = u . Hence, u is the fixed point of T. By Lemma 5, lim n w k u exists. Hence, u is the strong limit of { w k } . □
Theorem 3.
Let W be a nonempty closed convex subset of U and let T and { w k } be as in Theorem 1. If F i x ( T ) and lim inf k d i s t ( w k , F i x ( T ) ) = 0 . Subsequently, { w k } converges strongly to a fixed point of T.
Proof. 
The proof is elementary and, hence, omitted. □
The next theorem requires condition I of Sentor and Dotson [21]. The detail definition is given below.
Definition 1.
[21] Let W be a nonempty subset of U. A selfmap T of W is said to satisfy condition I if there is a nondecreasing function ξ with the properties ξ ( a ) = 0 if and only if a = 0 , ξ ( a ) > 0 for every a ( 0 , ) and w T w ξ ( d i s t ( w , F i x ( T ) ) ) for each w W .
Theorem 4.
Let W be a nonempty closed convex subset of U and let T and { w k } be as in Theorem 1 and F i x ( T ) . If T satisfies condition I, then { w k } converges strongly to a fixed point of T.
Proof. 
From Theorem 1, it follows that
lim inf k T w k w k = 0 .
From the definition of condition I, we have
w k T w k ξ ( dist ( w k , F i x ( T ) ) ) .
From (9), we get
lim inf k ξ ( dist ( w k , F i x ( T ) ) ) = 0 .
The function ξ : [ 0 , ) [ 0 , ) is non-decreasing and satisfy ξ ( 0 ) = 0 , ξ ( a ) > 0 for every a > 0 . Hence
lim inf k dist ( w k , F i x ( T ) ) = 0 .
By Theorem 3, we conclude that T converges to some fixed point of T. □
Using Opial’s property, we obtain the weak convergence of { w k } for maps with ( E ) -condition.
Theorem 5.
Let W a nonempty closed convex subset of U having Opial property and let T and { w k } be as in Theorem 1 and F i x ( T ) . Subsequently, { w k } converges weakly to a fixed point of T.
Proof. 
By Theorem 1, the sequence { w k } is bounded and lim k T w k w k = 0 . U is reflexive because U is uniform convex. Now, by reflexivity of U, we can construct a weakly convergent subsequence { w k s } of { w k } with some weak limit u 1 W . By Lemma 3, we conclude that u 1 F i x ( T ) . We claim that { w k } converges weakly to u 1 . Assume that u 1 is not the weak limit of { w k } . Accordingly, we choose another weakly convergent subsequence { w k t } of { w k } with some weak limit u 2 W and assume that u 2 u 1 . Again, by Lemma 3, u 2 F i x ( T ) . Using Lemma 5 and Opial condition, we have
lim k w k u 1 = lim s w k s u 1 < lim s w k s u 2 = lim k w k u 2 = lim t w k t u 2 < lim t w k t w 1 = lim k w k u 1 .
This is a contradiction. Hence u 1 is the weak limit of { w k } and fixed point of T. □

4. Numerical Example and Rate of Convergence

Example 1.
Define a selfmap T on W = [ 0 , 1 ] as follows:
T w = 0 i f w W 1 = 0 , 1 500 4 w 5 i f w W 2 = 1 500 , 1
First, we are going to show that T belongs to the class of Garcia–Falset maps, that is, we shall show that | w T w | μ | w T w | + | w w | for each pair of elements w , w W and some real constant μ 1 . Fix μ = 5 and consider the following cases.
(i):For w , w W 1 , we have
| w T w | = | w | 5 | w | = 5 | w T w | 5 | w T w | + | w w | .
(ii):For w , w W 2 , we have
| w T w | | w T w | + | T w T w | = | w T w | + | 4 w 5 4 w 5 | = | w T w | + 4 5 | w w | | w T w | + | w w | 5 | w T w | + | w w | .
(iii):For w W 2 and w W 1 , we have
| w T w | = | w | = 5 | w 5 | = 5 | w T w | 5 | w T w | + | w w | .
From the above cases, one can conclude that T belongs to the class of Garcia–Falset maps. Next, we show that T does not belong to the class of Suzuki maps. We select w = 1 800 and w = 1 500 . Susbequently, 1 2 | w T w | = 1 2 | w | = 1 1600 < 3 4000 = | w w | , but | T w T w | = | 4 w 5 | = 1 625 > 3 4000 = | w w | . For all k 1 , let a k = 0.70 and b k = 0.65 and c k = 0.45 . Table 1 shows that three-step Thakur iteration process [14] converges faster to the fixed point g = 0 as compared three-step Abbas [13] and three-step Noor [12] iterative processes.
In Example 1, we set different values for parameters a k , b k and c k and set stopping criterion w k w * < 10 15 , where the element w * = 0 is a unique fixed point of T. The influence of initial guess and parameter for the three-step Thakur [14], three-step Abbas [13], and three-step Noor [12] iterative processes can be seen in the Table 2, Table 3 and Table 4.

5. Application

In this section, we are interested in finding of the solution of a split feasibility problem (in short SFP) by using the three-step iterative method (2). To do this, we assume that U 1 and U 2 are any two real Hilbert spaces, C U 1 and Q U 2 be convex and closed. Assume that L : U 1 U 2 be a linear and bounded. Subsequently, the SFP mathematically described as finding an element w C , such that
w C , L w Q .
Next we assume that the solution set Ω associated with the SFP (10) is nonempty and let
Ω = { w C : L w Q } = C L 1 Q .
We see that the set Ω is nonempty convex as well as closed. Censor and Elfving [22] solved the class of inverse problems with the help of SFP. In the year 2002, Byrne [23] proposed the remarkable C Q -algorithm for solving the SFP. If γ ( 0 , 2 L 2 ) , P C and P Q represent the projections onto C and Q respectively and L * : U 2 * U 1 * is the adjoint of L, then the sequence { w k } of C Q -algorithm is generated iteratively, as follows:
w k + 1 = P C [ I γ L * ( I P Q ) L ] w k , k 0 .
The following facts are in [24].
Lemma 6.
If T = P C [ I γ L * ( I P Q ) L ] , for γ ( 0 , 2 L 2 ) , then T is non-expansive.
By assumption, the set Ω that is associated with a SFP is nonempty, one can see that the element w * C is the solution of SFP if and only if it solves the following fixed point equation:
P C [ I γ L * ( I P Q ) L ] w = w , w C .
Hence, the solution set Ω coincides with the fixed point set of the operator T, that is, F i x ( T ) = Ω = C L 1 Q . For details, one can refer [25,26].
Now, we present our main results.
Theorem 6.
Let T = P C [ I γ L * ( I P Q ) L ] and { w k } be a sequence defined by the iterative process (2), then { w k } converges weakly to the some solution of a SFP (10).
Proof. 
By Lemma 6, the operator T is non-expansive. In the view of Lemma 1, T is Garcia–Falset operator. The conclusions follows from Theorem 5. □
Theorem 7.
Let T = P C [ I γ L * ( I P Q ) L ] and { w k } be a sequence defined by the iterative process (2), then { w k } converges strongly to the solution of SFP (10), provided that lim inf k d ( w k , Ω ) = 0 .
Proof. 
Proof follows from Theorem 3. □

6. Conclusions

The three-step Thakur [14] iterative process converges faster than three-step Abbas [13] and three-step Noor [12] iterative process, respectively, for the example under consideration as shown in the Table 1, Table 2 and Table 3. The class of Garcia-Falset maps is wider than the class of Suzuki maps, as shown in the Example 1. Hence, our results update the results of Maniu [15] from the setting of Suzuki maps to the general setting of Garcia-Falset maps. We have also applied our results for finding solutions of split feasibility problems. Because our iterative process converges faster than Abbas and Noor iterations and the class of Garcia–Falset maps is more general than the class of non-expansive and Suzuki maps, so our results improve and extend the corresponding results in [6,7,12,13,14,15].

Author Contributions

K.U., J.A. and M.d.l.S. contributed equally in writing this article. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Basque Government Grant IT1207-1.

Acknowledgments

The authors are grateful to the Spanish Government for Grant RTI2018-094336-B-I00 (MCIU/AEI/FEDER, UE) and to the Basque Government for Grant IT1207-19.

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. Caccioppoli, R. Un teorema generale sull’ esistenza di elementi uniti in una transformazione funzionale. Rend. Accad. Lincei 1930, 11, 794–799. [Google Scholar]
  3. Browder, F.E. Nonexpansive nonlinear operators in a Banach space. Proc. Natl. Acad. Sci. USA 1965, 54, 1041–1044. [Google Scholar] [CrossRef] [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. Mon. 1965, 72, 1004–1006. [Google Scholar] [CrossRef] [Green Version]
  6. Suzuki, T. Fixed point theorems and convergence theorems for some generalized non-expansive mapping. J. Math. Anal. Appl. 2008, 340, 1088–1095. [Google Scholar] [CrossRef] [Green Version]
  7. Garcia-Falset, J.; Llorens-Fuster, E.; Suzuki, T. Fixed point theory for a class of generalized nonexpansive mappings. J. Math. Anal. Appl. 2011, 375, 185–195. [Google Scholar] [CrossRef] [Green Version]
  8. Usurelu, G.I.; Bejenaru, A.; Postolache, M. Operators with property (E) as concerns numerical anaysis and visualization. Numer. Func. Anal. Optim. 2020. [Google Scholar] [CrossRef]
  9. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  10. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  11. Agarwal, R.P.; O’Regon, D.; Sahu, D.R. Iterative construction of fixed points of nearly asymtotically non-expansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
  12. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef] [Green Version]
  13. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Math. Vesnik 2014, 66, 223–234. [Google Scholar]
  14. Thakur, B.S.; Thakur, D.; Postolache, M. New iteration scheme for numerical reckoning fixed points of nonexpansive mappings. J. Inequal. Appl. 2014, 2014, 328. [Google Scholar] [CrossRef] [Green Version]
  15. Maniu, G. On a three-step iteration process for Suzuki mappings with qualitative study. Numer. Funct. Anal. Optim. 2020. [Google Scholar] [CrossRef]
  16. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Fixed Point Theory for Lipschitzian-Type Mappings with Applications Series; Topological Fixed Point Theory and Its Applications; Springer: New York, NY, USA, 2009; Volume 6. [Google Scholar]
  17. Takahashi, W. Nonlinear Functional Analysis; Yokohoma Publishers: Yokohoma, Japan, 2000. [Google Scholar]
  18. Clarkson, J.A. Uniformly convex spaces. Trans. Am. Math. Soc. 1936, 40, 396–414. [Google Scholar] [CrossRef]
  19. Opial, Z. Weak and strong convergence of the sequence of successive approximations for non-expansive mappings. Bull. Am. Math. Soc. 1967, 73, 591–597. [Google Scholar] [CrossRef] [Green Version]
  20. Schu, J. Weak and strong convergence to fixed points of asymptotically non-expansive mappings. Bull. Austral. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef] [Green Version]
  21. Senter, H.F.; Dotson, W.G. Approximating fixed points of non-expansive mappings. Proc. Am. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
  22. Censor, Y.; Elfving, T. A multiprojection algorithm using Bregman projections in a product space. Numer. Algor. 1994, 8, 221–239. [Google Scholar] [CrossRef]
  23. Byrne, C. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Prob. 2002, 18, 411–453. [Google Scholar] [CrossRef]
  24. Feng, M.; Shi, L.; Chen, R. A new three-step iterative algorithm for solving the split feasibility problem. Univ. Politeh. Buch. Ser. A 2019, 81, 93–102. [Google Scholar]
  25. Xu, H.K. A variable Krasnoselskii-Mann algorithm and the multiple-set split feasibility problem. Inverse Probl. 2006, 22, 2021–2034. [Google Scholar] [CrossRef]
  26. Xu, H.K. Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 2010, 26, 105018. [Google Scholar] [CrossRef]
Table 1. Strong convergence of three-step iterative processes while using T given in Example 1.
Table 1. Strong convergence of three-step iterative processes while using T given in Example 1.
Three-Step ThakurThree-Step AbbasThree-Step Noor
w 1 0.50.50.5
w 2 0.3291780000000000.3545920000000000.354888000000000
w 3 0.2167163113680000.2514709729280000.251890985088000
w 4 0.1426764838869910.1783391904649700.178786175831820
w 5 0.0939319192259030.1264753004507090.126898136737206
w 6 0.0618406426138890.0896942594748360.090069251900787
w 7 0.0407131581087090.0636097337114020.063928993337133
w 8 0.0268037519198170.0451110053923870.045375265174857
w 9 0.0176464108989230.0319920032481940.032206274214749
w 10 0.0116176204937710.0226882168315600.022859240487047
w 11 0.0076485301577970.0160901203654780.016224940275934
w 12 0.0050354557205660.0114108559212710.011516073209292
w 13 0.0033151224863690.0080923964456710.008173832378198
w 14 0.0021825307796360.0057389980809260.005801590050068
w 15 0.0002619036935560.0040700056150230.004117829379377
w 16 00.0028863828620850.002922736465576
w 17 00.0020469765436640.002074488197591
w 18 000.000311173229638
Table 2. When a k = k k + 1 , b k = k k + 7 and c k = ( 1 3 k + 4 ) 1 2 .
Table 2. When a k = k k + 1 , b k = k k + 7 and c k = ( 1 3 k + 4 ) 1 2 .
Number of Iterates Required to Reach Fixed Point.
Initial Points Three-Step NoorThree-Step AbbasThree-Step Thakur
0.10231513
0.25261816
0.50272117
0.75282218
0.95292319
Table 3. When a k = k k + 3 , b k = k k + 7 and c k = 2 k 5 k + 2 .
Table 3. When a k = k k + 3 , b k = k k + 7 and c k = 2 k 5 k + 2 .
Number of Iterates Required to Reach Fixed Point.
Initial PointsThree-Step NoorThree-Step AbbasThree-Step Thakur
0.10181110
0.25191411
0.50201612
0.75201713
0.95201713
Table 4. When a k = 1 ( 1 k + 7 ) , b k = k 7 k + 25 1 7 and c k = k k + 25 .
Table 4. When a k = 1 ( 1 k + 7 ) , b k = k 7 k + 25 1 7 and c k = k k + 25 .
Number of Iterates Required to Reach Fixed Point.
Initial Points Three-Step NoorThree-Step AbbasThree-Step Thakur
0.10241513
0.25251816
0.50252017
0.75252118
0.95252219

Share and Cite

MDPI and ACS Style

Ullah, K.; Ahmad, J.; de la Sen, M. Some New Results on a Three-Step Iteration Process. Axioms 2020, 9, 110. https://doi.org/10.3390/axioms9030110

AMA Style

Ullah K, Ahmad J, de la Sen M. Some New Results on a Three-Step Iteration Process. Axioms. 2020; 9(3):110. https://doi.org/10.3390/axioms9030110

Chicago/Turabian Style

Ullah, Kifayat, Junaid Ahmad, and Manuel de la Sen. 2020. "Some New Results on a Three-Step Iteration Process" Axioms 9, no. 3: 110. https://doi.org/10.3390/axioms9030110

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