NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

BRAHMA VALLEY COLLEGE OF ENGG & RESEARCH INSTITUTE. NASHIK (062)

NUMERICAL METHODS AND COMPUTER SEM. : II (SE)
DEPT. : ELECTRICAL ENGG.
PROGRAMMING ( 203148 )
PROGRAM NO. : BVCOERI/ELECT/NMCP/01 PAGE:__-__ DATE:
PROGRAM TITLE: SOLUTION OF POLYNOMIAL EQUATION USING BIRGE-VIETA METHOD.

AIM: To find out a solution of a polynomial equation using Bierge-Vieta method.

HARDWARE AND SOFTWARE:

1) Hardware: Desktop, minimum 128MB RAM, a suitable HDD

2) Software: Windows XP/Linux, Turbo C/ C++ or Borland C/ C++ compiler

B.V.C.O.E.R.I.,NASHIK Page 1
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

BRAHMA VALLEY COLLEGE OF ENGG & RESEARCH INSTITUTE. NASHIK (062)

NUMERICAL METHODS AND COMPUTER SEM. : II (SE)
DEPT. : ELECTRICAL ENGG.
PROGRAMMING ( 203148 )
PROGRAM NO. : BVCOERI/ELECT/NMCP/02 PAGE:__-__ DATE:
PROGRAM TITLE: SOLUTION OF TRANSCENDENTAL EQUATION USING BISECTION OR
REGULA- FALSI METHOD.

AIM: To find out a solution of a transcendental equation using Bisection or Regula-Falsi

method.

HARDWARE AND SOFTWARE:

1) Hardware: Desktop, minimum 128MB RAM, a suitable HDD

2) Software: Windows XP/Linux, Turbo C/ C++ or Borland C/ C++ compiler

THEORY:

PROBLEM DEFINATION:
1) Find the root of x3-x-4 = 0 using Bisection method upto accuracy 0.001.

NUMERICAL SOLUTION:
f(x) = x3-x-4
f(0) = -4, f(1) = -4. f(2) = 2.
Here, f(a) = -ve and f(b) = +ve
Root lies between interval [a,b] i.e. [1,2]
Mid point of the interval is x0 = (a+b)/2 = (1+2)/2 = 1.5
So, f(1.5) = -2.215, this new value is giving –ve answer of f(x), so replacing the
value which is already giving –ve answer of f(x) from previous interval by
this new value giving –ve value of f(x) to get close interval than previous
interval. Hence new interval [1.5,2]. Repeat this procedure,we get

B.V.C.O.E.R.I.,NASHIK Page 2
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

Iteration Value of a (of which Value of b(of which x0 =

No. f(a) is –ve) f(a) is –ve) (a+b)/2
f(x0) [a-b]

1. 1 2 1.5 -2.125 1

2. 1.5 2 1.75 -0.39 0.5

3. 1.75 2 1.875 0.716 0.25

4. 1.75 1.875 1.8125 0.141846 0.125

5. 1.75 1.8125 1.78125 -0.129608 0.0625

6. 1.78125 1.8125 1.796875 0.004803 0.03125

7. 1.78125 1.796875 1.789062 -0.062730 0.015625

8. 1.789062 1.796875 1.792969 -0.029046 0.0078125

9. 1.792069 1.796875 1.794922 -0.012142 0.0039063

10. 1.794922 1.796875 1.795898 -0.003675 0.001953

Number of iterations required to achieve accuracy 0.001 is,

ln(|
b
-
a|
/e)
ln(|
l2|
/0.
001
)

n  
9.965
10
ln2 ln
2

Here accuracy of 0.001953 is achieved at the end of 10th iteration; hence value of
root is 1.795898

B.V.C.O.E.R.I.,NASHIK Page 3
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

ALGORITHM:
1. Define f(x) =
2. Enter the desired accuracy, e
3. do
{

Read a,b

} while (f(a) * f(b) > 0)

4. k = 0
5. do
{

x0 = (a+b)/2

if (f(a) * f(b) < 0) then

b = x0

else

a = x0

endif

k=k+1

} while (|b-a|) > e)

6. Print the value of root, x0 and no. of iterations performed, k.

Stop

B.V.C.O.E.R.I.,NASHIK Page 4
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

FLOW-CHART:

B.V.C.O.E.R.I.,NASHIK Page 5
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

PROGRAM FOR BISECTION METHOD:

/* Bisection Method */
#include<stdio.h>
#include<conio.h>
#include<math.h>
/*function*/
float f(float x)
{
float f;
/* f=x*x*x-cos(x)*cos(x); */
f=pow(2.7182828,x)-3*cos(x)+1;
return(f);
}
/* Main Program */
main()
{
float a,b,e,x0,N;
int k;
clrscr();
printf(“\n Enter accuracy”);
scanf(“%f”,&e);
do
{
printf(“\n Enter interval a,b”);
scanf(“%f%f”,&a,&b);
}while(f(a)*f(b)>0.0);
k=0;
do
{
x0=(a+b)/2.0;
printf(“\nI=%d a=%f b=%f x0=%f f(x0)=%f |b-
a|=%f”,k+1,a,b,x0,f(x0),fabs(b-a));
if (f(a)*f(x0)<0.0)
{b=x0;}
else
{a=x0;}
k=k+1;
}while(fabs(b-a)>e);
printf(“\n Root of the equation is %f”,x0);
printf(“\n Actual no.of iterations required to achieve desired accuracy,%d”,k);
getch();
}

B.V.C.O.E.R.I.,NASHIK Page 6
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

OUTPUT: Enter accuracy 0.001

Enter interval a, b 1 2
I= a= b= x0= f(x0)= |b-a|=
Root of the equation 1.7968
Actual no.of iterations required to achieve desired accuracy 10

B.V.C.O.E.R.I.,NASHIK Page 7
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

B.V.C.O.E.R.I.,NASHIK Page 8
 NUMERICAL METHODS AND COMPUTER PROGRAMMING (NMCP)

B.V.C.O.E.R.I.,NASHIK Page 9