Jungck-type implicit iterative algorithms with numerical examples
We introduce a new Jungck-type implicit iterative scheme and study its strong convergence, stability under weak parametric restrictions in generalized convex metric spaces and data dependency in generalized hyperbolic spaces. We show thatnewintroduced iterative scheme has better convergence rate as compared to well known Jungck implicit Mann, Jungck implicit Ishikawa and Jungck implicit Noor iterative schemes. It is also shown that Jungck implicit iterative schemes converge faster than the corresponding Jungck explicit iterative schemes. Validity of our analytic proofs is shown through numerical examples. Our results are improvements and generalizations of some recent results of Khan et al.[21], Chugh et al.[8] and many others in fixed point theory.