A Comprehensive Analysis of Stability and Data Dependency for a Novel Jungck-type Iterative Algorithm
Kapil Kumar *
Department of Mathematics, Baba Mastnath University, Asthal Bohar-124021, Rohtak, Haryana, India.
Vivek Kumar
Department of Mathematics, KLP College, Rewari-123401, Haryana, India.
Ranbir Singh
Department of Mathematics, Baba Mastnath University, Asthal Bohar-124021, Rohtak, Haryana, India.
Satish Narwal
Department of Mathematics, Sat Jinda Kalyana College, Kalanaur-124113, Rohtak, Haryana, India.
*Author to whom correspondence should be addressed.
Abstract
This study introduces a novel Jungck-type iterative algorithm for approximating coincidence points under specific contractive conditions. The research demonstrates the algorithm's strong convergence, stability, and data dependency through rigorous theoretical analysis and numerical experiments. Results indicate that the proposed method achieves a significantly faster convergence rate compared to existing Jungck-type iterations. These findings have practical implications in fields such as optimization, economic modeling, and coupled differential equations, where iterative techniques are vital.
Keywords: Data dependence, common fixed point, coincidence point, stability