Comparison of The Speed of Convergence Among Various Iterative Schemes
classification
🧮 math.FA
keywords
iterativeschemecontractionkarahanmappingsozdemirproveapproximate
read the original abstract
We show that iterative scheme due to Karahan and \"Ozdemir (2013) can be used to approximate fixed point of contraction mappings. Furthermore, we prove that CR iterative scheme converges faster than the iterative scheme due to Karahan and \"Ozdemir (2013) for the class contraction mappings. Finally, we prove a data dependence result for contraction mappings by employing iterative scheme due to Karahan and \"Ozdemir (2013).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.