ROOT FINDING

1) The Graphical Method

A simple way to calculate the root of the f(x) = 0 equation is to make a plot of the function and
observe where the x-axis passes. This intersection point provides a rough approximation of the
root.

Graphic techniques are of limited practical value since they are not certain. However, graphical
methods can be used to obtain rough estimates that can be used as initial estimates for numerical
methods.

A single root is bracketed by negative and positive values of f(x).

f(xlower) and f(xupper) are on opposite side of the x axis and there are three roots within this
interval.
If f(xlower) and f(xupper) have the same sign, there are either no roots, or even number of roots
between the values.

2) The Bisection method

Suppose that f(x) is a continuous function with the opposite sign f(a) and f(b) defined in the
range [a,b]. This technique, which is based on the intermediate value theorem, assumes that the
number xi exists in [a,b].

Incremental search methods use this observation by locating an interval that the function
changes the sign. Then, the position of the sign change is defined more precisely by dividing
the interval into a series of sub-intervals. Each of these sub-ranges is searched to find the sign
change. The process is repeated and the root estimate is improved by subdividing the subranges
by finer increments.

Alternatively, the bisection method, called Bolzano method is a type of incremental search
which is always obtained by dividing the interval into halves. If the function changes the sign
over an interval, the function value at the midpoint is evaluated. The root location is determined
at the middle of the subinterval where the sign change occurs later. This process is repeated to
obtain refined estimates.

It is advantageous to select the smallest [a, b] interval as small as possible to reduce the number
of iterations required to achieve a certain degree of correctness.
The bisection method has significant disadvantages. It's really slow to converge compared other
methods. However, this method always has an important feature that approximates a solution
when compared with other methods.

To begin, set a1=a and b1=b, and let p1 be the midpoint of [a,b]
P1 = a1 + (b1-a1)/2 = (a1 + b1)/2
If f(p1) = 0 , then p = p1, and we are done
If f(p1) is not equal to zero, then f(p1) has the same sign as either f(a1) or f(b1).
If f(p1) and f(a1) have the same sign. Set a2 = p1 and b2 = b1
If f(p1) and f(a1) have the same opposite.sign. Set a2 = a1 and b2 = p1
Then reapply this process to the interval [a2,b2]

Example: Show that f(x) = x3 + 4x2 – 10 = 0 has a root in [1,2], and use the Bisection method
to determine an approximation to the root with a prespecified percent tolerance ϵs = 5% note
with 5 significant figures.

Solution: f(1) = x3 + 4x2 – 10 = -5 and f(2) = x3 + 4x2 – 10 = 14

1st iteration → p1 = (1 + 2)/2 = 1.5 → f(1.5) = x3 + 4x2 – 10 = 2.375 > 0

Then we should select the interval [1,1.5] fot the second iteration

2nd iteration → p2 = (1 + 1.5)/2 = 1.25 → f(1.25) = x3 + 4x2 – 10 = -1.7969 < 0

ϵs = (1.25 – 1.5)/(1.25)x100 = 20%
So our new interval becomes [1.25,1.5]

3rd iteration → p3 = (1.25 + 1.5)/2 = 1.375 → f(1.375) = x3 + 4x2 – 10 = 0.16211 > 0

ϵs = (1.375 – 1.25)/(1.375)x100 = 9.091%
So our new interval becomes [1.375,1.5]

4th iteration → p4 = (1.375 + 1.25)/2 = 1.3125 → f(1.3125) = x3 + 4x2 – 10 = -0.84839 < 0

ϵs = (1.3125 – 1.375)/(1.3125)x100 = 4.76% < 5%
ptrue = 1.3652

As stated before, the bisection method is really slow to converge compared other methods and
this method always has an important feature that approximates a solution when compared with
other methods.

RERENCES:
S.C. Chapra and R.P. Canale, “Numerical Methods for Engineers”, 6th ed., McGraw-Hill,, NY,
2010
Richard L. Burden and J. Douglas Faires, “Numerical Analysis”, 9th ed., Brooks/Cole, Cengage
Learning, Canada.