Yunus Atalan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yunus Atalan has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Faik Gürsoy
Department of Mathematics, Adiyaman University, Adiyaman, Türkiye
2 shared publications - Emirhan Hacıoğlu
Department of Mathematics, Trakya University, 22030 Edirne, Türkiye
1 shared publication - Ertan Gündoğdu
Department of Mathematics , Aksaray University , Aksaray , Türkiye
1 shared publication - Esra Erbaş
Aksaray University
1 shared publication - Esra Kiliç
Aksaray University
1 shared publication - Gradimir V. Milovanovic
Serbian Academy of Sciences and Arts, Belgrade, Serbia
1 shared publication
Latest Publications
- 23 October 2026
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
Approximating solutions of fractional differential equations via a new faster iteration scheme in hyperbolic spaces
In this paper, we introduce a new four-step fixed point iteration scheme in the framework of hyperbolic spaces as defined by Kohlenbach. We establish strong convergence theorems for the proposed iteration scheme for contractive-like mappings having a fixed point. Furthermore, we present a detailed rate analysis and prove that explicit error majorants for our iteration decay faster than those for the Abbas–Nazir iteration under suitable control-parameter assumptions. For positive affine contractions, this comparison also applies to actual errors. We also establish a data dependence result for the new scheme. Finally, we illustrate the theoretical findings through numerical examples and an application to a fractional differential equation. The examples show fewer iteration cycles at stated tolerances; iteration counts, operator-evaluation costs, and discretization errors are distinguished.
- 23 October 2026
- Published by Walter de Gruyter GmbH in Georgian Mathematical Journal
Approximating solutions of fractional differential equations via a new faster iteration scheme in hyperbolic spaces
In this paper, we introduce a new four-step fixed point iteration scheme in the framework of hyperbolic spaces as defined by Kohlenbach. We establish strong convergence theorems for the proposed iteration scheme for contractive-like mappings having a fixed point. Furthermore, we present a detailed rate analysis and prove that explicit error majorants for our iteration decay faster than those for the Abbas–Nazir iteration under suitable control-parameter assumptions. For positive affine contractions, this comparison also applies to actual errors. We also establish a data dependence result for the new scheme. Finally, we illustrate the theoretical findings through numerical examples and an application to a fractional differential equation. The examples show fewer iteration cycles at stated tolerances; iteration counts, operator-evaluation costs, and discretization errors are distinguished.
- Open Access
- 30 September 2025
- Published by Fundamental Journal of Mathematics and Applications in Fundamental Journal of Mathematics and Applications
- Vol. 8 (3) , 161-168
A New Iterative Process Based on Almost Contraction Operators
This research article provides proof of convergence in Banach spaces for a new fixed-point iterative process constructed with two operators satisfying certain conditions. Additionally, the convergence rate of this iterative process is examined, and the obtained result is supported by numerical examples. Finally, the concept of data dependence is analyzed.
- 30 September 2025
- Published by Fundamental Journal of Mathematics and Applications in Fundamental Journal of Mathematics and Applications
- Vol. 8 (3) , 161-168
Open AccessA New Iterative Process Based on Almost Contraction Operators
This research article provides proof of convergence in Banach spaces for a new fixed-point iterative process constructed with two operators satisfying certain conditions. Additionally, the convergence rate of this iterative process is examined, and the obtained result is supported by numerical examples. Finally, the concept of data dependence is analyzed.
- Open Access
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (1) , 1529-1554
Novel escape criteria for complex-valued hyperbolic functions through a fixed point iteration method
This study presented an efficient fixed-point iteration method for deriving novel escape criteria for hyperbolic sine and hyperbolic cosine functions of varying degrees. The method contributes to obtaining more accurate and effective escape criteria, thereby enhancing the mathematical understanding and computational analysis of these functions. Additionally, using the derived criteria, the iteration method was employed to generate visually appealing fractals for Julia and Mandelbrot sets, demonstrating significant advantages in computational speed and practical utility. The method's effective performance in producing complex and aesthetically satisfying fractal structures highlights its efficiency and applicability in fractal generation.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (1) , 1529-1554
Open AccessNovel escape criteria for complex-valued hyperbolic functions through a fixed point iteration method
This study presented an efficient fixed-point iteration method for deriving novel escape criteria for hyperbolic sine and hyperbolic cosine functions of varying degrees. The method contributes to obtaining more accurate and effective escape criteria, thereby enhancing the mathematical understanding and computational analysis of these functions. Additionally, using the derived criteria, the iteration method was employed to generate visually appealing fractals for Julia and Mandelbrot sets, demonstrating significant advantages in computational speed and practical utility. The method's effective performance in producing complex and aesthetically satisfying fractal structures highlights its efficiency and applicability in fractal generation.
- Open Access
- 7 August 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (4) , 869-890
Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification
In this paper, we introduce two novel forward-backward splitting algorithms (FBSAs) for nonsmooth convex minimization. We provide a thorough convergence analysis, emphasizing the new algorithms and contrasting them with existing ones. Our findings are validated through a numerical example. The practical utility of these algorithms in real-world applications, including machine learning for tasks such as classification, regression, and image deblurring reveal that these algorithms consistently approach optimal solutions with fewer iterations, highlighting their efficiency in real-world scenarios.
- 7 August 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 90 (4) , 869-890
Open AccessNovel algorithms based on forward-backward splitting technique: effective methods for regression and classification
In this paper, we introduce two novel forward-backward splitting algorithms (FBSAs) for nonsmooth convex minimization. We provide a thorough convergence analysis, emphasizing the new algorithms and contrasting them with existing ones. Our findings are validated through a numerical example. The practical utility of these algorithms in real-world applications, including machine learning for tasks such as classification, regression, and image deblurring reveal that these algorithms consistently approach optimal solutions with fewer iterations, highlighting their efficiency in real-world scenarios.
- Open Access
- 30 April 2024
- Published by Cihannuma Dayanisma ve Isbirligi Dernegi in Cihannüma Teknoloji Fen ve Mühendislik Bilimleri Akademi Dergisi
- Vol. 2 (1) , 44-55
Gecikmeli Diferansiyel Denklemlerin İteratif Çözümleri Üzerine
Quantitative and qualitative details that are important for some problems modeled as differential or integral equations can be made more explicit through fixed point iteration methods. Iteration methods are used as an effective tool to include an equation whose solution is under investigation into a class of operators under certain conditions and to obtain the solution of the equation with the help of this operator. In this study, the convergence of a new four-step iteration method is proved and it is shown that since delay differential equations can be included in the class of contraction mappings under certain conditions, the sequence obtained from the reconstructed four-step iteration method with the help of these equations converges to the solution of these equations. Sabit nokta teorisinin dinamik bir literatüre sahip olmasının altında yatan nedenlerin başında diferansiyel ve integral denklemler için varlık ve teklik teoremlerinin ispatlanmasına duyulan ihtiyaç gelmektedir. Diferansiyel-integral denklemler şeklinde modellenen problemleri çözmek için ortaya çıkan bu teori farklı alanlarda ilginç uygulamalara sahip olmasından dolayı genel ve soyut bir teori olarak düşünülebilir. Diferansiyel veya integral denklem şeklinde modellenen bazı problemler için önem arz eden nicel ve nitel ayrıntılar sabit nokta iterasyon yöntemleri aracılığıyla daha belirgin hale getirilebilir. Çözümü incelenen bir denklemi belirli şartlar altında bir operatör sınıfına dahil etmek ve bu operatör yardımıyla söz konusu denklemin çözümüne ulaşmak için iterasyon yöntemleri etkin bir araç olarak kullanılmaktadır. Bu çalışmada yeni dört adımlı bir iterasyon yönteminin yakınsaklığı ispatlanmış ve gecikmeli diferansiyel denklemler belirli şartları sağlamak kaydıyla daraltan dönüşüm sınıfına dahil edilebildiğinden bu denklemler yardımıyla yeniden inşa edilen dört adımlı iterasyon yönteminden elde edilen dizinin bu denklemlerin çözümüne yakınsadığı gösterilmiştir.
- 30 April 2024
- Published by Cihannuma Dayanisma ve Isbirligi Dernegi in Cihannüma Teknoloji Fen ve Mühendislik Bilimleri Akademi Dergisi
- Vol. 2 (1) , 44-55
Open AccessGecikmeli Diferansiyel Denklemlerin İteratif Çözümleri Üzerine
Quantitative and qualitative details that are important for some problems modeled as differential or integral equations can be made more explicit through fixed point iteration methods. Iteration methods are used as an effective tool to include an equation whose solution is under investigation into a class of operators under certain conditions and to obtain the solution of the equation with the help of this operator. In this study, the convergence of a new four-step iteration method is proved and it is shown that since delay differential equations can be included in the class of contraction mappings under certain conditions, the sequence obtained from the reconstructed four-step iteration method with the help of these equations converges to the solution of these equations. Sabit nokta teorisinin dinamik bir literatüre sahip olmasının altında yatan nedenlerin başında diferansiyel ve integral denklemler için varlık ve teklik teoremlerinin ispatlanmasına duyulan ihtiyaç gelmektedir. Diferansiyel-integral denklemler şeklinde modellenen problemleri çözmek için ortaya çıkan bu teori farklı alanlarda ilginç uygulamalara sahip olmasından dolayı genel ve soyut bir teori olarak düşünülebilir. Diferansiyel veya integral denklem şeklinde modellenen bazı problemler için önem arz eden nicel ve nitel ayrıntılar sabit nokta iterasyon yöntemleri aracılığıyla daha belirgin hale getirilebilir. Çözümü incelenen bir denklemi belirli şartlar altında bir operatör sınıfına dahil etmek ve bu operatör yardımıyla söz konusu denklemin çözümüne ulaşmak için iterasyon yöntemleri etkin bir araç olarak kullanılmaktadır. Bu çalışmada yeni dört adımlı bir iterasyon yönteminin yakınsaklığı ispatlanmış ve gecikmeli diferansiyel denklemler belirli şartları sağlamak kaydıyla daraltan dönüşüm sınıfına dahil edilebildiğinden bu denklemler yardımıyla yeniden inşa edilen dört adımlı iterasyon yönteminden elde edilen dizinin bu denklemlerin çözümüne yakınsadığı gösterilmiştir.
- Open Access
- 31 December 2023
- Published by Gaziosmanpasa University in Journal of New Theory
- No. 45,p. 1-17
Analyzing Stability and Data Dependence Notions by a Novel Jungck-Type Iteration Method
Finding the ideal circumstances for a mapping to have a fixed point is the fundamental goal of fixed point theory. These criteria can also be used for the structure under investigation. One of this theory’s most well-known theorems, Banach’s fixed point theorem, has been expanded adopting various methods, making it possible to conduct numerous research studies. Thanks to the Jungck-Contraction Theorem, which has been proven through commutative mappings, many fixed point theorems have been obtained using classical fixed point iteration methods and newly defined methods. This study aims to investigate the convergence, stability, convergence rate, and data dependency of the new four-step fixed-point iteration method. Nontrivial examples are also included to support some of the results herein.
- 31 December 2023
- Published by Gaziosmanpasa University in Journal of New Theory
- No. 45,p. 1-17
Open AccessAnalyzing Stability and Data Dependence Notions by a Novel Jungck-Type Iteration Method
Finding the ideal circumstances for a mapping to have a fixed point is the fundamental goal of fixed point theory. These criteria can also be used for the structure under investigation. One of this theory’s most well-known theorems, Banach’s fixed point theorem, has been expanded adopting various methods, making it possible to conduct numerous research studies. Thanks to the Jungck-Contraction Theorem, which has been proven through commutative mappings, many fixed point theorems have been obtained using classical fixed point iteration methods and newly defined methods. This study aims to investigate the convergence, stability, convergence rate, and data dependency of the new four-step fixed-point iteration method. Nontrivial examples are also included to support some of the results herein.
- Open Access
- 30 June 2022
- Published by Aksaray University in Aksaray University Journal of Science and Engineering
- Vol. 6 (1) , 57-70
Convergence and Stability Analysis of a New Four-Step Fixed-Point Algorithm
The concept of stability is studied on many different types of mathematical structures. This concept can be thought of as the small changes that will be applied in the structure studied should not disrupt the functioning of this structure. In this context, we performed the convergence and stability analysis of the new four-step iteration algorithm that we defined in this study, under appropriate conditions. In addition, we execute a speed comparison with existing algorithms to prove that the new algorithm is effective and useful, and we gave a numerical example to support our result.
- 30 June 2022
- Published by Aksaray University in Aksaray University Journal of Science and Engineering
- Vol. 6 (1) , 57-70
Open AccessConvergence and Stability Analysis of a New Four-Step Fixed-Point Algorithm
The concept of stability is studied on many different types of mathematical structures. This concept can be thought of as the small changes that will be applied in the structure studied should not disrupt the functioning of this structure. In this context, we performed the convergence and stability analysis of the new four-step iteration algorithm that we defined in this study, under appropriate conditions. In addition, we execute a speed comparison with existing algorithms to prove that the new algorithm is effective and useful, and we gave a numerical example to support our result.
- 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- Open Access
- 1 December 2020
- Vol. 17 (1) , 139-155
An Example of Data Dependence Result for The Class of Almost Contraction Mappings
- 1 December 2020
- Vol. 17 (1) , 139-155
Open AccessAn Example of Data Dependence Result for The Class of Almost Contraction Mappings
- 30 September 2018
- Published by Marmara University in Marmara Fen Bilimleri Dergisi
- Vol. 30 (3) , 276-285
Yeni Bir İterasyon Yöntemi İçin Hemen-Hemen Büzülme Dönüşümleri Altında Bazı Sabit Nokta Teoremleri
Bu makalede (1.1) ile verilen iterasyon yönteminden daha sade olan yeni bir iterasyon yöntemi tanımlanmıştır. Bu iterasyonyönteminin hemen hemen büzülme dönüşümü şartını sağlayan iki operatörün ortak sabit noktasına yakınsak olduğu ispatlanmıştır.Ayrıca yeni iterasyon yönteminin (1.1) ile verilen iterasyon yönteminden daha hızlı olduğu gösterilmiştir ve bu sonucu destekleyenbir tablo ile grafik verilmiştir. Son olarak, hemen hemen büzülme dönüşümü şartını sağlayan iki operatör için yeni tanımlananiterasyon kullanılarak veri bağlılığı sonucu elde edilmiştir.
- 30 September 2018
- Published by Marmara University in Marmara Fen Bilimleri Dergisi
- Vol. 30 (3) , 276-285
Yeni Bir İterasyon Yöntemi İçin Hemen-Hemen Büzülme Dönüşümleri Altında Bazı Sabit Nokta Teoremleri
Bu makalede (1.1) ile verilen iterasyon yönteminden daha sade olan yeni bir iterasyon yöntemi tanımlanmıştır. Bu iterasyonyönteminin hemen hemen büzülme dönüşümü şartını sağlayan iki operatörün ortak sabit noktasına yakınsak olduğu ispatlanmıştır.Ayrıca yeni iterasyon yönteminin (1.1) ile verilen iterasyon yönteminden daha hızlı olduğu gösterilmiştir ve bu sonucu destekleyenbir tablo ile grafik verilmiştir. Son olarak, hemen hemen büzülme dönüşümü şartını sağlayan iki operatör için yeni tanımlananiterasyon kullanılarak veri bağlılığı sonucu elde edilmiştir.