Scribd
Upload
2 views2 pages

4- Iteration Method

The document outlines Experiment 4 of a Computer Science & Numerical Analysis Lab Manual, focusing on the Fixed Point Iteration Method for finding real roots of equations. It explains the theory behind the method, including the iterative process and steps to implement it in MATLAB. The experiment includes a task to find the real root of a specific equation and write corresponding MATLAB code.

Uploaded by

Mujahid Irfan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

4- Iteration Method

The document outlines Experiment 4 of a Computer Science & Numerical Analysis Lab Manual, focusing on the Fixed Point Iteration Method for finding real roots of equations. It explains the theory behind the method, including the iterative process and steps to implement it in MATLAB. The experiment includes a task to find the real root of a specific equation and write corresponding MATLAB code.

Uploaded by

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

Computer Science & Numerical Analysis Lab Manual

Experiment 4

Study of Fixed Point Iteration Method & its Implementation on MATLAB

Objective:

 To understand the fixed point iteration method to find real root of an algebraic or transcendental
equation
 To implement the code for fixed point iteration method on MATLAB

Theory:
The 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, bi-quadratic and
transcendental equations. So, we can apply specific numerical methods to find the solution which are based on
approximate values to start the process of finding the solution. One among these methods is the fixed point
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 such that Φ(x) =
x. In the fixed point iteration method, the given function is algebraically converted in the form of Φ(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 = Φ(x). Choose Φ(x) such that | Φ(x)’| < 1 at x = xo where xo is some initial guess called fixed point iterative
scheme. Then the iterative method is applied by successive approximations given by xn = Φ (xn – 1), that is, x1 =
Φ(xo), x2 = Φ(x1) and so on.

The sequence of steps followed in fixed point iteration method is given as:

 Choose the initial value xo for the iterative method. One way to choose xo is to find the values x = a and
x = b for which f(a) < 0 and f(b) > 0. By narrowing down the selection of a and b, take xo as the
average of a and b.
 Express the given equation, in the form x = Φ(x) such that |Φ’(x)| < 1 at x = xo. If there is more than one
possibility of Φ(x), choose the Φ(x) which has the minimum value of |Φ’(x)| at x = xo.
 By applying the successive approximations xn = Φ(xn – 1) , we get a sequence of {xn} that converges to a
point, which is the approximate solution of the given equation.

Task 1:

a) Find the real root of the equation f(x) = x 3- 2x - 5 = 0 using fixed point iteration method.

Designed & Prepared by Engr. Syed Ahtisham Mehmood Shah


Computer Science & Numerical Analysis Lab Manual
Experiment 4

b) Write MATLAB code for part a.

Conclusion:

Designed & Prepared by Engr. Syed Ahtisham Mehmood Shah

You might also like