In this study, considering the advantages of parallel fixed point algorithms arising from their symmetrical behavior, new types of parallel algorithms have been defined. Strong convergence of these algorithms for certain mappings with altering points has been analyzed, and it has been observed that their convergence behavior is better than existing algorithms with non-simple samples. In addition, the concept of data dependency for these algorithms has been examined for the first time in this study. Finally, it has been proven that the solution of a variational inequality system can be obtained using newly defined parallel algorithms under suitable conditions.
1 June 2020 in Iğdır Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Bu çalışmada yeni bir iterasyon yöntemi tanımlanmıştır. Bu iterasyon yönteminin Banach uzaylarında uygun koşullar altında yakınsaklığı incelenmiştir ve başka bir iterasyon yöntemiyle yakınsama anlamında denk olduğu gösterilmiştir. Son olarak yeni iterasyon yönteminin literatürdeki mevcut bir iterasyon yöntemine göre daha iyi bir yakınsama hızına sahip olduğu ispatlanarak bu sonucu destekleyen bir örnek verilmiştir.
5 January 2026 in Mathematical Sciences and Applications E-Notes
In this paper, we give comprehensive details about iteration methods to solve equilibrium problems through viscosity type approximation. This study introduces a new viscosity type iteration method in order to find the common point of the set of fixed points of nonexpansive mappings and relaxed $(a,b)$-cocoercive mapping, and the groups of solutions for of variational inequality and an equilibrium problem in Hilbert spaces. We also argue that this iteration method strongly converges to a common point in the mentioned three sets. As part of the applications, we give an example supporting the convergence theorem. As we emphasize the concept of data dependency for fixed point theory, we present the data dependence result for the fixed points of the stated class of mappings for the novel iteration method via viscosity type approximation.
1 July 2026 in Computational Mathematics and Mathematical Physics
In this study, we introduce a new Kirk-type iteration method that includes some important iteration algorithms in its special cases. Afterward, we investigate the behaviors of strong convergence and fixed point of this iteration method under certain mappings. According to the obtained results, it is theoretically observed that the convergence behavior of the new Kirk-type iteration method is better than some of the existing Kirk-type iteration methods. Furthermore, the rate of convergence studied in this paper is numerically compared with the same Kirk-type iteration methods as well as with some classical iteration methods. Also, new iteration method has been proven to be stable under certain conditions. As another important research topic, the concept of data dependency of Kirk-type iteration method, which has not been studied in the literature, was proved for the first time in this study. It was shown that the solution of a nonlinear equation can be reached more efficiently through this type of iteration method. Finally, we show that the theoretical results obtained throughout the study are valid with interesting numerical examples.