<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OALibJ</journal-id><journal-title-group><journal-title>Open Access Library Journal</journal-title></journal-title-group><issn pub-type="epub">2333-9705</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/oalib.1105245</article-id><article-id pub-id-type="publisher-id">OALibJ-91276</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Biomedical&amp;Life Sciences</subject><subject> Business&amp;Economics</subject><subject> Chemistry&amp;Materials Science</subject><subject> Computer Science&amp;Communications</subject><subject> Earth&amp;Environmental Sciences</subject><subject> Engineering</subject><subject> Medicine&amp;Healthcare</subject><subject> Physics&amp;Mathematics</subject><subject> Social Sciences&amp;Humanities</subject></subj-group></article-categories><title-group><article-title>
 
 
  Fixed Point Results for K-Iteration Using Non-Linear Type Mappings
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Anju</surname><given-names>Panwar</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Ravi</surname><given-names>Parkash Bhokal</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>Government College, Dujana, Jhajjar (Haryana), India</addr-line></aff><aff id="aff1"><addr-line>Department of Mathematics, M. D. U. Rohtak, Haryana, India</addr-line></aff><pub-date pub-type="epub"><day>06</day><month>03</month><year>2019</year></pub-date><volume>06</volume><issue>03</issue><fpage>1</fpage><lpage>14</lpage><history><date date-type="received"><day>13,</day>	<month>February</month>	<year>2019</year></date><date date-type="rev-recd"><day>17,</day>	<month>March</month>	<year>2019</year>	</date><date date-type="accepted"><day>20,</day>	<month>March</month>	<year>2019</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In this paper we establish convergence and stability results using general contractive condition, quasi-nonexpansive mapping and mean non expansive mapping for K-iteration process. We shall also generalize the K-iteration process for a pair of distinct mappings and with the help of example we claim that the generalized iteration process has better convergence rate than the K-iteration process for single mapping and some of the existing iteration processes. Suitable examples are given in the support of main results.
 
</p></abstract><kwd-group><kwd>K-Iteration Process</kwd><kwd> Opial’s Condition</kwd><kwd> Mean Non-Expansive Mapping</kwd><kwd>  Quasi Non-Expansive Mapping</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction and Preliminary Definitions</title><p>Let ( X , d ) be a metric space and T : X → X be a self map defined on X. Let F ( T ) = { z ∈ X : T z = z } denote the set of fixed point of T. For x 0 ∈ X , the sequence { x n } n = 0 ∞ defined by</p><p>x n + 1 = T x n , n ≥ 0 , (1.1)</p><p>is called the Picard iteration.</p><p>For x 0 ∈ X , the sequence { x n } n = 0 ∞ defined by</p><p>*Corrosponding author.</p><p>x n + 1 = ( 1 − α n ) x n + α n T x n , n ≥ 0 , (1.2)</p><p>where { α n } n = 0 ∞ is a sequence in [ 0 , 1 ] such that ∑ n = 0 ∞ α n = ∞ is called the Mann iteration process [<xref ref-type="bibr" rid="scirp.91276-ref1">1</xref>] .</p><p>In 2013, Khan [<xref ref-type="bibr" rid="scirp.91276-ref2">2</xref>] produced a new type of iteration process by introducing the concept of the following Picard-Mann hybrid iterative process for a single mapping T. For the initial value x 0 ∈ X , the sequence { x n } n = 0 ∞ defined by</p><p>x n + 1 = T y n ,</p><p>y n = ( 1 − α n ) x n + α n T x n , n ≥ 0 , (1.3)</p><p>where { α n } n = 0 ∞ is a sequence in [ 0 , 1 ] .</p><p>Khan [<xref ref-type="bibr" rid="scirp.91276-ref2">2</xref>] showed that the rate of convergence of Picard-Mann hybrid iterative process is more than the Picard iteration scheme, Mann iteration scheme [<xref ref-type="bibr" rid="scirp.91276-ref1">1</xref>] and Ishikawa iterative schemes [<xref ref-type="bibr" rid="scirp.91276-ref3">3</xref>] .</p><p>In this direction Gursoy and Karakaya [<xref ref-type="bibr" rid="scirp.91276-ref4">4</xref>] , gave new iteration process as follows:</p><p>For the initial value x 0 ∈ X , the sequence { x n } n = 0 ∞ defined by</p><p>{ z n = ( 1 − β n ) x n + β n T x n , y n = ( 1 − α n ) T x n + α n T z n , x n + 1 = T y n (1.4)</p><p>where { α n } n = 0 ∞ , { β n } n = 0 ∞ is a sequence in [ 0 , 1 ] is known as Picard-S iterative process. By giving appropriate example, Gursoy and Karakaya [<xref ref-type="bibr" rid="scirp.91276-ref4">4</xref>] proved that their iterative process has better convergence rate than Picard, Mann, Ishikawa, Noor and Normal-S iterative processes.</p><p>Karakaya et al. in their paper [<xref ref-type="bibr" rid="scirp.91276-ref5">5</xref>] , introduced a new hybrid iterative process as</p><p>{ x 0 ∈ X , y n = T ( 1 − β n ) x n + β n T x n , x n + 1 = T ( 1 − α n ) y n + α n T y n (1.5)</p><p>where { α n } n = 0 ∞ , { β n } n = 0 ∞ is a sequence in [ 0 , 1 ] .</p><p>With the help of suitable example it was claimed by Karakaya et al. [<xref ref-type="bibr" rid="scirp.91276-ref5">5</xref>] , that their iteration process converges faster than the iteration process of Gursoy and Karakaya [<xref ref-type="bibr" rid="scirp.91276-ref4">4</xref>] .</p><p>In 2016, Thakur et al. [<xref ref-type="bibr" rid="scirp.91276-ref6">6</xref>] introduced a new iteration scheme called Thakur New Iteration Scheme as for the initial value x 0 ∈ X , the sequence { x n } n = 0 ∞ defined by</p><p>{ z n = ( 1 − β n ) x n + β n T x n , y n = T ( 1 − α n ) x n + α n z n , x n + 1 = T y n (1.6)</p><p>where { α n } n = 0 ∞ , { β n } n = 0 ∞ is a sequence in [ 0 , 1 ] .</p><p>In [<xref ref-type="bibr" rid="scirp.91276-ref6">6</xref>] it was claimed that the Thakur New Iteration Scheme has higher convergence rate than the iteration process of Karakaya et al. [<xref ref-type="bibr" rid="scirp.91276-ref7">7</xref>] .</p><p>In the recent work of Hussain et al. [<xref ref-type="bibr" rid="scirp.91276-ref8">8</xref>] , a new iteration scheme has been developed and it is claimed that it has better convergence rate than the iterative process Thakur et al. [<xref ref-type="bibr" rid="scirp.91276-ref6">6</xref>] . This iteration process is called K-iteration process and is given as:</p><p>For the initial value x 0 ∈ X , the sequence { x n } n = 0 ∞ defined by</p><p>{ z n = ( 1 − β n ) x n + β n T x n , y n = T ( 1 − α n ) T x n + α n T z n , x n + 1 = T y n (1.7)</p><p>where { α n } n = 0 ∞ , { β n } n = 0 ∞ is a sequence in [ 0 , 1 ] .</p><p>In the present work we shall generalize some convergence and stability results for K-iteration process. We shall also prove convergence and stability results for more general form of K-iteration process and K-iteration process for a pair of two distinct mappings.</p><p>Definition 1.1 [<xref ref-type="bibr" rid="scirp.91276-ref3">3</xref>] : Let X be a real Banach space. The mapping T : X → X is said to be asymptotically quasi-nonexpansive if F ( T ) ≠ ∅ and there exists a sequence { μ n } ⊂ [ 0 , ∞ ) with μ n → 0 as n → ∞ such that</p><p>‖ T n x − q ‖ ≤ ( 1 + μ n ) ‖ x − q ‖ (1.8)</p><p>for all x ∈ X , q ∈ F ( T ) and n ≥ 0 .</p><p>Definition 1.2 [<xref ref-type="bibr" rid="scirp.91276-ref9">9</xref>] : Let X be a real Banach space. The mapping T : X → X is said to be mean non-expansive if there exists two non negative real numbers a , b such that a + b ≤ 1 and for all x , y ∈ X ,</p><p>‖ T x − T y ‖ = a ‖ x − y ‖ + b ‖ x − T y ‖</p><p>Definition 1.3 [<xref ref-type="bibr" rid="scirp.91276-ref10">10</xref>] : Let { z n } n = 0 ∞ be any sequence in X. Then the iterative process x n + 1 = f ( T , x n ) which converges to a fixed point q, is said to be stable with respect to the mapping T if for φ n = ‖ z n + 1 − f ( T , z n ) ‖ , n = 0 , 1 , 2 , ⋯ , we have lim n → ∞ φ n = 0 if and only if lim n → ∞ z n = q .</p><p>Definition 1.4 [<xref ref-type="bibr" rid="scirp.91276-ref7">7</xref>] : A space X is said to satisfy Opial’s condition if for each sequence { x n } n = 0 ∞ in X such that x n converges weakly to x we have for all y ∈ X , x ≠ y following holds:</p><p>1) lim inf n → ∞ ‖ x n − x ‖ &lt; lim inf n → ∞ ‖ x n − y ‖ ,</p><p>2) lim sup n → ∞ ‖ x n − x ‖ &lt; lim sup n → ∞ ‖ x n − y ‖ .</p><p>Lemma 1.5 [<xref ref-type="bibr" rid="scirp.91276-ref11">11</xref>] : Let { a n } n = 0 ∞ and { b n } n = 0 ∞ be non-negative real sequences satisfying the inequality:</p><p>a n + 1 ≤ ( 1 − b n ) a n + b n ,</p><p>where b n ∈ ( 0 , 1 ) , for all n ∈ N , ∑ n = 1 ∞ b n = ∞ and b n a n → 0 as n → ∞ , then lim n → ∞ a n = 0 .</p><p>Lemma 1.6 [<xref ref-type="bibr" rid="scirp.91276-ref12">12</xref>] : Let δ be a real number such that 0 ≤ δ &lt; 1 , and { ϵ n } n = 0 ∞ be a sequence of positive numbers such that lim n → ∞ ϵ n = 0 . Then for any sequence of positive numbers { a n } n = 0 ∞ satisfying a n + 1 ≤ δ a n + ϵ n , n = 0 , 1 , 2 , ⋯ , we have lim n → ∞ a n = 0 .</p><p>Lemma 1.7 [<xref ref-type="bibr" rid="scirp.91276-ref13">13</xref>] : Let X be a real Banach space and { g n } be any sequence in X such that 0 &lt; g n &lt; 1 for all n ∈ N . Let { a n } n = 0 ∞ and { b n } n = 0 ∞ be non-negative real sequences satisfying lim sup n → ∞ ‖ a n ‖ ≤ c , lim sup n → ∞ ‖ b n ‖ ≤ c and lim sup n → ∞ ‖ g n a n + ( 1 − g n ) b n ‖ = c holds for some c ≥ 0 . Then lim sup n → ∞ ‖ a n − b n ‖ = 0 .</p></sec><sec id="s2"><title>2. Main Results</title><p>Theorem 2.1: Let X be a Banach space and T : X → X be a mapping satisfying the condition</p><p>‖ T x − q ‖ ≤ δ ‖ x − q ‖ (2.1)</p><p>where q ∈ F , x ∈ X and 0 ≤ δ &lt; 1 . Let { x n } n = 0 ∞ be the sequence defined by the K-iterative process given by (1.7). Then the sequence { x n } n = 0 ∞ converges strongly to q ∈ F ( T ) .</p><p>Proof: From (1.7) and (2.1) we have,</p><p>‖ x n + 1 − q ‖ = ‖ T y n − q ‖ ≤ δ ‖ T y n − q ‖ (2.2)</p><p>And</p><p>‖ y n − q ‖ = ‖ T ( ( 1 − α n ) T x n + α n T z n ) − q ‖ ≤ δ ‖ ( 1 − α n ) T x n + α n T z n − q ‖ ≤ δ ‖ ( 1 − α n ) ( T x n − q ) + α n ( T z n − q ) ‖ ≤ δ [ ( 1 − α n ) ‖ T x n − q ‖ + α n ‖ T z n − q ‖ ] ≤ δ [ ( 1 − α n ) ‖ T x n − q ‖ + α n ‖ T z n − q ‖ ] ≤ δ 2 [ ( 1 − α n ) ‖ x n − q ‖ + α n ‖ z n − q ‖ ] (2.3)</p><p>Again using (1.7) and (2.1) we get,</p><p>‖ z n − q ‖ = ‖ ( 1 − β n ) x n + β n T x n − q ‖ ≤ ( 1 − β n ) ‖ x n − q ‖ + β n ‖ T x n − q ‖ ≤ ( 1 − β n ) ‖ x n − q ‖ + β n δ ‖ x n − q ‖ (2.4)</p><p>Using (2.4) in (2.3) we get,</p><p>‖ y n − q ‖ ≤ δ 2 [ ( 1 − α n ) ‖ x n − q ‖ + α n ( 1 − β n ) ‖ x n − q ‖ + α n β n δ ‖ x n − q ‖ ] ≤ δ 2 ( 1 − α n + α n ( 1 − β n ) + α n β n δ ) ‖ x n − q ‖ ≤ δ 2 ( 1 − α n β n ( 1 − δ ) ) ‖ x n − q ‖ (2.5)</p><p>Using (2.5) in (2.2) we get,</p><p>‖ x n + 1 − q ‖ ≤ δ 3 ( 1 − α n β n ( 1 − δ ) ) ‖ x n − q ‖</p><p>Since 0 ≤ δ &lt; 1 , α n ∈ [ 0 , 1 ) and ∑ n = 0 ∞ α n = ∞ . Hence by using lemma (1.6), we have</p><p>lim n → ∞ ‖ x n + 1 − q ‖ = 0.</p><p>Hence the sequence { x n } n = 0 ∞ converges strongly to q.</p><p>Corollary 2.2: (Akewe and Okeke [<xref ref-type="bibr" rid="scirp.91276-ref14">14</xref>] ) Let X be a Banach space and T : X → X be a mapping satisfying the condition</p><p>‖ T x − q ‖ ≤ δ ‖ x − q ‖</p><p>where q ∈ F , x ∈ X and 0 ≤ δ &lt; 1 . Let { x n } n = 0 ∞ be the sequence defined by the Picard-Mann hybrid iterative process given by (1.3). Then the sequence { x n } n = 0 ∞ converges strongly to q.</p><p>Remark 2.3: Theorem 2.1 gives generalization to many results in the literature by considering a wider class of contractive type operators and more general iterative process, including the results of Chidume [<xref ref-type="bibr" rid="scirp.91276-ref15">15</xref>] , Bosede and Rhoades [<xref ref-type="bibr" rid="scirp.91276-ref16">16</xref>] and Akewe and Okeke [<xref ref-type="bibr" rid="scirp.91276-ref14">14</xref>] .</p><p>Theorem 2.4: Let X be a Banach space and T : X → X be a mapping satisfying the condition</p><p>‖ T x − q ‖ ≤ δ ‖ x − q ‖</p><p>where q ∈ F , x ∈ X and 0 ≤ δ &lt; 1 . Let { x n } n = 0 ∞ be the sequence defined by the K-iterative process given by (1.7). Then the iteration process (1.7) is T-stable.</p><p>Proof: By theorem 2.1, the sequence { x n } n = 0 ∞ converges strongly to q. Let { u n } n = 0 ∞ , { v n } n = 0 ∞ and { w n } n = 0 ∞ be real sequences in X.</p><p>Let φ n = ‖ u n + 1 − T v n ‖ , n = 0 , 1 , 2 , ⋯ , where</p><p>w n = ( 1 − β n ) u n + β n T u n ,</p><p>v n = T ( ( 1 − α n ) T u n + α n T w n ) ,</p><p>u n + 1 = T v n ,</p><p>and let lim n → ∞ φ n = 0 .</p><p>We shall prove that lim n → ∞ u n = q .</p><p>Now,</p><p>‖ u n + 1 − q ‖ = ‖ u n + 1 − T v n ‖ + ‖ T v n − q ‖ ≤ φ n + δ ‖ v n − q ‖ (2.6)</p><p>‖ v n − q ‖ = ‖ T ( ( 1 − α n ) T u n + α n T w n ) − q ‖ ≤ δ ‖ ( 1 − α n ) T u n + α n T w n − q ‖ ≤ δ ‖ ( 1 − α n ) ( T u n − q ) + α n ( T w n − q ) ‖ ≤ δ [ ( 1 − α n ) ‖ T u n − q ‖ + α n ‖ T w n − q ‖ ] ≤ δ [ ( 1 − α n ) ‖ T u n − q ‖ + α n ‖ T w n − q ‖ ] ≤ δ 2 [ ( 1 − α n ) ‖ u n − q ‖ + α n ‖ w n − q ‖ ] (2.7)</p><p>Again using (1.7) and (2.1) we get,</p><p>‖ w n − q ‖ = ‖ ( 1 − β n ) u n + β n T u n − q ‖ ≤ ( 1 − β n ) ‖ u n − q ‖ + β n ‖ T u n − q ‖ ≤ ( 1 − β n ) ‖ u n − q ‖ + β n δ ‖ u n − q ‖ ≤ ( 1 − β n ( 1 − δ ) ) ‖ u n − q ‖ (2.8)</p><p>Using (2.8) in (2.7) we get,</p><p>‖ v n − q ‖ ≤ δ 2 [ ( 1 − α n ) ‖ u n − q ‖ + α n ( 1 − β n ( 1 − δ ) ) ‖ u n − q ‖ ] ≤ δ 2 ( 1 − α n β n ( 1 − δ ) ) ‖ u n − q ‖ (2.9)</p><p>Using (2.9) in (2.6) we get,</p><p>‖ u n + 1 − q ‖ ≤ φ n + δ 3 ( 1 − α n β n ( 1 − δ ) ) ‖ u n − q ‖ (2.10)</p><p>Since 0 ≤ δ &lt; 1 and since 0 ≤ α n , β n ≤ 1 we have by lemma (1.6)</p><p>lim n → ∞ u n = q .</p><p>Conversely let lim n → ∞ u n = q . We shall show that lim n → ∞ φ n = 0 .</p><p>Now</p><p>φ n = ‖ u n + 1 − T v n ‖ ≤ ‖ u n + 1 − q ‖ + ‖ T q − T v n ‖ ≤ ‖ u n + 1 − q ‖ + δ ‖ v n − q ‖ (2.11)</p><p>Substituting (2.9) in (2.11),</p><p>φ n ≤ ‖ u n + 1 − q ‖ + δ 3 ( 1 − α n β n ( 1 − δ ) ) ‖ u n − q ‖ (2.12)</p><p>Since lim n → ∞ u n = q , we have from (2.12) lim n → ∞ φ n = 0 . Hence the K-iteration scheme is T-stable.</p><p>From theorem 2.4, we have the following corollary.</p><p>Corollary 2.5: Let X be a Banach space and T : X → X be a mapping satisfying the condition</p><p>‖ T x − q ‖ ≤ δ ‖ x − q ‖ ,</p><p>where q ∈ F , x ∈ X and 0 ≤ δ &lt; 1 . Let { x n } n = 0 ∞ be the sequence defined by the Picard-Mann hybrid iterative process given by (1.3). Then the iteration process (1.3) is T-stable.</p><p>Example 2.6: Let X = [ 0 , 1 ] and consider the mapping T x = x 2 . The clearly the mapping T satisfies the inequality (2.1). Now F ( T ) = 0 . Now we claim that the K-iteration scheme (1.7) is T-stable. Let us take α n = β n = 1 2 and consider the sequences x n = y n = z n = 1 n . Then clearly lim n → ∞ x n = 0 .</p><p>Now</p><p>φ n = ‖ x n + 1 − T y n ‖ = ‖ x n + 1 − y n 2 ‖ = ‖ x n + 1 − T ( ( 1 − α n ) T x n + α n T z n ) 2 ‖ = ‖ x n + 1 − ( 1 − α n ) T x n + α n T z n 4 ‖ = ‖ x n + 1 − ( ( 1 − α n ) x n 8 + α n z n 8 ) ‖ = ‖ x n + 1 − ( ( 1 − α n ) x n 8 + α n ( 1 − β n ) x n 8 + α n β n T x n 8 ) ‖ = ‖ x n + 1 − ( ( 1 − α n ) x n 8 + α n ( 1 − β n ) x n 8 + α n β n x n 16 ) ‖ = ‖ 1 n + 1 − ( 1 16 n + 1 32 n + 1 64 n ) ‖ = ‖ 1 n + 1 − 1 8 n ‖</p><p>= ‖ 7 n − 1 8 n ( n + 1 ) ‖ = ‖ 7 − 1 n 8 ( n + 1 ) ‖ (2.13)</p><p>Taking limit n → ∞ in (2.13), we have lim n → ∞ φ n = 0 . Hence the K-iteration process is T-stable.</p><p>Now we shall prove the convergence and stability results for asymptotically quasi-nonexpansive mapping by considering the more general form of K-iteration process as:</p><p>z n = ( 1 − β n ) x n + β n T n x n ,</p><p>y n = T n ( ( 1 − α n ) T n x n + α n T n z n ) ,</p><p>x n + 1 = T n y n , where n = 0 , 1 , 2 , ⋯ , (2.14)</p><p>Theorem 2.7: Let H be a non-empty closed convex subset of a Banach space X and T : H → H be asymptotically quasi-nonexpansive mapping with real sequence μ n ⊆ [ 0 , ∞ ) . Let { x n } n = 0 ∞ be the sequence defined by the K-iterative process given by (2.14) and satisfies the assumption that ∑ n = 0 ∞ α n β n μ n = ∞ . Then the sequence { x n } n = 0 ∞ converges strongly to some fixed point q of the mapping T.</p><p>Proof: From the iterative process (2.14) we have,</p><p>‖ z n − q ‖ = ‖ ( 1 − β n ) x n + β n T n x n − q ‖ ≤ ( 1 − β n ) ‖ x n − q ‖ + β n ‖ T n x n − q ‖ ≤ ( 1 − β n ) ‖ x n − q ‖ + β n ( 1 + μ n ) ‖ x n − q ‖ ≤ ( 1 + β n μ n ) ‖ x n − q ‖ (2.15)</p><p>and</p><p>‖ y n − q ‖ = ‖ T n ( ( 1 − α n ) T n x n + α n T n z n ) − q ‖ ≤ ( 1 + μ n ) ‖ ( 1 − α n ) T n x n + α n T n z n − q ‖ ≤ ( 1 + μ n ) ‖ ( 1 − α n ) ( T n x n − q ) + α n ( T n z n − q ) ‖ ≤ ( 1 + μ n ) [ ( 1 − α n ) ‖ T n x n − q ‖ + α n ‖ T n z n − q ‖ ]</p><p>≤ ( 1 + μ n ) [ ( 1 − α n ) ( 1 + μ n ) ‖ x n − q ‖ + α n ( 1 + μ n ) ‖ z n − q ‖ ] ≤ ( 1 + μ n ) 2 [ ( 1 − α n ) ‖ x n − q ‖ + α n ‖ z n − q ‖ ] ≤ ( 1 + μ n ) 2 [ ( 1 − α n ) ‖ x n − q ‖ + α n ( 1 + β n μ n ) ‖ x n − q ‖ ] ≤ ( 1 + μ n ) 2 ( 1 − α n β n μ n ) ‖ x n − q ‖ (2.16)</p><p>Again using (2.14) we have,</p><p>‖ x n + 1 − q ‖ ≤ ‖ T n y n − q ‖ ≤ ( 1 + μ n ) ‖ y n − q ‖ ≤ ( 1 + μ n ) 3 ( 1 − α n β n μ n ) ‖ x n − q ‖ (2.17)</p><p>By repeating the above process, we have the following inequalities</p><p>‖ x n + 1 − q ‖ ≤ ( 1 + μ n ) 3 ( 1 − α n β n μ n ) ‖ x n − q ‖</p><p>‖ x n − q ‖ ≤ ( 1 + μ n − 1 ) 3 ( 1 − α n − 1 β n − 1 μ n − 1 ) ‖ x n − 1 − q ‖</p><p>‖ x n − 1 − q ‖ ≤ ( 1 + μ n − 2 ) 3 ( 1 − α n − 2 β n − 2 μ n − 2 ) ‖ x n − 2 − q ‖</p><p>⋯</p><p>‖ x 1 − q ‖ ≤ ( 1 + μ 0 ) 3 ( 1 − α 0 β 0 μ 0 ) ‖ x 0 − q ‖</p><p>So we can write,</p><p>‖ x n + 1 − q ‖ ≤ ( 1 + μ 0 ) 3 ( n + 1 ) ‖ x 0 − q ‖ ∏ j = 0 n ( 1 − α j β j μ j )</p><p>Since 1 − x ≤ e − x for all x ∈ [ 0 , 1 ] . Now 1 − α j β j μ j &lt; 1 , so we can write,</p><p>‖ x n + 1 − q ‖ ≤ ( 1 + μ 0 ) 3 ( n + 1 ) ‖ x 0 − q ‖ e − ( 1 − α j β j μ j ) ≤ ( 1 + μ 0 ) 3 ( n + 1 ) ‖ x 0 − q ‖ e − ∑ j = 0 n α j β j μ j (2.18)</p><p>Taking limit n → ∞ in (2.18), we have lim n → ∞ ‖ x n − q ‖ = 0 , that is the sequence { x n } n = 0 ∞ converges strongly to fixed point q of the mapping T.</p><p>Theorem 2.8: Let H be a non-empty closed convex subset of a Banach space X and T : H → H be asymptotically quasi-nonexpansive mapping with real sequence μ n ⊆ [ 0 , ∞ ) . Let { x n } n = 0 ∞ be the sequence defined by the K-iterative process given by (2.14) and satisfies the assumption that ∑ n = 0 ∞ α n β n μ n = ∞ . Then the iterative process (2.14) is T-stable.</p><p>Proof: Let { u n } n = 0 ∞ ⊂ X be any arbitrary sequence. Let the sequence generated by the iterative process (2.14) is x n + 1 = f ( T , x n ) converging to the fixed point q.</p><p>Let φ n = ‖ u n + 1 − f ( T , x n ) ‖ .</p><p>We shall prove that lim n → ∞ φ n = 0 if and only if lim n → ∞ u n = q .</p><p>First suppose lim n → ∞ φ n = 0 . Now we have</p><p>‖ u n + 1 − q ‖ = ‖ u n + 1 − f ( T , u n ) ‖ + ‖ f ( T , u n ) − q ‖ = φ n + ‖ T n ( T n ( 1 − β n ) T n u n + β n T n ( ( 1 − α n ) u n + α n T n u n ) ) − q ‖ ≤ φ n + ( 1 + μ n ) 3 ( 1 − α n β n μ n ) ‖ x n − q ‖ (2.19)</p><p>where α n , β n ∈ [ 0 , 1 ] , lim n → ∞ φ n = 0 and lim n → ∞ μ n = 0 .</p><p>Now using (2.19) together with lemma (1.5), we have lim n → ∞ ‖ u n − q ‖ = 0 that is lim n → ∞ u n = q .</p><p>Conversely let lim n → ∞ u n = q . we have</p><p>φ n = ‖ u n + 1 − f ( T , u n ) ‖ ≤ ‖ u n + 1 − q ‖ + ‖ f ( T , u n ) − q ‖ ≤ ‖ u n + 1 − q ‖ + ( 1 + μ n ) 3 ( 1 − α n β n μ n ) ‖ u n − q ‖</p><p>Taking limit n → ∞ both sides of (6) we have lim n → ∞ φ n = 0 . Hence (2.14) is T-stable.</p><p>Now we shall prove the convergence results for mean non-expansive mapping by modifying the K-iteration process for two mappings as:</p><p>z n = ( 1 − β n ) x n + β n S x n ,</p><p>y n = T ( ( 1 − α n ) S x n + α n T z n ) ,</p><p>x n + 1 = T y n , where n = 0 , 1 , 2 , ⋯ , (2.20)</p><p>Lemma 2.9: Let H be a non-empty closed convex subset of a Banach space X and S , T : H → H be two mean non-expansive mapping such that F = F ( T ) ∩ F ( S ) ≠ ϕ . Let { x n } n = 0 ∞ be the sequence defined by the K-iterative process given by (2.20). Then lim n → ∞ ‖ x n − q ‖ exists for some q ∈ F .</p><p>Proof: We have</p><p>‖ z n − q ‖ = ‖ ( 1 − β n ) x n + β n S x n − q ‖ ≤ ( 1 − β n ) ‖ x n − q ‖ + β n ‖ S x n − q ‖ ≤ ( 1 − β n ) ‖ x n − q ‖ + β n ( a 1 ‖ x n − q ‖ + b 1 ‖ x n − q ‖ ) ≤ ( 1 − β n ) ‖ x n − q ‖ + β n ( a 1 + b 1 ) ‖ x n − q ‖ ≤ ‖ x n − q ‖ (2.21)</p><p>Again using (2.20) and (2.21)</p><p>‖ y n − q ‖ = ‖ T ( ( 1 − α n ) S x n + α n T z n ) − q ‖ ≤ a 2 ‖ ( ( 1 − α n ) S x n + α n T z n ) − q ‖ + b 2 ‖ ( ( 1 − α n ) S x n + α n T z n ) − q ‖ ≤ ( a 2 + b 2 ) ‖ ( ( 1 − α n ) S x n + α n T z n ) − q ‖ ≤ ( 1 − α n ) ‖ S x n − q ‖ + α n ‖ T z n − q ‖</p><p>≤ ( 1 − α n ) ( a 1 ‖ x n − q ‖ + b 1 ‖ x n − q ‖ ) + α n ( a 2 ‖ z n − q ‖ + b 2 ‖ z n − q ‖ ) ≤ ( 1 − α n ) ( a 1 + b 1 ) ‖ x n − q ‖ + α n ( a 2 + b 2 ) ‖ z n − q ‖ ≤ ( 1 − α n ) ‖ x n − q ‖ + α n ‖ z n − q ‖ ≤ ‖ x n − q ‖ (2.22)</p><p>Again using (2.20) and (2.22)</p><p>‖ x n + 1 − q ‖ ≤ ‖ T y n − q ‖ ≤ a 2 ‖ y n − q ‖ + b 2 ‖ y n − q ‖ ≤ ( a 2 + b 2 ) ‖ y n − q ‖ ≤ ‖ y n − q ‖ ≤ ‖ x n − q ‖ (2.23)</p><p>This shows that { ‖ x n − q ‖ } is non-increasing and bounded sequence for q ∈ F . Hence lim n → ∞ ‖ x n − q ‖ exists.</p><p>Lemma 2.10: Let be a non-empty closed convex subset of a Banach space and S , T : H → H be two mean non-expansive mapping such that F = F ( T ) ∩ F ( S ) ≠ ϕ . Let { x n } n = 0 ∞ be the sequence defined by the K-iterative process given by (2.20). Also consider that lim n → ∞ ‖ S x n − q ‖ = lim n → ∞ ‖ T x n − q ‖ = 0 for some q ∈ F . Then lim n → ∞ ‖ T x n − x n ‖ = 0 .</p><p>Proof: Let q ∈ F . In lemma (2.9) we have proved the existence of</p><p>lim n → ∞ ‖ x n − q ‖ . Let lim n → ∞ ‖ x n − q ‖ = c . (2.24)</p><p>W.L.O.G. let c &gt; 0 .</p><p>Now from (2.20) and (2.24) we have,</p><p>lim sup n → ∞ ‖ z n − q ‖ ≤ lim sup n → ∞ ‖ x n − q ‖ = c (2.25)</p><p>Now</p><p>‖ S x n − q ‖ ≤ a 1 ‖ x n − q ‖ + b 1 ‖ x n − q ‖ ≤ ( a 1 + b 1 ) ‖ x n − q ‖ ≤ ‖ x n − q ‖</p><p>Implies that lim sup n → ∞ ‖ S x n − q ‖ ≤ lim sup n → ∞ ‖ x n − q ‖ = c (2.26)</p><p>Now</p><p>‖ x n + 1 − q ‖ ≤ ‖ T y n − q ‖ ≤ a 2 ‖ y n − q ‖ + b 2 ‖ y n − q ‖ ≤ ( a 2 + b 2 ) ‖ y n − q ‖ ≤ ‖ y n − q ‖ ≤ ‖ T ( ( 1 − α n ) S x n + α n T z n ) − q ‖ ≤ a 2 ‖ ( ( 1 − α n ) S x n + α n T z n ) − q ‖ + b 2 ‖ ( ( 1 − α n ) S x n + α n T z n ) − q ‖ ≤ ( a 2 + b 2 ) ‖ ( ( 1 − α n ) S x n + α n T z n ) − q ‖</p><p>≤ ( 1 − α n ) ‖ S x n − q ‖ + α n ‖ T z n − q ‖ ≤ ( 1 − α n ) ( a 1 ‖ x n − q ‖ + b 1 ‖ x n − q ‖ ) + α n ( a 2 ‖ z n − q ‖ + b 2 ‖ z n − q ‖ ) ≤ ( 1 − α n ) ( a 1 + b 1 ) ‖ x n − q ‖ + α n ( a 2 + b 2 ) ‖ z n − q ‖ ≤ ( 1 − α n ) ‖ x n − q ‖ + α n ‖ z n − q ‖ ≤ ‖ x n − q ‖ − α n ‖ x n − q ‖ + α n ‖ z n − q ‖</p><p>⇒ ‖ x n + 1 − q ‖ − ‖ x n − q ‖ α n = ‖ z n − q ‖ − ‖ x n − q ‖</p><p>and hence</p><p>‖ x n + 1 − q ‖ − ‖ x n − q ‖ ≤ ‖ x n + 1 − q ‖ − ‖ x n − q ‖ α n = ‖ z n − q ‖ − ‖ x n − q ‖</p><p>which implies that ‖ x n + 1 − q ‖ ≤ ‖ z n − q ‖ (2.27)</p><p>Taking limit inferior in (2.27) we obtain</p><p>c ≤ lim inf n → ∞ ‖ z n − q ‖ (2.28)</p><p>From (2.20) and (2.28) we have</p><p>c = lim n → ∞ ‖ z n − q ‖ = lim n → ∞ ‖ ( 1 − β n ) x n + β n S x n − q ‖ = lim n → ∞ ‖ β n ( S x n − q ) + ( 1 − β n ) ( x n − q ) ‖ (2.29)</p><p>Now from (2.24), (2.26), (2.29) and lemma (1.7), we have lim n → ∞ ‖ S x n − x n ‖ = 0 .</p><p>Now,</p><p>‖ T x n − q ‖ ≤ a 2 ‖ x n − q ‖ + b 2 ‖ x n − q ‖ ≤ ‖ x n − q ‖</p><p>⇒ lim sup n → ∞ ‖ T x n − q ‖ ≤ lim sup n → ∞ ‖ x n − q ‖ ≤ c (2.30)</p><p>Using the conditions of the lemma in (2.30), we can write</p><p>C = lim n → ∞ ‖ β n ( T x n − q ) + ( 1 − β n ) ( x n − q ) ‖ (2.31)</p><p>Using (2.24), (2.30), (2.31) along with the lemma (1.7), we have</p><p>lim n → ∞ ‖ T x n − x n ‖ = 0.</p><p>Theorem 2.11: Let H be a non-empty closed convex subset of a Banach space X satisfying Opial’s condition and S, T and { x n } n = 0 ∞ be same as defined in the lemma (2.10) .Then the sequence { x n } n = 0 ∞ converges weakly to some q ∈ F .</p><p>Proof: From lemma (2.10) we have, lim n → ∞ ‖ T x n − x n ‖ = 0 .</p><p>Since X is uniformly convex and hence it is reflexive so there exists a subsequence { x n m } of { x n } such that { x n m } converges weakly to some q 1 ∈ F . Since H is closed so q 1 ∈ H . Now we claim the weak convergence of { x n } to q 1 . Let it is not true, then there exists a subsequence of { x n i } of { x n } which converges weakly to q 2 and let q 1 ≠ q 2 . Also q 2 ∈ F . Now from lemma (2.9) lim n → ∞ ‖ x n − q 1 ‖ and lim n → ∞ ‖ x n − q 2 ‖ both exist. Using Opial’s condition we have,</p><p>lim n → ∞ ‖ x n − q 1 ‖ ≤ lim n → ∞ ‖ x n m − q 1 ‖ &lt; lim n → ∞ ‖ x n m − q 2 ‖ = lim n → ∞ ‖ x n − q 2 ‖ = lim n → ∞ ‖ x n i − q 2 ‖ &lt; lim n → ∞ ‖ x n i − q 1 ‖ ≤ lim n → ∞ ‖ x n − q 1 ‖</p><p>This is a contradiction, so we must have q 1 = q 2 . Thus the sequence { x n } n = 0 ∞ converges weakly to some q ∈ F .</p><p>Theorem 2.12: Let H be a non-empty closed compact subset of a Banach space X and S, T and { x n } n = 0 ∞ be same as defined in the lemma (2.10). Then the sequence { x n } n = 0 ∞ converges strongly to some q ∈ F .</p><p>Proof: Since H is compact and hence it is sequentially compact. So there exists a subsequence { x n i } of { x n } which converges to q ∈ H .</p><p>Now</p><p>‖ x n i − T q ‖ = ‖ x n i − T x n i ‖ + ‖ T x n i − T q ‖ ≤ ‖ x n i − T x n i ‖ + a 2 ‖ x n i − q ‖ + b 2 ‖ x n i − q ‖ ≤ ‖ x n i − T x n i ‖ + ‖ x n i − q ‖ (2.32)</p><p>Taking limit n → ∞ in (2.32) we have, T q = q that is q ∈ F . We have earlier proved that lim n → ∞ ‖ x n − q ‖ exists for q ∈ F . Hence the sequence { x n } n = 0 ∞ converges strongly to some q ∈ F .</p><p>In [<xref ref-type="bibr" rid="scirp.91276-ref8">8</xref>] it is proves that the K-iteration process converges faster than Picard-S, Thakur-New and Vatan two-step iterative process. Now we shall compare the rate of convergence the K-iteration process defined in [<xref ref-type="bibr" rid="scirp.91276-ref8">8</xref>] and our new modified K-iteration process for two mappings.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Iterative values of K-iteration process and Modified K-iteration process</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >K-iteration</th><th align="center" valign="middle" >Modified K-iteration</th></tr></thead><tr><td align="center" valign="middle" >x<sub>0</sub></td><td align="center" valign="middle" >2.25</td><td align="center" valign="middle" >2.25</td></tr><tr><td align="center" valign="middle" >x<sub>1</sub></td><td align="center" valign="middle" >2.030273437500000</td><td align="center" valign="middle" >2.013360362386860</td></tr><tr><td align="center" valign="middle" >x<sub>2</sub></td><td align="center" valign="middle" >2.003665924072266</td><td align="center" valign="middle" >2.000717402289730</td></tr><tr><td align="center" valign="middle" >x<sub>3</sub></td><td align="center" valign="middle" >2.000443920493126</td><td align="center" valign="middle" >2.000038531785984</td></tr><tr><td align="center" valign="middle" >x<sub>4</sub></td><td align="center" valign="middle" >2.000053755997215</td><td align="center" valign="middle" >2.000002069576723</td></tr><tr><td align="center" valign="middle" >x<sub>5</sub></td><td align="center" valign="middle" >2.000006509515288</td><td align="center" valign="middle" >2.000000111158901</td></tr><tr><td align="center" valign="middle" >x<sub>6</sub></td><td align="center" valign="middle" >2.000000788261617</td><td align="center" valign="middle" >2.000000005970444</td></tr><tr><td align="center" valign="middle" >x<sub>7</sub></td><td align="center" valign="middle" >2.000000095453555</td><td align="center" valign="middle" >2.000000000320678</td></tr><tr><td align="center" valign="middle" >x<sub>8</sub></td><td align="center" valign="middle" >2.000000011558829</td><td align="center" valign="middle" >2.000000000017224</td></tr><tr><td align="center" valign="middle" >x<sub>9</sub></td><td align="center" valign="middle" >2.000000001399702</td><td align="center" valign="middle" >2.000000000000925</td></tr><tr><td align="center" valign="middle" >x<sub>10</sub></td><td align="center" valign="middle" >2.000000000169495</td><td align="center" valign="middle" >2.000000000000050</td></tr><tr><td align="center" valign="middle" >x<sub>11</sub></td><td align="center" valign="middle" >2.000000000020525</td><td align="center" valign="middle" >2.000000000000003</td></tr><tr><td align="center" valign="middle" >x<sub>12</sub></td><td align="center" valign="middle" >2.000000000002486</td><td align="center" valign="middle" >2.000000000000000</td></tr><tr><td align="center" valign="middle" >x<sub>13</sub></td><td align="center" valign="middle" >2.000000000000301</td><td align="center" valign="middle" >2.000000000000000</td></tr><tr><td align="center" valign="middle" >x<sub>14</sub></td><td align="center" valign="middle" >2.000000000000036</td><td align="center" valign="middle" >2.000000000000000</td></tr><tr><td align="center" valign="middle" >x<sub>15</sub></td><td align="center" valign="middle" >2.000000000000004</td><td align="center" valign="middle" >2.000000000000000</td></tr><tr><td align="center" valign="middle" >x<sub>16</sub></td><td align="center" valign="middle" >2.000000000000000</td><td align="center" valign="middle" >2.000000000000000</td></tr></tbody></table></table-wrap><p>Example 2.13: Let S , T : [ 0 , 3 ] → [ 0 , 3 ] be two mappings defined by T ( x ) = x + 2 2 and s ( x ) = ( x + 2 ) 1 2 . Let α n , β n be the sequences defined by α n = β n = 1 4 . Let the initial approximation be x 0 = 2.25 . Clearly S, T has</p><p>unique common fixed point 2. The convergence pattern of K-iteration process and modified K-iteration process is shown in <xref ref-type="table" rid="table1">Table 1</xref>.</p><p>Clearly we can conclude from <xref ref-type="table" rid="table1">Table 1</xref>, that the modified K-iteration process has better rate of convergence than the k-iteration process.</p></sec><sec id="s3"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s4"><title>Cite this paper</title><p>Panwar, A. and Bhokal, R.P. (2019) Fixed Point Results for K-Iteration Using Non-Linear Type Mappings. Open Access Library Journal, 6: e5245. https://doi.org/10.4236/oalib.1105245</p></sec></body><back><ref-list><title>References</title><ref id="scirp.91276-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Mann, W.R. (1953) Mean Value Methods in Iteration. Proceedings of the American Mathematical Society, 4, 506-510. https://doi.org/10.1090/S0002-9939-1953-0054846-3</mixed-citation></ref><ref id="scirp.91276-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Khan, S.H. (2013) A Picard-Mann Hybrid Iterative Process. Fixed Point Theory and Applications, 2013, 69. https://doi.org/10.1186/1687-1812-2013-69</mixed-citation></ref><ref id="scirp.91276-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Ishikawa, S. (1974) Fixed Points by a New Iteration Method. Proceedings of the American Mathematical Society, 44, 147-150. https://doi.org/10.1090/S0002-9939-1974-0336469-5</mixed-citation></ref><ref id="scirp.91276-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Gursoy, F. and Karakaya, V. (2014) A Picard-S Hybrid Type Iteration Method for Solving a Differential Equation with Retared Arguments. 1-16.</mixed-citation></ref><ref id="scirp.91276-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Karakaya, V., Bouzara, N.E.H., Dogan, K. and Atalan, Y. (2015) On Different Results for a New Two Step Iteration Method under Weak Contraction Mapping in Banach Spaces. 1-10. arXiv:1507.00200v1</mixed-citation></ref><ref id="scirp.91276-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Thakur, B.S., Thakur, D. and Postolache, M. (2016) A New Iterative Scheme for Numerical Reckoning Fixed Points of Suzuki’s Generalized Non-Expansive Mappings. Applied Mathematics and Computation, 275, 147-155. https://doi.org/10.1016/j.amc.2015.11.065</mixed-citation></ref><ref id="scirp.91276-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Opial, Z. (1967) Weak Convergence of the Sequence of Successive Approximations for Non-Expansive Mappings. Bulletin of the American Mathematical Society, 73, 595-597. https://doi.org/10.1090/S0002-9904-1967-11761-0</mixed-citation></ref><ref id="scirp.91276-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Hussain, N., Ullah, K. and Arshad, M. (2018) Fixed Point Approximation of Suzuki Generalized Non-Expansive Mapping via New Faster Iterative Process. arxiv 1802.09888v</mixed-citation></ref><ref id="scirp.91276-ref9"><label>9</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Zhang</surname><given-names> S.S. </given-names></name>,<etal>et al</etal>. (<year>1975</year>)<article-title>About Fixed Point Theory for Mean Non Expansive Mappings in Banach Spaces</article-title><source> Journal of Sichuan University</source><volume> 2</volume>,<fpage> 67</fpage>-<lpage>78</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.91276-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Harder, A.M. (1987) Fixed Point Theory and Stability Results for Fixed Point Iteration Procedure. University of Missouri-Rolla, Missouri.</mixed-citation></ref><ref id="scirp.91276-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Weng, X. (1991) Fixed Point Iteration for Local Strictly Pseudo-Contractive Mapping. Proceedings of the American Mathematical Society, 113, 727-731. https://doi.org/10.1090/S0002-9939-1991-1086345-8</mixed-citation></ref><ref id="scirp.91276-ref12"><label>12</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Berinde</surname><given-names> V. </given-names></name>,<etal>et al</etal>. (<year>2002</year>)<article-title>On the Stability of Some Fixed Point Procedures</article-title><source> Buletinul ?tiin?ific al Univer-sitatii Baia Mare</source><volume> Seria B</volume>,<fpage> Fascicola matematic?</fpage>-<lpage>informatic?</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.91276-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Sahu, J. (1991) Weak and Strong Convergence to Fixed Points of Asymptotically Non-Expansive Mappings. Bulletin of the Australian Mathematical Society, 43, 153-159. https://doi.org/10.1017/S0004972700028884</mixed-citation></ref><ref id="scirp.91276-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Akewe, H. and Okeke, G.A. (2015) Convergence and Stability Theorems for the Picard-Mann Hybrid Iterative Scheme for a General Class of Contractive-Like Operators. Fixed Point Theory and Applications, 2015, 66.</mixed-citation></ref><ref id="scirp.91276-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Chidume, C.E. (2014) Strong Convergence and Stability of Picard Iteration Sequence for General Class of Contractive-Type Mappings. Fixed Point Theory and Applications, 2014, 233. https://doi.org/10.1186/1687-1812-2014-233</mixed-citation></ref><ref id="scirp.91276-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Bosede, A.O. and Rhoades, B.E. (2010) Stability of Picard and Mann Iteration for a General Class of Functions. Journal of Advanced Mathematical Studies, 3, 23.</mixed-citation></ref></ref-list></back></article>