Fixed Point
Iteration Method
Fixed Point Iteration
Method
Iteration method, also known as the fixed point iteration method, is
one of the most popular approaches to find the real roots of a
nonlinear function. It requires just one initial guess and has a fast
rate of convergence which is linear..
Similar to the Newton-Raphson method, both the algorithm and
flowchart in case of iteration method require one initial guess. And,
just like the bisection method, this method has slow and linear
convergence.
A function f(x) = 0 is solved by the assumed initial guess. The
fixed point iteration method algorithm/flowchart work in such as
way that modifications alongside iteration are progressively
continued with the newer and fresher approximations of the initial
approximation.
Fixed Point Iteration Method
• The method known as Fixed point iteration method we
also called it x=g(x) method.
• A very useful way to get a root of f(x)=0.
• To use the method we rearrange f(x) into an
equivalent form x=g(x).
• Under suitable condition, the iterative form
𝑥𝑛+1 =𝑔( 𝑥 𝑛 )
Converge to the fixed point r, a root of f(x).
Fixed Point iteration Method
• If the equation f(x) can be expressed as x=g(x)
and is an initial approximation to the root then
the next approximation is given by and the next
approximation would be in general .
• This method is called method of successive
approximation or direct substitution method.
• The iterative cycle will terminate when the
relative error in the root is within the specified
|
limit. 𝑥𝑛 +1 − 𝑥𝑛
𝑥 𝑛+1 |
≦∈
Fixed Point iteration Method
Fixed Point iteration Method
Fixed Point iteration Method
Fixed Point iteration Method
Fixed Point iteration Method
Fixed Point iteration Method
Fixed Point Iteration Method
• Convergence Theorem: If g(x) and gʹ(x) are
continuous on an interval about a root r of the
equation x=g(x),and if for all x in the interval,
then ,n=0,1,2,3,…will converge to the root x=r ,
provided that hosen in the interval.
• Formula to calculate number of iteration in fixed point
iteration method is given by
Where k is highest value of gʹ in the interval.
Algorithm for Fixed Point Iteration Method
1. Start
2. Define function f(x)
3. Define function g(x) which is obtained
from f(x)=0 such that x = g(x) and |g'(x) < 1|
4. Choose intial guess x0, Tolerable Error e
and Maximum Iteration N
5. Initialize iteration counter: step = 1
6. Calculate x1 = g(x0)
7. Increment iteration counter: step = step + 1
8. If step > N then print "Not Convergent"
and goto (12) otherwise goto (10)
9. Set x0 = x1 for next iteration
10. If |f(x1)| > e then goto step (6) otherwise goto step (11)
11. Display x1 as root.
12. Stop
Iteration Method Algorithm:
• Start
• Read values of x0 and e.
*Here x0 is the initial approximation
e is the absolute error or the desired degree of
accuracy, also the stopping criteria*
• Calculate x1 = g(x0)
• If [x1 – x0] <= e, goto step 6.
*Here [ ] refers to the modulus sign*
• Else, assign x0 = x1 and goto step 3.
• Display x1 as the root.
• Stop
Complete Pseudocode for Fixed Point
Iteration Method
Iteration Method Flowchart:
Fixed Point Iteration Method
Ex: 2.2
• Q.5: Use a fixed point iteration method to determine a
solution accurate to within for onuse