Samet Maldar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Samet Maldar has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Esra Çetin
MINISTRY OF NATIONAL EDUCATION OF REPUBLIC OF TÜRKİYE
1 shared publication - Faik Gürsoy
Department of Mathematics, Adiyaman University, Adiyaman, Türkiye
1 shared publication - Mujahid Abbas
Department of Mechanical Engineering Science, University of Johannesburg, Johannesburg 2092, South Africa
1 shared publication - Vatan Karakaya
Yildiz Technical University
1 shared publication - Yunus Atalan
Aksaray Üniversitesi
1 shared publication
Latest Publications
- 1 July 2026
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 66 (7) , 1190-1206
On Convergence, Stability, and Data Dependence of a New Kirk-Type Iteration Process
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.
- 1 July 2026
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 66 (7) , 1190-1206
On Convergence, Stability, and Data Dependence of a New Kirk-Type Iteration Process
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.
- 5 January 2026
- Published by Mathematical Sciences and Applications E-Notes in Mathematical Sciences and Applications E-Notes
- No. Advanced O,p. 1-20
Solutions of Equilibrium Problems with Fixed Point Iteration Method and Data Dependence
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.
- 5 January 2026
- Published by Mathematical Sciences and Applications E-Notes in Mathematical Sciences and Applications E-Notes
- No. Advanced O,p. 1-20
Solutions of Equilibrium Problems with Fixed Point Iteration Method and Data Dependence
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.
- Open Access
New Parallel Fixed Point Algorithms and Their Application to a System of Variational Inequalities
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.
Open AccessNew Parallel Fixed Point Algorithms and Their Application to a System of Variational Inequalities
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.
- 27 September 2021
- Published by Celal Bayar University Journal of Science in Celal Bayar Üniversitesi Fen Bilimleri Dergisi
- Vol. 17 (3) , 313-318
On Iteration Method to The Solution of More General Volterra Integral Equation in Two Variables and a Data Dependence Result
Fixed point theory is one of the most important theories and has been studied extensively by researchers in many disciplines. One of these studies is its application to integral equations. In this work, we have shown that the iteration method given in [12] converges to the solution of the more general Volterra integral equation in two variables by using Bielecki’s norm. Also, a data dependence result for the solution of this integral equation has been proven.
- 27 September 2021
- Published by Celal Bayar University Journal of Science in Celal Bayar Üniversitesi Fen Bilimleri Dergisi
- Vol. 17 (3) , 313-318
On Iteration Method to The Solution of More General Volterra Integral Equation in Two Variables and a Data Dependence Result
Fixed point theory is one of the most important theories and has been studied extensively by researchers in many disciplines. One of these studies is its application to integral equations. In this work, we have shown that the iteration method given in [12] converges to the solution of the more general Volterra integral equation in two variables by using Bielecki’s norm. Also, a data dependence result for the solution of this integral equation has been proven.
- 15 July 2021
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 68 (3) , 1841-1868
Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem
- 15 July 2021
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 68 (3) , 1841-1868
Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem
- 16 April 2021
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 68 (2) , 863-883
On a three-step iteration process for multivalued Reich-Suzuki type $\alpha $-nonexpansive and contractive mappings- 16 April 2021
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 68 (2) , 863-883
On a three-step iteration process for multivalued Reich-Suzuki type $\alpha $-nonexpansive and contractive mappings- 1 June 2020
- Published by Igdir University in Iğdır Üniversitesi Fen Bilimleri Enstitüsü Dergisi
- Vol. 10 (2) , 1263-1272
Rate of Convergence for A New Iteration Method
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.
- 1 June 2020
- Published by Igdir University in Iğdır Üniversitesi Fen Bilimleri Enstitüsü Dergisi
- Vol. 10 (2) , 1263-1272
Rate of Convergence for A New Iteration Method
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.