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.
In this paper, we proved coincidence points theorems for two pairs mappings which are defined on nonempty subset in metric spaces by using condition (1.1). As application, we established a unique common fixed points theorems for these mappings by using the concept weakly compatible (R-weakly commuting) between these mappings.
In this paper we prove a theorem about the existence and uniqueness common fixed point for two uncommenting self-mappings which defined on orbitally complete G-metric space. Where we use a general contraction condition.
In this paper, developed Jungck contractive mappings into fuzzy Jungck contractive and proved fuzzy fixed point for some types of generalize fuzzy Jungck contractive mappings.
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.
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.
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.
This manuscript presents several applications for solving special kinds of ordinary and partial differential equations using iteration methods such as Adomian decomposition method (ADM), Variation iterative method (VIM) and Taylor series method. These methods can be applied as well as to solve nonperturbed problems and 3rd order parabolic PDEs with variable coefficient. Moreover, we compare the results using ADM, VIM and Taylor series method. These methods are a commination of the two initial conditions.
In the context of normed space, Banach's fixed point theorem for mapping is studied in this paper. This idea is generalized in Banach's classical fixed-point theory. Fixed point theory explains many situations where maps provide great answers through an amazing combination of mathematical analysis. Picard- Lendell's theorem, Picard's theorem, implicit function theorem, and other results are created by other mathematicians later using this fixed-point theorem. We have come up with ideas that Banach's theorem can be used to easily deduce many well-known fixed-point theorems. Extending the Banach contraction principle to include metric space with modular spaces has been included in some recent research, the aim of study proves some pro
... Show More