Scribd
Upload
3 views

Lecture 4 Fixed Point Method

The Fixed Point Method is a numerical technique used to find approximate solutions to equations by iteratively refining an initial guess until convergence is achieved. The method requires rewriting the equation in the form x=g(x) and iterating the process while ensuring the convergence criteria, |g′(x)|<1, is met. While it is advantageous for solving large, complex problems, convergence is not guaranteed and depends on the initial guess and function properties.

Uploaded by

Muneeb Tahir
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

Lecture 4 Fixed Point Method

The Fixed Point Method is a numerical technique used to find approximate solutions to equations by iteratively refining an initial guess until convergence is achieved. The method requires rewriting the equation in the form x=g(x) and iterating the process while ensuring the convergence criteria, |g′(x)|<1, is met. While it is advantageous for solving large, complex problems, convergence is not guaranteed and depends on the initial guess and function properties.

Uploaded by

Muneeb Tahir
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Fixed Point method

Fixed point Method


 Fixed pint method are numerical
techniques used to find approximate
solutions to equations, typically in cases
where direct methods are impractical.
These methods start with an initial guess
and refine it step by step through a
repeated process (iteration) until the
solution converges to a desired level of
accuracy. It is also known as iterative
method
Algorithm of Fixed Point Iteration Method

 The Fixed Point Method is a numerical technique used to


solve equations of the form:
f(x)=0
It is used to find the values of x where a function f(x) equals zero,
by rewriting the equation as:
x=g(x)
Here’s the process in simple terms:
 Rewrite the equation f(x)=0as x=g(x).
 Choose an initial guess x0, which is a point you assume is

close to the true solution.


 Iterate the process: Compute the next approximation by

plugging in the current guess into the equation xn+1=g(xn).


 Repeat the iteration process until the difference between

successive approximations is smaller than a predetermined


tolerance (i.e., until convergence is achieved).
 The method works when the function g(x) is convergent,

meaning that iterating the process gets closer to the true


Convergence Criteria:
 For the fixed-point iteration method to converge, the
following condition must generally hold:
∣g′(x)∣<1for all x
in the interval where you want the solution. This ensures
that successive approximations get closer to the fixed
point.
Advantages and Disadvantages

Advantages:
 Useful for large, complex problems where direct

methods are inefficient.


 Requires less memory compared to direct

methods.
Disadvantages:
 Convergence is not always guaranteed.

 The speed of convergence depends on the choice

of the initial guess and the function's properties.


Accuracy: Fixed point can be efficient, but their
accuracy is highly dependent on the specific
function and the chosen initial guess.
Example 1

Find a root of an equation using Fixed Point Iteration


method
Solution:
Example 1

Find a root of an equation using Fixed Point Iteration


method
Solution:

x 0 1 2
f(x) -1 -1 5
Example 1

Root lies between 1 and 2

x0=(1+2)/2=1.5

x1=ϕ(x0)=ϕ(1.5)=1.35721

x2=ϕ(x1)=ϕ(1.35721)=1.33086

x3=ϕ(x2)=ϕ(1.33086)=1.32588

x4=ϕ(x3)=ϕ(1.32588)=1.32494

x5=ϕ(x4)=ϕ(1.32494)=1.32476
Table

Difference
n x0 x1=ϕ(x0) Update
|x1-x0|
2 1.5 1.35721 x0=x1 0.14279
3 1.35721 1.33086 x0=x1 0.02635
4 1.33086 1.32588 x0=x1 0.00498
5 1.32588 1.32494 x0=x1 0.00094
6 1.32494 1.32476 x0=x1 0.00018
Example 2
Find a root of an equation using Fixed
Point Iteration method.
Solution:

Here f(0)=-1<0 and f(1)=3>0

∴ Root lies between 0 and 1


Example 2
 x0=(0+1)/2=0.5

x1=ϕ(x0)=ϕ(0.5)=0.44444

x2=ϕ(x1)=ϕ(0.44444)=0.47929

x3=ϕ(x2)=ϕ(0.47929)=0.45698

x4=ϕ(x3)=ϕ(0.45698)=0.47108

x5=ϕ(x4)=ϕ(0.47108)=0.46209

x6=ϕ(x5)=ϕ(0.46209)=0.46779
x7=ϕ(x6)=ϕ(0.46779)=0.46416

x8=ϕ(x7)=ϕ(0.46416)=0.46647

x9=ϕ(x8)=ϕ(0.46647)=0.465

x10=ϕ(x9)=ϕ(0.465)=0.46593

x11=ϕ(x10)=ϕ(0.46593)=0.46534

x12=ϕ(x11)=ϕ(0.46534)=0.46572
Difference
n x0 x1=ϕ(x0) Update
|x1-x0|
2 0.5 0.44444 x0=x1 0.05556
3 0.44444 0.47929 x0=x1 0.03485
4 0.47929 0.45698 x0=x1 0.02231
5 0.45698 0.47108 x0=x1 0.0141
6 0.47108 0.46209 x0=x1 0.00899
7 0.46209 0.46779 x0=x1 0.0057
8 0.46779 0.46416 x0=x1 0.00363
9 0.46416 0.46647 x0=x1 0.0023
10 0.46647 0.465 x0=x1 0.00146
11 0.465 0.46593 x0=x1 0.00093
12 0.46593 0.46534 x0=x1 0.00059
13 0.46534 0.46572 x0=x1 0.00038
Questions
 Find a root of an equation using Fixed Point
Iteration method
MATLAB CODE
 % iterative method
 f=@(x)x^2 - sin(x) - 0.5; % main
function
 xf = @(x) (sin(x)+ 0.5)^(1/2); %
Derivative of function
 % Initial guess
 a = 0.5;
 for i = 1:15
 iteration = i+1 % iteration number
 b = xf(a)
 a = b; % replace b by a
 end

You might also like