2013
DOI: 10.4208/ata.2013.v29.n1.2
|View full text |Cite
|
Sign up to set email alerts
|

Stability Results for Jungck-Kirk-Mann and Jungck-Kirk Hybrid Iterative Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 9 publications
0
8
0
Order By: Relevance
“…(i) With T i = T i and S = I = Identity operator; then, Jungck-Kirk-Mann type iterative algorithm (7) reduces to the Kirk-Mann iterative algorithm of Olatinwo [18]. (ii) If T i = T i , the algorithm (7) becomes the Jungck-Kirk-Mann iterative algorithm defined in Olatinwo [19]. (iii) The iterative processes of Kirk [12], Krasnoselskij [13], Mann [14], Picard [26] and Schaefer [33] are also some of the special cases of Jungck-Kirk-Mann type iterative algorithm.…”
Section: Remark 28mentioning
confidence: 99%
See 4 more Smart Citations
“…(i) With T i = T i and S = I = Identity operator; then, Jungck-Kirk-Mann type iterative algorithm (7) reduces to the Kirk-Mann iterative algorithm of Olatinwo [18]. (ii) If T i = T i , the algorithm (7) becomes the Jungck-Kirk-Mann iterative algorithm defined in Olatinwo [19]. (iii) The iterative processes of Kirk [12], Krasnoselskij [13], Mann [14], Picard [26] and Schaefer [33] are also some of the special cases of Jungck-Kirk-Mann type iterative algorithm.…”
Section: Remark 28mentioning
confidence: 99%
“…Some examples of operators satisfying our contractive condition are given later at the end of each section. Lemma 2.9 [5,[17][18][19]] Let be a real number such that 0 ≤ 𝛿 < 1 and { n } ∞ n=0 a sequence of positive numbers such that lim n→∞ n = 0. Then, for any sequence of positive numbers {u n } ∞ n=0 satisfying we have lim n→∞ u n = 0.…”
Section: Remark 28mentioning
confidence: 99%
See 3 more Smart Citations