Next Article in Journal
A Novel Symmetrical Inertial Alternating Direction Method of Multipliers with Proximal Term for Nonconvex Optimization with Applications
Previous Article in Journal
AFD-YOLOv10: A Lightweight Method for Non-Destructive Testing of Fusion Weld Seam Defects
Previous Article in Special Issue
Golden Meta-Spring Inspired by Bone Fractal Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analytical Approach to Convergence, Stability, and Data-Dependence of Jungck-KF Iterative Scheme with Applications in Dynamic Market Equilibrium Analysis

1
Department of Mathematics, Government College University, Katachery Road, Lahore 54000, Pakistan
2
Department of Mathematics, Babeş-Bolyai University, M. Kogălniceanu Street, No. 1, 400084 Cluj-Napoca, Romania
3
Department of Hospitality Services, Babeş-Bolyai University, Horea Street, No. 7, 400174 Cluj-Napoca, Romania
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(6), 885; https://doi.org/10.3390/sym17060885
Submission received: 28 April 2025 / Revised: 25 May 2025 / Accepted: 2 June 2025 / Published: 5 June 2025
(This article belongs to the Special Issue Application of Symmetry in Equations)

Abstract

:
In this work, we employ a more thorough contractive condition to examine the stability and convergence behavior of an Jungck-type iterative scheme for a pair of non-self mappings in a Banach space. Our results show that this iterative scheme has a better rate of convergence as compared to all existing Jungck-type iterative schemes. The norm of a Banach space is symmetric with respect to the origin. Symmetry can significantly influence both the theoretical underpinnings and practical convergence behavior of iterative schemes. Furthermore, we show the convergence behaviour of various Jungck-type iterative schemes with an Jungck-KF iterative scheme through an example. We also prove the data-dependence result for our proposed iterative scheme for non-self-mapping. Additionally, we provide an application of the Jungck-KF iterative scheme related to Dynamic Market Equilibrium.

1. Introduction

Fixed-point theory focuses on finding fixed points of operators and proving their uniqueness and convergence through iterative methods. In recent years, the exploration of iterative schemes has gained significant attention in mathematical research.
The field of fixed-point iterative methods has gradually become a valuable field of study because many problems in math, engineering, physics, economics, etc., can be converted to fixed-point problems [1,2]. Iterative schemes with fixed points are used to solve variational inequality and equilibrium problems in Hilbert spaces and Banach spaces [3,4,5,6,7,8,9].
Over the years, mathematicians have developed several iterative methods for approximating fixed-point solutions. These iterative methods are crucial for solving various mathematical problems, especially in the context of fixed-point theory. A pivotal result in this field is the Banach Contraction Theorem, established in 1922, which asserts the existence and uniqueness of fixed points for contraction mappings in metric spaces [10].
The success of fixed-point theorems like the Banach Contraction Principle, Browder-Gohde–Kirk Theorem, and Reich’s Theorem often hinges on the underlying geometrical structure of the space. Banach’s Contraction Principle works in complete metric spaces, but does not require symmetry. The Browder-Gohde–Kirk theorem, however, specifically requires the space to be uniformly convex (a symmetric property) for nonexpansive mappings to guarantee the existence of fixed points in closed, convex, and bounded subsets. In more general iterative schemes (e.g., Mann, Ishikawa, Noor iterations), the symmetry of the space affects not only the existence of fixed points but also the rate and stability of convergence.
While extensive research has addressed fixed points of contractive maps [11,12,13,14], relatively less attention has been given to investigating the convergence of iterative approximations to these common fixed points. In cases where exact solutions to fixed-point problems are challenging or impossible to obtain, the Banach Contraction Theorem’s use of the Picard iteration method offers an effective approach. However, to address the need for approximations, a variety of iterative algorithms have been developed and studied, aiming to provide approximate solutions to fixed-point problems [15,16,17,18,19,20,21,22,23].
Building on these foundational concepts, Jungck [24] introduced an iterative scheme that satisfies the Jungck contraction condition, aimed at approximating common fixed points of two coupled mappings. This framework has been further developed by various researchers who have extended its applications to different types of mappings and iterative processes.
Jungck [24] introduced an iterative scheme that satisfies the Jungck contraction condition to approximate the common fixed points of two coupled mappings, denoted by ξ and ζ . The contraction condition is
d ^ ( ζ a ̲ , ζ b ̲ ) κ d ^ ( ξ a ̲ , ξ b ̲ ) , 0 κ < 1 .
for all a ̲ , b ̲ Y . Building upon the concept of stability, Ostrowski [25] applied contraction mappings to discuss the consistency of the Picard iteration. Further, Harder [22] demonstrated how first-order differential equations could be resolved by utilizing this stability analysis. This approach has been extended by other researchers, including Berinde [20], and Imoru and Olatinwo [26], to address various problems within fixed-point theory and related fields.
In 2005, Singh et al. [27] introduced and discussed the Jungck–Mann iteration scheme and its stability for two contractive maps. Subsequently, Olatinwo and Imoru [28], as well as Olatinwo [26,28], extended this framework by proposing the Jungck Ishikawa and Noor iteration schemes. They demonstrated how these schemes’ convergence could be applied to pairs of generalized contractive operators for approximating common fixed points. Chugh and Kumar presented the Jungck-SP iterative scheme in [8], and Hussain et al. [23] presented the Jungck-CR iterative scheme, which converges faster than all the previous schemes and is defined as follows:
ξ a n + 1 = ( 1 η n ) ξ b n + η n ζ b n ξ b n = ( 1 σ n ) ζ a n + σ n ζ c n , n 1 ξ c n = ( 1 γ n ) ξ a n + γ n ζ a n
where η n , σ n , and γ n ( 0 , 1 ] .
In 2023, motivated by the Jungck-CR, Guran et al. [21] introduced the Jungck-DK iterative scheme and discussed the convergence, stability, and data-dependence of the iterative scheme. The sequence of the Jungck-DK iterative scheme is defined as follows:
ξ a n + 1 = ( 1 η n ) ξ c n + η n ζ b n ξ b n = ( 1 σ n ) ξ a n + σ n ζ c n , n 1 ξ c n = ζ a n
where η n and σ n ( 0 , 1 ] .
In 2022, Ullah [29] developed a new faster iterative scheme, which they called the K F -iterative scheme for generalized α -nonexpansive mappings on nonempty convex subsets of a Banach space. The sequence of the K F iterative scheme is defined as follows:
a 1 Y c c = ξ ( ( 1 η n ) a n + η n ξ a n ) , n 1 b n = ξ c n , a n + 1 = ξ ( ( 1 σ n ) ξ a n + σ n ξ b n )
where { η n } and { σ n } are real sequence in ( 0 , 1 ] .
In this paper, we study the convergence, stability, and data-dependence of the Jungck version of the K F iterative scheme, called the Jungck- K F iterative scheme, defined as
ξ a n + 1 = ζ b n ξ b n = ( 1 σ n ) ξ a n + σ n ξ c n n 1 ξ c n = ζ d n ξ d n = ζ e n ξ e n = ( 1 η n ) ξ a n + η n ζ a n
where { η n } and { σ n } are real sequences in ( 0 , 1 ] .
Motivated by previous studies in this field, we propose a new, faster Jungck-type iterative scheme, the Jungck-KF iterative scheme. We study the convergence behavior of our proposed iterative scheme in comparison with other leading Jungck-type iterative schemes. Further, we present an example to show the convergence of the Jungck-KF iteration scheme. We will also provide a few arguments to support the data-dependence result and will provide an application related to Dynamic Market Equilibrium.

2. Preliminaries

In this section, we discuss first some lemmas, propositions, and definitions that are used in our research.
Jungck [30] utilize iterative schemes to approximate the common fixed points of two mappings ξ and ζ satisfying the Jungck-contraction mapping.
For the convergence behavior of a Jungck–Ishikawa iterative scheme, Olatinwo [26] uses the generalized version of the Jungck contraction mapping, which is as follows:
ζ a ̲ ζ b ̲ υ ( ξ a ̲ ζ a ̲ ) + κ ^ ξ a ̲ ξ b ̲ ,
where a ̲ , b ̲ Y and κ [ 0 , 1 ) and υ is an increasing monotone self-function on R + such that υ ( 0 ) = 0 .
Definition 1
([9]). Let { n } and { κ n } R are convergent sequences with the limits on ℓ and κ, respectively. Then, { n } converges faster than { κ n } if
lim n n κ n κ 0 .
Definition 2
([9]). Let π 1 and π 2 be the self-mapping on A . Then the element α * is known to be a coincidence point in A of ( π 1 , p i 2 ) if π 1 ( α * ) = π 2 ( α * ) .
Definition 3
([9,30]). Let π 1 and π 2 be as in Definition 2. The point α * is called a common fixed point of ( π 1 , π 2 ) in A if π 1 ( α * ) = π 2 ( α * ) = ( α * ) .
Definition 4
([9]). The pair of mappings π 1 and π 2 is commuting if π 1 ( π 2 ) = π 2 ( π 1 ) , ∀ A .
Definition 5
([9]). The mappings π 1 and π 2 are called K-weakly commuting if ∀ A , K greater than 0 such that
π 1 ( π 2 ) π 2 ( π 1 ) K π 1 π 2 .
If K > 1 , then the mappings are called weakly commuting.
Definition 6
([9]). The mappings π 1 , π 2 is compatible if
lim n π 1 π 2 n π 2 π 1 n = 0 ,
where n is a sequence with lim n π 1 n = lim n π 2 n = for some A and n N .
The mappings π 1 and π 2 are weakly compatible if they commute at their coincidence points—i.e., if π 1 ( π 2 ) = π 2 ( π 1 ) whenever π 1 = π 2 .
Lemma 1
([19,21]). Let n be a positive sequence with lim n { n } = 0 and ρ R , such that ρ [ 0 , 1 ) . Then for any { ϑ n } R + that satisfies
ϑ n + 1 ρ ϑ n + n , n = 0 , 1 , 2 , 3 , ,
one has lim n n = 0 .
Definition 7
([21,27]). Define two operators ζ and ξ defined in A such that ξ , ζ : S A , where S is an arbitrary set such that ζ ( S ) ξ ( S ) and π * is the coincidence point of ξ and ζ. Let ξ n A be the sequence given by
ξ n + 1 = f ( ζ , n ) , n = N ,
where 0 A is the first guess and f is any function. Suppose that { ξ n } converges to π * . If ξ m n S is any sequence and if φ n = d ^ ( ξ m n , f ( ζ , n ) ) , n=,1,2,3, …, then the newly defined Jungck-KF scheme is said to be stable if and only if lim n φ n = 0 lim n ξ m n = π * .
Definition 8
([21,31]). Let χ and χ 1 be two self-mappings on A . Then χ 1 is an appropriate operator A if for all β A and for a fixed σ > 0
χ ( β ) χ 1 ( β ) σ .
Lemma 2
([21,31]). Let m n be a sequence in R + { 0 } and let n N be a natural number such that, for each n n 0 , the following inequality is true:
( 1 ϱ n ) m n + ϱ n r n m n + 1 , n N ,
where ϱ n ( 0 , 1 ) , Σ n = 1 ϱ n = and r n 0 , for every n N . Then,
lim sup n r n lim sup n m n 0
Definition 9
([21]). Let A be any arbitrary subset of Banach space B equipped with norm . . Define a pair of two mappings ( ξ , ζ ) and ( ξ 1 , ζ 1 ) from A to B such that ζ ( A ) ξ ( A ) and ζ 1 ( A ) ξ 1 ( A ) . Then ( ξ , ζ ) is an approximate operator of ( ξ 1 , x i 1 ) if, for every B and some fixed 1 > 0 and 2 > 0 , we have
ζ e l l ζ 1 e l l 1 ξ ξ 1 2 .

3. Convergence, Data-Dependence, and Stability in an Arbitrary Banach Space

We will study in this section the convergence, some stability conditions, and the data-dependence of the Jungck-KF-type iterative scheme. Symmetry is an important property of the norm of a Banach space. It is important to distinguish this basic symmetry of the norm from more advanced notions of geometric symmetry in Banach spaces, such as strict convexity, uniform convexity, and smoothness. These properties concern the shape of the unit ball and the behavior of dual spaces, and they play a more nuanced role in advanced results, such as the convergence of iterative schemes and fixed-point theorems.
Next, we will give the first main result of this section, the convergence theorem.
Theorem 1.
Let A be any subset of a Banach space ( S , · ) . Assume there exist two mappings ξ , ζ : A S , which are not necessarily self-maps, that satisfy Condition (5). Suppose ζ ( A ) ξ ( A ) , with ζ ( A ) being a closed subspace relative to ξ ( A ) , and that for some γ A , it holds that ξ ( γ ) = ζ ( γ ) = p ̲ * . Given an initial point a 0 A , the sequence { ξ ( a n ) } corresponds to the Jungck–Kirk-type iterative method specified by (4), where the control parameters 0 η n , σ n 1 for all n and the sequence { η n } satisfies n = 0 η n < . As a result, the process defined by (4) converges strongly to p ̲ * . Moreover, when A = S and the operators ξ and ζ are weakly compatible, the point p ̲ * serves as a unique common fixed point of both ξ and ζ.
Proof. 
In the beginning, we want to prove that the Jungck-KF iterative scheme (4) converges to p ̲ * , where p ̲ * is a common fixed point of the mappings ξ and ζ . Using (5), we obtain
ξ e n p ̲ *   ( 1 η n ) ξ a n p ̲ * + η n ζ a n p ̲ * .
Then,
ζ a n p ̲ * = ζ a n ζ γ κ ξ γ ξ a n = κ ξ a n p ̲ * .
And according to the condition (5),
ξ d n p ̲ * = ζ e n p ̲ * = ζ e n ζ γ υ ( ξ γ ζ γ ) + κ ξ γ ξ e n κ ξ γ ξ e n = κ ξ e n p ̲ * .
According to the condition (5) we get
ξ c n p ̲ * = ζ d n p ̲ * = ζ d n ζ γ υ ( ξ γ ζ γ ) + κ ξ γ ξ d n κ ξ γ ξ d n = κ ξ d n p ̲ * .
Then,
ξ b n p ̲ * = ( 1 σ n ) ξ a n + σ n ξ c n p ̲ * ( 1 σ n ) ξ a n p ̲ * + σ n ξ c n p ̲ * .
Then we have
ξ a n + 1 p ̲ * = ζ b n p ̲ * = ζ b n ζ γ υ ( ξ γ T γ ) + κ ξ γ ξ b n κ ξ γ ξ b n = κ ξ b n p ̲ * .
From (13) and (12) we have
ξ a n + 1 p ̲ * κ ( 1 σ n ) ξ a n p ̲ * + κ σ n ξ c n p ̲ * .
From (8) and (9) we have
ξ e n p ̲ * ( 1 η n ) ξ a n p ̲ * + κ η n ξ a n p ̲ * ( 1 η n ( 1 κ ) ) ξ a n p ̲ * ) .
From (10) and (15) we have
ξ d n p ̲ * κ ξ e n p ̲ * κ ( 1 η n ( 1 κ ) ) ξ a n p ̲ * ) .
From (11) and (16) we have
ξ c n p ̲ * κ ξ d n p ̲ * κ 2 ( 1 η n ( 1 κ ) ) ξ a n p ̲ * ) .
By putting (17) into (14) we get
ξ a n + 1 p ̲ * κ ( 1 σ n ) ξ a n p ̲ * + κ σ n κ 2 ( 1 η n ( 1 κ ) ) ξ a n p ̲ * κ ( 1 σ n ) + κ 3 σ n ( 1 η n ( 1 κ ) ) ξ a n p ̲ * κ ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) ξ a n p ̲ * κ k = 0 n ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) ξ a n p ̲ * = e ( 1 ( 1 κ 2 ) ( 1 η k ) ( 1 κ ) ) k = 0 σ k ξ a n p ̲ * .
As we know 0 κ < 1 and σ k belong to [ 0 , 1 ] with k = 0 σ k = ,
e ( 1 ( 1 κ 2 ) ( 1 η k ) ( 1 κ ) ) k = 0 σ k 0   w h e n   n .
As a consequence, it follows from (15) that
lim n ξ a n + 1 p ̲ * = 0 .
Thus, { ξ a n } p ̲ * .
Our next objective is to establish that p ̲ * acts as a unique common fixed point for the mappings ξ and ζ . To proceed, we assume that p ̲ * * is another candidate limit point.
Consequently, there exists a b * S such that ξ b * = ζ b * = p ̲ * * ̲ . However, according to the contraction condition (5), we have
0 p ̲ * ̲ p ̲ * * ̲ = ζ b ζ b * υ ( ξ b ζ b ) + κ ξ b ξ b * κ ξ b * p ̲ * = κ p ̲ * * ̲ p ̲ * ̲ .
Then p ̲ * ̲ = p ̲ * * ̲ as 0 κ < 1 .
Since ξ and ζ are compatible weakly with p ̲ * ̲ = ζ b = ξ b (so, ζ p ̲ * ̲ = ζ ζ b = ζ ξ b = ξ ζ b and hence ζ p ̲ * ̲ = ξ p ̲ * ̲ ), ζ p ̲ * ̲ is a coincidence point of ξ and ζ , which is unique. Then, p ̲ * ̲ = ζ p ̲ * ̲ . Thus, ξ p ̲ * ̲ = ζ p ̲ * ̲ = p ̲ * ̲ , and both ξ and ζ share a common fixed point p ̲ * ̲ . □
Next, we will discuss the stability property of the Jungck-KF-type iterative scheme (4).
Theorem 2.
If the mappings ξ and ζ and the sequence { a n } fulfill the conditions and assumptions outlined in Theorem 1, then the Jungck-KF iteration (4) can be considered ( ξ , ζ ) -stable.
Proof. 
Consider a sequence j n S , ϵ n = ξ j n + 1 ζ d n for n = 0 , 1 , 2 , , where ξ d n = ( 1 η n ) ξ j n + η n ξ e n and ξ e n = ( 1 σ n ) ξ j n + σ n ζ j n . Let lim n ϵ n = 0 .
By Jungck-KF iterative scheme (4), we have
ϵ n = ξ j n + 1 ζ b n = ξ j n + 1 ζ b n + ζ b n p ̲ * ξ j n + 1 ζ b n + ζ b n p ̲ * ϵ n + ζ b n p ̲ * ,
and
ζ b n p ̲ * = ζ b n ζ γ υ ( ξ γ ζ γ ) + κ ξ γ ξ b n κ ξ γ ξ b n = κ ξ b n p ̲ * .
Then, we have further
ξ j n + 1 p ̲ * = κ ζ b n p ̲ * ϵ n + κ ξ b n p ̲ * ,
ξ b n p ̲ * = ( 1 σ n ) ξ j n + σ n ξ c n p ̲ * ( 1 σ n ) ξ j n p ̲ * + σ n ξ c n p ̲ * ,
ξ c n p ̲ * = ζ d n p ̲ * = ζ d n ζ γ υ ( ξ γ ζ γ ) + κ ξ γ ξ d n κ ξ γ ξ d n = κ ξ d n p ̲ * .
We estimate again
ξ d n p ̲ * = ζ e n p ̲ * = ζ e n ζ γ υ ( ξ γ ζ γ ) + κ ξ γ ξ e n κ ξ γ ξ e n = κ ξ e n p ̲ * ,
ξ e n p ̲ * = ( 1 η n ) ξ j n + η n ζ j n p ̲ * ( 1 η n ) ξ j n p ̲ * + η n ζ j n p ̲ * ,
ζ j n p ̲ * = ζ j n ζ γ υ ( ξ γ ζ γ ) + κ ξ γ ξ j n κ ξ γ ξ j n = κ ξ j n p ̲ * .
Replacing (23) to (27) in (22), we get
ξ j n + 1 p ̲ * ϵ n + κ ( ( 1 σ n ) ξ j n p ̲ * + σ n κ 2 ( ( 1 η n ) ξ j n p ̲ * + η n κ ξ j n p ̲ * ) ) ϵ n + κ ( 1 σ n ) + κ 3 σ n ( 1 η n ( 1 κ ) ) ξ j n p ̲ * ϵ n + κ ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) ξ j n p ̲ * .
Using σ σ n with κ belong to [ 0 , 1 ) , we obtain
[ κ ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) ] < 1 .
Recalling Lemma 1 we get j n + 1 < ζ j n + ϵ n ; n=0,1,2,3,..,
lim n ξ j n + 1 = p ̲ * .
Conversely, let us consider that lim n ξ j n + 1 = p ̲ * . Then, according to the condition (5) and utilizing triangular inequality, we have that
ϵ n = ξ j n + 1 ζ b n ξ j n + 1 p ̲ * + ζ b n p ̲ * .
From (21) and (27) we have
ϵ n ξ j n + 1 p ̲ * + [ κ ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) ] ξ j n p ̲ * .
Hence, lim n ϵ n = 0 .
The resulting Jungck-KF scheme exhibits ( ξ , ζ ) -stability. □
The following theorem is devoted to studying the convergence behavior of the proposed Jungck-KF iteration in relation with the Jungck-DK iteration and other iterations. It is noteworthy that among all Jungck-type iterative methods, the Jungck-KF scheme is recognized for achieving a superior rate of convergence.
Theorem 3.
Let ξ , ζ , and { a n } all satisfy the hypothesis of Theorem 1. Then, for a given a 0 A , the Jungck-KF iterative scheme (4) compared to the iterative scheme based on Jungck-DK has a higher rate of convergence, converging to a fixed point p ̲ * .
Proof. 
Consider p ̲ * = ξ ( γ ) = ζ ( γ ) . By utilizing the contractive condition given in (5), from the Jungck-KF iterative scheme,
ξ a n + 1 p ̲ * κ ( 1 σ n ( 1 ( 1 η n ( 1 κ 2 ) ) ) ) ξ a n p ̲ * = b n .
Additionally, from the Jungck-KF iterative scheme, we have
ξ a n + 1 p ̲ * κ ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) ξ a n p ̲ * = a n .
Then, it follows that
a n b n = i = 0 n κ ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) κ ( 1 σ n ( 1 ( 1 η n ( 1 κ 2 ) ) ) ) ξ a n p ̲ * a n b n = i = 0 n ( 1 σ n ( 1 κ 2 ( 1 η n ( 1 κ ) ) ) ) ( 1 σ n ( 1 ( 1 η n ( 1 κ 2 ) ) ) ) ξ a n p ̲ *
Since κ [ 0 , 1 ) , lim n σ n = 0 = lim n η n .
From (29), we have
lim n a n b n 0 .
As a consequence, our proposed Jungck-KF iterative scheme is quicker than the Jungck-DK iterative scheme. □
The Jungck-KF scheme requires that the data-dependence result be provided.
Theorem 4.
Let ( ξ , ζ ) , ( ξ 1 , ζ 1 ) : A S be two mappings satisfying the condition (5), where ζ ( A ) ξ ( A ) , ζ 1 ( A ) ξ 1 ( A ) , and ( S , . ) is an arbitrary Banach space. ξ 1 ( A ) is a complete subspace in S. There exists a γ C ( ξ , ζ ) and γ C ( ξ 1 , ζ 1 ) such that ξ γ = ζ γ = p ̲ * and ξ 1 γ = ζ 1 γ = p ̲ * * ̲ . Let { ξ a n + 1 } be an iterative sequence ( K . F . ) where { η n } and { σ n } are two improper subsets of [ 0 , 1 ] satisfying n = 0 η n σ n = , and let { ξ 1 f n + 1 } be a new sequence, given as
ξ 1 f n + 1 = ζ 1 g n ξ 1 g n = ( 1 σ n ) ξ 1 f n + σ n ξ 1 h n ξ 1 h n = ζ 1 j n ξ 1 j n = ζ 1 O n ξ 1 O n = ( 1 η n ) ξ 1 f n + η n ζ 1 f n .
Suppose that { ξ a n + 1 } and { ξ 1 f n + 1 } converge to p ̲ * and p ̲ * * ̲ . Then, we have
p ̲ * p ̲ * * ̲ = 2 ϵ 1 κ 2 , where ϵ = m a x { ϵ 1 , ϵ 2 } .
Proof. 
By using iterative scheme Jungck-KF (4) and iterative scheme (30), the condition (1) and Definition 9, we have
ζ b n ξ 1 f n + 1 = ζ b n ζ 1 g n = ζ b n ζ g n + ζ g n ζ 1 g n ζ b n ζ g n + ζ g n ζ 1 g n υ ( ξ b n ζ b n ) + κ ξ b n ξ g n + ϵ 1 υ ( ξ b n ζ b n ) + κ ξ b n ξ 1 g n + ξ 1 g n ξ g n + ϵ 1 υ ( ξ b n ζ b n ) + κ { ξ b n ξ 1 g n + ξ 1 g n ξ g n } + ϵ 1 υ ( ξ b n ζ b n ) + κ { ξ b n ξ 1 g n } + κ ϵ | 2 + ϵ 1 .
Then, we get
ξ b n ζ b n = ξ b n ξ γ + ξ γ ζ b n ξ b n ξ γ + ξ γ ζ b n ξ b n p ̲ * + ξ γ ζ b n ξ b n p ̲ * + υ ( ξ γ ζ γ ) + κ ξ γ ξ b n ξ b n p ̲ * + κ ξ b n p ̲ * ( 1 κ ) ξ b n p ̲ * .
It can be shown that
ξ b n p ̲ * ξ a n p ̲ * ,
which implies
ξ b n ζ b n ( 1 κ ) ξ b n p ̲ * .
Next, we consider
ξ b n ξ 1 g n = ( 1 σ n ) ξ a n + σ n ξ c n ( 1 σ n ) ξ 1 f n σ n ξ 1 h n = ( 1 σ n ) ( ξ a n ξ 1 f n ) + σ n ( ξ c n ξ 1 h n ) ( 1 σ n ) ξ a n ξ 1 f n + σ n ξ c n ξ 1 h n .
Since
ξ c n = ζ d n ξ 1 h n = ζ 1 j n .
Then, it follows that
( 1 σ n ) ξ a n ξ 1 f n + σ n ζ d n ζ 1 j n ( 1 σ n ) ξ a n ξ 1 f n + σ n ζ d n ζ j n + ζ j n ζ 1 j n ( 1 σ n ) ξ a n ξ 1 f n + σ n ζ d n ζ j n + σ n ζ j n ζ 1 j n ( 1 σ n ) ξ a n ξ 1 f n + σ n ζ d n ζ j n + σ n ϵ 1 ( 1 σ n ) ξ a n ξ 1 f n + σ n { υ ( ξ d n ζ d n ) + κ ξ d n ξ j n } + σ n ϵ 1
( 1 σ n ) ξ a n ξ 1 f n + σ n { υ ( ξ d n ζ d n ) + κ ξ d n ξ 1 j n + ξ 1 j n ξ j n } + σ n ϵ 1 ( 1 σ n ) ξ a n ξ 1 f n + σ n { υ ( ξ d n ζ d n ) + κ ξ d n ξ 1 j n + κ ξ 1 j n ξ j n } + σ n ϵ 1 ( 1 σ n ) ξ a n ξ 1 f n + σ n { υ ( ξ d n ζ d n ) + κ ξ d n ξ 1 j n + κ ϵ 2 } + σ n ϵ 1 ( 1 σ n ) ξ a n ξ 1 f n + σ n υ ( ξ d n ζ d n ) + κ σ n ξ d n ξ 1 j n + κ σ n ϵ 2 + σ n ϵ 1 ( 1 σ n ) ξ a n ξ 1 f n + σ n υ ξ d n ζ d n + κ σ n ξ d n ξ 1 j n + σ n ( κ ϵ 2 + ϵ 1 ) ,
Next, we estimate
ξ d n ξ 1 j n = ζ e n ζ 1 O n = ζ e n ζ O n + ζ O n ζ 1 O n ζ e n ζ O n + ζ O n ζ 1 O n ζ e n ζ O n + ϵ 1 υ ( ξ e n ζ e n ) + κ ξ e n ξ O n + ϵ 1 υ ξ e n ζ e n + κ ξ e n ξ 1 O n + ξ 1 O n ξ O n + ϵ 1 υ ξ e n ζ e n + κ ξ e n ξ 1 O n + κ ξ 1 O n ξ O n + ϵ 1 υ ξ e n ζ e n + κ ξ e n ξ 1 O n + κ ϵ 2 + ϵ 1 υ ξ e n p ̲ * + p ̲ * ζ e n + κ ξ e n ξ 1 O n + κ ϵ 2 + ϵ 1 υ ( ξ e n p ̲ * + ζ γ ζ e n ) + κ ξ e n ξ 1 O n + κ ϵ 2 + ϵ 1 υ ( ξ e n p ̲ * + υ ξ γ ζ γ + κ ξ γ ξ e n ) + κ ξ e n ξ 1 O n + κ ϵ 2 + ϵ 1 υ ( 1 + κ ) ξ e n p ̲ * + κ ξ e n ξ 1 O n + κ ϵ 2 + ϵ 1 .
Next, we evaluate
ξ d n ζ d n = ξ d n ξ γ + ζ γ ζ d n ξ d n p ̲ * + ζ γ ζ d n ξ d n p ̲ * + υ ξ γ ζ γ + κ ξ γ ξ d n ξ d n p ̲ * + κ ξ d n p ̲ * ( 1 + κ ) ξ d n p ̲ * ( 1 + κ ) ζ e n p ̲ * ( 1 + κ ) ( υ ξ γ ζ γ + κ ξ γ ξ e n ) ( 1 + κ ) ( κ ξ γ ξ e n ) κ ( 1 + κ ) ξ e n p ̲ * ) ,
and
ξ e n p ̲ * = ( 1 η n ) ξ a n + η n ζ a n p ̲ * ( 1 η n ) ξ a n p ̲ * + η n ζ a n p ̲ * .
Since
ζ a n p ̲ * = ζ a n ζ γ υ ξ γ n ζ γ n + κ ξ γ n ξ a n κ ξ a n p ̲ * ,
we have
ξ e n p ̲ * ( 1 η n ) ξ a n p ̲ * + κ η n ξ a n p ̲ * ( 1 η n ( 1 κ ) ) ξ a n p ̲ * .
We obtain then
ξ e n ζ e n = ξ e n ξ γ + ξ γ ζ e n ξ e n p ̲ * + ζ γ ζ e n ξ e n p ̲ * + υ ξ γ ζ γ + κ ξ γ ξ e n ξ e n p ̲ * + κ ξ e n p ̲ * ( 1 + κ ) ξ e n p ̲ * ( 1 + κ ) ( 1 η n ( 1 κ ) ) ξ a n p ̲ * .
Then, we get
ξ e n ξ 1 O n = ( 1 η n ) ξ a n + η n ζ a n ( 1 η n ) ξ 1 f n η n ζ 1 f n ( 1 η n ) ( ξ a n ξ 1 f n ) + η n ( ζ a n ζ 1 f n ) ( 1 η n ) ξ a n ξ 1 f n + η n ζ a n ζ 1 f n ,
and
ζ a n ζ 1 f n = ζ a n ζ f n + ζ f n ζ 1 f n ζ a n ζ f n + ζ f n ζ 1 f n ζ a n ζ f n + ϵ 1 υ ( ξ a n ζ a n ) + κ ξ a n ξ f n + ϵ 1 υ ξ a n ζ a n + κ ξ a n ξ 1 f n + ξ 1 f n ξ f n + ϵ 1 υ ξ a n ζ a n + κ ξ a n ξ 1 f n + κ ξ 1 f n ξ f n + ϵ 1 υ ξ a n ζ a n + κ ξ a n ξ 1 f n + κ ϵ 2 + ϵ 1 υ ξ a n p ̲ * + p ̲ * ζ a n + κ ξ a n ξ 1 f n + κ ϵ 2 + ϵ 1 υ ( ξ a n p ̲ * + ζ γ ζ a n ) + κ ξ a n ξ 1 f n + κ ϵ 2 + ϵ 1 υ ( ξ a n p ̲ * + υ ξ γ ζ γ + κ ξ γ ξ a n ) + κ ξ a n ξ 1 f n + κ ϵ 2 + ϵ 1 υ ( ξ a n p ̲ * + κ ξ a n p ̲ * ) + κ ξ a n ξ 1 f n + κ ϵ 2 + ϵ 1 υ ( 1 + κ ) ξ a n p ̲ * + κ ξ a n ξ 1 f n + κ ϵ 2 + ϵ 1 .
By rearranging and putting values into the required inequality, we get
ξ b n ξ 1 g n ( 1 σ n ( 1 κ 2 ( 1 + η n ( 1 + κ ) ) ) ) ξ a n ξ 1 f n + ( 2 σ n υ κ ( 1 + κ ) + σ n η n υ κ ( 2 + 3 κ ( 1 + κ ) ) ) ξ a n p ̲ * + σ n κ ( 1 + η n κ ) ( κ ϵ 2 + ϵ 1 ) .
Putting this into the first inequality, we get
ξ a n + 1 ξ 1 f n + 1 υ ( 1 + κ ) ξ a n p ̲ * + κ ( ( 1 σ n ( 1 κ 2 ( 1 + η n ( 1 + κ ) ) ) ) ξ a n ξ 1 f n + ( 2 σ n υ κ ( 1 + κ ) + σ n η n υ κ ( 2 + 3 κ ( 1 + κ ) ) ) ξ a n p ̲ * + σ n κ ( 1 + η n κ ) ( κ ϵ 2 + ϵ 1 ) ) ( υ ( 1 + κ ) + κ ) ( 2 σ n υ κ ( 1 + κ ) + σ n η n υ κ ( 2 + 3 κ ( 1 + κ ) ) ) ξ a n p ̲ * + κ ( 1 σ n ( 1 κ 2 ( 1 + η n ( 1 + κ ) ) ) ) ξ a n ξ 1 f n + σ n κ 2 ( 1 + η n κ ) ( κ ϵ 2 + ϵ 1 ) .
Here, v n = ξ a n ξ 1 f n ,
l n = κ ( 1 σ n ( 1 κ 2 ( 1 + η n ( 1 + κ ) ) ) ) ,
m n = σ n κ 2 ( 1 + η n κ ) ( κ ϵ 2 + ϵ 1 ) .
If we take the limit on each side, then we get lim n ξ a n p ̲ * = 0 .
Using Lemma 2 we have
p ̲ * p ̲ * * ̲ = 2 ϵ 1 κ 2 ,
which completes the proof. □

4. Numerical Example

We present an example to visualize (graphically and mathematically) the fact that our developed J u n g c k K F iterative scheme converges faster than other Jungck-type iterative schemes.
Example 1.
Let ξ , ζ : [ 1 , 4 ] [ 1 , 16 ] be two mappings given as ζ a n = 2 a n + 3 and ξ a n = a n 2 . If we choose the first approximation a 0 = 2 , with η n = σ n = 1 2 ( n ) + 1 , n 0 , we find that p ̲ * = 9 is the coincidence point of the mappings defined above, p ̲ * = 9 = ζ ( 3 ) = ξ ( 3 ) .
In the Table 1 we provided the values of different Jungck-type iterative schemes related to our numerical example. To illustrate graphically the behavior of the convergence of the different Jungck-type iterative schemes considered in the Table 1 we give in the following, the Figure 1. Moreover, in the Table 2 will present some comparative results for another types of Jungck iterative schemes, considering the same values as in the Table 1.

5. Application in Dynamic Market Equilibrium

This section is dedicated to the analysis of Dynamic Market Equilibrium with respect to the common fixed-point result given in this paper. The role of coincident points and the Jungck sequence in the context of Dynamic Market Equilibrium was first studied by S. Shukla et. al. [32]. Then, starting with this work, we present an application to prove the practical utility of the Jungck contraction in determining the unique solution of an integral equation arising in the context of Dynamic Market Equilibrium in economics.
The concept of Dynamic Market Equilibrium lies at the intersection of economics and mathematics, particularly in economic dynamics, game theory, and mathematical optimization. It extends the classical notion of market equilibrium to systems that evolve over time, capturing how agents interact, adjust their behavior, and respond to changing market conditions.
Symmetry in an economic context may also refer to agent symmetry—where all agents are treated identically in terms of access to markets or preferences; preference symmetry—where agents have similar (e.g., homothetic or convex) preferences; or time symmetry—where future and past are treated analogously in intertemporal models.
While these are not mathematical symmetries of a norm, they influence whether the aggregated excess demand functions have properties (e.g., continuity, monotonicity, or convexity) that can be translated into functional–analytic terms for fixed-point theorems or variational inequality frameworks.
Supply M s and demand M d in many markets are influenced by current prices and price trends, including whether prices are rising or falling and the rate at which these changes occur (i.e., accelerating or decelerating) [33]. Consequently, an economist must consider the current price P ( t ) , its first derivative d P ( t ) d t , and its second derivative d 2 P ( t ) d t 2 . Let
M s = g 1 + u 1 P ( t ) + e 1 d P ( t ) d t + c 1 d 2 P ( t ) d t 2 M d = g 2 + u 2 P ( t ) + e 2 d P ( t ) d t + c 2 d 2 P ( t ) d t 2
where g 1 , g 2 , u 1 , u 2 , e 1 , and e 2 are constants, and c 1 and c 2 are chosen such that c 1 c 2 0 . Equilibrium is given by M s = M d . Therefore,
g 1 + u 1 P ( t ) + e 1 d P ( t ) d t + c 1 d 2 P ( t ) d t 2 = g 2 + u 2 P ( t ) + e 2 d P ( t ) d t + c 2 d 2 P ( t ) d t 2
since
( c 1 c 2 ) d 2 P ( t ) d t 2 + ( e 1 e 2 ) d P ( t ) d t + ( u 1 u 2 ) P ( t ) = ( g 1 g 2 ) .
Letting c = c 1 c 2 , e = e 1 e 2 , u = u 1 u 2 , and g = g 1 g 2 in the above, we have
c d 2 P ( t ) d t 2 + e d P ( t ) d t + u P ( t ) = g ,
and dividing P ( t ) by c 0 we get the following initial value problem:
P + e c P + u c P ( t ) = g c ; P ( 0 ) = 0 ; P ( 0 ) = 0 .
Further, let C [ 0 , σ ] , R be the set of real continuous functions defined on [ 0 , σ ] , with σ > 0 . Following the proof, it is easy to show that Problem (35) is equivalent to the integral equation
P ( t ) = 0 σ G ( t , v ) K ( t , v , P ( v ) ) d v ,
where G ( t , v ) : [ 0 , σ ] × [ 0 , σ ] [ 0 , σ ] is a Green function defined as
G ( t , v ) = v · e u 2 e ( t v ) , if 0 v t σ t · e u 2 e ( v t ) , if 0 t v σ
and K : [ 0 , σ ] × [ 0 , σ ] × C ( [ 0 , σ ] , R ) R is a continuous and non-decreasing function.
Further, let us consider the following equation system:
P 1 x ̲ ( t ) = 0 σ G ( t , v ) K ( t , v , P 1 x ̲ ( v ) ) d v P 2 y ̲ ( t ) = 0 σ G ( t , v ) H ( t , v , P 2 y ̲ ( v ) ) d v .
where K , H : [ 0 , σ ] × [ 0 , σ ] × C [ 0 , σ ] R are two continuous and non-decreasing functions and G ( t , v ) is a Green function defined as (37).
Let . : X × X R be a norm defined by
ζ a ζ b = sup t [ 0 , σ ] | ζ a ζ b | , for a , b R .
It is easy to prove that X = C [ 0 , σ ] , R , . form a Banach space.
Theorem 5.
Let X = C ( [ 0 , σ ] , R ) , . be a Banach space. Assume Equation (36) holds and that the following assertions are true:
(i) 
There exists an arbitrary subset A of X and ξ , ζ : A X , two weakly compatible mappings with the same properties as in Theorem 1, such that for x ̲ ( t ) , y ̲ ( t ) X we have
ζ x ̲ ( t ) = 0 σ G ( t , v ) K ( t , v , ζ x ̲ ( v ) ) d v ;
ξ y ̲ ( t ) = 0 σ G ( t , v ) H ( t , v , ξ y ̲ ( v ) ) d v ,
where K , H : [ 0 , σ ] × C [ 0 , σ ] R are two continuous and non-decreasing functions and G ( t , v ) : [ 0 , σ ] × [ 0 , σ ] [ 0 , σ ] is a Green function defined in (37) that is continuous and bounded as follows:
sup t [ 0 , σ ] 0 σ G ( t , v ) 1 ;
(ii) 
There exists a monotone increasing function υ : R + R + with the property υ ( 0 ) = 0 and r ^ [ 0 , 1 ] such that
| K ( t , v , ζ ( a ) ) H ( t , v , ζ ( b ) ) | | υ ( ξ a ζ b ) + r ^ ( ξ a ξ b ) | , for σ > 0 and a , b R .
Then, the integral equation system (38) has a unique common solution.
Proof. 
In order to prove this Theorem, we will check the Jungck-KF condition (5) for every x ̲ ( t ) , y ̲ ( t ) C [ 0 , σ ] .
| ζ x ̲ ( t ) ζ y ̲ ( t ) | = 0 σ G ( t , v ) K ( t , v , ζ x ̲ ( v ) ) d v 0 σ G ( t , v ) H ( t , v , ζ y ̲ ( v ) ) d v 0 σ | G ( t , v ) | · | K ( t , v , ζ x ̲ ( v ) ) H ( t , v , ζ y ̲ ( v ) ) | d v .
Using the assumption ( i i ) we have
| ζ x ̲ ( t ) ζ y ̲ ( t ) | 0 σ | G ( t , v ) | · υ ( ξ x ̲ ( v ) ζ y ̲ ( v ) ) + r ^ ( ξ x ̲ ( v ) ξ y ̲ ( v ) ) d v .
Taking the supremum on both sides, and taking into account that υ : R + R + is a monotone increasing function, for r ^ [ 0 , 1 ] , we get
sup t [ 0 , σ ] | ζ x ̲ ( t ) ζ y ̲ ( t ) | sup t [ 0 , σ ] 0 σ | G ( t , v ) | · υ ( ξ x ̲ ( v ) ζ y ̲ ( v ) ) + r ^ ( ξ x ̲ ( v ) ξ y ̲ ( v ) ) d v 0 σ sup t [ 0 , σ ] | G ( t , v ) | · sup t [ 0 , σ ] υ ( ξ x ̲ ( v ) ζ y ̲ ( v ) ) + r ^ ( ξ x ̲ ( v ) ξ y ̲ ( v ) ) d v 0 σ sup t [ 0 , σ ] | G ( t , v ) | · sup t [ 0 , σ ] υ ( ξ x ̲ ( v ) ζ y ̲ ( v ) ) + r ^ sup t [ 0 , σ ] ξ x ̲ ( v ) ξ y ̲ ( v ) d v 0 σ sup t [ 0 , σ ] | G ( t , v ) | · υ ( sup t [ 0 , σ ] ξ x ̲ ( v ) ζ y ̲ ( v ) ) + r ^ sup t [ 0 , σ ] ξ x ̲ ( v ) ξ y ̲ ( v ) d v .
Then we have
ζ x ̲ ζ y ̲ υ ( ξ x ̲ ζ y ̲ ) + r ^ ξ x ̲ ξ y ̲ 0 σ sup t [ 0 , σ ] | G ( t , v ) | d v .
Since the Green function is bounded as in ( i i ) , we get
ζ x ̲ ζ y ̲ υ ( ξ x ̲ ζ x ̲ ) + r ^ ξ x ̲ ξ y ̲
Then, the Jungck contraction condition given in (5) holds. Applying Theorem 1, for P 1 x ̲ = ζ x ̲ and P 2 y ̲ = ξ y ̲ , we get the existence of a unique common solution of the integral equation system (38)— x * C [ 0 , σ ] —which is derived from the price equation (36). Meanwhile, considering that the economic problem of determining market equilibrium is seen as a boundary value problem (35), the common unique solution of the integral equation system (38) is actually the equilibrium price of the market. □

6. Conclusions

The Jungck-KF iterative scheme’s efficiency stems from its comprehensive contractive conditions, enhanced stability and data-dependence, superior convergence rates, and flexibility in operator pairing. These attributes make it a robust choice for researchers and practitioners working within fixed-point theory and related fields. Also, the implications of the data-dependence result for the Jungck-KF iterative scheme are profound, enhancing its robustness, accuracy, applicability, efficiency, and potential for algorithmic innovation. These factors collectively contribute to its growing relevance in practical applications across diverse fields.
We also explored an application to prove the practical utility of the Jungck contraction in determining the unique solution of an integral equation arising in the context of dynamic market equilibrium in economics.
Also, a strong connection between norm symmetry in Banach spaces and dynamic market equilibrium models was made evident in this study. At a foundational level, norm symmetry ensures basic mathematical consistency in equilibrium formulations. Also, geometric symmetries in Banach spaces underpin the existence, uniqueness, and convergence of equilibrium in dynamic settings. These symmetries enable the use of fixed-point theory and variational analysis, which are central to proving results in dynamic general equilibrium theory and computational economics.

Author Contributions

Conceptualization, K.A., F.A. and K.S.; methodology, L.G. and M.-F.B.; software, K.A. and L.G.; validation, K.S. and M.-F.B.; formal analysis, K.A. and F.A.; investigation, K.A., F.A. and K.S.; resources K.A., F.A. and L.G.; data curation F.A., L.G. and M.-F.B.; writing—original draft preparation, K.A. and F.A.; writing–review and editing, L.G. and M.-F.B.; visualization, M.-F.B.; supervision, K.S. and M.-F.B.; project administration, K.S.; funding acquisition, M.-F.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data is contained within the article.

Acknowledgments

The second author expresses their thanks to the Office of Research Innovation and Commercialization (ORIC), Government College University, Lahore, Pakistan, for generous its support and facilitating this research work under project # 0421/ORIC/24.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Ostrowski, A.M. Solution of Equations and Systems of Equation; Academic Press: New York, NY, USA, 1960; Volume IX. [Google Scholar]
  2. Petković, M.S.; Neta, B.; Petković, L.; Džunić, J. Multipoint Methods for Solving Nonlinear Equation; Elsevier: Amsterdam, The Netherlands, 2013. [Google Scholar]
  3. Bnouhachem, A.; Noor, M.A. A new iterative method for variational inequalities. Appl. Math. Comput. 2006, 182, 1673–1682. [Google Scholar] [CrossRef]
  4. Noor, M.A.; Noor, K.I.; Bnouhachem, A. Some new iterative methods for solving variational inequalities. Can. J. Appl. Math. 2020, 2, 1–17. [Google Scholar]
  5. Ceng, L.-C.; Al-Homidan, S.; Ansari, Q.H.; Yao, J.-C. An iterative scheme for equilibrium problems and fixed point problem of strict-pseudo-contraction mappings. J. Comput. Appl. Math. 2009, 223, 967–974. [Google Scholar] [CrossRef]
  6. Ceng, L.-C.; Petrusel, A.; Yao, J.-C. Iterative approaches to solving equilibrium problems and fixed point problems of infinitely many nonexpansive mappings. J. Optim. Theory Appl. 2009, 143, 37–58. [Google Scholar] [CrossRef]
  7. Jia, J.; Shabbir, K.; Ahmad, K.; Shah, N.A.; Botmart, T. Strong convergence of a new hybrid iterative scheme for nonexpensive mappings and applications. J. Funct. Spaces 2022, 1, 4855173. [Google Scholar]
  8. Chugh, R.; Kumar, V. Data dependence of Noor and SP iterative schemes when dealing with quasi-contractive operators. Int. J. Comput. Appl. 2011, 36, 40–46. [Google Scholar] [CrossRef]
  9. Qing, Y.; Rhoades, B.E. Comments on the rate of convergence between Mann and Ishikawa iterations applied to Zamfirescu operators. Fixed Point Theory Appl. 2008, 2008, 387504. [Google Scholar] [CrossRef]
  10. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  11. Abbas, M.; Jungck, G. Common fixed point results for noncommuting mappings without continuity in cone metric spaces. J. Math. Anal. Appl. 2008, 341, 416–420. [Google Scholar] [CrossRef]
  12. Bouhadjera, H. A unique common fixed point for contractive mappings under a new concept. Bull. Transilv. Univ. Brasov. Ser. III Math. Comput. Sci. 2022, 2, 33–46. [Google Scholar] [CrossRef]
  13. Kumar, S.; Aron, D. Common fixed-point theorems for non-linear non-self contractive mappings in convex metric spaces. Topol. Algebra Its Appl. 2023, 11, 20220122. [Google Scholar] [CrossRef]
  14. Chandok, S.; Radenović, S. Existence of solution for orthogonal F-contraction mappings via Picard–Jungck sequences. J. Anal. 2022, 30, 677–690. [Google Scholar] [CrossRef]
  15. Fan, H.; Wang, C. Stability and convergence rate of Jungck-type iterations for a pair of strongly demicontractive mappings in Hilbert spaces. Comput. Appl. Math. 2023, 14, 33. [Google Scholar] [CrossRef]
  16. Maldar, S. An examination of data dependence for Jungck-Type iteration method. Erciyes Üniv. Fen Bilim. Enstitüsü Fen Bilim. Derg. 2020, 36, 374–384. [Google Scholar]
  17. Jamil, Z.Z.; Hussein, Z. Common Fixed Point of Jungck Picard Itrative for Two Weakly Compatible Self-Mappings. Iraqi J. Sci. 2021, 62, 1695–1701. [Google Scholar]
  18. Bosede, A.O. Strong convergence results for the Jungck-Ishikawa and Jungck-Mann iteration processes. Bull. Math. Anal. Appl. 2010, 2, 65–73. [Google Scholar]
  19. Berinde, V. On the convergence of the Ishikawa iteration in the class of quasi contractive operators. Acta Math. Univ. Comen. New Ser. 2004, 73, 119–126. [Google Scholar]
  20. Berinde, V.; Takens, F. Iterative Approximation of Fixed Points; Springer: Berlin/Heidelberg, Germany, 2007; Volume 1912. [Google Scholar]
  21. Guran, L.; Shabbir, K.; Ahmad, K.; Bota, M.F. Stability, Data Dependence, and Convergence Results with Computational Engendering of Fractals via Jungck-DK Iterative Scheme. Fractal Fract. 2023, 7, 418. [Google Scholar] [CrossRef]
  22. Harder, A.M. Fixed Point Theory and Stability Results for Fixed Point Iteration Procedures. 1987. Doctoral Dissertations. 634. Available online: https://scholarsmine.mst.edu/doctoral_dissertations/634 (accessed on 27 April 2025).
  23. Hussain, N.; Kumar, V.; Kutbi, M.A. On rate of convergence of Jungck-type iterative schemes. Abstr. Appl. Anal. 2013, 2013, 132626. [Google Scholar] [CrossRef]
  24. Jungck, G. Commuting mappings and fixed points. Am. Math. Mon. 1976, 83, 261–263. [Google Scholar] [CrossRef]
  25. Ostrowski, A.M. The Round-off Stability of Iterations. ZAMM-J. Appl. Math. Mech./Z. Angew. Math. Mech. 1967, 47, 77–81. [Google Scholar] [CrossRef]
  26. Olatinwo, M.O.; Imoru, C.O. Some convergence results for the Jungck–Mann and the Jungck–Ishikawa iteration processes in the class of generalized Zamfirescu operators. Acta Math. Univ. Comen. New Ser. 2008, 27, 299–304. [Google Scholar]
  27. Singh, S.L.; Bhatnagar, C.; Mishra, S.N. Stability of Jungck-type iterative procedures. Int. J. Math. Math. Sci. 2005, 2005, 3035–3043. [Google Scholar] [CrossRef]
  28. Olatinwo, M.O. A generalization of some convergence results using the Jungck-Noor three step iteration process in arbitrary Banach space. Fasc. Math. 2008, 40, 37–43. [Google Scholar]
  29. Ullah, K.; Ahmad, J.; Khan, F.M. Numerical reckoning fixed points via new faster iteration process. Appl. Gen. Topol. 2022, 23, 213–223. [Google Scholar] [CrossRef]
  30. Jungck, G.; Hussain, N. Compatible maps and invariant approximations. J. Math. Anal. Appl. 2007, 325, 1003–1012. [Google Scholar] [CrossRef]
  31. Soltuz, S.M.; Grosan, T. Data dependence for Ishikawa iteration when dealing with contractive-like operators. Fixed Point Theory Appl. 2008, 2008, 242916. [Google Scholar] [CrossRef]
  32. Shukla, S.; Dubey, N.; Shukla, R.; Mezník, I. Coincidence Point of Edelstein Type Mappings in Fuzzy Metric Spaces and Application to the Stability of Dynamic Markets. Axioms 2023, 12, 854. [Google Scholar] [CrossRef]
  33. Dowling Edward, T. Introduction to Mathematical Economics; MC Graw Hill Education: New York, NY, USA, 2001. [Google Scholar]
Figure 1. Comparison between Jungck-KF and other Jungck-type iterative schemes.
Figure 1. Comparison between Jungck-KF and other Jungck-type iterative schemes.
Symmetry 17 00885 g001
Table 1. Convergence of various Jungck-type iterative schemes to the coincidence point p ̲ * = 9 = ζ 3 = ξ 3 , with a 0 = 2 and η n = σ n = 1 2 n + 1 .
Table 1. Convergence of various Jungck-type iterative schemes to the coincidence point p ̲ * = 9 = ζ 3 = ξ 3 , with a 0 = 2 and η n = σ n = 1 2 n + 1 .
nJungck–MannJungck–IshikawaJungck–Noor
Iterative Scheme Iterative Scheme Iterative Scheme
ζ a n ξ a n a n + 1 ζ a n ξ a n a n + 1 ζ a n ξ a n a n + 1
07.000004.000002.394177.000004.000002.487417.000004.000002.50896
17.788345.732052.579087.974826.187202.669468.017916.294862.68722
28.158166.651652.687208.338927.126012.765568.374447.221162.77952
38.374417.221062.757818.531137.648352.824498.559037.725712.83556
48.515627.605512.807128.648987.977742.863848.671118.040392.87276
58.686338.083582.870408.783288.361572.912078.745538.252772.89894
68.740808.239212.891528.824148.480152.927548.797878.403842.91812
78.783038.360862.908228.855098.570512.939548.836248.515412.93261
88.816438.457722.921648.879088.640902.949028.865228.600212.94383
98.843288.535992.932598.898048.696732.956638.887668.666122.95268
108.686338.083582.870408.783288.361572.962078.905368.718312.95977
Table 2. Convergence of various Jungck-type iterative schemes to the coincidence point p ̲ * = 9 = ζ 3 = ξ 3 , with a 0 = 2 and η n = σ n = 1 2 n + 1 .
Table 2. Convergence of various Jungck-type iterative schemes to the coincidence point p ̲ * = 9 = ζ 3 = ξ 3 , with a 0 = 2 and η n = σ n = 1 2 n + 1 .
nJungck-CRJungck-DKJungck-KF
Iterative Scheme Iterative Scheme Iterative Scheme
ζ a n        ξ a n        a n + 1 ζ a n        ξ a n        a n + 1 ζ a n        ξ a n        a n + 1
07.00000 4.00000 2.834747.00000 4.00000 2.959567.00000 4.00000 2.98649
18.66949 8.03578 2.966288.91912 8.75900 2.990518.97298 8.91912 2.99882
28.93255 8.79879 2.992388.98102 8.94315 2.997408.99854 8.99382 2.99997
38.98476 8.95435 2.998178.99480 8.98441 2.999248.99994 8.99982 2.99999
48.99634 8.98903 2.999548.99848 8.99544 2.999768.99998 8.99995 3.00000
58.99908 8.99725 2.999888.99952 8.99856 2.999938.99998 8.99995 3.00000
68.99976 8.99929 2.999978.99986 8.99958 2.999988.99998 8.99995 3.00000
78.99994 8.99981 2.999998.99996 8.99988 3.000008.99998 8.99995 3.00000
88.99998 8.99995 3.000008.99998 8.99998 3.000008.99998 8.99995 3.00000
99.00000 8.99999 3.000009.00000 9.00000 3.000008.99998 8.99995 3.00000
109.00000 9.00000 3.000009.00000 9.00000 3.000008.99998 8.99995 3.00000
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ahmad, K.; Shabbir, K.; Ali, F.; Bota, M.-F.; Guran, L. Analytical Approach to Convergence, Stability, and Data-Dependence of Jungck-KF Iterative Scheme with Applications in Dynamic Market Equilibrium Analysis. Symmetry 2025, 17, 885. https://doi.org/10.3390/sym17060885

AMA Style

Ahmad K, Shabbir K, Ali F, Bota M-F, Guran L. Analytical Approach to Convergence, Stability, and Data-Dependence of Jungck-KF Iterative Scheme with Applications in Dynamic Market Equilibrium Analysis. Symmetry. 2025; 17(6):885. https://doi.org/10.3390/sym17060885

Chicago/Turabian Style

Ahmad, Khushdil, Khurram Shabbir, Faraz Ali, Monica-Felicia Bota, and Liliana Guran. 2025. "Analytical Approach to Convergence, Stability, and Data-Dependence of Jungck-KF Iterative Scheme with Applications in Dynamic Market Equilibrium Analysis" Symmetry 17, no. 6: 885. https://doi.org/10.3390/sym17060885

APA Style

Ahmad, K., Shabbir, K., Ali, F., Bota, M.-F., & Guran, L. (2025). Analytical Approach to Convergence, Stability, and Data-Dependence of Jungck-KF Iterative Scheme with Applications in Dynamic Market Equilibrium Analysis. Symmetry, 17(6), 885. https://doi.org/10.3390/sym17060885

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