On Rate of Convergence of Jungck-Type Iterative Schemes
نویسندگان
چکیده
منابع مشابه
On Rate of Convergence of Jungck-Type Iterative Schemes
and Applied Analysis 3 Szn − p = (1 − γn) Sxn + γnTxn − (1 − γn + γn) p ≤ (1 − γ n ) Sxn − p + γn Txn − Tz ≤ (1 − γ n ) Sxn − p + γ n {φ (‖Sz − Tz‖) + a Sxn − Sz } = (1 − γ n (1 − a)) Sxn − p . (13) It follows from (13) that Syn − p ≤ (1 − βn) a Sxn − p + β n a (1 − γ n (1 − a)) Sxn − p . (14) Using (1 − β ...
متن کاملOn the Rate of Convergence of Kirk-Type Iterative Schemes
The purpose of this paper is to introduce Kirk-type new iterative schemes called Kirk-SP and Kirk-CR schemes and to study the convergence of these iterative schemes by employing certain quasi-contractive operators. By taking an example, we will compare Kirk-SP, Kirk-CR, Kirk-Mann, Kirk-Ishikawa, and Kirk-Noor iterative schemes for aforementioned class of operators. Also, using computer programs...
متن کاملThe Convergence of Jungck-type Iterative Schemes for Generalized Contractive-like Operators
We introduce the Jungck-multistep iteration and show that it converges strongly to the unique common fixed point of a pair of weakly compatible generalized contractive-like operators defined on a Banach space. As corollaries, the results show that the Jungck-Mann, Jungck-Ishikawa and Jungck-Noor iterations can also be used to approximate the common fixed points of such maps. The results are imp...
متن کاملAnalytical and numerical treatment of Jungck-type iterative schemes
In this paper, we introduce a new and general Jungck-type iterative scheme for a pair of nonself mappings and study its strong convergence, stability and data dependence. It is exhibited that our iterative scheme has much better convergence rate than those of Jungck–Mann, Jungck–Ishikawa, Jungck–Noor and Jungck–CR iterative schemes. Numerical examples in support of validity and applications of ...
متن کاملStability of Jungck-type iterative procedures
Let (X ,d) be a metric space and T : X → X . Several physical problems, expressed as a fixed point equation Tx = x, are solved by approximating a sequence {xn} ⊂ X generated by an iterative procedure f (T ,xn). Let the sequence {xn} converge to a fixed point of T . The iterative procedure f (T ,xn) is considered numerically stable if and only if a sequence {yn} ⊂ X approximatively close to {xn}...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2013
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2013/132626