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.
The purpose of this research is to introduce a concept of general partial metric spaces as a generalization of partial metric space. Give some results and properties and find relations between general partial metric space, partial metric spaces and D-metric spaces.
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.
This paper is concerned with the study of the fixed points of set-valued contractions on ordered metric spaces. The first part of the paper deals with the existence of fixed points for these mappings where the contraction condition is assumed for comparable variables. A coupled fixed point theorem is also established in the second part.
The concept of separation axioms constitutes a key role in general topology and all generalized forms of topologies. The present authors continued the study of gpα-closed sets by utilizing this concept, new separation axioms, namely gpα-regular and gpα-normal spaces are studied and established their characterizations. Also, new spaces namely gpα-Tk for k = 0, 1, 2 are studied.
The 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 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 paper aims at initiating and exploring the concept of extended metric known as the Strong Altering JS-metric, a stronger version of the Altering JS-metric. The interrelation of Strong Altering JS-metric with the b-metric and dislocated metric has been analyzed and some examples have been provided. Certain theorems on fixed points for expansive self-mappings in the setting of complete Strong Altering JS-metric space have also been discussed.
In this paper,there are new considerations about the dual of a modular spaces and weak convergence. Two common fixed point theorems for a -non-expansive mapping defined on a star-shaped weakly compact subset are proved, Here the conditions of affineness, demi-closedness and Opial's property play an active role in the proving our results.
In this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.
The 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.