UNIVERSITY OF GUYANA

FACULTY OF
TECHNOLOGY

ENGINEERING MATHEMATICS
EMT 322
GROUP PRESENTATION
Group Members
Aggrey Anderson
Dane Benny
Gregory Williams
Kosi John
Tyrone Williams
Topics-
Internal Halving (Bisection Method)
Method of False Position
Newton – Raphson Method
Background
Analytical methods are commonly used to solve quadratic
equations.
The roots are determined by using mathematical
formulas.
Polynomial equations of orders five or higher cannot be
solved by analytic method.
Numerical Methods of approximation are employed for
such polynomial equations.
They are three basic methods used; Internal Halving,
Method of False Position and the Newton – Raphson
Method
Background
The root(s) of the equation Y =
f(x), are all the value(s) of “x”
where the equation f(x) = 0.
“x” can be a complex or real
number to satisfy the equation
f(x) = 0.
 The root(s) of the equation
f(x), depicted in the graph
are the values of “x” for which
f(x) = 0.This would be at x=3
and x=6 from the graph. Figure 1 – f(x) Graph
Internal Halving or
Bisection Method
 Internal Halving
This is based upon the use of the
intermediate mean-value
theorem.
 Which states that for a
continuous function f, defined
between the intervals of ( a, b ),
with f(a) and f(b) having
opposite signs, there exist at
least one root for the equation
between the intervals defined.
Figure 2 – Graph of f(x)
Internal Halving
The method is done by repeated halving of the intervals
(a, b), with f(a) and f(b) having opposite signs.

Assuming that x1 is the mid point

or the half of the intervals (a, b),
where x1 = (a + b)/2.
From the graph it can be seen that
f(x1) gives a positive value, thus the
root lies between x1 and b because the
two gives values that are opposite in
sign. Figure 2 – Graph of f(x)
Internal Halving
It is important that the half chosen to be further halved
or bisected must be the one where the root(s) lie.
Simply this must be the half with values of “x” that gives
values of the function that are opposite in sign.
 The half chosen is then further
bisected and the same principles
applied and followed.
Internal Halving
Example 1
Find the positive value of x that satisfies the equation
x2 – 2 = 0.
f(x) = x2 - 2
 Choose two arbitrary values of x, which would give
values for the function f(x) that are opposite in sign.
 Using, x = 1 and x = 2
So at, a = 1, f(a) = -1
& b = 2, f(b) = 2
 Therefore, a root lies between these intervals.
Internal Halving
 From the table below by the use
of the bisection method,
the root of the equation was
x = 1.4242
 a b x1 f(a) f(b) f(x1 )
( a + b )/2
1 2 1.5 -1 2 0.25

1 1.5 1.25 -1 0.25 -0.4375

1.25 1.5 1.375 -0.4375 0.25 -0.1094

1.375 1.5 1.4375 0.1094 0.25 0.0664

1.375 1.4375 1.4063 -0.1094 0.0664 -0.0225

1.4063 1.4375 1.4219 -0.0225 0.0664 0.0218

1.4063 1.4219 1.4141 -0.0225 0.0218 -0.0003

1.4141 1.4219 1.418 -0.0003 0.0218 0.0107

1.4141 1.418 1.4161 -0.0003 0.0107 0.0052

1.4141 1.4161 1.4152 -0.0003 0.0052 0.0025

1.4141 1.4152 1.4147 -0.0003 0.0025 0.0012

1.4141 1.4147 1.4144 -0.0003 0.0012 0.0005

1.4141 1.4144 1.4142 -0.0003 0.0005 0.0001

1.4141 1.4142 1.4142 -0.0003 0.0001 -0.0001

1.4242 1.4242 1.4242 0 0 0

Internal Halving
Example 2
Solve the equation using the bisection method.
f(x) = x3 + 4x2 – 10

 Using x = 1 and x = 1.5

So at, a = 1 f(1) = -5
& b = 1.5 f(1.5) = 2.375

 Therefore a root lies between the intervals.

 a b x1 f(a) f(b) f(x1 )
( a + b )/2
1 1.5 1.25 -5 2.375 -1.7969

1.25 1.5 1.375 -1.7969 2.375 0.1621

1.25 1.375 1.3125 -1.7969 0.1621 -0.8484

1.3125 1.375 1.3438 -0.8484 0.1621 -0.3504

1.3438 1.375 1.3594 -0.3504 0.1621 -0.096

1.3594 1.375 1.3672 -0.096 0.1621 0.0326

1.3594 1.3672 1.3633 -0.096 0.0326 -0.0318

1.3633 1.3672 1.3653 -0.0318 0.0326 0.0009

1.3635 1.3653 1.3643 -0.0318 0.0009 -0.0154

1.3643 1.3653 1.3648 -0.0154 0.0009 -0.0071

1.3648 1.3653 1.3651 -0.0071 0.0009 -0.0024

1.3651 1.3653 1.3652 -0.0024 0.0009 -0.0005

1.3652 1.3653 1.36525 -0.0005 0.0009 0.0003

1.3652 1.36525 1.365225 -0.0005 0.0003 -0.00008

1.365225 1.36525 1.365238 -0.00008 0.0003 -0.00003

Internal Halving
 From the table above the root of the equation
f(x) = x3 + 4x2 – 10, to four decimal places was found to
be at x = 1.3652
Method of False Position
Method of False Position
The False Position Method is a root-finding algorithm
that combines features from the Bisection Method and
the Secant Method. It was developed because the
bisection method was fairly slow

Advantages:
The method is guaranteed to converge, since the root is
bracketed in the bounds of the interval

Generally converges faster than the Bisection Method

 f(a)- a,f(a)
m =
f(b)
a- b

0-
m =
f(b) a (c,0) b
c- r
b
Equating the two slopes and Solving for ‘c’ gives

Y=f(x) b,f(b)
0- f(b) = f(a)- (c,f(c)

c-b f(b)
a- b
a sequence of intervals {[aK, bK]} each of
f(b) (b - a) which brackets the zero.
C=b-
f(b) - f(a)
Method of False Position
Use the false position method to find the root of
x sin(x) − 1 = 0 that is located in the interval [0, 2] (the
function sin(x) is evaluated in radians).

 Starting with a0 = 0 and b0 = 2, we have

f (0) = −1.00000000
f (2) =0.81859485

 So a root lies in the interval [0, 2].

Method of False Position
 Using formula, we get
c0 = 2 − {0.81859485(2 − 0)} / {0.81859485 − (−1)}
= 1.09975017
and f (c0) = −0.02001921.

 The function changes sign on the interval [c0 , b0] =

[1.09975017, 2], so we squeeze from the left and set
a1 = c0 and b1 = b0.
Method of False Position
 The formula produces the next approximation:
c1 = 2 − {0.81859485 (2 − 1.09975017)} /
{0.81859485 − (−0.02001921)} = 1.12124074
and f (c1) = 0.00983461.

 Next f (x) changes sign on [a1, c1] = [1.09975017,

1.12124074], and the next decision is to squeeze from
the right and set a2 = a1 and b2 = c1.
Method of False Position
 A summary of the calculations is

K Left endpoint Midpoint Right endpoint Function value

ak ck bk f (ck )

0 0.00000000 1.09975017 2.00000000 -0.02001921

1 1.09975017 1.12124074 2.00000000 0.00983461

2 1.09975017 1.11416120 1.12124074 0.00000563

3 1.09975017 1.11415714 1.11415714 0.00000000

Newton-Raphson
Method
Newton-Raphson Method
This method is a powerful technique for solving
equations numerically.

The method is widely used to compute polynomials and

does not compute successive approximations xn, but
computes a sequence of polynomials and only at the
end, arrives at an approximation for the root x.
Newton-Raphson Method
Firstly one starts with an initial assumption which is
reasonably close to the true root of the function. (xo)
Then the function is approximated by its tangent line,
which can be computed using basic calculus.
Newton-Raphson Method
Then one computes the x-intercept of the tangent line
using elementary algebra, this of course gives a better
approximation to the function’s root than the initial
assumption.
Newton Raphson Method
Example 1
The equation x3 – 3x – 4 = 0 is of the form f (x) = 0
where f (1) < 0 and f (3) > 0 so there is a solution to the
equation between 1 and 3.
We shall take this to be 2, by bisection. Find a better
approximation to the root.

 We have f (x) = x3 – 3x – 4, therefore f’ (x) = 3x2 – 3

 Initial approximation xo = 2, then
f (xo) = f(2) = (2)3 – 3(2) – 4 = –2
f’ (xo) = f’(2) = 3(2)2 – 3 = 9
Newton Raphson Method
 So, determining a better approximation x1;
x1 = xo – f (xo) = xo – xo3 – 3xo –4
f’ (xo) 3xo 2 – 3

x1 = 2 – (-2) = 2.22
9
 So xo = 2; x1 = 2.22
Newton Raphson Method
 By repeating the process and starting from x1 a better
approximation, x2 can now be obtained.

x2 = x1 - f (x1) = x1 – x13 – 3x1 –4

f’ (x1) 3x1 2 – 3
 Since x1 = 2.22; by substituting
f (x1) = f (2.22) = (2.22)3 – 3(2.22) – 4 = 0.281
f’ (x1) = f’ (2.22) = 3(2.22)2 – 3 = 11.785
Newton-Raphson Method
 Therefore, a better approximation x2 is given by
x2 = 2.22 – 0.281 = 2.196
11.785

 So x2 = 2.196

 Using x2 = 2.196 as a starter value, the process can be

continued until successive results agree to the desired
degree of accuracy.
Conclusion
In numerical analysis, the Newton-Raphson Method is
perhaps the best suited for finding successively better
approximations to the zeroes(or roots) of a real- valued
function.
The Bisection Method is simple, but quite long and
tedious.
False Position Method is only concerned with
polynomials of order five and above.
Hence, Newton-Raphson is most comprehensive.
References
Bostock, L. and Chandler, S. Core Maths For Advanced
Level. 3rd Edition. Nelson Thornes Ltd, United Kingdom,
2000.
Stroud, K. A. Advanced Engineering Mathematics. 4th
Edition. Palgrave Macmillan, New York, 2003.
Internal halving. Retrieved 7th May, 2009.
<http://books.google.gy/books?
id=VKs7Afjkng4C&pg=PA180&dq=internal+halving#PPA169
,M1>
Method of False Position. Retrieved 5th May, 2009.
<http://books.google.gy/books?id=bh5w6E-M-
PUC&pg=PA279&dq=method+of+false+position&lr=#PPR1,
M1>