This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations like Mann, Ishikawa, oor, D- iterations, and *- iteration for new contraction mappings called quasi contraction mappings. And we proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *- iteration) equivalent to approximate fixed points of quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type by employing zenali iteration also discussed.
In our research, we introduced new concepts, namely *and **-light mappings, after we knew *and **-totally disconnected mappings through the use of -open sets.
Many examples, facts, relationships and results have been given to support our work.
In this article, we will present a quasi-contraction mapping approach for D iteration, and we will prove that this iteration with modified SP iteration has the same convergence rate. At the other hand, we prove that the D iteration approach for quasi-contraction maps is faster than certain current leading iteration methods such as, Mann and Ishikawa. We are giving a numerical example, too.
The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
In this article, the partially ordered relation is constructed in geodesic spaces by betweeness property, A monotone sequence is generated in the domain of monotone inward mapping, a monotone inward contraction mapping is a monotone Caristi inward mapping is proved, the general fixed points for such mapping is discussed and A mutlivalued version of these results is also introduced.
The study of fixed points on the maps fulfilling certain contraction requirements has several applications and has been the focus of numerous research endeavors. On the other hand, as an extension of the idea of the best approximation, the best proximity point (ƁƤƤ) emerges. The best approximation theorem ensures the existence of an approximate solution; the best proximity point theorem is considered for addressing the problem in order to arrive at an optimum approximate solution. This paper introduces a new kind of proximal contraction mapping and establishes the best proximity point theorem for such mapping in fuzzy normed space ( space). In the beginning, the concept of the best proximity point was introduced. The concept of prox
... Show MoreThe best proximity point is a generalization of a fixed point that is beneficial when the contraction map is not a self-map. On other hand, best approximation theorems offer an approximate solution to the fixed point equation . It is used to solve the problem in order to come up with a good approximation. This paper's main purpose is to introduce new types of proximal contraction for nonself mappings in fuzzy normed space and then proved the best proximity point theorem for these mappings. At first, the definition of fuzzy normed space is given. Then the notions of the best proximity point and - proximal admissible in the context of fuzzy normed space are presented. The notion of α ̃–ψ ̃- proximal contractive mapping is introduced.
... Show MoreThe focus of this article, reviewed a generalized of contraction mapping and nonexpansive maps and recall some theorems about the existence and uniqueness of common fixed point and coincidence fixed-point for such maps under some conditions. Moreover, some schemes of different types as one-step schemes ,two-step schemes and three step schemes (Mann scheme algorithm, Ishukawa scheme algorithm, noor scheme algorithm, .scheme algorithm, scheme algorithm Modified scheme algorithm arahan scheme algorithm and others. The convergence of these schemes has been studied .On the other hands, We also reviewed the convergence, valence and stability theories of different types of near-plots in convex metric space.
We define L-contraction mapping in the setting of D-metric spaces analogous to L-contraction mappings [1] in complete metric spaces. Also, give a definition for general D- matric spaces.And then prove the existence of fixed point for more general class of mappings in generalized D-metric spaces.