SOLUTION OF ALGEBRAIC AND

TRANSCENDENTAL EQUATION

Presentation by:- Arunav(ME)

Roll no:- 005
Batch :- 2020-24

Under the supervision of

Dr. Kiran pal Applied mathematics for the subject(NAST)

DSEU OKHLA PHASE II

Algebraic Functions
• The general form of an algebraic function :
=0
=0 an i-th order polynomial .
Example :

Polynomial are a simple class of algebraic function

Transcendental functions
• A transcendental function is non-algebraic.
• May include trigonometric, exponential, logarithmic function.
• Examples:

f(x)= In
f(x)=
 Equation Solving
• Given an approximate location (initial value)
• Find a single real root
Root
Finding (non-linear single variable)

Open Brackting
Methods Methods

Iterative Newton- secant Biscetion False-

Raphson position
 BISECTION METHOD

Theory : the Bisection method is one of the simplest and most reliable of iterative methods for the solution of nonlinear
equations . This method ,also known as binary chopping or half-interval method , relies on the fact that if f(x) is real and
continuous in the interval a<x<b , and f(a) and f(b) are of opposite signs , that is ,
f(a)f(b)<0
Then there is at least one real root between a and b . There may be more than one root in the interval .
Let ,
Let us also define another point to be the middle point between a and b , that is ,

Now , there exists the following three conditions ;

1. If f() =0 , we have a root at
2. If f() < 0 , then there is a root between and
3. If f()f()<0 , then there is a root between and .
It follows that by testing the sign of the function at midpoint , we can deduce which part of the interval contains the root .
This is illustrated in fig given below . It shows that , since f() and f() are of opposite sign , a root lies between and . We can
further divide this subinterval into two halves to locate anew subinterval containing the root . This process can be repeated
until the interval contacting the root is as small as we desire .
BISECTION METHOD

f(x)

0
x

Fig: Illustration of bisection method

 REGULA-FALSI METHOD
The converge process in the bisection method is very slow. It depends only on the choice of end points of the interval [a,b]. The
function f(x) does not have any role in finding the point c (which is just the mid-point of a and b). It is used only to decide the
next smaller interval [a,c] or [c,b]. A better approximation to c can be obtained by taking the straight line L joining the points
(a,f(a)) and (b,f(b)) intersecting the X-axis . To obtain the value the C we can equate the two expression of the slope m of the
line L.
Y
m=
= (c-b) * (f(b)-f(a)) = -(b-a) * f(b)
0
X

(,f())
())
c=b-

Now the next smaller interval which brackets the root can be obtained by checking

f(a)*f(b) < 0 then b=c

> 0 then a=c
= 0 then c is the root.

Selecting C by the above expression is called Regula-Falsi method or False position method .
 NEWTON RAPHSON METHOD
Let us consider an equation f(x)=0 having graphical representation as