SlideShare a Scribd company logo
1 of 8
Download to read offline
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.8, 2013
53
Iterative Procedure for Uniform Continuous Mapping.
Chika Moore1
Nnubia Agatha C1*
and. Mogbademu Adesanmi2
1. Department of Mathematics, Nnamdi Azikiwe University P.M.B 5025 Awka, Nigeria.
2. Department of Mathematics, University of Lagos, Lagos Nigeria.
* E-mail of the corresponding author: obijiakuagatha@ymail.com
Abstract
Let K be a closed convex nonempty subset of a normed linear space E and let
{ }N
iiT 1= be a finite family of self
maps on K such that T1 is a uniformly continuous uniformly hemicontractive map and T1(K) is a bounded set
with φ≠= = ))(( 1 i
N
i TFF I , sufficient conditions for the strong convergence of an N-step iteration process to a
fixed common point of the family are proved
Keywords: key words, uniformly continuous, uniformly hemicontractive, finite family, common fixed point,
Noor iteration, strong convergence.
1. Introduction
{ } ExfxfxEfxJ ∈∀==∈= ;,:)(
22*
Where E*
denotes the dual space of E and .,. denotes the
generalized duality pairing between E and E*
. The single-valued normalized duality mapping is denoted by j. A
mapping
*
: EET → is called strongly pseudocontractive if for all Eyx ∈, , there exist
)()( yxJyxj −∈− and a constant )1,0(∈K such that
2
)1()(, yxkyxjTyTx −−≤−− .
T is called strongly eractractivpseudocont−φ if for all Eyx ∈, , there exist )()( yxJyxj −∈− and
a strictly increasing function [ ) [ )1,01,0: →φ with 0)0( =φ such that
( ) .)(,
2
yxyxyxyxjTyTx −−−−≤−− φ
It is called generalized strongly eractractivpseudocont−ψ or uniformly pseudocontractive if for all
Eyx ∈, , there exist )()( yxJyxj −∈− and a strictly increasing function [ ) [ )1,01,0: →ψ with
0)0( =ψ such that
( )yxyxyxjTyTx −−−≤−− ψ
2
)(, .
Every strongly eractractivpseudocont−φ operator is a uniformly eractractivpseudocont−ψ
operator with [ ) [ )1,01,0: →ψ defined by sss )()( φψ = , but not conversely (see [13]).
These classes of operators have been studied by several authors (see, for example [3], [4], [7], [13], [19], [23],
[24] and references therein).
If I denotes the identity operator, then T is strongly pseudocontractive, strongly eractractivpseudocont−φ ,
generalized strongly eractractivpseudocont−ψ if and only if )( TI − is strongly accretive, strongly
accretive−φ , generalized strongly accretive−φ operators respectively. The interest in pseudocontractive
mappings is mainly due to their connection with the important class of nonlinear accretive operators. In recent
years, many authors have given much attention to approximate the fixed points of non-linear operators in Banach
space using the Ishikawa and Mann iterative schemes (see, for example [8], [10], [11] and references therein).
Noor [14] introduced the three-step iteration process for solving nonlinear operator equations in real Banach as
follows;
Let E be a real Banach space, K a nonempty convex subset of E and KKT →: , a mapping. For an arbitrary
Kx ∈0 , the sequence { } Kx nn ⊂
∞
=0
defined by
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.8, 2013
54
= 1 −∝ +∝ ,
= 1 − + ,
= 1 − + ,
(1)
Where {∝ },{ }and { }are three sequences in [0,1] is called the three-step iteration (or the Noor iteration).
When = 0, then the three-step iteration reduces to the Ishikawa iterative sequence if = = 0, then the
three-step iteration reduces to the Mann iteration.
Rafiq [21], recently introduced a new type of iteration-the modified three-step iteration process which is defined
as follows;
Let ∶ → be three mappings for any given ∈ , the modified three-step iteration is defined by
= 1 −∝ +∝ ,
= 1 − +
= 1 − +
(2)
Where {∝ },{ }and { } are three real sequences staisfying some conditions. It is clear that the iteration
scheme (2) includes Noor as special case.
Glowinski and Le Tallec [5] used the three-step iteration schemes to solve elastoviscoplasiticty, liquid crystal
and eigen-value problems. They have shown that the three-step approximation scheme performs better than the
two-step and one-step iteration methods. Haubruge et al. [6] have studied the convergence analysis of three-step
iteration schemes and applied these three-step iteration to obtain new splitting type algorithms for solving
variational inequalities, separable convex programming and minimization of a sum of convex functions. They
also proved that three-step iterations also lead to highly parallelized algorithms under certain conditions. Thus, it
is clear that three-step schemes play an important part in solving various problems, which arise in pure and
applied sciences.
Recently, Xue and Fan [23] used the iteration procedure define by (2) in their theorem as stated below.
Theorem 1.1 Let X be a real Banach space and K be a nonempty closed convex subset of X. Let T1, T2 and T3
be strongly pseudocontractive self maps of K with T1(K) bounded and T1, T2 and T3 uniformly continuous. Let
{ } be defined by (2),where { }, { }and { } are three real sequences in [0,1] such that (i) , →
0 → ∞. (ii) ∑∞
# = ∞, and $ ∩ $ ∩ $ ≠ 0 then the sequence{ } converges strongly to the
common fixed point of T1, T2 and T3
Olaleru and Mogbademu [17] established the strong convergence of a modified Noor iterative process when
applied to three generalized strongly eractractivpseudocont−φ , operators or generalized strongly
accretive−φ operators in Banach space. Thus, generalizing the recent results of Fan and Xue (2009). In fact
the stated and proved the following result.
Theorem 1.2 let E be real Banach space, K a nonempty closed convex subset of E,
eractractivpseudocont−φ mappings such that ' bounded. Let { } be a sequence defined by (2)
where {( }, { } and { } are three sequences in [0,1] satisfiying the following conditions:
lim →∞ ( = lim →∞ = lim →∞ = 0
∞=∑
∞
≥0n
nα if F(T1) F(T2) F(T3) ≠ ∅, then the sequence { } converges to the unique common fixed
points T1, T2 and T3 .
Remark 1.1 In theorem 1.2, it is required that;
All the 3 maps be generalized strongly eractractivpseudocont−φ with the same function ϕ (which is
rather strong function).
All the 3 maps are required to be uniformly continuous (and thus bounded).
Our purpose in this paper is to extend is to extend and generalized the result of Olaleru and Mogbademu (17) in
the following ways:
We introduce m-step iteration scheme
We extend the result to any finite family of m-maps.
The conditions of our theorems are less restrictive and more general than the one used in (17), (23). For instance,
the demand that the three maps must be uniformly continuous is weakened by allowing some of the maps to be
free.
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.8, 2013
55
1.1. The M-Step Iteration Process
Let K be a non-empty convex subset of a normed linear space E and let T: K K be a map. For any
given ∈ . The m-step iteration process is defined by
, =
,- = .1 − ( ,-/ + ( ,- ,-0 ; ' = 1, 2, … , 4
,5 = = , 6ℎ898 + 1 = ' 4:; 4; ≥ 0 (3)
For a finite family
m
iiT 1}{ = of m-maps, the m-step iterative process becomes
, =
,- = .1 − ( ,-/ + ( ,- 5 0- ,-0 ; ' = 1, 2, … , 4
,5 = = , (4)
6ℎ898 + 1 = ' 4:; 4 =:9 ' = >8 ?
+ 1
4
@ = 4 A
+ 1
4
B − A
+ 1
4
BC , ≥ 0
In the case where at least one of the maps in the finite family has some asymptotic behaviour (satisfies an
asymptotic condition) then the iterative process becomes:
, =
,- = .1 − ( ,-/ + ( ,-
r
imT −+1 ,-0 ; ' = 1, 2, … , 4
,5 = = , (5)
With n and m as in equation (4) and 9 = 1 − D
5
E
We need the following lemma in this work:
Lemma 1.1 [13] Let {F }, { }, { } be sequence of nonnegative numbers satisfying the conditions:
,
0
∞=∑
∞
≥n
nβ → 0 as n→ ∞ and = 0{ }. Suppose that
;)( 1
22
1 nnnnn γµψβµµ +−≤ ++ = 1, 2, … …
Where H:[0,1) [0,1) is a strictly increasing function with H(0) = 0. Then F → 0 as → ∞.
2. Main Result
2.1 Theorem 2.1 Let E be a normed linear space and K a nonempty closed convex subset of E, let {Ti}
m
i 1= be
a finite family of self maps on the K such that :
• T1(K), T2(K) are bounded
• T1 is a uniformly continuous uniformly hemicontractive map on K
•
m
iF 1== I F(Ti) ∅ where F(Ti) is the set of fixed points of Ti in K
Starting with an arbitrary ∈ , let { } be the iterative sequence defined by
, =
,- = .1 − ( ,-/ + ( ,- imT −+1 ,-0 ; ' = 1, 2, … , 4 − 1
,5 = (6)
Where {( ,-} ⊂ 0,1 is a finite family of real sequence such that },...2,1{;0lim , miin
n
∈∀=
∞→
α and
.
0
, ∞=∑
∞
≥n
mnα Then, { nx } converges strongly to a common fixed point of the finite family.
Proof Let ∗
J $. It suffices to prove that:
• { } is bounded.
• Let K = L ,50 − L Then K → 0 as n→ ∞
• converges to ∗
.
Now, since T1(K) is bounded, let D1 = M − ∗M + NO # L ,50 − ∗
L < ∞. We establish by
induction that M − ∗M ≤ R ∀ ≥ 0. The case n = 0 is trivial, so assume it is true for n = v +1
M T − ∗M ≤ .1 − (T,5/M T − ∗M + (T,5L T,50 − ∗
L ≤ D1
Thus, M − ∗M ≤ R ∀ ≥ 0 which gives { } are bounded.
More so, since T1(K), T2(K) and { } are bounded sets, let
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.8, 2013
56
D2 = NO # {M − ∗M + L ,50 − ∗
L + L ,50 − ∗
L < ∞
Then,
L ,50 − L ≤ ( ,50 L − ,50 L + ( ,5L − ,50 L
≤ ( ,50 M − ∗M + L ,50 − ∗
L + ( ,5M − ∗M + L ,50 − ∗
L)
≤ ( ,50 + ( ,5 M − ∗M + max {L ,50 − ∗
L, L ,50 − ∗
L})
≤ ( ,50 + ( ,5 D2
Thus, 011, →− +− nmn xy as ∞→n .
Then by uniform continuity of T1, 0→nδ as ∞→n . Thus proving (ii).
Also,
))(,( *
1
*
1
2*
1 xxjxxxx nnn −−=− +++
))(,())(,)(1( *
1
*
1,1,
*
1
*
1, xxjxyTxxjxx nmnmnnnmn −−+−−−= +−++ αα
))(,()1( *
1
*
11,
*
1111,1,
*
1
*
, xxjxxTxxxTyTxxxx nnmnnnmnmnnnmn −−+−−+−−−≤ ++++−+ ααα
)()1( *
11
2*
1,
*
1111,1,
*
1
*
, xxxxxxxTyTxxxx nnmnnnmnmnnnmn −−−+−−+−−−≤ ++++−+ ψααα
)()1(
2
1
])1[(
2
1 *
11
2*
1,
2*
1,
2*
1
2*2
, xxxxxxxxxx nnmnnnmnnnmn −−−+−++−+−−≤ ++++ ψαδαα
So that
2*
1,
2*
1,,
2*
1
2*2
,
2*
1 2
2
1
)1(2 xxxxxxxxxx nmnnnmnnmnnnmnn −+−++−+−−≤− ++++ αδαδαα
)( *
11, xxnmn −− +ψα
Hence,
2*
11,,
2*
1
2
,
2*
,, 2)1()21( xxxxxx nmnnmnnmnnnmnmn −−+−−≤−−− ++ ψαδααδαα
(7)
Since
0, →inalpha as ,in ∞∀→ there exist Nn ∈0 such that 1)2(1
2
1 ,0 <+−<≥∀ nmnn n δα
)(
)2(1
2
)2(1)2(1
)1( 2*
11
,
,
,
,2*
,
2
,2*
1 xxxxxx n
nmn
mn
nmn
nmn
n
nmn
mn
n −
+−
−
+−
+−
+−
−
≤− ++ ψ
δα
α
δα
δα
δα
α
)(22)(2
2*
11,,,,
2*
1 xxDxx nmnnmnnmnmnn −−+++−≤ ++ ψαδαδαα
Let
*
xxnn −=µ ; mnn ,2αβ = ,
2
, )( Dnmnn δαδυ ++= . Then, we have that
)( 11
22
1 ++ −+≤ nnnnnn µψβυβµµ (8)
By Lemma, 0→nµ as ∞→n . Hence, the theorem.
2.2 Theorem 2.2
Let E be a normal linear space, K a non-empty closed convex subset of E, and let
m
iiT 1}{ = be a finite family
of self maps on K such that:
• T1(K) is bounded
• T1is a uniformly continuous uniformly hemicontractive map on K
• T2, …,Tm are bounded maps
• φ≠= = )(1 i
m
i TFF I where F(Ti) is the set of fixed points of Ti in K
Starting with an arbitrary Kx ∈0 , let { nx } be the iterative sequence defined by Equation 6. Then, { nx }
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.8, 2013
57
converges strongly to a common fixed point of the finite family.
Proof Let Fx ∈*
. Then
))(,( *
1
*
1
2*
1 xxjxxxx nnn −−=− +++
))(,())(,)(1( *
1
*
1,1,
*
1
*
1, xxjxyTxxjxx nmnmnnnmn −−+−−−= +−++ αα
))(,()1( *
1
*
11,
*
1111,1,
*
1
*
, xxjxxTxxxTyTxxxx nnmnnnmnmnnnmn −−+−−+−−−≤ ++++−+ ααα
)()1( *
11
2*
1,
*
1111,1,
*
1
*
, xxxxxxxTyTxxxx nnmnnnmnmnnnmn −−−+−−+−−−≤ ++++−+ ψααα
)()1(
2
1
])1[(
2
1 *
11
2*
1,
2*
1,
2*
1
2*2
, xxxxxxxxxx nnmnnnmnnnmn −−−+−++−+−−≤ ++++ ψαδαα
Where 111,1 +− −= nmnn xTyTδ ; So that
2*
1,
2*
1,,
2*
1
2*2
,
2*
1 2
2
1
)1(2 xxxxxxxxxx nmnnnmnnmnnnmnn −+−++−+−−≤− ++++ αδαδαα
)( *
11, xxnmn −− +ψα
So that
2*
11,,
2*
1
2
,
2*
,, 2)1()21( xxxxxx nmnnmnnmnnnmnmn −−+−−≤−−− ++ ψαδααδαα (9)
Now
L ,50 − L ≤ ( ,50 L − ,50 L + ( ,5L − ,50 L
≤ ( ,50 M − ∗M + L ,50 − ∗
L + ( ,5M − ∗M + L ,50 − ∗
L)
≤ ( ,50 + ( ,5 M − ∗M + max {L ,50 − ∗
L, L ,50 − ∗
L})
Since T1(K) is bounded by the same argument in the prove of part (i) of theorem 2.1 we establish that { nx }
is bounded. Since T2,…,Tn are bounded maps, we have that { nT nx } is bounded. Let D2 =
max {R , NO # M 5 − ∗M < ∞
L , − ∗
L ≤ .1 − ( , /M − ∗M + ( , M 5 − ∗M ≤ D ∀ ≥ 0 (10)
Thus, { 1−mT 1,ny }is bounded. Let D3 = = max {R , NO # L 50 , − ∗
L < ∞
L , − ∗
L ≤ .1 − ( , /M − ∗M + ( , L 50 , − ∗
L ≤ D ∀ ≥ 0 (11)
So, { 2−mT 2,ny }is bounded. Let D4 = max {R , NO # L 50 , − ∗
L < ∞. Proceeding thus, we obtain
that if { iny , }is bounded then { imT − iny , }is bounded, and Di+2 = max {R , NO # L 50- ,- − ∗
L < ∞
so that
L ,- − ∗
L ≤ .1 − ( ,- /M − ∗M + ( ,- L 50- ,- − ∗
L ≤ DX ∀ ≥ 0 (12)
Hence, {yn,i+1} and {Tm-1-iyn,i+1} are bounded. We have thus established that there exists a constant Do>0
such that
}.,...,2,1{},,max{ *
,
*
,
*
0 mxyTxyxxD iiniminn ∈∀−−−≥ − Thus, let D=2D0
0)( ,1,1, →+≤− −+− Dxy mnmnnimn αα as ∞→n (13)
So that 0→nδ as 0→n . There exists Nn ∈0 such that 0nn ≥∀
)(
)2(1
2
)2(1)2(1
)1( 2*
1
,
,
,
,2*
,
2
,2*
1 xxxxxx n
nmn
mn
nmn
nmn
n
nmn
mn
n −
+−
−
+−
+−
+−
−
≤− ++ ψ
δα
α
δα
δα
δα
α
)(22)(2
2*
11,,
2
,,
2*
1 xxDxx nmnnmnnmnmnn −−+++−≤ ++ ψαδαδαα
Let ;*
xxnn −=µ mnn ,2αβ = ,
2
, )( Dnmnn δαδυ ++= . Then, we have that
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.8, 2013
58
)( 11
22
1 ++ −+≤ nnnnnn µψβυβµµ (14)
By Lemma 1.1, 0→nµ as ∞→n . Hence, the theorem.
A map EEA →: is said to be accretive if Eyx ∈∀ , and 0>∀α
yxAyAxyx −≥−+− )(α . (15)
If the above holds, Eyx ∈∀ , and }0|{:)( =∈=∈∀ AwEwAZy (the zero set of A), then A is said to
be quasi-accretive. It is easy to see that T is hemicontractive if and if A=I-T is quasi-accretive. We have the
following theorem as an easy corollary to Theorem 2.2 and Theorem 2.1
2.3 Theorem 2.3
Let E be a normed liner space and let },...,2,1{;: miEEAi ∈→ be a finite family of maps such that:
• The simultaneous nonlinear equations },...,2,1{;0 mixAi ∈= have a common solution Ex ∈*
• R(I-Ai) is bounded.
• (I-A2), …, (I-Am) are bounded maps.
Starting with an arbitrary Ex ∈0 ,define the iterative sequence { nx }by
nn xy =0,
miyAxy iniminninin ,...,1;)1()1( 1,1,,, =−+−= −−+αα
miyTx iniminnin ,...,1;)1( 1,1,, =+−= −++αα
1, += nmn xy where in ≡+1 mod m; (16)
Where { in,α } )1,0(⊂ is a family of real sequences such that },...,2,1{;0lim , miin
n
∈∀=
∞→
α and
∑
∞
≥
∞=
0
,
n
mnα . Then, {xn} converges strongly to a solution of the simultaneous nonlinear equations.
Proof: Let Ti = I-Ai. Then Ti is a uniform continuous uniformly hemicontraction. Further,
nn xy =0,
miyAxy iniminninin ,...,1;)1()1( 1,1,,, =−+−= −−+αα
miyTx iniminnin ,...,1;)1( 1,1,, =+−= −++αα
1, += nmn xy where in ≡+1 mod m;
Thus, Theorem 2.2 applies and we have the stated results. Similarly
Theorem 2.4 Let E be a normed linear space and let },...,2,1{;: miEEAi ∈→ be a finite family of
maps such that:
• The simultaneous nonlinear equations Aix= 0 {1,2,…,m} have a common solution Ex ∈*
that is
φ≠= )(1 i
m
i AZI .
• R(I-A1), R(I-A2) are bounded
• Ai is a uniformly continuous quasi-accretive map
Starting with an arbitrary ,0 Ex ∈ define the iterative sequence {xn} by equation (16). Then {xn} converges
strongly to a solution of the simultaneous nonlinear equations.
3. ConclusionRemark
A Theorem 2.1 extends theorem 1.2 in the following ways; in Equation (6) of Theorem 2.1, let m = 3, ( , =
( , ( , ≡ , ( , ≡ , , ≡ , 0 ≡ , then we have Equation (2) of Theorem 1.2. Theorem 2.1 is
proved for any finite family of maps, so if they are just three in the family, we have Theorem 1.2. More so, the
conditions of Theorem 2.1. For instance, whereas the three maps in Theorem 1.2 are required to be uniformly
continuous and uniformly pseudocontractive with the same function H, Theorem 2.1 requires that only one map
Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.3, No.8, 2013
59
in the family satisfies such conditions. Also, Theorem 2.2 extends Theorem 1.2 in a similar manner. Hence,
Theorem 2.1, Theorem 2.2 and their corollaries are rather interesting.
References
[1] F. E. Browder, Nonlinear monotone and accretive operators in Banach space Proc. Nat Acad Sci. U.S.A. 61
(1968), 388-393.
[2] S. S. Chang, Some results for asymptotically pseudocontractive mappings and asymptotically nonexpansive
mappings, Proc. Amer. Math. Soc., 129 (2000) 845-853.
[3] S. S. Chang, Y. J. Cho, J. K. Kim, Some results for uniformly L-Lipschitzian mappings in Banach spaces,
Applied Mathematics Letters, 22, (2009), 121-125.
[4] L.J.Ciric, J.S. Ume, Ishikawa Iterative process for strongly pseudo-contractive operators in arbitrary Banach
spaces, Math. Commun.8(2003), 43-48.
[5] R. Glowinski, P. LeTallee, Augmented Lagrangian and operator-splitting methods in nonlinear mechanics,
SIAM publishing Co, Philadephia, 1989.
[6] S. Haubruge, V.H. Nguyen, J.J. Strodiot, Convergence analysis and applications of the Glowinski-Le Tallee
splitting method for finding a zero of the sum of two maximal monotone operators, J.Optim. Theory Appl.97
(1998) 645-673.
[7] Z. Huang, Approximating fixed points of ∅ -hemicontractive mappings by the Ishikawa iteration process
with errors in uniformly smooth Banach spaces, Comput. Math. Appl.39 (2) (1998), 13-21.
[8] Z. Huang, Equivalence theorems of the convergence between Ishikawa and Mann iterations with errors for
generalized strongly successively ∅ - pseudocontractive mappings without Lipschitz assumptions J. Math. Anal.
Appl. 329(2007), 935-947.
[9] I.S. Ishikawa, Fixed points by New Iteration Methods, Proc. Amer. Math. Soc., 44 (1974), 147-150
[10] L.S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in
Banach spaces, J. Math. Anal. Appl. 194 (1995), 114-125.
[11] L.S. liu, fixed points of local strictly pseudo- contractive mappings using Mann and Ishikawa iteration with
errors, Indian J. Pure Appl. Math. 26 (1995), 649-659.
[12] W.R. Mean Value methods in Iteration, Proc. Amer. Math. Soc., 4(1953).
[13] C. Moore and B.V.C. Nnoli, Iterative solution of nonlinear equations involving set-valued uniformly
accretive operations, Comput. Math. Anal. Appl. 42 (2001) 131-140.
[14] M.A Noor, T. M Kassias, Z. Huang, Three-step iterations for nonlinear accretive operator equations, J.
Math. Anal. Appl., 274 (2002), 59-68.
[15] M.A. Noor, New approximation schemes for general variational inequalities, J Math. Anal. Appl. 251
(2000), 217-229.
[16] E.U. Ofoedu, Strong convergence theorem for uniformly L-Lipchitzian asymptotically nonexpansive
mapping in real Banach space, J. Math. Appl., 321 (2006),722-728.
[17]J.O. Olaleru and A.A Mogbademu On the Modified Noor Iteration Scheme for Non-linear Maps. Private
communication
[18]M.O Osilike, Iterative approximation of fixed points of asymptotically demicontractive mappings, Indian
J.Pure Appl. Math. 29(1998) 1-9 [19]M.O. Osilike, Iterative solution of nonlinear equations of the ∅ -strongly
accretive operator equations in arbitarary Banach spaces, Nonlinear Anal. 36 (1999), 1-9.
[20] M.O. Osilike and B. G. Akuchu, Common Fixed points of a finite family of asymptotically
pseudocontractive maps, Fixed Point Theory and Applications 2004:2 (2004), 81-88.
[21] A. Rafiq, On Modified Noor iteration for nonlinear Equations in Banach spaces, Appl. Math. Comput. 182
(2006), 589-595.
[22] J. Schu, Iterative construction of fixed points of asymptotically nonexpensive mappings, Proc. Amer. Math.
Soc. 113 (1999), 727-731.
[23] Z. Xue and R. Fan, Some comments on NoorZ[s iterations in Banach spaces, Appl. Math. Comput. 206
(2008), 12-15.
[24] Y. Zhou, Y. Jia, Approximation of fixed points of strongly pseudocontractive maps without Lipschitz
assumptions, Proc. Amer. Soc. 125 (1997).
This academic article was published by The International Institute for Science,
Technology and Education (IISTE). The IISTE is a pioneer in the Open Access
Publishing service based in the U.S. and Europe. The aim of the institute is
Accelerating Global Knowledge Sharing.
More information about the publisher can be found in the IISTE’s homepage:
http://www.iiste.org
CALL FOR PAPERS
The IISTE is currently hosting more than 30 peer-reviewed academic journals and
collaborating with academic institutions around the world. There’s no deadline for
submission. Prospective authors of IISTE journals can find the submission
instruction on the following page: http://www.iiste.org/Journals/
The IISTE editorial team promises to the review and publish all the qualified
submissions in a fast manner. All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than
those inseparable from gaining access to the internet itself. Printed version of the
journals is also available upon request of readers and authors.
IISTE Knowledge Sharing Partners
EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar

More Related Content

What's hot

A multiphase lattice Boltzmann model with sharp interfaces
A multiphase lattice Boltzmann model with sharp interfacesA multiphase lattice Boltzmann model with sharp interfaces
A multiphase lattice Boltzmann model with sharp interfacesTim Reis
 
Many electrons atoms_2012.12.04 (PDF with links
Many electrons atoms_2012.12.04 (PDF with linksMany electrons atoms_2012.12.04 (PDF with links
Many electrons atoms_2012.12.04 (PDF with linksLadislav Kocbach
 
Dynamical systems solved ex
Dynamical systems solved exDynamical systems solved ex
Dynamical systems solved exMaths Tutoring
 
Understanding lattice Boltzmann boundary conditions through moments
Understanding lattice Boltzmann boundary conditions through momentsUnderstanding lattice Boltzmann boundary conditions through moments
Understanding lattice Boltzmann boundary conditions through momentsTim Reis
 
Workshop presentations l_bworkshop_reis
Workshop presentations l_bworkshop_reisWorkshop presentations l_bworkshop_reis
Workshop presentations l_bworkshop_reisTim Reis
 
A T(1)-type theorem for entangled multilinear Calderon-Zygmund operators
A T(1)-type theorem for entangled multilinear Calderon-Zygmund operatorsA T(1)-type theorem for entangled multilinear Calderon-Zygmund operators
A T(1)-type theorem for entangled multilinear Calderon-Zygmund operatorsVjekoslavKovac1
 
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spaces
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spacesOn fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spaces
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spacesAlexander Decker
 
On the Zeros of Polar Derivatives
On the Zeros of Polar DerivativesOn the Zeros of Polar Derivatives
On the Zeros of Polar Derivativespaperpublications3
 
Bayesian hybrid variable selection under generalized linear models
Bayesian hybrid variable selection under generalized linear modelsBayesian hybrid variable selection under generalized linear models
Bayesian hybrid variable selection under generalized linear modelsCaleb (Shiqiang) Jin
 
Regularity and complexity in dynamical systems
Regularity and complexity in dynamical systemsRegularity and complexity in dynamical systems
Regularity and complexity in dynamical systemsSpringer
 
Approximate Bayesian Computation with Quasi-Likelihoods
Approximate Bayesian Computation with Quasi-LikelihoodsApproximate Bayesian Computation with Quasi-Likelihoods
Approximate Bayesian Computation with Quasi-LikelihoodsStefano Cabras
 
The lattice Boltzmann equation: background, boundary conditions, and Burnett-...
The lattice Boltzmann equation: background, boundary conditions, and Burnett-...The lattice Boltzmann equation: background, boundary conditions, and Burnett-...
The lattice Boltzmann equation: background, boundary conditions, and Burnett-...Tim Reis
 
The lattice Boltzmann equation: background and boundary conditions
The lattice Boltzmann equation: background and boundary conditionsThe lattice Boltzmann equation: background and boundary conditions
The lattice Boltzmann equation: background and boundary conditionsTim Reis
 
Some Examples of Scaling Sets
Some Examples of Scaling SetsSome Examples of Scaling Sets
Some Examples of Scaling SetsVjekoslavKovac1
 

What's hot (20)

The Gaussian Hardy-Littlewood Maximal Function
The Gaussian Hardy-Littlewood Maximal FunctionThe Gaussian Hardy-Littlewood Maximal Function
The Gaussian Hardy-Littlewood Maximal Function
 
A multiphase lattice Boltzmann model with sharp interfaces
A multiphase lattice Boltzmann model with sharp interfacesA multiphase lattice Boltzmann model with sharp interfaces
A multiphase lattice Boltzmann model with sharp interfaces
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Many electrons atoms_2012.12.04 (PDF with links
Many electrons atoms_2012.12.04 (PDF with linksMany electrons atoms_2012.12.04 (PDF with links
Many electrons atoms_2012.12.04 (PDF with links
 
Dynamical systems solved ex
Dynamical systems solved exDynamical systems solved ex
Dynamical systems solved ex
 
Understanding lattice Boltzmann boundary conditions through moments
Understanding lattice Boltzmann boundary conditions through momentsUnderstanding lattice Boltzmann boundary conditions through moments
Understanding lattice Boltzmann boundary conditions through moments
 
Workshop presentations l_bworkshop_reis
Workshop presentations l_bworkshop_reisWorkshop presentations l_bworkshop_reis
Workshop presentations l_bworkshop_reis
 
A T(1)-type theorem for entangled multilinear Calderon-Zygmund operators
A T(1)-type theorem for entangled multilinear Calderon-Zygmund operatorsA T(1)-type theorem for entangled multilinear Calderon-Zygmund operators
A T(1)-type theorem for entangled multilinear Calderon-Zygmund operators
 
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spaces
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spacesOn fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spaces
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spaces
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Metric space
Metric spaceMetric space
Metric space
 
On the Zeros of Polar Derivatives
On the Zeros of Polar DerivativesOn the Zeros of Polar Derivatives
On the Zeros of Polar Derivatives
 
Bayesian hybrid variable selection under generalized linear models
Bayesian hybrid variable selection under generalized linear modelsBayesian hybrid variable selection under generalized linear models
Bayesian hybrid variable selection under generalized linear models
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Regularity and complexity in dynamical systems
Regularity and complexity in dynamical systemsRegularity and complexity in dynamical systems
Regularity and complexity in dynamical systems
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Approximate Bayesian Computation with Quasi-Likelihoods
Approximate Bayesian Computation with Quasi-LikelihoodsApproximate Bayesian Computation with Quasi-Likelihoods
Approximate Bayesian Computation with Quasi-Likelihoods
 
The lattice Boltzmann equation: background, boundary conditions, and Burnett-...
The lattice Boltzmann equation: background, boundary conditions, and Burnett-...The lattice Boltzmann equation: background, boundary conditions, and Burnett-...
The lattice Boltzmann equation: background, boundary conditions, and Burnett-...
 
The lattice Boltzmann equation: background and boundary conditions
The lattice Boltzmann equation: background and boundary conditionsThe lattice Boltzmann equation: background and boundary conditions
The lattice Boltzmann equation: background and boundary conditions
 
Some Examples of Scaling Sets
Some Examples of Scaling SetsSome Examples of Scaling Sets
Some Examples of Scaling Sets
 

Similar to Iterative procedure for uniform continuous mapping.

PaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMFPaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMFMezban Habibi
 
PaperNo14-Habibi-IJMA-n-Tuples and Chaoticity
PaperNo14-Habibi-IJMA-n-Tuples and ChaoticityPaperNo14-Habibi-IJMA-n-Tuples and Chaoticity
PaperNo14-Habibi-IJMA-n-Tuples and ChaoticityMezban Habibi
 
Redundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systemsRedundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systemsSpringer
 
Strong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappingsStrong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappingsAlexander Decker
 
Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...
Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...
Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...Université Internationale de Rabat
 
Average Polynomial Time Complexity Of Some NP-Complete Problems
Average Polynomial Time Complexity Of Some NP-Complete ProblemsAverage Polynomial Time Complexity Of Some NP-Complete Problems
Average Polynomial Time Complexity Of Some NP-Complete ProblemsAudrey Britton
 
A common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesA common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesAlexander Decker
 
PaperNo7-YousefiHabibi-IJAM
PaperNo7-YousefiHabibi-IJAMPaperNo7-YousefiHabibi-IJAM
PaperNo7-YousefiHabibi-IJAMMezban Habibi
 
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...BRNSS Publication Hub
 
machinelearning project
machinelearning projectmachinelearning project
machinelearning projectLianli Liu
 
Common fixed point theorems for contractive maps of
Common fixed point theorems for contractive maps ofCommon fixed point theorems for contractive maps of
Common fixed point theorems for contractive maps ofAlexander Decker
 
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier Analysis
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier AnalysisDSP_FOEHU - MATLAB 02 - The Discrete-time Fourier Analysis
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier AnalysisAmr E. Mohamed
 
DSP_FOEHU - MATLAB 01 - Discrete Time Signals and Systems
DSP_FOEHU - MATLAB 01 - Discrete Time Signals and SystemsDSP_FOEHU - MATLAB 01 - Discrete Time Signals and Systems
DSP_FOEHU - MATLAB 01 - Discrete Time Signals and SystemsAmr E. Mohamed
 

Similar to Iterative procedure for uniform continuous mapping. (20)

PaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMFPaperNo3-YousefiHabibi-IMF
PaperNo3-YousefiHabibi-IMF
 
PaperNo14-Habibi-IJMA-n-Tuples and Chaoticity
PaperNo14-Habibi-IJMA-n-Tuples and ChaoticityPaperNo14-Habibi-IJMA-n-Tuples and Chaoticity
PaperNo14-Habibi-IJMA-n-Tuples and Chaoticity
 
Redundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systemsRedundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systems
 
Modeling the dynamics of molecular concentration during the diffusion procedure
Modeling the dynamics of molecular concentration during the  diffusion procedureModeling the dynamics of molecular concentration during the  diffusion procedure
Modeling the dynamics of molecular concentration during the diffusion procedure
 
Strong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappingsStrong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappings
 
Mt3621702173
Mt3621702173Mt3621702173
Mt3621702173
 
Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...
Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...
Convexity of the Set of k-Admissible Functions on a Compact Kähler Manifold (...
 
Average Polynomial Time Complexity Of Some NP-Complete Problems
Average Polynomial Time Complexity Of Some NP-Complete ProblemsAverage Polynomial Time Complexity Of Some NP-Complete Problems
Average Polynomial Time Complexity Of Some NP-Complete Problems
 
TLT
TLTTLT
TLT
 
A common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spacesA common fixed point theorem in cone metric spaces
A common fixed point theorem in cone metric spaces
 
PaperNo7-YousefiHabibi-IJAM
PaperNo7-YousefiHabibi-IJAMPaperNo7-YousefiHabibi-IJAM
PaperNo7-YousefiHabibi-IJAM
 
02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf
 
02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf02_AJMS_186_19_RA.pdf
02_AJMS_186_19_RA.pdf
 
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
On Application of the Fixed-Point Theorem to the Solution of Ordinary Differe...
 
machinelearning project
machinelearning projectmachinelearning project
machinelearning project
 
Common fixed point theorems for contractive maps of
Common fixed point theorems for contractive maps ofCommon fixed point theorems for contractive maps of
Common fixed point theorems for contractive maps of
 
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier Analysis
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier AnalysisDSP_FOEHU - MATLAB 02 - The Discrete-time Fourier Analysis
DSP_FOEHU - MATLAB 02 - The Discrete-time Fourier Analysis
 
03_AJMS_166_18_RA.pdf
03_AJMS_166_18_RA.pdf03_AJMS_166_18_RA.pdf
03_AJMS_166_18_RA.pdf
 
03_AJMS_166_18_RA.pdf
03_AJMS_166_18_RA.pdf03_AJMS_166_18_RA.pdf
03_AJMS_166_18_RA.pdf
 
DSP_FOEHU - MATLAB 01 - Discrete Time Signals and Systems
DSP_FOEHU - MATLAB 01 - Discrete Time Signals and SystemsDSP_FOEHU - MATLAB 01 - Discrete Time Signals and Systems
DSP_FOEHU - MATLAB 01 - Discrete Time Signals and Systems
 

More from Alexander Decker

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inAlexander Decker
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksAlexander Decker
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dAlexander Decker
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceAlexander Decker
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifhamAlexander Decker
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaAlexander Decker
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenAlexander Decker
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget forAlexander Decker
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabAlexander Decker
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalAlexander Decker
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesAlexander Decker
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloudAlexander Decker
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveragedAlexander Decker
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenyaAlexander Decker
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health ofAlexander Decker
 

More from Alexander Decker (20)

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale in
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websites
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banks
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized d
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistance
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifham
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibia
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school children
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banks
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget for
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjab
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incremental
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniques
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo db
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloud
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveraged
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenya
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health of
 

Recently uploaded

How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonetsnaman860154
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...Neo4j
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptxHampshireHUG
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024The Digital Insurer
 
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024The Digital Insurer
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking MenDelhi Call girls
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Miguel Araújo
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsJoaquim Jorge
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slidevu2urc
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreternaman860154
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Scriptwesley chun
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking MenDelhi Call girls
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfEnterprise Knowledge
 
What Are The Drone Anti-jamming Systems Technology?
What Are The Drone Anti-jamming Systems Technology?What Are The Drone Anti-jamming Systems Technology?
What Are The Drone Anti-jamming Systems Technology?Antenna Manufacturer Coco
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)wesley chun
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonAnna Loughnan Colquhoun
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationRadu Cotescu
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsMaria Levchenko
 
Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024The Digital Insurer
 
Advantages of Hiring UIUX Design Service Providers for Your Business
Advantages of Hiring UIUX Design Service Providers for Your BusinessAdvantages of Hiring UIUX Design Service Providers for Your Business
Advantages of Hiring UIUX Design Service Providers for Your BusinessPixlogix Infotech
 

Recently uploaded (20)

How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
 
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
 
Presentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreterPresentation on how to chat with PDF using ChatGPT code interpreter
Presentation on how to chat with PDF using ChatGPT code interpreter
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Script
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
 
What Are The Drone Anti-jamming Systems Technology?
What Are The Drone Anti-jamming Systems Technology?What Are The Drone Anti-jamming Systems Technology?
What Are The Drone Anti-jamming Systems Technology?
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organization
 
Handwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed textsHandwritten Text Recognition for manuscripts and early printed texts
Handwritten Text Recognition for manuscripts and early printed texts
 
Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024Finology Group – Insurtech Innovation Award 2024
Finology Group – Insurtech Innovation Award 2024
 
Advantages of Hiring UIUX Design Service Providers for Your Business
Advantages of Hiring UIUX Design Service Providers for Your BusinessAdvantages of Hiring UIUX Design Service Providers for Your Business
Advantages of Hiring UIUX Design Service Providers for Your Business
 

Iterative procedure for uniform continuous mapping.

  • 1. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.8, 2013 53 Iterative Procedure for Uniform Continuous Mapping. Chika Moore1 Nnubia Agatha C1* and. Mogbademu Adesanmi2 1. Department of Mathematics, Nnamdi Azikiwe University P.M.B 5025 Awka, Nigeria. 2. Department of Mathematics, University of Lagos, Lagos Nigeria. * E-mail of the corresponding author: obijiakuagatha@ymail.com Abstract Let K be a closed convex nonempty subset of a normed linear space E and let { }N iiT 1= be a finite family of self maps on K such that T1 is a uniformly continuous uniformly hemicontractive map and T1(K) is a bounded set with φ≠= = ))(( 1 i N i TFF I , sufficient conditions for the strong convergence of an N-step iteration process to a fixed common point of the family are proved Keywords: key words, uniformly continuous, uniformly hemicontractive, finite family, common fixed point, Noor iteration, strong convergence. 1. Introduction { } ExfxfxEfxJ ∈∀==∈= ;,:)( 22* Where E* denotes the dual space of E and .,. denotes the generalized duality pairing between E and E* . The single-valued normalized duality mapping is denoted by j. A mapping * : EET → is called strongly pseudocontractive if for all Eyx ∈, , there exist )()( yxJyxj −∈− and a constant )1,0(∈K such that 2 )1()(, yxkyxjTyTx −−≤−− . T is called strongly eractractivpseudocont−φ if for all Eyx ∈, , there exist )()( yxJyxj −∈− and a strictly increasing function [ ) [ )1,01,0: →φ with 0)0( =φ such that ( ) .)(, 2 yxyxyxyxjTyTx −−−−≤−− φ It is called generalized strongly eractractivpseudocont−ψ or uniformly pseudocontractive if for all Eyx ∈, , there exist )()( yxJyxj −∈− and a strictly increasing function [ ) [ )1,01,0: →ψ with 0)0( =ψ such that ( )yxyxyxjTyTx −−−≤−− ψ 2 )(, . Every strongly eractractivpseudocont−φ operator is a uniformly eractractivpseudocont−ψ operator with [ ) [ )1,01,0: →ψ defined by sss )()( φψ = , but not conversely (see [13]). These classes of operators have been studied by several authors (see, for example [3], [4], [7], [13], [19], [23], [24] and references therein). If I denotes the identity operator, then T is strongly pseudocontractive, strongly eractractivpseudocont−φ , generalized strongly eractractivpseudocont−ψ if and only if )( TI − is strongly accretive, strongly accretive−φ , generalized strongly accretive−φ operators respectively. The interest in pseudocontractive mappings is mainly due to their connection with the important class of nonlinear accretive operators. In recent years, many authors have given much attention to approximate the fixed points of non-linear operators in Banach space using the Ishikawa and Mann iterative schemes (see, for example [8], [10], [11] and references therein). Noor [14] introduced the three-step iteration process for solving nonlinear operator equations in real Banach as follows; Let E be a real Banach space, K a nonempty convex subset of E and KKT →: , a mapping. For an arbitrary Kx ∈0 , the sequence { } Kx nn ⊂ ∞ =0 defined by
  • 2. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.8, 2013 54 = 1 −∝ +∝ , = 1 − + , = 1 − + , (1) Where {∝ },{ }and { }are three sequences in [0,1] is called the three-step iteration (or the Noor iteration). When = 0, then the three-step iteration reduces to the Ishikawa iterative sequence if = = 0, then the three-step iteration reduces to the Mann iteration. Rafiq [21], recently introduced a new type of iteration-the modified three-step iteration process which is defined as follows; Let ∶ → be three mappings for any given ∈ , the modified three-step iteration is defined by = 1 −∝ +∝ , = 1 − + = 1 − + (2) Where {∝ },{ }and { } are three real sequences staisfying some conditions. It is clear that the iteration scheme (2) includes Noor as special case. Glowinski and Le Tallec [5] used the three-step iteration schemes to solve elastoviscoplasiticty, liquid crystal and eigen-value problems. They have shown that the three-step approximation scheme performs better than the two-step and one-step iteration methods. Haubruge et al. [6] have studied the convergence analysis of three-step iteration schemes and applied these three-step iteration to obtain new splitting type algorithms for solving variational inequalities, separable convex programming and minimization of a sum of convex functions. They also proved that three-step iterations also lead to highly parallelized algorithms under certain conditions. Thus, it is clear that three-step schemes play an important part in solving various problems, which arise in pure and applied sciences. Recently, Xue and Fan [23] used the iteration procedure define by (2) in their theorem as stated below. Theorem 1.1 Let X be a real Banach space and K be a nonempty closed convex subset of X. Let T1, T2 and T3 be strongly pseudocontractive self maps of K with T1(K) bounded and T1, T2 and T3 uniformly continuous. Let { } be defined by (2),where { }, { }and { } are three real sequences in [0,1] such that (i) , → 0 → ∞. (ii) ∑∞ # = ∞, and $ ∩ $ ∩ $ ≠ 0 then the sequence{ } converges strongly to the common fixed point of T1, T2 and T3 Olaleru and Mogbademu [17] established the strong convergence of a modified Noor iterative process when applied to three generalized strongly eractractivpseudocont−φ , operators or generalized strongly accretive−φ operators in Banach space. Thus, generalizing the recent results of Fan and Xue (2009). In fact the stated and proved the following result. Theorem 1.2 let E be real Banach space, K a nonempty closed convex subset of E, eractractivpseudocont−φ mappings such that ' bounded. Let { } be a sequence defined by (2) where {( }, { } and { } are three sequences in [0,1] satisfiying the following conditions: lim →∞ ( = lim →∞ = lim →∞ = 0 ∞=∑ ∞ ≥0n nα if F(T1) F(T2) F(T3) ≠ ∅, then the sequence { } converges to the unique common fixed points T1, T2 and T3 . Remark 1.1 In theorem 1.2, it is required that; All the 3 maps be generalized strongly eractractivpseudocont−φ with the same function ϕ (which is rather strong function). All the 3 maps are required to be uniformly continuous (and thus bounded). Our purpose in this paper is to extend is to extend and generalized the result of Olaleru and Mogbademu (17) in the following ways: We introduce m-step iteration scheme We extend the result to any finite family of m-maps. The conditions of our theorems are less restrictive and more general than the one used in (17), (23). For instance, the demand that the three maps must be uniformly continuous is weakened by allowing some of the maps to be free.
  • 3. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.8, 2013 55 1.1. The M-Step Iteration Process Let K be a non-empty convex subset of a normed linear space E and let T: K K be a map. For any given ∈ . The m-step iteration process is defined by , = ,- = .1 − ( ,-/ + ( ,- ,-0 ; ' = 1, 2, … , 4 ,5 = = , 6ℎ898 + 1 = ' 4:; 4; ≥ 0 (3) For a finite family m iiT 1}{ = of m-maps, the m-step iterative process becomes , = ,- = .1 − ( ,-/ + ( ,- 5 0- ,-0 ; ' = 1, 2, … , 4 ,5 = = , (4) 6ℎ898 + 1 = ' 4:; 4 =:9 ' = >8 ? + 1 4 @ = 4 A + 1 4 B − A + 1 4 BC , ≥ 0 In the case where at least one of the maps in the finite family has some asymptotic behaviour (satisfies an asymptotic condition) then the iterative process becomes: , = ,- = .1 − ( ,-/ + ( ,- r imT −+1 ,-0 ; ' = 1, 2, … , 4 ,5 = = , (5) With n and m as in equation (4) and 9 = 1 − D 5 E We need the following lemma in this work: Lemma 1.1 [13] Let {F }, { }, { } be sequence of nonnegative numbers satisfying the conditions: , 0 ∞=∑ ∞ ≥n nβ → 0 as n→ ∞ and = 0{ }. Suppose that ;)( 1 22 1 nnnnn γµψβµµ +−≤ ++ = 1, 2, … … Where H:[0,1) [0,1) is a strictly increasing function with H(0) = 0. Then F → 0 as → ∞. 2. Main Result 2.1 Theorem 2.1 Let E be a normed linear space and K a nonempty closed convex subset of E, let {Ti} m i 1= be a finite family of self maps on the K such that : • T1(K), T2(K) are bounded • T1 is a uniformly continuous uniformly hemicontractive map on K • m iF 1== I F(Ti) ∅ where F(Ti) is the set of fixed points of Ti in K Starting with an arbitrary ∈ , let { } be the iterative sequence defined by , = ,- = .1 − ( ,-/ + ( ,- imT −+1 ,-0 ; ' = 1, 2, … , 4 − 1 ,5 = (6) Where {( ,-} ⊂ 0,1 is a finite family of real sequence such that },...2,1{;0lim , miin n ∈∀= ∞→ α and . 0 , ∞=∑ ∞ ≥n mnα Then, { nx } converges strongly to a common fixed point of the finite family. Proof Let ∗ J $. It suffices to prove that: • { } is bounded. • Let K = L ,50 − L Then K → 0 as n→ ∞ • converges to ∗ . Now, since T1(K) is bounded, let D1 = M − ∗M + NO # L ,50 − ∗ L < ∞. We establish by induction that M − ∗M ≤ R ∀ ≥ 0. The case n = 0 is trivial, so assume it is true for n = v +1 M T − ∗M ≤ .1 − (T,5/M T − ∗M + (T,5L T,50 − ∗ L ≤ D1 Thus, M − ∗M ≤ R ∀ ≥ 0 which gives { } are bounded. More so, since T1(K), T2(K) and { } are bounded sets, let
  • 4. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.8, 2013 56 D2 = NO # {M − ∗M + L ,50 − ∗ L + L ,50 − ∗ L < ∞ Then, L ,50 − L ≤ ( ,50 L − ,50 L + ( ,5L − ,50 L ≤ ( ,50 M − ∗M + L ,50 − ∗ L + ( ,5M − ∗M + L ,50 − ∗ L) ≤ ( ,50 + ( ,5 M − ∗M + max {L ,50 − ∗ L, L ,50 − ∗ L}) ≤ ( ,50 + ( ,5 D2 Thus, 011, →− +− nmn xy as ∞→n . Then by uniform continuity of T1, 0→nδ as ∞→n . Thus proving (ii). Also, ))(,( * 1 * 1 2* 1 xxjxxxx nnn −−=− +++ ))(,())(,)(1( * 1 * 1,1, * 1 * 1, xxjxyTxxjxx nmnmnnnmn −−+−−−= +−++ αα ))(,()1( * 1 * 11, * 1111,1, * 1 * , xxjxxTxxxTyTxxxx nnmnnnmnmnnnmn −−+−−+−−−≤ ++++−+ ααα )()1( * 11 2* 1, * 1111,1, * 1 * , xxxxxxxTyTxxxx nnmnnnmnmnnnmn −−−+−−+−−−≤ ++++−+ ψααα )()1( 2 1 ])1[( 2 1 * 11 2* 1, 2* 1, 2* 1 2*2 , xxxxxxxxxx nnmnnnmnnnmn −−−+−++−+−−≤ ++++ ψαδαα So that 2* 1, 2* 1,, 2* 1 2*2 , 2* 1 2 2 1 )1(2 xxxxxxxxxx nmnnnmnnmnnnmnn −+−++−+−−≤− ++++ αδαδαα )( * 11, xxnmn −− +ψα Hence, 2* 11,, 2* 1 2 , 2* ,, 2)1()21( xxxxxx nmnnmnnmnnnmnmn −−+−−≤−−− ++ ψαδααδαα (7) Since 0, →inalpha as ,in ∞∀→ there exist Nn ∈0 such that 1)2(1 2 1 ,0 <+−<≥∀ nmnn n δα )( )2(1 2 )2(1)2(1 )1( 2* 11 , , , ,2* , 2 ,2* 1 xxxxxx n nmn mn nmn nmn n nmn mn n − +− − +− +− +− − ≤− ++ ψ δα α δα δα δα α )(22)(2 2* 11,,,, 2* 1 xxDxx nmnnmnnmnmnn −−+++−≤ ++ ψαδαδαα Let * xxnn −=µ ; mnn ,2αβ = , 2 , )( Dnmnn δαδυ ++= . Then, we have that )( 11 22 1 ++ −+≤ nnnnnn µψβυβµµ (8) By Lemma, 0→nµ as ∞→n . Hence, the theorem. 2.2 Theorem 2.2 Let E be a normal linear space, K a non-empty closed convex subset of E, and let m iiT 1}{ = be a finite family of self maps on K such that: • T1(K) is bounded • T1is a uniformly continuous uniformly hemicontractive map on K • T2, …,Tm are bounded maps • φ≠= = )(1 i m i TFF I where F(Ti) is the set of fixed points of Ti in K Starting with an arbitrary Kx ∈0 , let { nx } be the iterative sequence defined by Equation 6. Then, { nx }
  • 5. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.8, 2013 57 converges strongly to a common fixed point of the finite family. Proof Let Fx ∈* . Then ))(,( * 1 * 1 2* 1 xxjxxxx nnn −−=− +++ ))(,())(,)(1( * 1 * 1,1, * 1 * 1, xxjxyTxxjxx nmnmnnnmn −−+−−−= +−++ αα ))(,()1( * 1 * 11, * 1111,1, * 1 * , xxjxxTxxxTyTxxxx nnmnnnmnmnnnmn −−+−−+−−−≤ ++++−+ ααα )()1( * 11 2* 1, * 1111,1, * 1 * , xxxxxxxTyTxxxx nnmnnnmnmnnnmn −−−+−−+−−−≤ ++++−+ ψααα )()1( 2 1 ])1[( 2 1 * 11 2* 1, 2* 1, 2* 1 2*2 , xxxxxxxxxx nnmnnnmnnnmn −−−+−++−+−−≤ ++++ ψαδαα Where 111,1 +− −= nmnn xTyTδ ; So that 2* 1, 2* 1,, 2* 1 2*2 , 2* 1 2 2 1 )1(2 xxxxxxxxxx nmnnnmnnmnnnmnn −+−++−+−−≤− ++++ αδαδαα )( * 11, xxnmn −− +ψα So that 2* 11,, 2* 1 2 , 2* ,, 2)1()21( xxxxxx nmnnmnnmnnnmnmn −−+−−≤−−− ++ ψαδααδαα (9) Now L ,50 − L ≤ ( ,50 L − ,50 L + ( ,5L − ,50 L ≤ ( ,50 M − ∗M + L ,50 − ∗ L + ( ,5M − ∗M + L ,50 − ∗ L) ≤ ( ,50 + ( ,5 M − ∗M + max {L ,50 − ∗ L, L ,50 − ∗ L}) Since T1(K) is bounded by the same argument in the prove of part (i) of theorem 2.1 we establish that { nx } is bounded. Since T2,…,Tn are bounded maps, we have that { nT nx } is bounded. Let D2 = max {R , NO # M 5 − ∗M < ∞ L , − ∗ L ≤ .1 − ( , /M − ∗M + ( , M 5 − ∗M ≤ D ∀ ≥ 0 (10) Thus, { 1−mT 1,ny }is bounded. Let D3 = = max {R , NO # L 50 , − ∗ L < ∞ L , − ∗ L ≤ .1 − ( , /M − ∗M + ( , L 50 , − ∗ L ≤ D ∀ ≥ 0 (11) So, { 2−mT 2,ny }is bounded. Let D4 = max {R , NO # L 50 , − ∗ L < ∞. Proceeding thus, we obtain that if { iny , }is bounded then { imT − iny , }is bounded, and Di+2 = max {R , NO # L 50- ,- − ∗ L < ∞ so that L ,- − ∗ L ≤ .1 − ( ,- /M − ∗M + ( ,- L 50- ,- − ∗ L ≤ DX ∀ ≥ 0 (12) Hence, {yn,i+1} and {Tm-1-iyn,i+1} are bounded. We have thus established that there exists a constant Do>0 such that }.,...,2,1{},,max{ * , * , * 0 mxyTxyxxD iiniminn ∈∀−−−≥ − Thus, let D=2D0 0)( ,1,1, →+≤− −+− Dxy mnmnnimn αα as ∞→n (13) So that 0→nδ as 0→n . There exists Nn ∈0 such that 0nn ≥∀ )( )2(1 2 )2(1)2(1 )1( 2* 1 , , , ,2* , 2 ,2* 1 xxxxxx n nmn mn nmn nmn n nmn mn n − +− − +− +− +− − ≤− ++ ψ δα α δα δα δα α )(22)(2 2* 11,, 2 ,, 2* 1 xxDxx nmnnmnnmnmnn −−+++−≤ ++ ψαδαδαα Let ;* xxnn −=µ mnn ,2αβ = , 2 , )( Dnmnn δαδυ ++= . Then, we have that
  • 6. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.8, 2013 58 )( 11 22 1 ++ −+≤ nnnnnn µψβυβµµ (14) By Lemma 1.1, 0→nµ as ∞→n . Hence, the theorem. A map EEA →: is said to be accretive if Eyx ∈∀ , and 0>∀α yxAyAxyx −≥−+− )(α . (15) If the above holds, Eyx ∈∀ , and }0|{:)( =∈=∈∀ AwEwAZy (the zero set of A), then A is said to be quasi-accretive. It is easy to see that T is hemicontractive if and if A=I-T is quasi-accretive. We have the following theorem as an easy corollary to Theorem 2.2 and Theorem 2.1 2.3 Theorem 2.3 Let E be a normed liner space and let },...,2,1{;: miEEAi ∈→ be a finite family of maps such that: • The simultaneous nonlinear equations },...,2,1{;0 mixAi ∈= have a common solution Ex ∈* • R(I-Ai) is bounded. • (I-A2), …, (I-Am) are bounded maps. Starting with an arbitrary Ex ∈0 ,define the iterative sequence { nx }by nn xy =0, miyAxy iniminninin ,...,1;)1()1( 1,1,,, =−+−= −−+αα miyTx iniminnin ,...,1;)1( 1,1,, =+−= −++αα 1, += nmn xy where in ≡+1 mod m; (16) Where { in,α } )1,0(⊂ is a family of real sequences such that },...,2,1{;0lim , miin n ∈∀= ∞→ α and ∑ ∞ ≥ ∞= 0 , n mnα . Then, {xn} converges strongly to a solution of the simultaneous nonlinear equations. Proof: Let Ti = I-Ai. Then Ti is a uniform continuous uniformly hemicontraction. Further, nn xy =0, miyAxy iniminninin ,...,1;)1()1( 1,1,,, =−+−= −−+αα miyTx iniminnin ,...,1;)1( 1,1,, =+−= −++αα 1, += nmn xy where in ≡+1 mod m; Thus, Theorem 2.2 applies and we have the stated results. Similarly Theorem 2.4 Let E be a normed linear space and let },...,2,1{;: miEEAi ∈→ be a finite family of maps such that: • The simultaneous nonlinear equations Aix= 0 {1,2,…,m} have a common solution Ex ∈* that is φ≠= )(1 i m i AZI . • R(I-A1), R(I-A2) are bounded • Ai is a uniformly continuous quasi-accretive map Starting with an arbitrary ,0 Ex ∈ define the iterative sequence {xn} by equation (16). Then {xn} converges strongly to a solution of the simultaneous nonlinear equations. 3. ConclusionRemark A Theorem 2.1 extends theorem 1.2 in the following ways; in Equation (6) of Theorem 2.1, let m = 3, ( , = ( , ( , ≡ , ( , ≡ , , ≡ , 0 ≡ , then we have Equation (2) of Theorem 1.2. Theorem 2.1 is proved for any finite family of maps, so if they are just three in the family, we have Theorem 1.2. More so, the conditions of Theorem 2.1. For instance, whereas the three maps in Theorem 1.2 are required to be uniformly continuous and uniformly pseudocontractive with the same function H, Theorem 2.1 requires that only one map
  • 7. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.3, No.8, 2013 59 in the family satisfies such conditions. Also, Theorem 2.2 extends Theorem 1.2 in a similar manner. Hence, Theorem 2.1, Theorem 2.2 and their corollaries are rather interesting. References [1] F. E. Browder, Nonlinear monotone and accretive operators in Banach space Proc. Nat Acad Sci. U.S.A. 61 (1968), 388-393. [2] S. S. Chang, Some results for asymptotically pseudocontractive mappings and asymptotically nonexpansive mappings, Proc. Amer. Math. Soc., 129 (2000) 845-853. [3] S. S. Chang, Y. J. Cho, J. K. Kim, Some results for uniformly L-Lipschitzian mappings in Banach spaces, Applied Mathematics Letters, 22, (2009), 121-125. [4] L.J.Ciric, J.S. Ume, Ishikawa Iterative process for strongly pseudo-contractive operators in arbitrary Banach spaces, Math. Commun.8(2003), 43-48. [5] R. Glowinski, P. LeTallee, Augmented Lagrangian and operator-splitting methods in nonlinear mechanics, SIAM publishing Co, Philadephia, 1989. [6] S. Haubruge, V.H. Nguyen, J.J. Strodiot, Convergence analysis and applications of the Glowinski-Le Tallee splitting method for finding a zero of the sum of two maximal monotone operators, J.Optim. Theory Appl.97 (1998) 645-673. [7] Z. Huang, Approximating fixed points of ∅ -hemicontractive mappings by the Ishikawa iteration process with errors in uniformly smooth Banach spaces, Comput. Math. Appl.39 (2) (1998), 13-21. [8] Z. Huang, Equivalence theorems of the convergence between Ishikawa and Mann iterations with errors for generalized strongly successively ∅ - pseudocontractive mappings without Lipschitz assumptions J. Math. Anal. Appl. 329(2007), 935-947. [9] I.S. Ishikawa, Fixed points by New Iteration Methods, Proc. Amer. Math. Soc., 44 (1974), 147-150 [10] L.S. Liu, Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces, J. Math. Anal. Appl. 194 (1995), 114-125. [11] L.S. liu, fixed points of local strictly pseudo- contractive mappings using Mann and Ishikawa iteration with errors, Indian J. Pure Appl. Math. 26 (1995), 649-659. [12] W.R. Mean Value methods in Iteration, Proc. Amer. Math. Soc., 4(1953). [13] C. Moore and B.V.C. Nnoli, Iterative solution of nonlinear equations involving set-valued uniformly accretive operations, Comput. Math. Anal. Appl. 42 (2001) 131-140. [14] M.A Noor, T. M Kassias, Z. Huang, Three-step iterations for nonlinear accretive operator equations, J. Math. Anal. Appl., 274 (2002), 59-68. [15] M.A. Noor, New approximation schemes for general variational inequalities, J Math. Anal. Appl. 251 (2000), 217-229. [16] E.U. Ofoedu, Strong convergence theorem for uniformly L-Lipchitzian asymptotically nonexpansive mapping in real Banach space, J. Math. Appl., 321 (2006),722-728. [17]J.O. Olaleru and A.A Mogbademu On the Modified Noor Iteration Scheme for Non-linear Maps. Private communication [18]M.O Osilike, Iterative approximation of fixed points of asymptotically demicontractive mappings, Indian J.Pure Appl. Math. 29(1998) 1-9 [19]M.O. Osilike, Iterative solution of nonlinear equations of the ∅ -strongly accretive operator equations in arbitarary Banach spaces, Nonlinear Anal. 36 (1999), 1-9. [20] M.O. Osilike and B. G. Akuchu, Common Fixed points of a finite family of asymptotically pseudocontractive maps, Fixed Point Theory and Applications 2004:2 (2004), 81-88. [21] A. Rafiq, On Modified Noor iteration for nonlinear Equations in Banach spaces, Appl. Math. Comput. 182 (2006), 589-595. [22] J. Schu, Iterative construction of fixed points of asymptotically nonexpensive mappings, Proc. Amer. Math. Soc. 113 (1999), 727-731. [23] Z. Xue and R. Fan, Some comments on NoorZ[s iterations in Banach spaces, Appl. Math. Comput. 206 (2008), 12-15. [24] Y. Zhou, Y. Jia, Approximation of fixed points of strongly pseudocontractive maps without Lipschitz assumptions, Proc. Amer. Soc. 125 (1997).
  • 8. This academic article was published by The International Institute for Science, Technology and Education (IISTE). The IISTE is a pioneer in the Open Access Publishing service based in the U.S. and Europe. The aim of the institute is Accelerating Global Knowledge Sharing. More information about the publisher can be found in the IISTE’s homepage: http://www.iiste.org CALL FOR PAPERS The IISTE is currently hosting more than 30 peer-reviewed academic journals and collaborating with academic institutions around the world. There’s no deadline for submission. Prospective authors of IISTE journals can find the submission instruction on the following page: http://www.iiste.org/Journals/ The IISTE editorial team promises to the review and publish all the qualified submissions in a fast manner. All the journals articles are available online to the readers all over the world without financial, legal, or technical barriers other than those inseparable from gaining access to the internet itself. Printed version of the journals is also available upon request of readers and authors. IISTE Knowledge Sharing Partners EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial Library , NewJour, Google Scholar