Solution to Non-Linear Algebraic Equations with one variable

We generally come across Non-Linear Algebraic Equations in the following cases

while studying various knowledge areas of Chemical Engineering:
1. Dew point and Bubble point calculations
2. Estimation of power requirements of compressor
3. Use of popular Equations of States for various Pressure-Volume
computations
4. Flash and Distillation column computations
5. Multiple steady states in continuous flow stirred tank reactors
Consider a non-linear algebraic equation of the type f(x) =0 where the variable is
x. Here, the number of values of x depends upon the degree of f(x). The nonlinear equation containing one variable has N roots where N is the degree of the
given non-linear equation. The exact value of all these roots cannot be found out
analytically. Hence, the methods discussed in this section are used to find the
value of one of the roots of the given non-linear algebraic equation within the
specified boundaries and to a level of acceptable limit of error. Therefore, these
methods are called as Bracketing methods. The selection of boundary for search
of the root of the non-linear equation affects the final value of the root and
hence, its value may be found to be different for different boundaries. The
methods used for solving Non-Linear equations are as follows:
1.
2.
3.
4.

Bisection method
Newton-Raphson method
Regula Falsi method
Secant method

All the above methods are iterative in nature and the iterations are repeated till
the root does not lie within the allowable error limits.
1. Bisection Method: As the name says, it is a method involving the bisection
of the given interval. Hence, it is also called as Interval Halving method.
Consider a non-linear algebraic equation in one variable x as f(x) =0. Let
the interval in which the root of f(x) lies be (a, b). Now, let the value of
new value of root after each iteration be c. Hence, following are the steps
for solving of non-linear algebraic equation with one variable by using
Bisection method:
f(x) =0 and interval is (a ,b)

c=

a+b
2

Now, we find the values of:

f(a) ,f(b) ,f(c)
If

f ( a ) . f ( c ) <0

Else, if

, b =c & a =a

f ( b ) . f ( c ) <0

, a =c & b =b

We continue the above procedure till we get the value of x within the error
limits.
Also, if the interval is not defined in the problem statement, then we can
assume any interval for the problem provided for the chosen (a ,b) ,

f ( a ) . f ( b )< 0
The above method can be graphically conceptualised as follows:

From the above graph, we can see that the initial interval (a ,b) has been
used to calculate the new value of root that is c which lies exactly between
a & b or precisely it its the mid-point of segment ab. Hence, now we check
for the above given conditions and find that

f ( a ) . f ( c ) <0

. So, the interval (a ,b) now becomes interval (a ,c) for the

second iteration. In this process we have divided the initial interval into its
half and so it is called as interval halving method. Also, subsequent
iterations follow which finally results into the computation of the root of
f(x) which lies within the error limits.
If the value of required error limit is known, we can use the following
formula to calculate the no. of iterations required to reach the value of the
root:

[log ( ba )logE ]
log 2

Where, interval is (a ,b)

error is E
no. of iterations are n