Open AccessSome Theorems of Fixed Point Approximations By Iteration Processes
Author(s) -
Zena Hussein Maibed,
Saad Shakeir Hussein
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1818/1/012153
Subject(s) - fixed point iteration , power iteration , fixed point , arnoldi iteration , mathematics , preconditioner , contraction (grammar) , iterative method , contraction mapping , process (computing) , algorithm , mathematical optimization , computer science , mathematical analysis , medicine , operating system
The purpose of this paper, is to study different iterations algorithms types three_steps called, new iteration, M ∗ −iteration, k −iteration, and Noor-iteration, for approximation of fixed points. We show that the new iteration process is faster than the existing leading iteration processes like M ∗ −iteration, k −iteration, and Noor-iteration process, for like contraction mappings. We support our analytic proof with a numerical example.