See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/285392960

Comparative Study of Different Root Location Methods Using MATLAB

Program

Article · December 2012

CITATION READS

1 961

1 author:

Muhibul Haque Bhuyan

Southeast University (Bangladesh)
127 PUBLICATIONS   301 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Modeling of Pocket Implanted MOSFETs View project

VLSI Circuit Design View project

All content following this page was uploaded by Muhibul Haque Bhuyan on 01 December 2015.

The user has requested enhancement of the downloaded file.

 30 BHUYAN: COMPARATIVE STUDY OF DIFFERENT ROOT LOCATION METHODS USING MATLAB PROGRAMS

Green University Review

ISSN 2218-5283

Comparative Study of Different Root Location Methods Using

MATLAB Program

Muhibul Haque Bhuyan1

Keywords: Abstract: In this paper, different numerical methods for root location have been
Root Location studied by developing MATLAB programs. A mathematical problem from
electrical engineering field has been selected to find the root of a function. Roots
Methods,
are found for same data set so that different root location methods can be
No of Iterations, compared. Comparison is shown in terms of number of iterations required,
execution time needed, percentage of approximate errors and accuracy of the
MATLAB Program,
results. It has been observed that among these methods, Newton-Raphson
Percentage of method is faster and produces more accurate results. This type of problem
solving by using MATLAB programs from engineering discipline helps the
Approximate Error,
students to enhance their skills in both theory and practice in numerical analysis
Execution Time. of different problems of their respective fields.

exploit the fact that a function changes sign in

1. INTRODUCTION the vicinity of a root. These techniques are also
called bracketing methods, because in this case

I
N many cases, we need to find the roots of an
equation. Root location means searching for
a value of an unknown variable of a function
so that the value of that function becomes zero
for that particular value of that unknown variable
[1]. There are several methods for the root
location, but in case of transcendental equations
no general method exists for finding their roots
in terms of their coefficients [2]. In this case,
numerical techniques are required. There are two
broad categories of numerical techniques to find
the root of an equation, such as, open and close
methods. In the open method category, there are
several methods, such as, simple fixed point
method, Newton Raphson method, secant
method etc. In the close method category, there
are several methods, such as, bisection method,
regula-falsi method etc. [1,3]. Open method uses
one or two initial guesses to find the approximate
root of a function numerically. If two initial
guesses are used then both of them lie on one
side of the root. On the other hand, to find the
roots of an equation numerically close methods
two initial guesses are required and these two
initial guesses brackets the true roots, i.e. these
guesses must be on either side of the root. The
particular methods employ different strategies to
systematically reduce the width of the bracket
and hence home in on the correct answer.
The problem of finding roots of a given equation
is a very common problem in the field of
engineering design [4-7]. In engineering design
problems, at first, mathematical models or
equations are derived to predict the dependent
variables (that reflect the state or performance of
the system) as a function of independent
variables (along which the system behavior is
being determined), forcing functions (that
represent the external input signals) and
parameters (that represent its properties or
composition) [1-3].
Now a day, MATLAB programs are the vehicle
for presenting the underlying numerical

1
Muhibul Haque Bhuyan is with the Department of Electrical and Electronic Engineering, Green University of Bangladesh,
Dhaka, Bangladesh, E-mail: muhibulhb@gmail.com
Manuscript Dates: Received: 20 November 2012; Revised: 08 December 2012; Accepted: 15 December 2012
 GREEN UNIVERSITY REVIEW, VOLUME 3, NUMBER 2, DECEMBER 2012
algorithms, and it is being used by practicing
engineers in solving several numerical problems
[8-11]. In this study, MATLAB programs have
been developed for the solution of a particular
electrical circuit problem that cannot be solved
analytically. It has been shown that among all of
these methods used to get the roots of this
particular problem, Newton-Raphson method is
faster and produces results that are more
accurate.
2. PROBLEM SETTING
The pocket implanted n-MOSFET with split
drain structure, shown in Fig. 1, is considered in
this work and assumed co-ordinate system is
shown at the left side of the structure. The circuit
given in Fig. 1 is considered for this study. In
this circuit, at first, the capacitor (C) is charged
from the DC voltage source (VDC) by throwing
the switch in position „A‟.
Fig. 1 An RLC series circuit
When the capacitor is charged up to the amount
of q0 then the switch is thrown to position „B‟
and the capacitor is allowed to discharge through
the RLC series circuit formed by the capacitor
(C), inductor (L) and resistor (R). If the capacitor
discharges to the amount of q at a certain time t,
then the equation of q can be written as given in
equation (1).

Rt  1  R 2 
q  q0 e 2 L cos    t (1)
 LC  2 L  
 
Now, if we want to find out the value of
resistance (R) required for this RLC series circuit
for which charge (q) becomes 1% of original
value (q0) at a time t = 0.05 sec for given values
of inductance (L) and capacitance (C) then we
can rearrange the equation (1) into a univariable
function of R as follows [1, 12]:

Rt  1  R 2  q
f  R   e 2 L cos    t  (2)
 LC  2 L   q0
 
The value of inductance and capacitance used
here are 5 H and 100 F respectively. For the
31
above function, a function file is written in
MATLAB. For the Newton-Raphson method, the
first derivative of the function file is also
required. This file is used by the main files of
each method to search the approximate value of
R. The initial guesses are 200  and 400 .
3. ALGORITHMS OF DIFFERENT ROOT
LOCATION METHODS
In this comparative study of root location four
different root location methods are considered,
such as, bisection, regula-falsi, Newton-Raphson
and secant methods. For this purpose, the
algorithms of these four methods are studied.
Then MATLAB program is developed with
flowcharts of main program and function file
using these algorithms.
3.1 BISECTION METHOD
In general, if a function, f(x) is real and
continuous in the interval from xl to xu and f(xl)
and f(xu) have opposite signs, that is, if
f ( xl ) f ( xu )  0 then there is at least one real
root between xl and xu.
Incremental search methods capitalize on this
observation by locating an interval where the
function changes its sign. Then the location of
sign change is identified more precisely by
dividing the interval into a number of
subintervals. Each of these subintervals is
searched to locate the sign change. The process
is repeated and the root estimate is refined by
dividing the subintervals into finer increments.
The Bisection method is one type of incremental
search method in which the interval is always
divided in half. If a function changes sign over
an interval, the function value at the midpoint is
evaluated. The location of the root is then
determined as lying at the midpoint of the
subinterval within which the sign change occurs.
The process is repeated to obtain refined
estimates. A simple algorithm for the bisection
method is given below:
1. Choose lower and upper limit of initial
guesses, xl and xu respectively such that the
function changes its sign over the interval.
This can be checked by ensuring that
f ( xl ) f ( xu )  0 .
2. An estimate of the root is determined by
x  xu
xr  l
2
 32 BHUYAN: COMPARATIVE STUDY OF DIFFERENT ROOT LOCATION METHODS USING MATLAB PROGRAMS
3. Determine in which subinterval the root lies:
a. If f ( xl ) f ( xr )  0 , the root lies in the
lower subinterval. Therefore, set xu = xr
and return to step 2.
b. If f ( xl ) f ( xr )  0 , the root lies in the
upper subinterval. Therefore, set xl = xr
and return to step 2.
c. If f ( xl ) f ( xr )  0 , the root equals true
root, i.e., xt = xr; terminate the
computation.
Evaluate the percentage of approximate errors by
using the following formula:
x new  x old
 a  r new r 100%
xr
If  a   s , specified error tolerance, then stop
the iteration; otherwise go to step 2. The process
is repeated until this condition is met.
3.2 REGULA-FALSI METHOD
In Regula-Falsi method or method of False-
Position, two points found from xl to xu are
joined by a straight line. The intersection of this
line with the x-axis represents an improved
estimate of the root. It is also called linear
interpolation method. The process is repeated to
obtain refined estimates. A simple algorithm for
the Regula-Falsi method is given below:
1. Choose lower and upper limit of initial
guesses, xl and xu respectively such that the
function changes its sign over the interval.
This can be checked by ensuring that
f ( xl ) f ( xu )  0 .
2. An estimate of the root is determined by
f  xu  xl  xu 
xr  xu 
f  xl   f  xu 
3. Determine in which subinterval the root lies:
a. If f ( xl ) f ( xr )  0 , the root lies in the
lower subinterval. Therefore, set xu = xr
and return to step 2.
b. If f ( xl ) f ( xr )  0 , the root lies in the
upper subinterval. Therefore, set xl = xr
and return to step 2.
c. If f ( xl ) f ( xr )  0 , the root equals true
root, i.e., xt = xr; terminate the
computation.
Evaluate the percentage of approximate errors by
using the following formula:
x new  x old
 a  r new r 100%
xr
If  a   s , specified error tolerance, then stop
the iteration; otherwise go to step 2. The process
is repeated until this condition is met.
3.3 NEWTON-RAPHSON METHOD
Newton-Raphson method is the most widely used
of all root-locating formulas. If the function, f(x)
and an initial guess, xi is known then we can
easily draw a tangent at the point [xi , f(xi )]. The
point where the tangent crosses the x-axis
usually represents an improved estimate of the
root. The formula is derived geometrically from
the straight line equation as the first derivative of
the function f   x  represents the slope of the
tangent at that particular point. A simple
algorithm for the Newton-Raphson method is
given below:
1. Choose an initial guess that will be close to
the true root.
2. An estimate of the root is determined by
f  xi 
xi 1  xi 
f   xi 
3. Evaluate the percentage of approximate
errors by using the following formula:
x x
 a  i 1 i 100%
xi 1
If  a   s , specified error tolerance, then stop
the iteration; otherwise go to step 2. The process
is repeated until this condition is met.
3.4 SECANT METHOD
This method is almost the same as Newton-
Raphson method where first derivative of the
function is required. To simplify this two initial
guesses are needed. But it is not necessary that
both should be located on the opposite side of the
root. The approximate first derivative has to be
found from these initial guesses and if this is put
in the formula of Newton-Raphson method then
the formula of secant method is found. If two
initial guesses are x-1 and x0 then the formula for
approximate first derivative can be written as
f  xi   f  xi 1 
f   xi   .
xi  xi 1
A simple algorithm for the secant method is
given below:
1. Choose initial guesses that will be close to
the true root.
 GREEN UNIVERSITY REVIEW, VOLUME 3, NUMBER 2, DECEMBER 2012 33

2. An estimate of the root is determined by method converges or iteration is stopped. Finally,

f  xi  xi  xi 1  the result is displayed at the command prompt of
xi 1  xi 
f  xi   f  xi 1  the MATLAB.
3. Evaluate the percentage of approximate START
errors by using the following formula:
x x Variable Initialization
 a  i 1 i 100%
xi 1
If  a   s , specified error tolerance, then stop
Function Call
the iteration; otherwise go to step 2. The process
is repeated until this condition is met. Root calculation

4. PROGRAM DEVELOPMENT IN Function Call

MATLAB i=1+1

Condition check and initial guess change

The function file is written using a MATLAB
command, 'function' followed by the variable
where calculated function value is saved and
returned to the main file. Then function name is
inserted by which the main file calls the function
file and the argument of the function is given in
parenthesis through which the main file sends
the value of the function‟s unknown variable.
Afterwards, this file initializes all the parameters
required for calculation of the function value by
the obtained value of the argument variable from
the main file. The function is written by using
various MATLAB commands as shown in Fig 2.
Same function is used for all the four root
location methods. The main file of Fig. 3 calls
this function file each time for calculation of the
function values. In MATLAB, function file
should be named by the function name.
Function Declaration
Function’s variables initialization
Function value Calculation
Fig. 2 Flow chart of the „function‟ file developed
in MATLAB for the function value calculation
using the various root location methods
Percentage of approximate error (a)
calculation
N
a< s
Y
Display of results
END
Fig. 3 Flow chart of the main program developed
for coding in MATLAB
5. SIMULATION RESULTS
A comparison of various root location methods
discussed in previous section is given in Fig. 3
for the same function given in (2) after
MATLAB simulation of the codes for all of these
methods. For this purpose, an IBM machine with
240 GB hard disk drive, 2 GB RAM and an Intel
Core2 Duo CPU with 2.8 GHz clock frequency is
used. Microsoft Windows XP is used as the
operating system, and MATLAB program runs
under this operating system. Built-in timers of
MATLAB have been used to calculate the
execution time of each program.
1.0E+02
Bisection Method
Regula-Falsi Method
Newton-Raphson Method
1.0E+01 Secant Method
Percentage of Approximate Errors

In the main file, at first initial guesses and other

1.0E+00
parameter values are declared. Then the main
file enters into a loop where algorithm of each 1.0E-01

method is written according to the formula given

1.0E-02
in the earlier section. As shown in the flow chart
of Fig. 3, root is calculated according to the 1.0E-03

algorithm of a particular root location method

and then the value of initial guess(es) is(are) 1.0E-04
0 2 4 6 8 10 12 14 16 18 20
changed according to the condition(s) set for that Number of Iterations Required

particular method. After that the condition to Fig. 4 Comparison of different numerical methods for
stop the iteration is tested and based on that the root location in terms of number of iterations required
 34 BHUYAN: COMPARATIVE STUDY OF DIFFERENT ROOT LOCATION METHODS USING MATLAB PROGRAMS
Table 1 Execution time, number of iterations required, final roots and percentage of approximate error of
different root location methods
Name of the Execution No of
Sl #
Methods Time (sec) iterations
1 Bisection 0.230586 19
2 Regula-Falsi 0.079270
3 Newton Raphson 0.068728
4 Secant 0.024693
Fig. 4 shows the percentage of approximate
errors versus the number of iterations required.
Here it is seen that for all the methods,
percentage of approximate errors decrease with
the increasing number of iterations. That means
all the methods converges for the given problem.
But it is observed that bisection method takes a
large number of iterations than that of the other
three methods and Newton-Raphson method
takes less number of iterations for the same
specified error limit. Convergence rate is faster
in Newton Raphson method than the other three
methods, since from Fig. 4 it is seen that the
slope of the curve is higher than that of the other
three. It is also observed that Newton-Raphson
method produces more accurate results than the
other three methods for the same specified error
limit. On the other hand, secant method takes
less execution time than the other three methods.
This is because, it does not need to evaluate two
different functions as Newton-Raphson method
does. However, the result produced by secant
method is not as good as Newton-Raphson
method. Of course, execution time may vary
from machine to machine. Besides, among the
four methods, Newton-Raphson method produces
least amount of percentage of approximate error
at the final iteration. It is shown in the Table 1.
6. CONCLUSIONS
A comparative study of various root location
methods have been performed using MATLAB
programs. In this study, a particular root
searching problem from the branch of electrical
engineering has been taken and solved for the
same parameter values and initial guesses by all
the methods mentioned. Comparison shows that
for this problem Newton Raphson method is
better, but this comparison can be applied to
problems of any other branches of engineering as
well as other disciplines. This will certainly
increase the numerical computational skills of
the students studying in undergraduate level.
REFERENCES
[1] S. C. Chapra and R. P. Canale, “Numerical Methods for
Engineers with Software and Programming
Percentage of
Final root
Approximate Error (%)
328.1515121459961 5.812402410-5
8 328.1515112509088 8.986794210-5
4 328.1514290851482 4.036895810-9
4 328.1514290535596 8.088604610-5
Applications,” 4th Edition, ch. 1-5, Tata McGraw Hill
Publishing Co. Ltd., India, 2002.
[2] J. B. Scarborough, “Numerical Mathematical Analysis,”
6th Edition, ch. 10, Oxford and IBH Publishing Co. Pvt.
Ltd., India, 1966.
[3] E. Lsaacson and H. B. Keller, "Analysis of Numerical
Methods," 2nd Edition, Ch. 3, John Wiley and Sons, NY,
USA, 1994.
[4] M. A. Hasan, editor. Root Iterations and the
Computation of Minimum and Maximum Zeros of
Polynomials, Proceedings of IEEE International
Symposium on Circuits and Systems, 2005.
[5] J. Rothweiler. A rootfinding algorithm for line spectral
frequencies. In the proceedings of IEEE International,
Conference on Acoustics, Speeches and Signal
Processing, 2:661:664, 1992.
[6] J. Jr. Campbell, V. Welch, and T. Tremain. An
expandable error-protected 4800 bps CELP coder (u.s.
federal standard 4800 bps voice coder). In IEEE Int.
Conf. on Acoustics, Speech and Signal Processing, page
735:738, 1989.
[7] J. Hubbard, D. Schleicher, and S. Sutherland. How to
find all roots of complex polynomials by newton‟s
method. Inventiones Math., 146:1:33, 2001.
[8] J. H. Mathews and K. D. Fink, “Numerical Methods
using MATLAB,” 4th Edition, ch. 2, Prentice-Hall of
India, 2004.
[9] J. Butt, “Introduction to Numerical Analysis Using
MATLAB,” ch. 1, Jones & Bartlett Learning, 2009.
[10] C. Moler, “Numerical Computing with MATLAB,”
http://www.mathworks.com/moler/chapters.html,
retrieved December 2012.
[11] J. Kiusalaas, “Numerical Methods In Engineering With
MATLAB,” Cambridge University Press, 2005.
[12] V. Y. Pan, “Univariate polynomials: Nearly optimal
algorithms for factorization and root finding,” In B.
Mourrain, editor, Int. Symp. Symbolic and Algebraic
Computation, page 253:267, London, Canada, 2001.
Muhibul Haque Bhuyan (M'07)
born in Dhaka, Bangladesh in
1974. He received the B.Sc. Engg.,
M.Sc. Engg. and Ph.D. degrees all
in Electrical and Electronic
Engineering (EEE) from
Bangladesh University of
Engineering Technology (BUET), Dhaka, Bangladesh
in 1998, 2002 and 2011 respectively.
At present, Dr. Bhuyan is working as an Associate
Professor and Chairman in the Department of
Electrical and Electronic Engineering (EEE) of Green
University of Bangladesh (GUB) since July 2012. He
started his career as a Faculty Member in the
Department of ECE/EEE of American International
University Bangladesh (AIUB) and worked there from
June 1999 to June 2003. Then he was with the Ultra-
Scaled Devices Engineering Laboratory under the
Center of Excellence (COE) program of Hiroshima
 GREEN UNIVERSITY REVIEW, VOLUME 3, NUMBER 2, DECEMBER 2012
University, Japan as a Researcher from July 2003 to
March 2004. From July 2005 to August 2008, Dr.
Bhuyan led the Department of Electronics and
Telecommunication Engineering (ETE) of Daffodil
International University (DIU) as the Head of the
Department and played a pioneering role in
establishing the Department of ETE and in opening a
new Department of Electrical and Electronic
Engineering (EEE) in DIU. He worked as an Assistant
Professor in DIU from July 2005 to May 2010 and in
Presidency University (PU) from June 2010 to
December 2011 and as an Associate Professor of the
Department of EEE in DIU from January 2012 to June
2012. He also worked as a Part-time Lecturer in the
Department of EEE of Ahsanullah University of
Science and Technology, Bangladesh and as an
Adjunct Assistant Professor in the Department of
CSE/ETE/EEE of East West University (EWU),
Peoples University of Bangladesh (PUB) and DIU.
View publication stats
35
His research interest includes modeling of the pocket
implanted bulk, double-gate and SOI n-MOSFET,
power electronics and control systems design using
PLC, microcontroller, DSP, FPGA etc. He is involved
in numerical computations of electrical and electronic
engineering problems using MATLAB. He also works
on the development and improvement of electrical and
electronic engineering education in the university
sector in Bangladesh. He has over 50 national and
international journal and conference papers.
Dr. Bhuyan is the Executive Editor of the Green
University Review and the Executive Member of
Bangladesh Electronics Society (BES); Life Member
of Institute of Engineers Bangladesh (IEB) and
Member of IEEE and EDS. He was the Secretary of
IEEE Bangladesh Section and Editorial Board‟s
Member Secretary of the Daffodil International
University Journal of Science and Technology. He is
also serving as the Editor and Reviewer of many other
national and international journals.