Yunus Atalan

Dr. Yunus Atalan


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 April 2021 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
SMSamet Maldar
Samet Maldar
FGFaik Gürsoy
Faik Gürsoy
YAYunus Atalan
Yunus Atalan
MAMujahid Abbas
Mujahid Abbas

7 August 2024 in Journal of Global Optimization
Verified
Journal Article
Open access
PDF file
YAYunus Atalan
Yunus Atalan
EHEmirhan HACIOĞLU
Emirhan HACIOĞLU
DEDr. Müzeyyen Ertürk
Dr. Müzeyyen Ertürk
FGFaik Gürsoy
Faik Gürsoy
Gradimir V. MilovanovicGradimir V. Milovanovic
Gradimir V. Milovanovic
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.

1 January 2025 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
TŞTunçar Şahan
Tunçar Şahan
YAYunus Atalan
Yunus Atalan
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.

30 September 2018 in Marmara Fen Bilimleri Dergisi
Verified
Journal Article
Closed access
PDF file
YAYunus Atalan
Yunus Atalan
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.

31 December 2023 in Journal of New Theory
Verified
Journal Article
Open access
PDF file
YAYunus Atalan
Yunus Atalan
EEEsra Erbaş
Esra Erbaş
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.

1 December 2020
Verified
Open access
PDF file
YAYunus Atalan
Yunus Atalan
VKVatan Karakaya
Vatan Karakaya
In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. Finally, we obtain a data dependence result for almost contraction mappings by using $S^*$ iteration method and in order to show validity of this result we give an example.