Search

We introduce multivalued G\'{o}rnicki mapping and various new types of multivalued enriched contractive mappings, viz., multivalued enriched Kannan mapping, multivalued enriched Chatterjea mapping, and multivalued enriched Ciri\'{c}-Reich-Rus mapping. Then we establish some existence results for the fixed points of these multivalued contractive type mappings using the fixed point property of the average operator of the mappings. Furthermore, we present some data dependence results for the fixed points of mentioned classes of mappings.

We study the convergence analysis of a Picard-S iteration method for a particular class of weak-contraction mappings. Furthermore, we prove a data dependence result for fixed point of the class of weak-contraction mappings with the help of the Picard-S iteration methods.

We introduce a new iteration method called Picard-S iteration. We show that the Picard-S iteration method can be used to approximate fixed point of contraction mappings. Also, we show that our new iteration method is equivalent and converges faster than CR iteration method for the aforementioned class of mappings. Furthermore, by providing an example, it is shown that the Picard-S iteration method converges faster than all Picard, Mann, Ishikawa, Noor, SP, CR, S and some other iteration methods in the existing literature when applied to contraction mappings. A data dependence result is proven for fixed point of contraction mappings with help of the new iteration method. Finally, we show that the Picard-S iteration method can be used to solve differential equations with retarded argument.

We show that iterative scheme due to Karahan and \"Ozdemir (2013) can be used to approximate fixed point of contraction mappings. Furthermore, we prove that CR iterative scheme converges faster than the iterative scheme due to Karahan and \"Ozdemir (2013) for the class contraction mappings. Finally, we prove a data dependence result for contraction mappings by employing iterative scheme due to Karahan and \"Ozdemir (2013).

The purpose of this paper is to introduce a new Kirk type iterative algorithm called Kirk multistep iteration and to study its convergence. We also prove some theorems related with the stability results for the Kirk-multistep and Kirk-SP iterative processes by employing certain contractive-like operators. Our results generalize and unify some other results in the literature.

Fuzzy logic was introduced by Zadeh in 1965. Since then, the importance of fuzzy logic has come increasingly to the present.There are many applications of fuzzy logic in the field of science and engineering, e.g. population dynamics (Barros), chaos control (Feng,Fradkov), computer programming (Giles), nonlinear dynamical systems (Hong), etc. The concept of intuitionistic fuzzy set, as a generalization of fuzzy logic, was introduced by Atanassov in 1986. Quite recently Park has introduced the concept of intuitionistic fuzzy metric space, and Saadati and Park studied the notion of intuitionistic fuzzy normed space. Intuitionistic fuzzy analogues of many concept in classical analysis was studied by many authors (Mursaleen, Rsaadati, Jebril, Dinda, etc.). The concept of statistical convergence was introduced by Fast. Mursaleen defined {\lambda}-statistical convergence in Muhammed. Also the concept of statistical convergence was studied in intuitionistic fuzzy normed space in Karakus..Quite recently, Karakaya et al. defined and studied statistical convergence of function sequences in intuitionistic fuzzy normed spaces. Mohiuddine and Lohani defined and studied {\lambda}-statistical convergence in intuitionistic fuzzy normed spaces (Lohani). In this paper, we shall study concept {\lambda}-statistical convergence for function sequences and investigate some basic properties related to the concept in intuitionistic fuzzy normed space., Comment: MSC intuitionistic fuzzy normed space, uniform and pointwise {\lambda}-statistical convergence