Scribd
Upload
27 views

Post Lab-2

This document is a lab report on using the bisection method to find the root of a function. It provides the objective, answers questions about error curves from using the method, lists advantages like guaranteed convergence and disadvantages like requiring initial guesses bracketing the root. The conclusion discusses determining the root and using MATLAB code in the experiment.

Uploaded by

Gaffar Khan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
27 views

Post Lab-2

This document is a lab report on using the bisection method to find the root of a function. It provides the objective, answers questions about error curves from using the method, lists advantages like guaranteed convergence and disadvantages like requiring initial guesses bracketing the root. The conclusion discusses determining the root and using MATLAB code in the experiment.

Uploaded by

Gaffar Khan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

East West University

Post Lab Report for EEE 203

Course No: EEE

Experiment No: 02

Name of the Experiment: Root Finding Using Bisection.

Prepared by:

Student Name: MD. Abdul Gaffar

Student ID: 2015-3-80-003

Date of performance: 01.02.2017

Date of submission: 22.02.2017


OBJECTIVE: By this experiment a function is given as f(x) =667.38/x (1-e-0.146843x)-40. We
given initial guess of x0=12 and x1=16. This is experiment is using Bisection Method.

ANSWER TO THE QUESTION NO: 02

COMMENT: In Exact relative error vs Iteration curve , the relative errors decrease with each
iteration and creates a smooth line. But True relative error vs Iteration curve the true relative
error decrease discontinuously and create a seedy pattern.

ANSWER TO THE QUESTION NO: 03

ADVANTAGES:

1. The bisection method is always convergent. Since the method brackets the root, the
method is guaranteed to converge.
2. As iterations are conducted, the interval gets halved. So one can guarantee the error in the
solution of the equation.
3. Bisection can be shown to be an "optimal" algorithm for functions that change sigh in
[a,b] in that it produces the smallest interval of uncertainty in a given # of iterations
4. f(x) need not be continuous on [a,b]
5. convergence is guaranteed (linearly)
6. the bisection method discards 50% of the current interval at each step, it brackets the root
much more quickly than the incremental search method does.
7. To compare:
On average, assuming a root is somewhere on the interval between 0 and 1, it takes 6–7 function
evaluations to estimate the root to within 0.1 accuracy.

Those same 6–7 function evaluations using bisection estimates the root to within 1 24 = 0.625 to
1 25 = 0.031 accuracy.

DISADVANTAGES:
1. the bisection method only finds roots where the function crosses the x axis. It cannot find
roots where the function is tangent to the x axis.
2. the bisection method can be fooled by singularities in the function.
3. the bisection method cannot find complex roots of polynomials
4. Two initial guesses are required, with f (a) f (b) <0. This may prove difficult
5. If there are multiple zeros in the interval there is no guidance as to which will be chosen
6. Linear convergence may be slow compared to other methods
CONCLUSION: By this experiment we know that determine root in bisection method. We also
learnt mat lab by using for loop and if else condition. In the lab hours we face some problem we
first time not understood why xc old=0 the condition. We discover that the error is decreasing
and it is true for both errors.

You might also like