Nueva Ecija University of Science and Technology

CE323_Numerical Solutions to CE Problems

ROOTS OF NON-LINEAR EQUATION

METHOD IN SOLVING THE ROOTS NON-LINEAR EQUATIONS
1. Bracketing Method - the method 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.
Bisection Method
* It is also known as “Interval having method”, “Binary search Method”, or “Dichotomy method”
* A bracketing method using the principle of intermediate theorem for continuous function.
* 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.
Bisection method is used with function f(x) when the curve crosses the axis.
Algorithm:
1. Identify a bracket including a root with points a (lower limit) and b (higher limit) such that a < b and f(a)
* f(b) < 0.
2. Determine the midpoint of a and b, let’s say c.
3. Check c:
* if f(a) * f(c) < 0 ; then a remains but b becomes c
* if f(a) * f(c) > 0 ; then a becomes c and b remains
* if f(a) * f(c) = 0 ; then c is a root
4. Repeat the procedure until the desired accuracy is achieved.
5. Stop iteration if b-a < 0.01.
Example 1
Determine the root of x4 - x - 10 = 0 using 5 iterations in Bisection method. Use a = 1.5 and b = 2
Solution:
If a = 1.5; f(1.5) = (1.5)4 - 1.5 - 10
= -6.4375 (negative)
If b = 2 ; f(2) = (2)4 - 2 - 10
= 4 (positive)
By having two different signs with the values, we can proceed with the iteration.
Get the average of the limits, or the midpoint c
c = (1.5 +2.0) / 2
= 1.75

Engr. Cristy M. Malasan, MSCE

Instructor, COE
 a b Check c:
f(a) f(b) c (midpoint) f(c)
(lower limit) (upper limit) * if f(a) * f(c) < 0 ;
then a remains but b becomes c
1.5 2.0 -6.4375 4.00 1.75 -2.3711
* if f(a) * f(c) > 0 ;
1.75 2.0 -2.3711 4.00 1.875 +0.4846 then a becomes c and b remains
* if f(a) * f(c) = 0 ; then c is a root
1.75 1.875 -2.3711 0.4846 1.8125 -0.9606

1.8125 1.875 -0.9606 0.4846 1.8437 -0.2877

1.8437 1.875 -0.2877 0.4846 1.8593 0.0915 5th iteration, near 0

x = 1.8593

Therefore, the root of the equation between 1.5 to 2.0 is taken as x= 1.8593 approximately.

Engr. Cristy M. Malasan, MSCE

Instructor, COE
Example 2
A function is defined as f(x) = x2– 3. Find the root using Bisection method.
Solution:
Take note that the initial limit is not given, and the number of iteration.
Assume lower limit and upper limit.
Assume a = 0 ; f(a) = 02– 3 = -3 (negative)
Assume b = 1 ; f(b) = 12– 3 = -2 (negative)
Assume c = 2 ; f(c) = 22– 3 = +1 (positive)
Take the negative and positive value as the lower and upper limits.
And the average is, c= (1.0 + 2.0)/ 2 = 1.50
If a = 1.5; f(1.5) = (1.5)4 - 1.5 - 10
= -6.4375 (negative)
If b = 2 ; f(2) = (2)4 - 2 - 10
= 4 (positive)
By having two different signs with the values, we can proceed with the iteration.
Get the average of the limits, or the midpoint c
c = (1.5 +2.0) / 2
= 1.75

a b
f(a) f(b) c (midpoint) f(c)
(lower limit) (upper limit)
1.0 2.0 -2.0 +1.0 1.5 -0.75 Check c:
* if f(a) * f(c) < 0 ;
1.50 2.0 -0.75 +1.0 1.75 0.0625
then a remains but b becomes c
1.50 1.75 -0.75 +0.0625 1.625 -0.3594 * if f(a) * f(c) > 0 ;
1.625 1.75 -0.3594 +0.0625 1.6875 -0.01523 then a becomes c and b remains
* if f(a) * f(c) = 0 ; then c is a root
1.6875 1.75 -0.1523 +0.0625 1.7188 -0.0459

1.7188 1.75 -0.0459 +0.0625 1.7344 +0.00814

1.7188 1.7344 -0.0459 +0.00814 1.7266 -0.01885

1.7266 1.7344 -0.01885 +0.00814 1.7305 -0.00537 < 0.01

Therefore, the root of the equation is x = 1.7344 approximately.

x = 1.7344

Note that Bisection method cannot be applied to curves that are not intersecting the x-axis.
Engr. Cristy M. Malasan, MSCE
Instructor, COE
SECANT METHOD
Another method in determining roots of a non-linear function.
A root-finding method which utilizes the open method of delivering roots of a function using the se-
cant line.
It is basically Newton’s method without identifying the derivative at every iteration.
SECANT METHOD is used with function f(x) when the curve crosses the x-axis.

ALGORITHM:
1. Identify an initial interval such that the product of the function would be equal to zero.
2. The approximate value is computed as x0 = a0 - f(a0) [(b0 -a0)/(f(b0 ) - f(a0)]
3. Determine the next subinterval.
4, Repeat the process until the desired accuracy is achieved.
DERIVATION OF APPROXIMATE
Approximate is the convergence point in the curve.
Newton-Raphson
Method

Secant Method

Formula from Newton

Raphson Method
EXAMPLE
Use Secant method to solve for the root of f(x) = cos (x) + 2sin(x) + x2 using the initial values 0
and -0.1. Iterate until 4 decimal values.
Solution
Let xa = 0:
f (xa ) = cos(0) + 2sin(0) + (0)2
=1
Let xb = -0.1:
f (xb ) = cos(-0.1) + 2sin(-0.1) + (-0.1)2
= 0.8053
Repeat the process until accuracy is obtained.

xa xb f(xa) f(xb )

0 -0.1 1 0.8053

-0.1 -0.5136 0.8053 0.1522

-0.5136 -0.6100 0.1522 0.0461

-0.6100 -0.6518 0.0461 0.00602

-0.6518 -0.6588 0.006602 0.000409

-0.6588 -0.6593 0.000409 0.000004 < 0.01

Therefore, the approximate root of f(x) = cos (x) + 2sin(x) + x2 is x = -0.6593

Example 2. Use Secant method to solve for the root of f(x) = x3 + 3sin(x) +4.
Using the iteration, the root of x = -1.099075

Another method to determine the root is to do the process using MATLAB.

Engr. Cristy M. Malasan, MSCE
Instructor, COE