Convergence rate of implicit iteration process and a data dependence result
From MaRDI portal
Abstract: The aim of this paper is to introduce an implicit S-iteration process and study its convergence in the framework of W-hyperbolic spaces. We show that the implicit S-iteration process has higher rate of convergence than implicit Mann type iteration and implicit Ishikawa-type iteration processes. We present a numerical example to support the analytic result proved herein. Finally, we prove a data dependence result for a contractive type mapping using implicit S-iteration process.
Recommendations
- On the rate of convergence of different implicit iterations in convex metric spaces
- Comparison rate of convergence and data dependence for a new iteration method
- Convergence and data dependence results of an iteration process in a hyperbolic space
- On a new faster implicit fixed point iterative scheme in convex metric spaces
- Jungck-type implicit iterative algorithms with numerical examples
Cites work
- scientific article; zbMATH DE number 5837659 (Why is no real title available?)
- scientific article; zbMATH DE number 2172770 (Why is no real title available?)
- scientific article; zbMATH DE number 2201881 (Why is no real title available?)
- scientific article; zbMATH DE number 7696267 (Why is no real title available?)
- A convexity in metric space and nonexpansive mappings. I.
- Approximating the common fixed points of two sequences of uniformly quasi-Lipschitzian mappings in convex metric spaces
- Convergence of a general iterative scheme for a finite family of asymptotically quasi-nonexpansive mappings in convex metric spaces and applications
- Convergence of an implicit algorithm for two families of nonexpansive mappings
- Convergence theorems for common fixed points of asymptotically quasi-nonexpansive mappings in convex metric spaces
- Data dependence for Ishikawa iteration when dealing with contractive-like operators
- Fixed point theorems in metric spaces
- Implicit Mann fixed point iterations for pseudo-contractive mappings
- On Mann implicit iterations for strongly accretive and strongly pseudo-contractive mappings
- On analytical and numerical study of implicit fixed point iterations
- On the convergence of the Ishikawa iterates to a common fixed point of two mappings.
- Picard iteration converges faster than Mann iteration for a class of quasi-contractive operators
- Short proofs of stability results for fixed point iteration procedures for a class of contractive-type mappings
- Some logical metatheorems with applications in functional analysis
- Stronger convergence theorems for an infinite family of uniformly quasi-Lipschitzian mappings in convex metric spaces
Cited in
(4)- An efficient iterative procedure in hyperbolic space and application to non-linear delay integral equation
- On Berinde's method for comparing iterative processes
- Comparison rate of convergence and data dependence for a new iteration method
- Existence, error estimation, rate of convergence, Ulam-Hyers stability, well-posedness and limit shadowing property related to a fixed point problem
This page was built for publication: Convergence rate of implicit iteration process and a data dependence result
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606898)
