Numerical Methods with Applications

KJM 503

CHAPTER 2.0 ROOTS OF A FUNCTION

Lecturer : Abdul Halim b Abdullah

Faculty : Mechanical Engineering
Room : T1 – A16 – 1A
 Topics/Concepts: Chapter 2
2.1 Graphical Methods

2.2 Bracketing Methods

a. Bisection Method
b. False-Position Method

2.3 Open Methods

a. One-Point Iteration Method (or Fixed-Point Iteration)
b. Newton-Raphson Method
c. Secant Method

2.4 Multiple Roots

a. Modified Newton-Raphson Method

2.5 Roots of Polynomials

a. Muller Method
b. Bairstow Method
 ROOTS
OF
EQUATIONS

GRAPHICAL
METHODS

BRACKETING
METHODS

BISECTION FALSE-POSITION
METHOD METHOD

OPEN METHODS

ONE-POINT ITERATION MODIFIED

NEWTON-RAPHSON NEWTON-RAPHSON
(FIXED-POINT) SECANT METHOD
METHOD METHOD
METHOD (MULTIPLE ROOTS)

ROOTS OF
POLYNOMIALS

MULLER METHOD BAIRSTOW METHOD

Graphical Method
2.1 Graphical Methods
- A simple method to get an estimate of the root of the equation f(x) = 0.
- The function f(x) is plotted against x and the location(s) where it crosses the x axis
provides a rough approximation of the root(s).
- Results can be used as initial guesses for advanced numerical methods.

From graph, the root is

approximately equal to
4.6.
 2.2 Bracketing Methods
- Because two initial guesses for the root are
required

- General guides (with few exeptions):

Let
xu be an upper bound of the interval => f(xu)
xl be a lower bound of the interval => f(xl)

1. If f(xu) & f(xl) in opposite signs, there is an odd

number of roots in the interval.
2. If f(xu) & f(xl) in same signs, there is either no
rootor an even number of roots.
2.2 Bracketing Methods
Exceptions to these general rules:
(i) When the functions are tangential to the x axis such as f(x) = (x-
3)(x-2)(x-2) = 0 as shown in figure 2.2-2(a) and
(ii) When the functions are discontinous, as shown in figure 2.2-2(b)
2.2 (a) Bisection Method
2.2 (a) Bisection Method
2.2 (a) Bisection Method

Solution:
2.2 (a) Bisection Method
2.2 (b) False-Position Method
2.2 (b) False-Position Method (example)
2.2 (b) False-Position Method (example)
2.3 Open Methods
- Based on formulas that requires only a single starting value of x or
two starting values that do not necessarily bracket the root.

- Usually do so much more quickly than the bracket methods.

- Some of them require an evaluation of the first derivative of the

functions.
2.3 (a) One-Point Iteration Method
- also known as Fixed-Point Iteration
- By rearranging the function f(x) = 0 so that x is on the left
side of the equation,
x = g(x)

- To estimate the new value xi+1 by knowing or having an

initial guess xi (an old value);
xi+1 = g (xi)
2.3 (a) One-Point Iteration Method
2.3 (a) One-Point Iteration Method
2.3 (a) One-Point Iteration Method (example)
2.3 (a) One-Point Iteration Method (example)
2.3 (b) Newton-Raphson Method
-Most widely used technique to find root of the equation.
-It is efficiency if the first derivative of the function f(x) is available or easy to
get.
2.3 (b) Newton-Raphson Method
2.3 (b) Newton-Raphson Method
2.3 (c) Secant Method
2.3 (c) Secant Method
2.3 (c) Secant Method (example)
2.3 (c) Secant Method (example)
2.3 (c) Secant Method
2.4 Multiple Roots
2.4 Multiple Roots
2.4 Multiple Roots
2.4 (a) Modified Newton-Raphson
Method
2.4 (a) Modified Newton-Raphson
Method
2.4 (a) Modified Newton-Raphson Method
2.4 (a) Modified Newton-Raphson Method (example)
2.4 (a) Modified Newton-Raphson Method (example)
2.5 Roots of Polynomials
General form of polynomial

where n=the order of the polynomial and a’s=constant coefficients

The roots of polynomials follow these rules:

1. For the ‘n’th order equation, there are n real or complex roots. It
should be noted that these roots will not be necessarily be dinstinct.
2. If n is odd, there is at least one real root.
3. If complex roots exist, they exist in conjugate pairs (that is, ƴ + µi
and ƴ - µi), where i = √(-1).
2.5 (a) Muller Method
Muller method take similar approach as the secant method, but it
projects a parabola through three points.

A comparison of two related approaches for locating roots:

(a) The secant method and (b) Muller method
2.5 (a) Muller Method

The approach is facilitated by writing the parabolic equation in a

convenient form;

As we want this parabola to intersect the three point [xo, f(xo)], [x1,
f(x1)], [x2, f(x2)],

As we have three unknown, substitute into to equation

(7.21)
(7.22)
2.5 (a) Muller Method

Algebraic manipulation can then be used to solve for the remaining

coefficients, a and b.

(7.23)

(7.24)
(7.25)
(7.26)
2.5 (a) Muller Method

To find root, use the quadratic formula

Error calculated as;

2.5 (a) Muller Method (example)
2.5 (a) Muller Method (example)

Note: xr = x3

The results show that the method converges rapidly on the root, xr = 4.
2.5 (b) Bairstow Method
Is an iterative approach related loosely to both the Muller and newton-Raphson method
2.5 (b) Bairstow Method

(b)
(c)
2.5 (b) Bairstow Method

By expanding using Taylor series;

(7.33)

(7.34)

(7.35)
2.5 (b) Bairstow Method

Bairstow showed that the partial derivatives can be obtained by a synthetic

division of the ‘b’s in a similar to the way in which the ‘b’s themselves were
derived:
(7.36a)
(7.36b)
(7.36c)

If apply to Eqns. (7.34) and (7.35)

2.5 (b) Bairstow Method
2.5 (b) Bairstow Method (example)
2.5 (b) Bairstow Method (example)
2.5 (b) Bairstow Method (example)