2017
DOI: 10.18466/cbayarfbe.339352
|View full text |Cite
|
Sign up to set email alerts
|

Convergence and Data Dependence Results for AK Iterative Algorithm

Abstract: This paper concentrates on studying convergence and data dependence of AK iteration for the class of maps which was introduced by Berinde. Also, we will support our results with an example.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…3x for x ∈ [1,3]. ThenT is an approximate operator of T with η = 1 3 . We take α n = 1 2 n and β n = 1 3 n for n = 0, 1, 2... so that lim…”
Section: Data Dependencementioning
confidence: 99%
See 4 more Smart Citations
“…3x for x ∈ [1,3]. ThenT is an approximate operator of T with η = 1 3 . We take α n = 1 2 n and β n = 1 3 n for n = 0, 1, 2... so that lim…”
Section: Data Dependencementioning
confidence: 99%
“…x 0 ∈ K z n = T ((1 − β n )x n + β n T x n ) y n = T ((1 − α n )z n + α n T z n ) x n+1 = Ty n (1) where {α n } ∞ n=0 and {β n } ∞ n=0 are real sequences in [0,1]. Ullah and Arshad [4] proved the convergence, data dependence and T -stability of AK iteration procedure under certain assumptions on α n s for contraction maps as follows.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations