WEEK 4

Roots of Equations
 Multiple Roots
 Systems of Nonlinear Equations
2
LESSON OUTCOMES

At the end of this topic, the students will be able:

 To solve roots for polynomials systems and

system of non-linear equations
  Multiple Roots
• Corresponds to a point where a function is tangent to the x
axis at that point. For example, following polynomials have:

• Double root f ( x)  x 3  5 x 2  7 x  3
– f(x) = (x–3)(x–1)(x–1) ~ one value of x makes two terms in
the equation equal to zero
– Axis is not cross (even roots)

• Triple root f ( x)  x 4  6 x3  12 x 2  10 x  3
– f(x) = (x–3)(x–1)(x–1)(x–1) ~ one value of x makes three
terms in the equation equal to zero
– Axis is cross (odd roots)
4
 Figure shows (a) through (c) show
Consequently, multiple roots pose several cases of multiple roots.
several limitations for the numerical
methods. There are two possible
difficulties:

1. For a function with even multiple

roots, the function does not change
sign over the interval. Thus, it
eliminates the use of the reliable
bracketing methods.

2. At the multiple roots, both f(x) and

f’(x) are zero or approach zero. This
poses problems for both Newton-
Raphson and secant methods.
To overcome these two problems,
a modified Newton-Raphson method is used.
5
• Introducing the new function u(x) as the ratio of the function
and its first derivative as

f ( xi ) This function has roots

u ( xi )  at all the same locations
f ( xi ) as the original function

• Using quotient rule for the derivative,

f ' ( xi ) f ' ( xi )  f ( xi ) f ' ' ( xi )
u ' ( x) 
 f ( xi )
 2

• The modified Newton-Raphson method in terms of u(x) is

then
u ( xi )
xi 1  xi 
u ' ( xi )
6
• Then, modified Newton-Raphson Method
f ( xi ) f ' ( xi )
xi 1  xi 
 f ( xi )  f ( xi ) f ' ' ( xi )
 2

• The denominator will not be zero even if f’(x) is zero.

Therefore, the formula is said to be more stable.

 It is preferable for multiple roots, it is somewhat less

efficient.
 Unless necessary, this method is seldom used in practice
due more computational effort involved.

7
Example
Use both standard and modified Newton-Raphson
methods to evaluate the multiple root for
f ( x)  x  5 x  7 x  3
3 2

with an initial guess of x0 = 0.

Refer Example 6.9

8
Exercise
Use the modified Newton-Raphson method to find
the root of the following polynomial function
f(x) = x3 - 7x2 + 8x +16 = 0
until the relative error is less than 0.05%.
Use (i) x = 0 and (ii) x = 2.0 as initial guess.

9
i) x = 0
Ite. xi f(xi) f’(xi) f’’(xi) xi+1 εa(%)
1 0.0 16.0 8.0 -14.0 -0.4444 -

2 -0.4444 0.9739 14.8147 -16.6667 -0.8485 47.619

3 -0.8485 3.5618 22.0386 -19.0909 -0.9903 14.316
4 -0.9903 0.2427 24.8053 -19.9415 -0.9999 0.970
5 -0.9999 0.00095 24.9992 -19.9998 -1.0000 0.004

Note: f’(x) does not approach zero, so x = 1.0 is not a multiple root.

ii) x = 2
Ite. xi f(xi) f’(xi) f’’(xi) xi+1 εa(%)
1 2.0 12.0 -8.0 -2.0 3.0909 -

2 3.0909 3.3809 -6.6116 4.5455 3.8796 20.327

3 3.8796 0.07083 -1.1613 9.2771 3.9985 2.975
4 3.9985 0.000012 -0.01523 9.9909 3.9999 0.038

Note: f’(x) approaches zero, so x = 3.9999 (essentially 4.0) is a multiple root.

10
SYSTEMS OF NONLINEAR EQUATIONS
 Linear equations
f1 ( x1 , x2 , x3 , , xn )  0
f 2 ( x1 , x2 , x3 , , xn )  0

f n ( x1 , x2 , x3 , , xn )  0
 Which can be solved for

f ( x)  a1 x1  a 2 x2  ...  anxn  b  0

11
 Non-linear equations

x 2  xy  10
y  3xy 2  57
 Which can be solved for using expression:

u ( x, y )  x  xy  10  0
2

v( x, y )  y  3xy  57  0
2

12
• Solution of the nonlinear equations using open methods

 Fixed point iteration

 Newton Raphson

13
Example: Fixed point iteration
Determine the roots using fixed-point iteration with initial
guesses of x = 1.5 and y = 3.5
u ( x, y )  x 2  xy  10  0
v( x, y )  y  3xy 2  57  0

Refer Example 6.10

14
 Newton-Raphson method

• Taylor series expansion of a function of more than

one variable
ui ui
ui 1  ui  ( xi 1  xi )  ( yi 1  yi )
x y
vi vi
vi 1  vi  ( xi 1  xi )  ( yi 1  yi )
x y
• The root of the equation occurs at the value of x and
y where ui+1 and vi+1 equal to zero.
 • Then, the equation can be arranged to
ui ui ui ui
xi 1  yi 1  ui  xi  yi
x y x y
vi vi vi vi
xi 1  yi 1  vi  xi  yi
x y x y
vi ui
ui  vi
y y
xi 1  xi 
ui vi ui vi
Two equation 
version of x y y x
Newton-Raphson
ui vi Determinant of
method
vi  ui the Jacobian of
yi 1  yi  x x the system.
ui vi ui vi

x y y x
16
Example: Newton Raphson

Use the multiple-equation Newton-Raphson

method to determine roots with initial guesses
of x = 1.5 and y = 3.5
u ( x, y )  x 2  xy  10  0
v( x, y )  y  3xy 2  57  0

Refer Example 6.11

17
Exercise
Determine the roots of the following
simultaneous equations using
(a) fixed-point iteration
(b) Newton-Raphson method
y = -x2 + x + 0.75
y + 5xy = x2
Employ initial guesses of x=y=1.2 until the
approximate error is less than 0.05%.

18