The aim of this paper is to study the convergence of an iteration scheme for multi-valued mappings which defined on a subset of a complete convex real modular. There are two main results, in the first result, we show that the convergence with respect to a multi-valued contraction mapping to a fixed point. And, in the second result, we deal with two different schemes for two multivalued mappings (one of them is a contraction and other has a fixed point) and then we show that the limit point of these two schemes is the same. Moreover, this limit will be the common fixed point the two mappings.
In this paper, some basic notions and facts in the b-modular space similar to those in the modular spaces as a type of generalization are given. For example, concepts of convergence, best approximate, uniformly convexity etc. And then, two results about relation between semi compactness and approximation are proved which are used to prove a theorem on the existence of best approximation for a semi-compact subset of b-modular space.
This paper presents results about the existence of best approximations via nonexpansive type maps defined on modular spaces.
In this article, results have been shown via using a general quasi contraction multi-valued mapping in Cat(0) space. These results are used to prove the convergence of two iteration algorithms to a fixed point and the equivalence of convergence. We also demonstrate an appropriate conditions to ensure that one is faster than others.
The aim of this article, we define new iterative methods called three-step type in which Jungck resolvent CR-iteration and resolvent Jungck SP-iteration are discussed and study rate convergence and strong convergence in Banach space to reach the fixed point which is differentially solve of nonlinear equations. The studies also expanded around it to find the best solution for nonlinear operator equations in addition to the varying inequalities in Hilbert spaces and Banach spaces, as well as the use of these iterative methods to approximate the difference between algorithms and their images, where we examined the necessary conditions that guarantee the unity and existence of the solid point. Finally, the results show that resolvent CR-iter
... Show More<p>In this paper, we prove there exists a coupled fixed point for a set- valued contraction mapping defined on X× X , where X is incomplete ordered G-metric. Also, we prove the existence of a unique fixed point for single valued mapping with respect to implicit condition defined on a complete G- metric.</p>
The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result.
In the present study, the cluster concept was adopted to find points parallel to the cumulative points of any subset in topology cluster proximity spaces. The takeoff set term was given by the researcher to the set of all points. Also, an opposite definition was found for it, which is the follower set. The relation between them was found and their most important properties were highlighted. Through these two sets, new sets were built that are called, f_σ-set ,f_tσ-set ,t_fσ-set ,bushy set, scant set .
The purpose of this paper, is to study different iterations algorithms types three_steps called, new iteration,
In this work, we introduce Fibonacci– Halpern iterative scheme ( FH scheme) in partial ordered Banach space (POB space) for monotone total asymptotically non-expansive mapping (, MTAN mapping) that defined on weakly compact convex subset. We also discuss the results of weak and strong convergence for this scheme.
Throughout this work, compactness condition of m-th iterate of the mapping for some natural m is necessary to ensure strong convergence, while Opial's condition has been employed to show weak convergence. Stability of FH scheme is also studied. A numerical comparison is provided by an example to show that FH scheme is faster than Mann and Halpern iterative
... Show More