Photo by helloimnik from unsplash
In this paper, we introduce a three step iteration method and show that this method can be used to approximate fixed point of weak contraction mappings. Furthermore, we prove that… Click to show full abstract
In this paper, we introduce a three step iteration method and show that this method can be used to approximate fixed point of weak contraction mappings. Furthermore, we prove that this iteration method is equivalent to Mann iterative scheme and converges faster than Picard-S iterative scheme for the class of weak contraction mappings. We also present tables and three graphics to support this result. Finally, we prove a data dependence result for weak contraction mappings using this three step iterative scheme.
Keywords:
iteration;
fixed point;
iterative scheme;
contraction mappings;
weak contraction
Journal Title: Fixed Point Theory
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Fixed Point Theory
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!