An Analysis and Study of Iteration Procedures

International Journal of Trend in Scientific Research and Development (IJTSRD)
Volume: 3 | Issue: 4 | May-Jun 2019 Available Online: www.ijtsrd.com e-ISSN: 2456 - 6470
@ IJTSRD | Unique Paper ID - IJTSRD23715 | Volume – 3 | Issue – 4 | May-Jun 2019 Page: 312
An Analysis and Study of Iteration Procedures
Dr. R. B. Singh1, Shivani Tomar2
1Head, 2Student
1,2Department of Mathematics, MONAD University, Hapur, Kastala Kasmabad, Uttar Pradesh, India
How to cite this paper: Dr. R. B. Singh |
Shivani Tomar "An Analysis and Study
of Iteration Procedures" Published in
International Journal of Trend in
Scientific Research and Development
(ijtsrd), ISSN: 2456-
6470, Volume-3 |
Issue-4, June 2019,
pp.312-314, URL:
https://www.ijtsrd.c
om/papers/ijtsrd23
715.pdf
Copyright © 2019 by author(s) and
International Journal of Trend in
Scientific Research and Development
Journal. This is an Open Access article
distributed under
the terms of the
Creative Commons
Attribution License (CC BY 4.0)
(http://creativecommons.org/licenses/
by/4.0)
ABSTRACT
In computational mathematics, an iterative method is a scientific techniquethat
utilizes an underlying speculation to produce a grouping of improving rough
answers for a class of issues, where the n-th estimate is gotten from the past
ones. A particular execution of an iterativemethod,includingtheend criteria,isa
calculation of the iterative method. An iterative method is called joined if the
relating grouping meets for given starting approximations. A scientifically
thorough combination investigation of an iterative method is typically
performed; notwithstanding, heuristic-based iterative methods areadditionally
normal.
This Research provides a survey of iteration procedures that have been used to
obtain fixed points for maps satisfying a variety of contractive conditions.
Keywords: fixed points, iteration, condition, nonnegative entries etc.
1. INTRODUCTION
The literature abounds with papers which establish fixed points for maps
satisfying a variety of contractive conditions. In most cases the contractive
definition is strong enough, not only to guarantee the existence of a unique fixed
point, but also to obtain that fixed point by repeated iteration of the function.
However, for certain kinds of maps, such as nonexpansive maps, repeated
function iteration need not converge to a fixed point.
A none expansive map satisfies the condition ||Tx-Ty||≤||x-y||
for each pair of points x, y in the space. A simple example is
the following. Define T(x) = 1 — x for 0 ≤ x ≤ 1. Then T is a
none expansive self map of [0,1] with a unique fixed point at
x = 1/2, but, if one chooses as a starting point the value x =
a,a a≠ 1/2, then repeated iteration of T yields the sequence
{1 — a, a, 1 — a, a,...}.
In 1953 W.R. Mann defined the following iteration
procedure. Let A be a lower triangular matrix with
nonnegative entries and row sums 1. Define
where
The most interesting cases of the Mann iterative process are
obtained by choosing matrices A such that
k = 0,1,... ,n;n = 0,1,2,..., and either
ann=1 for all for all n>0. Thus, if one chooses any sequence
{cn} satisfying (i) C0 =1, (ii) 0 ≤cn < 1 for n > 0, and (iii)
ΣCn=∞ then the entries of A become ann=cn
…….(1.1)
and A is a regular matrix. (A regular matrix is a bounded
linear operator on £°° such that A is limit preserving for
convergent sequences.)The above representation for A
allows one to write the iteration scheme in the following
form:
One example of such matrices is the Cesaro matrix, obtained
by choosing Another is cn= 1 for all n ≥ 0,
which corresponds to ordinaryfunctioniteration,commonly
called Picard iteration.
Pichard iteration of the function S1/2=(1+T)/2 isequivalent
to the Mann iteration scheme with
This matrix is the Euler matrix of order 1, and the
transformation S1/2 has been investigated by Edelsteinand
Krasnoselskii [30]. Krasnoselskii showed that, if X is a
uniformly convex Banach space, and T is a nonexpansive
selfmap of X, then S1/2 converges to a fixed point of T.
Edelstein showed that the condition of uniform convexity
could be weakened to that of strict convexity. Pichard
iteration of the function Sλ = λI + (1 - λ)T, 0 < λ < 1, for any
function T, homogeneous of degree 1, is equivalent to the
Mann iteration scheme with
This matrix is the Euler matrix of order (1 - λ)/λ. The
iteration of Sλ has been investigated by Browder and
Petryshyn, Opial], and Schaefer. Mann showed that, if T is
any continuous selfmap of a closed interval [a, b] with at
most one fixed point, then his iteration scheme, with cn =
l/(n + 1), converges to the fixed point of T. Franks and
Marzecextended this result to continuous functions
possessing more than one fixed point in the interval. A
matrix A is called a weighted mean matrix if A is a lower
IJTSRD23715

International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
triangular matrix with nonzero entries ank=pk/Pnwhere
{pk} is a nonnegative sequence with po positive and
The author extended the above-mentioned result of Franks
and Marzec to any continuous self map of an interval [a, b],
and A any weighted mean matrix satisfying the condition
In [42] the author also showed that the matrix defined by
(1.1) is equivalent to a regular weighted mean matrix with
weights
Let E be a Banach space, C a closed convex subset of E, T a
continuous selfmap of C. Mann showed that, if either of the
sequences {xn} or {vn} converges, then so does the other,
and to the same limit, which is a fixed point of T. Dotson
extended this result to locally convex HausdorfF linear
topological spaces E. Consequently,tousetheMann iterative
process on nonexpansive maps, all one needs is to establish
the convergence of either {xn} or {vn}.
(Figure: Iteration Procedure)
For uniformly convex Banach spaces, the following was
obtained independently by Browder Kirk and Gohde .
Let C be a closed, bounded, and convex subset of a uniformly
convex Banach space, T a nonexpansive selfmap of C. Then T
has a fixed point. Unfortunately the proofs of above theorem
are not constructive. A number of papers have been written
to obtain some kind of sequential convergence for
nonexpansive maps. Most such theorems are valid only
under some additional hypothesis,such as compactness, and
converge only weakly. Halpern obtained two algorithms for
obtaining fixed points for nonexpansive maps on Hilbert
spaces. In his dissertation, Humphreys constructed an
algorithm which can be applied to obtain fixed points for
nonexpansive maps on uniformly convex Banach spaces. A
nonexpansive mapping issaidtobeasymptoticallyregularif,
for each point x in the space, lim(Tn+1x - Tnx) = 0. In 1966
Browder and Petryshyn established the following result.
2. Theorems:
2.1 THEOREM 1:Let X be a Banach space,Tanonexpansive
asymptotically regular selfmap of X. Suppose that T has a
fixed point, and that I — T maps bounded closed subsets ofX
into closed subsets of X. Then, for each x0 ∈ X, {TnxQ}
converges to a fixed point of T in X.
In 1972 Groetsch established the following theorem, which
removes the hypothesis that T be asymptotically regular.
2.2 THEOREM 2. Suppose T is a nonexpansive selfmapof a
closed convex subset E of X which has at least one fixed
point. If I — T maps bounded closed subsets of E into closed
subsets of E, then the Mann iterative procedure, with {cn}
satisfying conditions (i), (ii), and (iv) Σcn(l — cn) = ∝,
converges strongly to a fixed pointofT. Ishikawa established
the following theorem.
2.3 THEOREM 3. Let D be a closed subsetofaBanachspace
X and let T be a no expansive map from D into a compact
subset of X. Then T has a fixed point in D and the Mann
iterative process with {cn} satisfyingconditions(i)- (iii),and
(0 < cn < b < 1 for all n, converges to a fixed point of T.
For spaces of dimension higher than one, continuity is not
adequate to guarantee convergenceto afixed point, either by
repeated function iteration, or by some other iteration
procedure. Therefore it is necessary to impose some kind of
growth condition on the map. If the contractive condition is
strong enough, then the map will have a unique fixed point,
which can be obtained by repeated iteration of the function.
If the contractive condition is slightly weaker, then some
other iteration scheme is required. Evenif thefixedpoint can
be obtained by function iteration, it is not withoutinterest to
determine if other iterationprocedures convergetothefixed
point. A generalization of a nonexpansive map with at least
one fixed point that of a quasi-nonexpansivemap. Afunction
T is a quasi-nonexpansive map if it has at least one fixed
point, and, for each fixed point p, ||Tx — p|| < ||x — p||. The
following is due to Dotson.
2.4 THEOREM 4. Let E be a strictly convex Banach space,C
a closed convex subset of E, T a continuous quasi-
nonexpansive selfmap of C such that T(C) ⊂K ⊂ C, where Kis
compact. Let x0∈ C and consider a Mann iteration process
such that {cn} clusters at some point in (0,1). Then the
sequences {xn}, {vn} converge strongly toafixed pointofT.A
contractive definition which is included in the classofquasi-
contractive maps is the following, due to Zamfirescu . A map
satisfies condition Z if, for each pair of pointsx,yin thespace,
at least one of the following is true:
(i) ||Tx - Ty|| < α||x - y||, (ii) ||Tx - Ty|| < β[||x - Tx||+ ||y - Ty||}, or
(iii) ||Tx - Ty|| <γ[|| x -Ty|| +|| y - Tx ||], α β,γ where are real
nonnegative constants satisfying α<1, β,γ<1/2 As shown in
[52], T has a unique fixed point, which can be obtained by
repeated iteration of the function. The following result
appears in.
2.5 THEOREM 5. Let X be a uniformly convex Banach
space, E a closed convex subset of X, T a self map of E
satisfying condition Z. Then the Mann iterative process with
{cn} satisfying conditions (i), (ii), and (iv) converges to the
fixed point of T.A generalization of definition Z was made by
Ciric [11]. A map satisfies condition C if there exists a
constant k satisfying 0 ≤ k < 1 such that, for each pair of
points x, y in the space,
||Tx - Ty|| < kmax{||x - y||, ||x - Tx||, ||y - Ty||, ||x - Ty||, ||y - Tx||}.
In [42] the author proved the following for Hilbert spaces.

International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
2.6 THEOREM 6. Let H be a Hilbert space, T a selfmap of H
satisfying condition C. Then the Mann iterativeprocess,with
{cn} satisfying conditions (i)-(iii) and limsup cn < 1 — k2
converges to the fixed point of T. Chidume [10] hasextended
the above result to lp spaces, p ≥ 2, under the conditions
k2(p — 1) < 1 and limsupc„ < (p — 1)_1 — k2.As noted
earlier, if T is continuous, then, if the Mann iterative process
converges, it must converge to a fixed point of T. If T is not
continuous, there is no guarantee that, even if the Mann
process converges, it will converge to a fixed point of T.
Consider, for example, the map T defined by TO = Tl = 0, Tx=
1,0 < x < 1. Then T is a selfmap of [0,1], with a fixed point at x
= 0. However, the Mann iteration scheme, with cn = l/(n +
1),0 < x0 < 1, converges to 1, which is not a fixed point of T.
A map T is said to be strictly-pseudo contractive if there
exists a constant k, 0 < k < 1 such that, for all points x, y in
the space,
||Tx - Ty||2 < ||x - y||2 + k|| (I - T)x - (I - T)y||2.
We shall call denote the class of all such maps by P2. Clearly
P2 mappings contain the nonex-pansive mappings, but the
classes P2,C, and quasi-nonexpansive mappings are
independent.
3. STABILITY.
We shall now discuss the question of stability of iteration
processes, adopting the definition of stabilitythatappearsin
.Let X be a Banach space, T a selfmap of X, and assume that
xn+1 = f(T, xn) defines some iterationprocedureinvolvingT.
For example, f(T, xn) = Txn. Suppose that {xn} convergestoa
fixed point p of T. Let {yn}be an arbitrary sequence in X and
define en = ||yn+1 — f(Ty yn)||
for n = 0,1,2, If limn = 0 implies that limn y„ = p, thenthe
iteration procedure xn+i =
/(T, x„) is said to be T-stable. The first result on T-stable
mappings was proved by Ostrovski for the Banach
contraction principle. In the authors show that function
iteration is stable for a variety of contractive definitions.
Their best result for function iteration is the following.
3.1 THEOREM. Let X be a complete metric space, T a
selfmap of X satisfying the contractive condition of
Zamfirescu. Let p be the fixed point of T. Let x0 ∈K, set xn+1
= Txn,n > 0. Let {yn} be a sequence in A", and set en =
d(yn+1,Tyn) for n = 0,1,2,.... Then
n=0,1,2,3….And
For the Mann iteration procedure their best result is the
following.
3.2 THEOREM. Let (X, ||.||) be a normed linear space, T a
selfmap of X satisfying the Zamfirescu condition. Let x 0 ∈ X,
and suppose that there exists a fixed point p and xn —♦ p,
where {xn} denotes the Mann iterative procedures with the
{cn} satisfying (i), (ii), and 0≤ a ≤ cn ≤ b < 1. Suppose {yn} is a
sequence in X and en = ||yn+1 -[(l-cn)yn+cnTyn]|| for n =
0,1,2,.... Then
where
if and only if
For the iteration method of Kirk , they have the following
result.
Conclusion:
Iteration is the redundancy of a procedure so as to create a
(perhaps unbounded) succession of results. The grouping
will approach some end point or end esteem. Every
redundancy of the procedure is a solitary iteration, and the
result of every iteration is then the beginning stage of the
following iteration. In mathematics and software
engineering, iteration (alongside the related system of
recursion) is a standard component of calculations. In
algorithmic circumstances, recursion and iteration can be
utilized to a similar impact. The essential distinction is that
recursion can be utilized as an answer without earlier
learning about how oftenthe activityshould rehash,while an
effective iteration necessitates that premonition.
References:
[1] Amritkar, Amit; de Sturler, Eric; Świrydowicz,
Katarzyna; Tafti, Danesh; Ahuja, Kapil (2015).
"Recycling Krylov subspaces forCFDapplicationsand a
new hybrid recycling solver". Journalof Computational
Physics.
[2] Helen Timperley, Aaron Wilson, Heather Barrar, and
Irene Fung. "Teacher Professional Learning and
Development: Best Evidence Synthesis Iteration
[BES]" (PDF). OECD. p. 238. Retrieved 4 April 2013.
[3] Dijkstra, Edsger W. (1960). "Recursive
Programming". Numerische Mathematik. 2 (1): 312–
318. doi:10.1007/BF01386232.
[4] Johnsonbaugh, Richard (2004). Discrete Mathematics.
Prentice Hall. ISBN 978-0-13-117686-7.
[5] Hofstadter, Douglas (1999). Gödel, Escher, Bach: an
Eternal Golden Braid. Basic Books. ISBN 978-0-465-
02656-2.
[6] Shoenfield, Joseph R. (2000). Recursion Theory. A K
Peters Ltd. ISBN 978-1-56881-149-9.
[7] Causey, Robert L. (2001). Logic, Sets, and Recursion.
Jones & Bartlett. ISBN 978-0-7637-1695-0.
[8] Cori, Rene; Lascar, Daniel; Pelletier, Donald H.
(2001). Recursion Theory, Gödel's Theorems, Set
Theory, Model Theory. Oxford University
Press. ISBN 978-0-19-850050-6.
[9] Barwise, Jon; Moss,LawrenceS.(1996). ViciousCircles.
Stanford Univ Center for the Study of Language and
Information. ISBN 978-0-19-850050-6. - offers a
treatment of co recursion.
[10] Rosen, Kenneth H. (2002). Discrete Mathematics and
Its Applications. McGraw-Hill College. ISBN 978-0-07-
293033-7.

An Analysis and Study of Iteration Procedures

More Related Content

What's hot (20)

Similar to An Analysis and Study of Iteration Procedures (20)

More from ijtsrd (20)

Recently uploaded (20)

An Analysis and Study of Iteration Procedures