Next Article in Journal
An Enhanced Particle Swarm Optimization Algorithm for the Permutation Flow Shop Scheduling Problem
Previous Article in Journal
Research on Enterprise Public Opinion Crisis Response Strategies in the Context of Information Asymmetry
Previous Article in Special Issue
Best Proximity Theory in Metrically Convex Menger PM-Spaces via Cyclic Kannan Maps
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

On a Novel Iterative Algorithm in CAT(0) Spaces with Qualitative Analysis and Applications

1
Abdus Salam School of Mathematical Sciences, Government College University, Lahore 54000, Pakistan
2
Department of Mechanical Engineering Science, Faculty of Engineering and the Built Environment, University of Johannesburg, Johannesburg 2006, South Africa
3
Department of Medical Research, China Medical University, Taichung 406040, Taiwan
4
Department of Mathematics and Informatics, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(10), 1695; https://doi.org/10.3390/sym17101695
Submission received: 2 September 2025 / Revised: 3 October 2025 / Accepted: 7 October 2025 / Published: 9 October 2025

Abstract

This study presents a novel and efficient iterative scheme in the setting of CAT(0) spaces and investigates the convergence properties for a generalized class of mappings satisfying the Garcia–Falset property using the proposed iterative scheme. Strong and weak convergence results are established in CAT(0) spaces, generalizing many existing results in the literature. Furthermore, we discuss the stability and data dependence of the new iterative process. Numerical experiments include an analysis of error values, the number of iterations, and computational time, providing a comprehensive assessment of the method’s performance. Moreover, graphical comparisons demonstrate the efficiency and reliability of the approach. The obtained results are utilized in solving integral equations. Additionally, the paper concludes with a polynomiographic study of the newly introduced iterative process, in comparison with standard algorithms, such as Newton, Halley, or Kalantari’s B4 iteration, emphasizing symmetry properties.
Keywords: fixed point; Δ–convergence; stability; data dependence; polynomiography fixed point; Δ–convergence; stability; data dependence; polynomiography

Share and Cite

MDPI and ACS Style

Khan, M.; Abbas, M.; Ciobanescu, C. On a Novel Iterative Algorithm in CAT(0) Spaces with Qualitative Analysis and Applications. Symmetry 2025, 17, 1695. https://doi.org/10.3390/sym17101695

AMA Style

Khan M, Abbas M, Ciobanescu C. On a Novel Iterative Algorithm in CAT(0) Spaces with Qualitative Analysis and Applications. Symmetry. 2025; 17(10):1695. https://doi.org/10.3390/sym17101695

Chicago/Turabian Style

Khan, Muhammad, Mujahid Abbas, and Cristian Ciobanescu. 2025. "On a Novel Iterative Algorithm in CAT(0) Spaces with Qualitative Analysis and Applications" Symmetry 17, no. 10: 1695. https://doi.org/10.3390/sym17101695

APA Style

Khan, M., Abbas, M., & Ciobanescu, C. (2025). On a Novel Iterative Algorithm in CAT(0) Spaces with Qualitative Analysis and Applications. Symmetry, 17(10), 1695. https://doi.org/10.3390/sym17101695

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop