ROOTS OF NON- CE 316:

LINEAR
Numerical
Solutions to
CE Problems

EQUATIONS

Fernando, JPP
 NON-LINEAR EQUATIONS

1. Polynomial Equations
2. Transcendental Equations

Exponential Equations
Logarithmic Equations
Trigonometric Equations
Hyperbolic Equations

Solutions to equations of the form can be seen as

places where the graph of f(x) crosses or touches the
axis.
 GENERAL METHODS IN SOLVING NON-
LINEAR EQUATIONS

1. Bracketing Method
The method starts with a range that contains the
root and the procedure is used to obtain a small range
containing the root.

2. Open Method
The method starts with one or more guess points.
With every iteration, a new root is obtained.
 GENERAL METHODS IN SOLVING NON-
LINEAR EQUATIONS

1. Non-numerical Methods
 Graphing
 Incremental Search Method
2. Bracketing Methods
 Bisection Method
 Regula Falsi Method
3. Open Methods
 Newton-Raphson Method
 Secant Method
INCREMENTAL SEARCH Roots of
Non-linear
METHOD Equations

Fernando, JPP
 INCREMENTAL SEARCH METHOD (ISM)

Also known as BRUTE FORCE METHOD.

A simple method of determining the root of a
nonlinear equation by means of using increments.
It is used to find an interval of two values of “x”
which is expected to contain at least one root.

NOTE:
Incremental method is used with function f(x) when
the curve crosses the x-axis.
 INCREMENTAL SEARCH METHOD

ALGORITHM:
1. Identify the first value of x and the increment to be
used.
2. Tabulate results and locate an interval where the
function change signs.
3. Divide the interval into a number of sub-intervals.
4. Search the sub-interval to accurately locate the
change of sign.
 INCREMENTAL SEARCH METHOD

EXAMPLE 1:

Let
Increment = 2
 INCREMENTAL SEARCH METHOD

Incremental method is NOT a numeric method, but

helps to determine an approximate value to be used in
calculating roots.

ADVANTAGES DISADVANTAGES
Simple to follow Time consuming

How do we determine to
If a solution is guaranteed
use?
 INCREMENTAL SEARCH METHOD

EXAMPLE 2:

Determine the root of using the interval from 3

– 0. Take three decimal places.
 INCREMENTAL SEARCH METHOD

NOTE:

Incremental search method can’t be applied to

curves not intersecting the x-axis.
Choice of is purely a guess, one can graph the curve
to have an idea which to use.
 Roots of
BISECTION METHOD Non-linear
Equations

Fernando, JPP
 BISECTION METHOD

Also known as INTERVAL HALVING METHOD, ROOT-

FINDING METHOD, BINARY SEARCH METHOD, or
DICHOTOMY METHOD
A bracketing method using the principle of
intermediate theorem for continuous functions.
A simple method of determining the root of a
nonlinear equation by means of using increments.
It is used to find an interval of two values of “x”
which is expected to contain at least one root.
NOTE:
Bisection method is used with function f(x) when the
curve crosses the x-axis.
 BISECTION METHOD

ALGORITHM:
1. Identify a bracket including a root with points a and
b such that and
2. Determine the midpoint of a and b, let’s say c.
3. Check c:
If ; then a remains but b becomes c
If ; then a becomes c and b remains
If ; then c is a root
4. Repeat the procedure until the desired accuracy is
achieved.
5. Stop iteration if
 BISECTION METHOD

EXAMPLE 1:

Determine the roots of using 5 iterations in

Bisection method. Use a = 1.5 and b = 2.
 BISECTION METHOD

EXAMPLE 2:

A function is defined as . Find the root using

Bisection method.
 BISECTION METHOD

NOTE:

Bisection method can’t be applied to curves not

intersecting the x-axis.
The procedure reduces the bracket of values to
accurately determine the approximate root of an
equation.
 Roots of
REGULA FALSI METHOD Non-linear
Equations

Fernando, JPP
 REGULA FALSI METHOD

Also known as FALSE POSITION METHOD.

A trial and error method of substituting a value for
the unknown variable and testing the function.

NOTE:
Regula falsi method is used with function f(x) when
the curve crosses the x-axis.
 REGULA FALSI METHOD

ALGORITHM:
1. Identify a bracket including a root with points a and b such
that and
2. The approximate value is computed as

3. Check c:
 If ; then a remains but b becomes c
 If ; then a becomes c and b remains
 If ; then c is a root
4. Repeat the procedure until the desired accuracy is achieved.
5. Stop iteration according to the desired accuracy of f(c).
 REGULA FALSI METHOD

DERIVATION OF APPROXIMATE

Approximate is the convergence point in the curve.

 REGULA FALSI METHOD

REGULA FALSI VS. BISECTION

Regula falsi and bisection method have similar
patterns with a single distinction in the process.

Bisection Method Regula Falsi Method

or
 REGULA FALSI METHOD

Example 1:

Determine the root of

using Regula Falsi Method.

 REGULA FALSI METHOD

Example 2:

Determine the root of

using Regula Falsi Method.

 REGULA FALSI METHOD

NOTE:

Regula falsi method can’t be applied to curves not

intersecting the x-axis.
The procedure reduces the bracket of values to
accurately determine the approximate root of an
equation much faster than bisection method.
NEWTON-RAPHSON Roots of
Non-linear
METHOD Equations

Fernando, JPP
 NEWTON-RAPHSON METHOD

Also known as NEWTON’S METHOD

An open method of quickly determining roots
numerically.

NOTE:
Newton-Rhapson method is used with function f(x)
when the curve crosses the x-axis.
 NEWTON-RAPHSON METHOD

ALGORITHM:
1. Differentiate the function.
2. Identify a value of x.
3. The approximate value is computed as

4. Repeat the procedure until the desired accuracy is

achieved.
 NEWTON-RAPHSON METHOD

DERIVATION OF APPROXIMATE

Approximate is the convergence point in the curve.

 NEWTON-RAPHSON METHOD

EXAMPLE 1:

Use Newton’s method to solve for the root of

 NEWTON-RAPHSON METHOD

EXAMPLE 2:

Use Newton’s method to solve for the root of

to 5 decimal places.
 NEWTON-RAPHSON METHOD

NOTE:

Newton-Raphson method can’t be applied to curves

not intersecting the x-axis.
The procedure doesn’t use limits but rather a single
value of x to be iterated by a formula involving the
slope of the tangent line of the point.
 NEWTON-RAPHSON METHOD

LIMITATIONS OF NEWTON-RAPHSON
METHOD

1. Horizontal tangent line

2. Division by zero
3. Approximating the wrong root
4. Oscillating sequence
5. Root jumping
 Roots of
SECANT METHOD Non-linear
Equations

Fernando, JPP
 SECANT METHOD

A root-finding method which utilizes the open

method of delivering roots of a function using the
secant line.
It is basically Newton’s Method without identifying
the derivative at every iteration.

NOTE:
Secant method is used with function f(x) when the
curve crosses the x-axis.
 SECANT METHOD

ALGORITHM:
1. Identify an initial interval such that the product of
the functions would be equal to zero.
2. The approximate value is computed as

3. Determine the next sub-interval.

4. Repeat the procedure until the desired accuracy is
achieved.
 SECANT METHOD

DERIVATION OF APPROXIMATE

Approximate is the convergence point in the curve.

 SECANT METHOD

EXAMPLE 1:

Use Secant method to solve for the root of

Using the initial values 0 and -0.1. Iterate until

4 decimal values.
 SECANT METHOD

EXAMPLE 2:

Determine the root of

using the initial values 0 and 1. Check 6

decimal places.
 SECANT METHOD

NOTE:

The Secant method is faster but may not converge at

all.
Although Secant method starts with an interval, the
succeeding value of x is located outside the interval,
thus it is not considered as a bracketing method.
 CE 316:

END OF PRESENTATION Numerical

Solutions to CE
Problems

Fernando, JPP