0% found this document useful (0 votes)
10 views

Fixed Point Iterations

yukm

Uploaded by

Jejo Villarin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views

Fixed Point Iterations

yukm

Uploaded by

Jejo Villarin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

FIXED POINT ITERATION

Introduction

A point, say, s is called a fixed point if it satisfies the equation x = g(x). Fixed point
Iteration the transcendental equation f(x) = 0 can be converted algebraically into the
form x = g(x) and then using the iterative scheme with the recursive relation

xi+1= g(xi), i = 0, 1, 2, . . .,

with some initial guess x0 is called the fixed point iterative scheme.

Formula
Algorithm - Fixed Point Iteration Scheme

Given an equation f(x) = 0


Convert f(x) = 0 into the form x = g(x)
Let the initial guess be x0
Do
xi+1= g(xi)
while (none of the convergence criterion C1 or C2 is met)

 C1. Fixing apriori the total number of iterations N .


 C2. By testing the condition | xi+1 - g(xi) | (where i is the iteration number) less than
some tolerance limit, say epsilon, fixed apriori.

3
FIXED POINT I
Table of X vs Y

X Y

-1

0 #DIV/0!

1 3.316625

2 1.732051

3 1.20185

4 0.935414

5 0.774597

6 0.666667

Graph

4.5
4
3.5
3
2.5
2
1.5
1
0.5
0
-2 -1 0 1 2 3 4 5 6 7

4
FIXED POINT I
Table of Iteration
𝒙𝟒 − 𝒙 − 𝟏𝟎 = 𝟎
(𝑿 + 𝟏𝟎).𝟓
𝒈(𝒙) =
𝑿

N Xi
1 1.8
2 1.9084
3 1.8082
4 1.9004
5 1.8153
6 1.8936
7 1.8213
8 1.8878
9 1.8264
10 1.8829
11 1.8308
12 1.8788
13 1.8345
14 1.8753
15 1.8376
. ....
89 1.8555
90 1.8556
91 1.8555
92 1.8556
93 1.8556

You might also like