Roots of Nonlinear Equation

MATH5E- NUMERICAL SOLUTIONS FOR CE PROBLEMS

PREPARED BY:
ENGR. RICHMONILYN A. SALVADOR, MSCE
 A Nonlinear equation can be defined as the
equation having the maximum degree 2 or
more than 2.

A linear equation forms a straight line on the

graph.
A nonlinear equation forms a curve on the
graph.
The general form of linear equation is,
y = mx +c.
Solutions of Equations in One Variable
Numerical Algorithm To find the
approximate solutions (roots) for non-linear
equations,

Bisection method
False Position Method (Regula Falsi method)
Fixed-Point Iteration
Newton-Raphson method (Newton’s method
The Secant Method
BRACKETING METHODS

BISECTION METHOD
FALSE POSITION METHOD (REGULA FALSI METHOD)
BISECTION METHOD
The bisection method is an approximation
method to find the roots of the given equation
by repeatedly dividing the interval.
This method will divide the interval until the
resulting interval is found, which is extremely
small.
Steps for Bisection Method:
Steps for Bisection Method:
 BISECTION METHOD

Example:
Find a root of an equation, f(x)=x3-x-1
 Solution:  1st iteration :  2nd iteration :
x3-x-1=0 f(1)=-1<0 and f(2)=5>0 f(1)=-1<0 and f(1.5)=0.875>0
Let f(x)=x3-x-1
∴ Now, Root lies
Here: between 1 and 2 ∴ Now, Root lies between 1 and 1.5
x 0 1 2
x0=(1+2)/2=1.5
f(x) -1 -1 5 x1= (1+1.5)/2 =1.25
f(x0)=f(1.5)=0.875>0 f(x1)= f(1.25)= -0.29688<0
 BISECTION METHOD

Example:
Find a root of an equation, f(x)=x3-x-1
 3rd iteration :  4th iteration :
f(1.25)=-0.29688<0 and f(1.25)=-0.29688<0 and f(1.375)=0.22461>0
f(1.5)=0.875>0
∴ Now, Root lies between 1.25 and 1.375
∴ Now, Root lies
between 1.25 and 1.5 x3=(1.25+1.375)/2=1.3125

x2=(1.25+1.50)/2=1.375 f(x3)=f(1.3125)=-0.05151<0

f(x2)=f(1.375)=0.22461>0
 BISECTION METHOD

Example:
Find a root of an equation, f(x)=x3-x-1
 5th iteration :  6th iteration :
f(1.3125)=-0.05151<0 and f(1.3125)=-0.05151<0 and
f(1.375)=0.22461>0 f(1.34375)=0.08261>0

∴ Now, Root lies between ∴ Now, Root lies between

1.3125 and 1.375 1.3125 and 1.34375

x4=(1.3125+1.375)/2=1.34375 x5=(1.3125+1.34375)/2=1.32812

f(x4)=f(1.34375)=0.08261>0 f(x5)=f(1.32812)=0.01458>0
 BISECTION METHOD

Example:
Find a root of an equation, f(x)=x3-x-1
 7th iteration :  8th iteration :
f(1.3125)=-0.05151<0 and f(1.32031)=-0.01871<0 and
f(1.32812)=0.01458>0 f(1.32812)=0.01458>0

∴ Now, Root lies between ∴ Now, Root lies between

1.3125 and 1.32812 1.32031 and 1.32812

x6=(1.3125+1.32812)/2=1.32031 x7=(1.32031+1.32812)/2=1.32422

f(x6)=f(1.32031)=-0.01871<0 f(x7)=f(1.32422)=-0.00213<0
 BISECTION METHOD

Example:
Find a root of an equation, f(x)=x3-x-1
 9th iteration :  10th iteration :
f(1.32422)=-0.00213<0 and f(1.32422)=-0.00213<0 and
f(1.32812)=0.01458>0 f(1.32617)=0.00621>0

∴ Now, Root lies between ∴ Now, Root lies between

1.32422 and 1.32812
1.32422 and 1.32617
x8=(1.32422+1.32812)/2=1.32617
x9=(1.32422+1.32617)/2=1.3252
f(x8)=f(1.32617)=0.00621>0
f(x9)= f(1.3252)=0.00204>0
 BISECTION METHOD

Example:
Find a root of an equation, f(x)=x3-x-1
 11th iteration : Approximate root of the
f(1.32422)=-0.00213<0 and
equation x3-x-1=0 using
f(1.3252)=0.00204>0
Bisection method
∴ Now, Root lies between is 1.32471
1.32422 and 1.3252

x10=(1.32422+1.3252)/2=1.32471

f(x10)=f(1.32471)=-0.00005<0
 BISECTION METHOD
Find a root of an equation, f(x)=x3-x-1
Approximate root of the equation x3-x-1=0 using Bisection method is 1.32471
 BISECTION METHOD

EXERCISE:
1. Find the approximate roots, assuming x is any roots; 0,1,2…
2. Try several iterations until you find the approx. roots (lets say up to 11th iterations)
3. Tabulate all given and solved data.
(SOLVED MANUALLY & USING NUMERICAL ALGORITHM)
FALSE POSITION METHOD
(REGULA FALSI METHOD)
A numerical technique used to find the approximate
roots of nonlinear equations of the form f(x)=0.
This method combines aspects of both
the bisection method and the secant method.
It is particularly useful when dealing with continuous
functions where a root lies between two initial
guesses.
 FALSE POSITION METHOD (REGULA FALSI METHOD)
 FALSE POSITION METHOD (REGULA FALSI METHOD)
Example:
Find a root of an equation, f(x)=x3-x-1
 FALSE POSITION METHOD (REGULA FALSI METHOD)
Example:
Find a root of an equation, f(x)=x3-x-1
 FALSE POSITION METHOD (REGULA FALSI METHOD)
Example:
Find a root of an equation, f(x)=x3-x-1
 FALSE POSITION METHOD (REGULA FALSI METHOD)

EXERCISE:
1. Find the approximate roots, assuming x is any roots; 0,1,2…
2. Try several iterations until you find the approx. roots (lets say up to 11th iterations)
3. Tabulate all given and solved data.
(SOLVED MANUALLY & USING NUMERICAL ALGORITHM)

n x0 f(x0) x1 f(x1) x2 f(x2) Update

1 x0=x2

2 so on….

5
NEWTON-RAPHSON METHOD
(NEWTON’S METHOD)
It is an iterative numerical method used to
find the roots of a real-valued
function, using guess for the first iteration (x0)
and then approximating the next
iteration(x1) which is close to roots, using the
following formula.
 NEWTON-RAPHSON METHOD (NEWTON’S METHOD)
 NEWTON-RAPHSON METHOD (NEWTON’S METHOD)
Example:
Find a root of an equation, f(x)=x3-x-1
 NEWTON-RAPHSON METHOD (NEWTON’S METHOD)
Example:
Find a root of an equation, f(x)=x3-x-1
 NEWTON-RAPHSON METHOD (NEWTON’S METHOD)

EXERCISE:
1. Find the approximate roots, assuming x is any roots; 0,1,2…
2. Try several iterations until you find the approx. roots (lets say up to 11th iterations)
3. Tabulate all given and solved data.
(SOLVED MANUALLY & USING NUMERICAL ALGORITHM)

n x0 f (x0) f‘ (x0) x1 Update

1 x0=x1

2 so on….

5
THE SECANT METHOD
It is a recursive method for finding the root for the
polynomials by successive approximation. It’s
similar to the Regular-falsi method but here we
don’t need to check f(x1)f(x2)<0 again and again
after every approximation.
In this method, the neighbourhoods roots are
approximated by secant line or chord to the
function f(x).
It’s also advantageous of this method that we
don’t need to differentiate the given function f(x),
as we do in Newton-raphson method.
 THE SECANT METHOD
 THE SECANT METHOD
Example:
Find a root of an equation, f(x)=x3-x-1
 THE SECANT METHOD
Example:
Find a root of an equation, f(x)=x3-x-1
 THE SECANT METHOD

EXERCISE:
1. Find the approximate roots, assuming x is any roots; 0,1,2…
2. Try several iterations until you find the approx. roots (lets say up to 11th iterations)
3. Tabulate all given and solved data.
(SOLVED MANUALLY & USING NUMERICAL ALGORITHM)

n x0 f(x0) x1 f(x1) x2 f(x2) Update

x0=x1
1
x1=x2

2 so on….

5
FIXED POINT ITERATION
The fixed point iteration method uses the
concept of a fixed point in a repeated
manner to compute the solution of the
given equation.
A fixed point is a point in the domain of a
function g such that g(x) = x.
In the fixed point iteration method, the
given function is algebraically converted in
the form of g(x) = x.
 FIXED POINT ITERATION
 FIXED POINT ITERATION
Example:
Find a root of an equation, f(x)=x3-x-1
 FIXED POINT ITERATION

EXERCISE:
1. Find the approximate roots, assuming x is any roots; 0,1,2…
2. Try several iterations until you find the approx. roots (lets say up to 11th iterations)
3. Tabulate all given and solved data.
(SOLVED MANUALLY & USING NUMERICAL ALGORITHM)

Difference
n x0 x1 =Φ(x0) f(x1) Update
|x1-x0|

x0=x1
1
x1=x2

2 so on….

5
END
EXERCISES:

 Bisection method
 False Position Method (Regula Falsi method)
 Fixed-Point Iteration
 Newton-Raphson method (Newton’s method
 The Secant Method