Convergence analysis for a new faster iteration method

Abstract

In this paper, we introduce a new iteration method and show that this iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that the new iteration method is equivalent to both Mann iteration method and Picard-Mann hybrid iteration method and also converges faster than Picard-Mann hybrid iteration method for the class of almost contraction mappings. In addition to these we give a table and graphics for support this result. Finally, we prove a data dependence result for almost contraction mappings by using the new iteration method.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…