Adama Science and Technology University

School of Applied Natural Science

Department of Applied Mathematics

Seminar I

On

FIXED POINT ITERATION METHOD

AND ITS APPLICATION

By: Bereket Bogale

Advisor:

Mesfin Zewde (Phd)

January,2024

Adama,Ethiopa
 Acknowledgment
First of all I want to thanks GOD for his protection and guidance to prepare this seminar
successfully. Next to this I would like to express us thanks to the Department of Applied
Mathematics, Adama Science and Technology University, for providing me with the necessary
knowledge, assistance and facilities to conduct my seminar work. Next, I would like to express
my deep appreciation to my advisor, Mesfin Zewude (Phd) for his enthusiasm, guidance and
constant encouragement throughout the seminar period. His regular advice and suggestion made
me work easier and proficient. I really appreciate the time he has taken to supervise me on skill
and knowledge, thank you once again. Last but not least, a special word of thanks also goes to
my family and friends for their continuous and unconditional support, love and encouragement
throughout the progress of this seminar.

i
 Abstract
Mathematics plays an important role in our everyday life. Fixed point iteration theory is a
fascinating subject, with an enormous number of applications in various fields of mathematics.
Maybe due to this transversal character, I have always experienced some diÿculties to find a
book (unless expressly devoted to fixed points) treating the argument in a unitary fashion. In
most cases, It is noticed that fixed points pop up when they are needed. On the contrary, It is
believed that they should deserve a relevant place in any general textbook, and particularly, in a
functional analysis textbook. This is mainly the reason that made me decide to write down these
notes. Ii is tried to collect most of the significant results of the field, and then to present various
related applications.

ii
 Contents
Acknowledgment..............................................................................................................................i

Abstract............................................................................................................................................ii

CHAPTER ONE..............................................................................................................................1

INTRODICTION.............................................................................................................................1

1.1 Roots of Nonlinear Equations................................................................................................1

1.2 Mathematical analysis...........................................................................................................2

CHAPTER TWO.............................................................................................................................5

FIXED POINT ITERATION METHOD........................................................................................5

2.1 FIXED POINT ITERATION METHOD THEOREM:.............................................................5

2.2 Algorithm of fixed point iteration method.............................................................................6

2.3 properties of fixed point iteration method.............................................................................7

2.4 Geometric meaning of fixed point iteration method..............................................................7

CHAPTER THREE.......................................................................................................................13

APPLICATION OF FIXED POINT ITERATION METHOD.....................................................13

3.1 Approximation by Fixed Point Iteration..............................................................................13

Illustrative example 1................................................................................................................13

Example 2..................................................................................................................................14

Example 3..................................................................................................................................15

CHAPTER FOUR.........................................................................................................................17

CONCLUSION..............................................................................................................................17

REFERENCE................................................................................................................................18

iii
 CHAPTER ONE

INTRODICTION
Fixed point iteration method in numerical analaysis is used to find an approximate solution to
algebric and transcendential equations.Sometimes it becomes veery tedious to find solutions to
qubic quadratic and trancedential equations then we can apply specific numerical methods to
find the solution.One among those methods is the fixed iteration method .The fixed point
iteration method uses the concept of a fixed point in a repeated manner to compute the solution
of the given equation.

1.1 Roots of Nonlinear Equations

Let say we want to find the solution of f (x) = 0. For example:

a ) xe x−1=0 ,
b ) 2 sin x−x=0
These equations can not be solved directly.
We need numerical methods to compute the approximate solutions.
• First we write f (x) = 0 in the form x = F (x).
• Note that F (x) is not unique. For instance, see the following.
Example 1

1
 Example 2
• Find the first approximate root of the equation 2 x3 −2 x −5 up to four decimal places
• Solution
• Given
3
• f ( x )=2 x −2 x−5

• As per the algorithm we find the value of x 0 for which we have to find a and b such that
f(a)¿ 0 and f(b)¿b

• Now f(0)=-5
• F(1)= -5 F(2)= 7
• Now we shall find g(x) such that І g' (x)І ¿ 1 at x= x 0

( )
1
3 2 x +5 3
• 2 x −2 x −5 , x=
2

( )
1
2 x +5
• g(x)= 3
which satisfies І g' (x)І ¿ 1 at x= x 0
2

• At x= 1.5 0n the interval [1,2]

• thus a=1 and b=2
a+b 1+ 2
• therefore x= = =1.5
2 2
• Now applying the iterative method x n =g( x n−1) for n=1,2,3,4,5……..

1.2 Mathematical analysis

If f (p) = p, then we say that p is a fixed point of the function f (x). We note a strong relation
between root finding and finding fixed points:

If f (p) = p, then we say that p is a fixed point of the function f (x). We note a strong relation
between root finding and finding fixed points:
To convert a fixed-point problem

g(x) = x,

2
to a root finding problem, define f (x) = g(x)−x, and look for roots of f (x) = 0.

If f (p) = p, then we say that p is a fixed point of the function f (x). We note a strong relation
between root finding and finding fixed points:
To convert a fixed-point problem

g(x) = x,

to a root finding problem, define

f (x) = g(x)−x, and look for roots of f (x) = 0.

To convert a root finding problem

f (x) = 0,

to a fixed point problem, define

g(x) = f (x) + x, and look for fixed points g(x) = x.

Fixed point iteration method in numerical analysis is used to find an approximate solution to
algebraic and transcendental equations. Sometimes it becomes very tedious to find solutions to
cubic quadratic and transcendental equations then we can apply specific numerical methods to
find the solution. One among those methods is the fixed iteration method .The fixed point
iteration method uses the concept of a fixed point in a repeated manner to compute the solution
of the given equation.

• A fixed point is a point in the domain of a function is algebrically converted in the form
of g(x)=x
• Suppose we have an equation f(x)=0 for which we have to find the solution . The
equation can be expressed as x=g(x)
• Choose g(x ) such that І g' (x)І ¿ 1 at x= x 0 where x 0, is some initial guess called fixed
point iterative scheme.
Then the iterative method is applied by succesive approximations given by x n =g( x n−1) that is x 1
=g( x 0), x 2=g( x 1) so on…

3
Fixed point iteration method is
• A method for solving NON-LINEAR EQUATIONS
• Non-linear Equations (some examples):
2
• 4 x −1=0
3 2
• x −x +10=0
• y=sin ⁡(x )
• y=log ⁡( x )

4
 CHAPTER TWO

FIXED POINT ITERATION METHOD

2.1 FIXED POINT ITERATION METHOD THEOREM:

Let α be a root of f(x) =0.in a neighbourhood I of α ,let the equation be written as x=φ (x) lf φ (x)
is continuous in I and |φ1 (x)|<1 ∀ x ∈ I , then the sequence of approximation x 0 , x 1 . x 3 … .. ,given
by x n=φ ( x n) converges to α ,where x 0 ∈ I .
PROOF

If g(a) = a or g(b) = b, then it is clear that the fixed point exists. If this is not true, then it must be
true that g(a) > a and g(b) < b Define h(x)=g(x)-x. Then h is continuous on the interval [a,b] and

h(a)=g(a) – a > 0 and

h(b)=g(b) – b > 0 . The intermediate value theorem implies ∃ p∈ (a,b) such that h(p) = 0 So
g(p)-p=0 implies p is a fixed point of g.

Suppose also that

|g'(x)|≤ k < 1 ∀ x ∈(a,b) is true and that p and q are both fixed points in [a,b] with p ≠ q. By the
g ( p )−g(q) '
mean value theorem, there is a number between p and q such that =g (ԑ) then
p−q
|p-q| = |g(p) - g(q)| = |g'(ԑ )|p-q||≤ k|p-q| < |p-q|
which produces a contradiction. The contradiction comes from the assumption that p ≠ q therefore
p = q and the fixed point must be unique.

Fixed point iteration: The iteration pn=g (p n−1) for n = 0, 1, 2, …… is called a fixed point
iteration.

Convergence: The rate, or order, of convergence is how quickly a set of iterations will reach the
fixed point. In contrary to the bisection method, which was not a fixed point method, and had
order of convergence equal to one, fixed point methods will generally have a higher rate of

5
convergence. If the derivative of the function at the fixed point ≠ zero, there will be linear
convergence, which is the same as convergence of order one. If the derivative at the fixed point

is equal to zero, it is possible for the fixed point method to converge faster than order one. If
working with an equation which iterates to a fixed point, it is ideal to find the constant that
makes the derivative of the function at the fixed point equal to zero to ensure higher order
convergence.

There are four main types of convergence and divergence of the fixed point method. Let g'(x)
equal the derivative of the function g evaluated at the fixed point x:

Monotonic convergence: There is direct convergence to the fixed point with the fixed point
being strongly attractive. Monotonic convergence occurs when 0 < g'(x) < 1

Oscillating convergence: There is indirect convergence to the fixed point with the fixed point
being weakly attractive. Oscillating convergence occurs when -1 < g'(x) < 0

Monotonic divergence: There is direct divergence from the fixed point with the fixed point
being strongly repellent. Monotonic divergence occurs when g'(x) > 1

Oscillating divergence: There is indirect divergence from the fixed point with the fixed point
being weakly repellent. Oscillating divergence occurs when g'(x) < -1

2.2 Algorithm of fixed point iteration method

• choose the initial value x 0 for the iterative method one way to choose x 0 is is to find the
values of x=a and x=b for which f(a)¿ 0 and f(b)¿b by narrowing down the selection of a
and b take x 0 as the average of a and b.
• Express the given equation in the form x=g(x) such that І g' (x)І ¿ 1 at x= x 0 if there more
than one possiblity of g(x) which has the minimum value of g' (x) at x= x 0.

6
 • By applying the successive approximations x n =g( x n−1) ,if f is a continous function we get
a sequence of {x n} which converges to a point which is the approximte solution of the
given equation.

2.3 properties of fixed point iteration method

• The form of x=g(x) can be chosen in many ways . But we choose g(x) for which І g' (x)І ¿
1 at x= x 0
• By the fixed point iteration method we get a sequence of x n which converges to the root
of the given equation.
• Lower the value of g' (x) .fewer the iteration are required to get the approximate solution.
• The rate of convergence is more if the value of g' (x) is smaller.
• The method is useful for finding the real root of the equation which is the form of an
infinite series.

2.4 Geometric meaning of fixed point iteration method

• Plotting 2 graphs y=x & y=g(x)
• The point where the 2 plots intersect
is called the fixed point, is the solution
• The numerical value of x (solution) is
found by the iterative process
• The initial guess is a value of x which is
near the fixed point as the first guess and substitute in g(x)

7
8
9
Example 3

f ( x )= x3 −3 x−1=0
i ) x 3 −3 x−1=0
⇒ 3 x=x 3 −1
x 3 −1
⇒ x=
3

ii ) x3 −3 x−1=0
⇒ x 3 −3 x=1
⇒ x( x 2 −3)=1
1
⇒ x= 2
x −3
3
iii) x −3 x−1=0
⇒ x 3 =3 x+1
3 x+1
⇒ x= 2
x
and many more .
10
We shall use these forms (x = F (x)) in our next example, denoted by

x3 −1
i ) x= =F1 ( x)
3
1
ii ) x= 2 =F 2( x )
x −3
3x+1
iii ) x= 2 =F3 ( x)
x

• We can say that the solution of x = F (x) is the intersection of two graphs y = x and y = F
(x).
• For example, see the following figure:

yx
y  F ( x)

11
Solution steps
1. Start the computation with initial value x0.
2. From y = F (x), we have y0 = F (x0).
3. Then, from graph y = x, we may assume x1 = y0. From here, we have y1 = F(x1) and x2 =
y1.
4. Similarly, we will obtain x3, x4, … and so on.

We hope that the neighborhood denoted by the dashed line converges to the intersection point of
the two graphs y = x and y = F(x).
Conclusion
Fixed point iteration is of the form

x 1 =F (x 0 ),
x 2 =F (x 1 ),
x 3 =F ( x2 ),
⋮
x i+1 =F ( xi )

12
 CHAPTER THREE

APPLICATION OF FIXED POINT ITERATION METHOD

The fixed point iteration method in numerical analysis is used to find an approximate solution to
algebraic and transcendental equations.

3.1 Approximation by Fixed Point Iteration

Illustrative example 1
we have obtained various forms of x = F(x). Now referring to xi+1 = F(xi), we put subscripts as
follows.

x 3−1
x 3−1 i
i) x= ⇒ xi+1 = (1)
3 3
Let x 0=−1. 5 be the initial value.
From (1 ) we can compute:
x1 =−1 . 458333
x 2=−1 . 367163
x3 =−1 . 185138
⋮

The distance between xi+1 and xi increases,

i.e. |xi+1 – xi| > |xi – xi-1|.
This iteration fails (since it diverges).

1 1
ii ) x= ⇒ x i+1= (2)
x 2 −3 x 2 −3
i
Put x 0=−0 .3 . From (2) we can compute :
x1 =−0 . 343643
x 2=−0. 346992
x 3=−0. 347271
x 4 =−0 . 347294
x5 =−0. 347296
x 6=−0 .347296
⋮
13
The distance between xi+1 and xi decreases,

i.e. |xi+1 – xi | < | xi – xi-1 |.

This iteration converges (succeeds).

Example 2
3 x +1 3 x i +1
ii ) x= ⇒ x i+1 = (3 )
x2 x2
i
Take x 0 =1. 9 .
From (3 ) we can compute :
x1 = 1 .855956
x 2=1 . 906730
x 3=1 . 848431
x 4 =1. 915679
⋮

We have |xi+1 – xi | > | xi – xi-1 |. This shows that this iteration diverges (Iteration fails)
.
• An iteration converges if it satisfies

• From the convergent iteration, we conclude that one of the solutions of

x 3 −3 x −1=0 is x≈−0. 347296 .

CHECK

(−0.347296)3 −3(−0.347296)−1
¿−0.000001
¿0
• How to make sure that initial value x0 can give a convergent iteration?
Answer:

14
We differentiate F(x) to get F ′(x).
The iteration converges if

a ) |F' ( x 0 )|<1 or −1<F ' ( x 0 )<1, and

b ) x 0 is close to the solution of f ( x )=0.

Example 3
For x 3 −3 x−1=0 ,
we have determined in Example 2 that:
x 3 −1
i) F 1 ( x)= ⇒ F 1 '( x )=x 2
3
For x0 =−1 . 5 , we have F 1 ' (x 0 )=2. 25>1 .
Condition −1<F ' ( x 0 )<1 is not satisfied
and the iteration with this initial value is divergent .

1 2x
ii ) F 2 ( x )= 2
⇒ F 2 ' (x )=− 2
x −3 (x −3 )2
For x0 =−0. 3 , we have F 2 '( x 0 )≈−0. 07 that
satisfies condition −1<F ' ( x 0 )<1.
Therefore, the iteration with this initial value
can be examined, since it could possibly converge .

3 x +1 3 x +2
iii ) F 3 ( x )=2
⇒ F 3 '( x )=− 3
x x
At x 0 =1 . 9 , we have F 3 ' ( x 0 )≈−1 .1<−1 .
Condition −1<F ' ( x 0 )<1 is not satisfied .
Thus, the iteration with this initial value diverges .

15
 Conclusion

We must choose the initial value x 0

that satisfies the condition −1<F '( x 0 )<1
such that the iteration could possibly converge .

 Algebraically transform to the form

x=…
3 2
f ( x )=x + x −3 x−3
3 2
x=x + x −2 x −3
3 2
x + x −3
x=
3

 Every rootfinding problem can be transformed into any number of fixed point problems

16
 CHAPTER FOUR

CONCLUSION
• Fixed Point Iteration Method is used for finding ROOTS of Non-Linear Equations.
• fzero command can be used to find solution of Non-linear equations directly (Initial
Guess value should be chosen carefully).
• Graphs can be used to visualize the solution of the equation.
• Loops (both For & While) are tools which can be implemented in program code to find
solution of equations, with following steps:
• Initial Guess value
• Algorithm for finding solution
• Criteria for stopping computations
• Generally,Fixed point theory is a fascinating subject,with an enormous number of
applications in various fields of mathematics. Maybe due to this transversal character, I
have always experienced some difficulties to find a book (unless expressly devoted to
fixed points) treating the argument in a unitary fashion. In most cases, I noticed that fixed
points pop up when they are needed.
•

17
 REFERENCE

1.Ezzatia R. and Azadegaan E, A two parameter family of second order iterative methods for
solving non linear equation

2.Guutschi W. Alexander M. Ostrowski(1893-1986) his life,work and students(2010)

3.Hajjah imran M. and Gamal M.D.H A two step iterative method free from derivative for
solving nonlinear equation http://dx.doi.org/10.12988.2014.49710

4.krasnosel skiin,,M.A two remarks on the method of successive approximations uspekhi

matematicheskikih Nuak

5.Mann W,R Mean value methods in iteration proceeding of the American mathematical society
1953 vol.4 pp 55

6.McNamee J.M numerical methods for roots of polynomiyals part I Elsevier Amsterdam 2007.
7.Ortega J.M Rhienboldt W.C iterative solution of non linear equations in several variables,
academic press new york

8.Ostrowski A.M solutions of equations and systems of equations ,academic press,new york
1960

9.Petrovic M.S neta R. petrovic Dzunic J. multi point methods for solving non linear equations

10. Traub J.F iterative methods for the solution of equations prenitic Hall

18