Numerical Techniques Lab Manual

Numerical Techniques
Lab Manual
Numerical Techniques Lab Manual
Dev Bhoomi Institute Of Technology LABORATORY MANUAL

Department of Computer Applications
PRACTICAL INSTRUCTION SHEET
EXPERIMENT NO. ISSUE NO. : ISSUE DATE:
REV. NO. : REV. DATE : PAGE:
LABORATORY Name & Code: SEMESTER:
List of Programs
S.NO. ALGORITHM/ FLOW CHART/ PROGRAM PAGE NO.
1. To deduce error involved in polynomial equation.
2. To Find out the root of the Algebraic and Transcendental equations using
Bisection method.
Regula-Falsi method.
Newton-Raphson method.
Iterative method.
6. To implement Numerical Integration using Trapezoidal rule.
7. To implement Numerical Integration using Simpson 1/3 rule.
8. To implement Numerical Integration Simpson 3/8 rule.
9. To implement Newton‟s Forward Interpolation formula.
10. To implement Newton‟s Backward Interpolation formula.
11. To implement Gauss Forward Interpolation formula.
12. To implement Gauss Backward Interpolation formula.
13. To implement Bessel‟s Interpolation formula.
14. To implement Sterling‟s Interpolation formula.
15. To implement Newton‟s Divided Difference formula.
16. To implement Langrange‟s Interpolation formula.
17. To implement Numerical Differentiations.
18. To implement Least Square Method for curve fitting.
19. To draw frequency chart like histogram, frequency curve and pie-chart etc.
20. To estimate regression equation from sampled data and evaluate
values of standard deviation, t-statistics, regression coefficient,
value of R^2 for at least two independent variables.

1. Algorithm to deduce error involved in polynomial equation.
Step-1. Start of the program.

Step-2. Input the variable t_val, a_value.
Step-3. Calculate absolute error as
abs_err=|t_val-a_val|
Step-4. Calculate relative error as
rel_err=abs_err/t_val
Step-5. Calculate percentage relative error as
p_rel_err=rel_err*100
Step-6. PRINT abs_err, rel_err and p_rel_err
Step-7. STOP

Program to deduce error involved in polynomial equation
#include<stdio.h>
#include<math.h>
#include<conio.h>
void main()
{
double abs_err, rel_err, p_rel_err, t_val, a_val;
printf(“\n INPUT TRUE VALUE:”);

scanf(“%lf”, &t_val);
printf(“\n INPUT APPROXIMATE VALUE:”);

scanf(“%lf”, &a_val);
abs_err=fabs(t_val-a_val);
rel_err=abs_err/t_val;
p_rel_err=rel_err*100;
printf(“\nABSOLUTE ERROR= %lf”, abs_err);

printf(“\nRELATIVE ERROR= %lf”, rel_err);
printf(“\nPERCENTAGE RELATIVE ERROR= %lf”, p_rel_err);
getch();
}

2. Algorithm of BISECTION METHOD.

Step-2. Input the variable x1, x2 for the task.
Step-3. Check f(x1)*f(x2)<0
Step-4. If yes proceed
Step-5. If no exit and print error message
Step-6. Repeat 7-11 if condition not satisfied
Step-7. X0=(x1+x2)/2
Step-8. If f(x0)*f(x1)<0
Step-9. X2=x0
Step-10. Else
Step-11. X1=x0
Step-12. Condition:
Step-13. if | (x1-x2)/x1) | < maximum possible error or f(x0)=0
Step-14. Print output
Step-15. End of program.

PROGRAM: BISECTION METHOD.
#include<stdio.h>
#include<math.h>
#include<conio.h>
#include<process.h>
#include<string.h>
#define EPS 0.00000005
#define F(x) (x)*log10(x)-1.2
void Bisect();
int count=1,n;
float root=1;
void main()
{
clrscr();
printf("\n Solution by BISECTION method \n");
printf("\n Equation is ");
printf("\n\t\t\t x*log(x) - 1.2 = 0\n\n");
printf("Enter the number of iterations:");
scanf("%d",&n);
Bisect();
getch();
}
void Bisect()
{
float x0,x1,x2;
float f0,f1,f2;
int i=0;
for(x2=1;;x2++)
{
f2=F(x2);
if (f2>0)
{
break;
}
}
for(x1=x2-1;;x2 --)
{
f1=F(x1);
if(f1<0)
{
break;
}
}
printf("\t\t----------------------------------------- ");
printf("\n\t\t ITERATIONS\t\t ROOTS\n");

printf("\t\t----------------------------------------- ");
for(;count<=n;count++)
{
x0=((x1+x2)/2.0);
f0=F(x0);
if(f0==0)
{
root=x0;
}
if(f0*f1<0)
{
x2=x0;
}
else
{
x1=x0;
f1=f0;
}
printf("\n\t\t ITERATION %d", count);
printf("\t :\t %f",x0);
if(fabs((x1-x2)/x1) < EPS)
{
printf("\n\t\t--------------------------------- ");
printf("\n\t\t Root = %f",x0);
printf("\n\t\t Iterations = %d\n", count);
printf("\t\t------------------------------------ ");
getch();
exit(0);
}
}
printf("\n\t\t---------------------------------------- ");
printf("\n\t\t\t Root = %7.4f",x0);
printf("\n\t\t\t Iterations = %d\n", count-1);
printf("\t\t------------------------------------------ ");
getch();
}

3. Algorithm of FALSE POSITION or REGULA-FALSI METHOD.

Step-2. Input the variable x0, x1,e, n for the task.
Step-3. f0=f(x0)
Step-4. f2=f(x2)
Step-5. for i=1 and repeat if i<=n
Step-6. x2 = (x1.f1-xo.f1)/(f1-f0)
Step-7. f2 = x2
Step-8. if | f2 | <=e
Step-9. print “convergent “, x2, f2
Step-10. if sign (f2)!=sign(f0)
Step-11. x1=x2 & f1 = f2
Step-12. else
Step-13. X0 = x2 & f0 = f2
Step-14. End loop
Step-16. End the program.
PROGRAM: FALSE POSITION or REGULA-FALSI METHOD.
#include<stdio.h>
#include<math.h>
#include<conio.h>
#include<string.h>
#include<process.h>
#define EPS 0.00005
#define f(x) 3*x+sin(x)-exp(x)
void FAL_POS();
void main()
{
clrscr();
printf("\n Solution by FALSE POSITION
method\n"); printf("\n Equation is ");
printf("\n\t\t\t 3*x + sin(x)-exp(x)=0\n\n");
FAL_POS();
}
void FAL_POS()
{
float f0,f1,f2;
float x0,x1,x2;
int itr;
int i;
printf("Enter the number of iteration:");
scanf("%d",&itr);
for(x1=0.0;;)
{
f1=f(x1);
if(f1>0)
{
break;
}
else
{
x1=x1+0.1;
}
}
x0=x1-0.1;
f0=f(x0);
printf("\n\t\t-----------------------------------------");
printf("\n\t\t ITERATION\t x2\t\t F(x)\n");
printf("\t\t--------------------------------------------");
for(i=0;i<itr;i++)
{
x2=x0-((x1-x0)/(f1-f0))*f0;
f2=f(x2);
if(f0*f2>0)
{
x1=x2;
f1=f2;
}
else
{
x0=x2;
f0=f2;
}
if(fabs(f(2))>EPS)
{
printf("\n\t\t%d\t%f\t%f\n",i+1,x2,f2);
}
}
printf("\t\t--------------------------------------------");
printf("\n\t\t\t\tRoot=%f\n",x2);
printf("\t\t-------------------------------------------");
getch();
}

4. Algorithm of NEWTON-RAPHSON METHOD.

Step-2. input the variables x0, n for the task.
Step-3. input Epsilon & delta
Step-4. for i= 1 and repeat if i <= n
Step-5. f0 = f(x0)
Step-6. dfo = df(x1)
Step-7. if | dfo | <= delta
a. Print slope too small
b. Print x0, f0, df0, i
c. End of program
Step-8. x1 = x0 –(f0/df0)
Step-9. if | (x1-x0/x1) | < epsilon
a. Print convergent
b. Print x1, f(x1), i
c. End of program
Step-10. x0 = x1
Step-11. End loop.

PROGRAM: NEWTON RAPHSON METHOD.
# include <stdio.h>
# include <conio.h>
# include <math.h>
# include <process.h>
# include <string.h>
# define f(x) 3*x -cos(x)-1
# define df(x) 3+sin(x)
void NEW_RAP();
void main()
{
clrscr();
printf ("\n Solution by NEWTON RAPHSON method
\n"); printf ("\n Equation is: ");
printf ("\n\t\t\t 3*X - COS X - 1=0 \n\n
"); NEW_RAP();
getch();
}
void NEW_RAP()
{
long float x1,x0;
long float f0,f1;
long float df0;
int i=1;
int itr;
float EPS; float
error; for(x1=0;;x1
+=0.01)
{
f1=f(x1);
if (f1 > 0)
{
break;
}
}
x0=x1-0.01;
f0=f(x0);
printf(" Enter the number of iterations:
"); scanf(" %d",&itr);
printf(" Enter the maximum possible error:
"); scanf("%f",&EPS);
if (fabs(f0) > f1)
{
printf("\n\t\t The root is near to %.4f\n",x1);
}
Avantika Yadav KEC Page 11

if(f1 > fabs(f(x0)))

{
printf("\n\t\t The root is near to %.4f\n",x0);
}
x0=(x0+x1)/2;
for(;i<=itr;i++)
{
f0=f(x0);
df0=df(x0);
x1=x0 - (f0/df0);
printf("\n\t\t The %d approximation to the root is:%f",i,x1);
error=fabs(x1-x0);
if(error<EPS)
{
Step-3. break;
Step-4. }
x0 = x1;
Step-5. }
Step-6. if(error>EPS)
{
Step-7. printf("\n\n\t NOTE:- ");
Step-8. printf("The number of iterations are not sufficient.");
}
Step-9. printf("\n\n\n\t\t\t ------------------------------");
printf("\n\t\t\t The root is %.4f ",x1);
Step-10. printf("\n\t\t\t ------------------------------");
Step-11. }

5. ALGORITHM FOR ITERATION
METHOD. Algorithm 1
Step-1. Read x0, e, n

x0 is the initial guess, e is the allowed error in root, n is total iterations to be
allowed for convergence.
Step-2. x1 ← g(x0)
Steps 4 to 6 are repeated until the procedure converges to a root or
iterations reach n.
For i = 1 to n in steps of 1
do x0 ← x1
x1 ← g(x0)
If ≤ e then, GO TO 9
end for.
Write „Does not converge to a root‟, x0,
x1 Stop
Write „converges to a root‟, i,
x1 Stop.
Algorithm 2 (Iteration Method)
Step-1. Define function f(x)

Step-2. Define function df(x)
Step-3. Get the value of a, max_err.
Step-4. Initialize j
Step-5. If df(a) < 1 then b = 1, a = f(a)
Step-6. Print root after j, iteration is f(a)
Step-7. If fabs(b – a) > max_err then
Step-8. j++, goto (5)
Step-9. End if
Step-10. Else print root doesn‟t exist
Step-11. End.
PROGRAM: ITERATION METHOD.
#include<stdio.h>
#include<math.h>
#include<conio.h>
#define EPS 0.00005
#define F(x) (x*x*x + 1)/2
#define f(x) x*x*x - 2*x + 1
void ITER();
void main ()
{
clrscr();
printf("\n\t Solution by ITERATION method - ");
printf("\n\t Equation is - ");

printf("\n\t\t\t\t X*X*X - 2*X + 1 = 0\n");
ITER();
getch();
}
void ITER()
{
float x1,x2,x0,f0,f1,f2,error;
int i=0,n;
for(x1=1;;x1++)
{
f1=F(x1);
if (f1>0)
break;
}
for(x0=x1-1;;x0--)
{
f0=f(x0);
if(f0<0)
break;
}
x2=(x0+x1)/2;
printf("Enter the number of iterations:- ");
scanf("%d",&n);
printf("\n\t\t The 1 approximation to the root is:- %f",x2);
for(;i<n-1;i++)
{
f2=F(x2);
printf("\n\t\t The %d approximation to the root is:- %f",i+2,f2);
x2=F(x2);
error=fabs(f2-f1);
if(error<EPS)
break;
f1=f2;
}
if(error>EPS)
printf("\n\n\t NOTE:- The number of iterations are not sufficient.");
printf("\n\n\n\t\t\t------------------------------");
printf("\n\t\t\t The root is %.4f",f2);
printf("\n\t\t\t-----------------------------");
}
6. ALGORITHM OF TRAPEZOIDAL RULE

Step-2. Input Lower limit a
Step-3. Input Upper Limit b
Step-4. Input number of sub intervals n
Step-5. h=(b-a)/n
Step-6. sum=0
Step-7. sum=fun(a)+fun(b)
Step-8. for i=1; i<n; i++
Step-9. sum +=2*fun(a+i)
Step-10. End Loop i
Step-11. result =sum*h/2;
Step-12. Print Output result
Step-13. End of Program
Step-14. Start of Section fun
Step-15. temp = 1/(1+(x*x))
Step-16. Return temp
Step-17. End of Section fun.
PROGRAM: TRAPEZOIDAL METHOD.
# include <stdio.h>
# include <conio.h>
# include <math.h>
float fun(float); void
main()
{
float result=1;
float a,b; float
h,sum; int i,j;
int n;
clrscr();
printf("\n\n Enter the range - ");
printf("\n\n Lower Limit a - ");
scanf("%f" ,&a); printf("\n\n
Upper Limit b - "); scanf("%f"
,&b);
printf("\n\n Enter number of subintervals -
"); scanf("%d" ,&n);
h=(b-a)/n; sum=0;
sum=fun(a)+fun(b);
for(i=1;i<n;i++)
{
sum+=2*fun(a+i);
}
result=sum*h/2;
printf("n\n\n\n Value of the integral is
%6.4f\t",result); printf("\n\n\n Press Enter to Exit");
getch();
}
float fun(float x)
{
float temp;
temp = 1/(1+(x*x));
return temp;
}

rd
7. ALGORITHM OF SIMPSON’S 1/3 RULE

Step-3. Input Upper limit b
Step-4. Input number of subintervals n
Step-5. h=(b–a)/n
Step-6. sum=0
Step-7. sum=fun(a)+4*fun(a+h)+fun(b)
Step-8. for i=3; i<n; i + = 2
Step-9. sum + = 2*fun(a+(i – 1)*h) + 4*fun(a+i*h)
Step-10. End of loop i
Step-11. result=sum*h/3
Step-15. temp = 1/(1+(x*x))
Step-17. End of Section fun
rd
PROGRAM: SIMPSON’S 1/3 METHOD OF NUMERICAL INTEGRATION
#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<process.h>
#include<string.h>
float fun(float);
void main()
{
float result=1;
float a,b;
float sum,h;
int i,j,n;
clrscr();
printf("\n Enter the range - ");
printf("\n Lower Limit a - ");
scanf("%f",&a)
;printf("\n Upper limit b - ");
scanf("%f",&b);
printf("\n\n Enter number of subintervals - ");
scanf("%d",&n);
h=(b-a)/n;
sum=0;
sum=fun(a)+4*fun(a+h)+fun(b);
for(i=3;i<n;i+=2)
{
sum+=2*fun(a+(i-1)*h)+4*fun(a+i*h);
}
result=sum*h/3;
printf("\n\nValue of integral is %6.4f\t",result);
getch();}
float fun(float x)
{
float temp;
temp=1/(1+(x*x));
return temp;
}
th
8. ALGORITHM OF SIMPSON’S 3/8 RULE

Step-3. Input Upper limit b
Step-4. Input number of sub itervals n
Step-5. h = (b – a)/n
Step-6. sum = 0
Step-7. sum = fun(a) + fun (b)
Step-8. for i = 1; i < n; i++
Step-9. if i%3=0:
Step-10. sum + = 2*fun(a + i*h)
Step-11. else:
Step-12. sum + = 3*fun(a+(i)*h)
Step-13. End of loop i
Step-14. result = sum*3*h/8
Step-18. temp = 1/(1+(x*x))
Step-20. End of section fun
th
PROGRAM: SIMPSON’S 3/8 METHOD OF NUMERICAL INTEGRATION
#include<stdio.h>
#include<conio.h>
float fun(int);
void main()
{
int n,a,b,i;
float h, sum=0, result;
//clrscr();
printf("enter range");
scanf("%d",&n);
printf("enter lower limit");
scanf("%d",&a);
printf("enter upper limit");
scanf("%d",&b);
h=(b-a)/n;
sum=fun(a)+fun(b);
for(i=0;i<n;i++)
{
if (i%2==0)
sum+=2*fun(a+i*h);
else
sum+=3*fun(a+i*h);
}
result=sum*3/8*h;
printf("%f", result);
getch();
}
float fun(int x)
{
float val;
val=1/(1+(x*x));
return(val);
}
9. Algorithm for Newton’s Forward method of interpolation
Step-1. Start of the program

Step-2. Input number of terms n
Step-3. Input the array ax
Step-4. Input the array ay
Step-5. h=ax[1] – ax[0]
Step-6. for i=0; i<n-1; i++
Step-7. diff[i] [1]=ay[i + 1] – ay[i]
Step-8. End Loop i
Step-9. for j=2; j<=4; j++
Step-10. for i = 0; i <n – j; i++
Step-11. diff[i][j]=diff [i + 1] [j – 1]-diff [i][j – 1]
Step-12. End Loop i
Step-13. End Loop j
Step-14. i=0
Step-15. Repeat Step 16 until ax[i]<x
Step-16. i=i + 1
Step-17. i=i – 1;
Step-18. p=(x – ax [i])/h
Step-19. y1=p*diff[i – 1][1]
Step-20. y2=p*(p+1)*diff [i – 1][2]/2
Step-21. y3=(p+1)*p*(p-1)*diff[i –2 ][3]/6
Step-22. y4=(p+2)*(p+1)*p*(p – 1)*diff[i – 3][4]/24
Step-23. y=ay[i]+y1+y2+y3+y4
Step-24. Print output x, y
Step-25. End of program.
PROGRAM: NEWTON’S FORWORD METHOD OF INTERPOLATION
# include <stdio.h>
# include <conio.h>
# include <math.h>
void main()
{
int n; int i,j;
float ax[10];
float ay[10];
float x; float
y = 0; float
h; float p;
float diff[20][20];
float y1,y2,y3,y4;
clrscr();
printf("\n Enter the number of terms -
"); scanf("%d",&n);
printf("Enter the value in the form of x - ");
for (i=0;i<n;i++)
{
printf("Enter the value of x%d -
",i+1); scanf("%f",&ax[i]);
}
printf("\n Enter the value in the form of y -
"); for (i=0;i<n;i++)
{
printf ("Enter the value of y%d - ",
i+1); scanf ("%f",&ay [i]);
}
printf("\nEnter the value of x for");
printf("\nwhich you want the value of y -
"); scanf("%f",&x);
h=ax[1]-ax[0];
for(i=0;i<n-1;i++)
{
diff[i][1]=ay[i+1]-ay[i];
}
for(j=2;j<=4;j++)
{
for(i=0;i<n-j;i++)
{

diff[i][j]=diff[i+1][j-1]-diff[i][j-1];
}
}
i=0;
do
{
i++;
}
while(ax[i]<x);
i--;
p=(x-ax[i])/h;
y1=p*diff[i-1][1];
y2=p*(p+1)*diff[i-1][2]/2;
y3=(p+1)*p*(p-1)*diff[i-2][3]/6;
y4=(p+2)*(p+1)*p*(p-1)*diff[i-3][4]/24;
y=ay[i]+y1+y2+y3+y4;
printf("\nwhen x=%6.4f, y=%6.8f ",x,y);

getch();
}

PROGRAM: GAUSS’S BACKWARD METHOD OF INTERPOLATION.
# include <stdio.h>
# include <conio.h>
# include <math.h>
void main()
{
int n;
int i,j; float
ax[10]; float
ay[10]; float x;
float y=0;
float h;
float p;
float diff[20][20];
float y1,y2,y3,y4;
clrscr();
printf("\n Enter the number of terms - ");
scanf("%d",&n);
printf("\n Enter the value in the form of x - ");
for (i=0;i<n;i++)
{
printf("\n\n Enter the value of x%d - ",i+1);
scanf("%f",&ax[i]);
}
printf("\n\n Enter the value in the form of y - ");
for(i=0;i<n;i++)
{
printf("\n Enter the value of y%d - ",i+1);
scanf("%f",&ay[i]);
}
printf("\nEnter the value of x for - ");
printf("\nwhich you want the value of y - ");
scanf("%f",&x);
h=ax[1]-ax[0];
for(i=0;i<n-1;i++)
{
}
for(j=2;j<=4;j++)
{
for(i=0;i<n-j;i++)
{

}
}
i=0;
do {
i++;
}
while (ax[i]<x);
i--;
p=(x-ax[i])/h;
y1=p*diff[i-1][1];
y2=p*(p+1)*diff[i-1][2]/2;
y3=(p+1)*p*(p-1)*diff[i-2][3]/6;
y4=(p+2)*(p+1)*p*(p-1)*diff[i-3][4]/24;
printf("\nwhen x=%6.1f,y=%6.4f ",x,y);
getch();
}

13. Algorithm to implement BESSELS INTERPOLATION FORMULA

Program to implement BESSELS INTERPOLATION FORMULA in C.
#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<process.h>
#include<conio.h>
void main()
{
int n; // no. of terms.
int i,j; // Loop variables
float ax[10]; // 'X' array limit 9
float ay[10]; // 'Y' array limit 9
float x; // User Query for what value of X
float y; // Calculated value for coressponding X.
float h; // Calc. Section
float p; // Calc. Section
float diff[20][20]; // to store Y
float y1,y2,y3,y4; // Formulae variables.
clrscr();
printf("\t\t !! BESSELS INTERPOLATION FORMULA!!
"); // Input section.
printf("\n\n Enter the no. of terms -> ");
scanf("%d",&n);
// Input Sequel for array X

printf("\n\n Enter the value in the form of x -> ");
// Input loop for X.
for(i=0;i<n;i++)
{
printf("\n Enter the value of x%d -> ",i+1);
scanf("%f",&ax[i]);
}
// Input sequel for array Y.

printf("\n\n Enter the value in the form of y -> ");
// Input loop for Y.
for(i=0;i<n;i++)
{
printf("\n Enter the value of y%d -> ",i+1);
scanf("%f",&ay[i]);
}
// Inputting the required value quarry

printf("\n\n Enter the value of x for ");

printf("\n which u want the value of y -> ");
scanf("%f",&x);
// Calculation and processing

section. h=ax[1]-ax[0]; for(i=0;i<n-
1;i++)
for(j=2;j<=4;j++)
for(i=0;i<n-j;i++)
i=0;
do
{
i++;
}
while(ax[i]<x);
i--;
p=(x-ax[i])/h;
y1=p*diff[i][1];
y2=p*(p-1)*(diff[i][2]+diff[i-1][2])/4;
y3=p*(p-1)*(p-0.5)*diff[i-1][3]/6;
y4=(p+1)*p*(p-1)*(p-2)*(diff[i-2][4]+diff[i-1][4])/48;
// Taking sum
// Outut Section
printf("\n When x = %6.2f , y = %6.8f",x,y);
// Invoke user watch halt function

printf("\n\n\n\t\t\t !! PRESS ENTER TO EXIT !! ");
getch();
}

14. Algorithm of Sterling’s Interpolation Formula

Step-5. h = ax[1]-ax[0]
Step-6. for i = 1;i < n-1; i++
Step-7. diff [i][1] = ay[i + 1]-ay[i]
Step-8. End loop i
Step-9. for j = 2; j < = 4; j++
Step-10. for i = 0; i < n-j; i++
Step-11. diff[i][j] = diff[i + 1][j-1]-diff[i][j-1]
Step-12. End loop i
Step-13. End loop j
Step-14. i=0
Step-15. Repeat step 16 until ax[i] < x
Step-16. i=i+1
Step-17. i = i-1;
Step-18. p = (x-ax[i])/h
Step-19. y1= p*(diff[i][1] + diff[i-1][1])/2
Step-20. y2 = p*p*diff[i-1][2]/2
Step-21. y3 = p*(p*p-1)*(diff[i-1][3]+diff[i-2][3])/6
Step-22. y4 = p*p*(p*p-1)*diff[i-2][4]/24
Step-23. y = ay[i]+y1 + y2 + y3 + y4
Step-25. End of program

PROGRAM: STERLING’S METHOD OF INTERPOLATION.
#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<process.h>
void main()
{
int n;
int i,j;
float ax[10];
float ax[10];
float h;
float p;
float diff[20][20];
float x,y;
float y1,y2,y3,y4;
clrscr();
printf("\n Enter the value of terms");
scanf("%d",%n);
printf(”\n Enter the values for x \n”);
for(i=0;i<n;i++)
{
printf("\n Enter the value for x%d-",i+1);
scanf("%f”,&ax[i]);
}
printf("\n Enter the values for y \n");
for(i=0;i<n;i++)
{
printf("\n Enter the value for y%d-",i+1);
scanf("%f",&ay[i]);
}
printf("\n Enter the value of x for");
printf("\n which you want the value of y");
scanf("%f",&x);
h=ax[1]-ax[0];
for(i=0;i<n-1;i++)
{
}
for(j=2;j<=4;j++)
{
for(i=0;i<n-j;i++)
{
}

}
i=0;
do {
i++;
}
while(ax[i]<x);
i--;
p=(x-ax[i])/h;
y1=p*(diff[i][1]+diff[i-1][1])/2;
y2=p*p*diff[i-1][2]/2;
y3=p*(p*p-1)*(diff[i-1][3]+diff[i-2][3])/6;
y4=p*p*(p*p-1)*diff[i-2][4]/24;
printf("\n\n When x=%6.2f, y=%6.8f",x,y);
getch();
}

15. Algorithm to implement Newton’s Divided Difference formula.

Program to implement Newton’s Divided Difference formula.
#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
float x[10],y[10][10],sum,p,u,temp;
int i,n,j,k=0,f,m;
float fact(int);
clrscr();
printf("\nhow many record you will be enter: ");
scanf("%d",&n);
for(i=0; i<n; i++)
{
printf("\n\nenter the value of x%d: ",i);
scanf("%f",&x[i]);
printf("\n\nenter the value of f(x%d): ",i);
scanf("%f",&y[k][i]);
}
printf("\n\nEnter X for finding f(x): ");
scanf("%f",&p);
for(i=1;i<n;i++)
{
k=i;
for(j=0;j<n-i;j++)
{
y[i][j]=(y[i-1][j+1]-y[i-1][j])/(x[k]-x[j]);
k++;
}
}
printf("\n_____________________________________________________\n");
printf("\n x(i)\t y(i)\t y1(i) y2(i) y3(i) y4(i)");
printf("\n_____________________________________________________\n");
for(i=0;i<n;i++)
{
printf("\n %.3f",x[i]);
for(j=0;j<n-i;j++)
{
printf(" ");
printf(" %.3f",y[j][i]);
}
printf("\n");

i=0;
do
{
if(x[i]<p && p<x[i+1])
k=1;
else
i++;
}while(k != 1);
f=i;
sum=0;
for(i=0;i<n-1;i++)
{
k=f;
temp=1;
for(j=0;j<i;j++)
{
temp = temp * (p - x[k]);
k++;
}
sum = sum + temp*(y[i][f]);
}
printf("\n\n f(%.2f) = %f ",p,sum);
getch();
}

16. Algorithm of LAGRANGE’S INTERPOLATION FORMULA.
Step-1. Start of the program

Step-5. for i=0; i<n; i++
Step-6. nr=1
Step-7. dr=1
Step-8. for j=0; j<n; j++
Step-9. if j !=i
a. nr=nr*(x-ax[j])
Step-10. b.dr*(ax[i]-ax[j])
Step-11. End Loop j
Step-12. y+=(nr/dr)∗ay[i]
Step-13. End Loop i
Step-14. Print Output x, y

PROGRAM: LAGRANGE’S INTERPOLATION FORMULA.
#include<stdio.h>
#include<conio.h>
#define MAX 10
void main()
{
float x[MAX],y[MAX],k=0,z,nr,dr;
int i,j,m;
//clrscr();
printf("\n enter the range ");
scanf("%d",&m);
printf("\n enter the x value ");
for(i=0;i<m;i++)
scanf("%f",&x[i]);
printf("\n enter the y value ");
for(i=0;i<m;i++)
scanf("%f",&y[i]);
printf("\n enter value OF Z to be calculated ");
scanf("%f",&z);
for(i=0;i<m;i++)
{ nr=1;dr=1;
for(j=0;j<m;j++)
{
if (j!=i)
{
nr=nr*(z-x[j]);
dr=dr*(x[i]-x[j]);
}
}
k=k+((nr/dr)*y[i]);
}
printf("\n final result=%f\n",k);
getch();
}

17. Algorithm to implement Numerical Differentiations.

Program to implement Numerical Differentiations.
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
float F (float x);
void deriv (float f(float), float x, int n, float h, float **D)

{
int i, j;
unsigned powerof4;
for (i = 0; i <= n; i++)

{
D[i][0] = ( f(x+h) - f(x-h) ) / (2.0 * h);
powerof4 = 1;
for (j = 0; j < i; j++)
{
powerof4 <<= 2; /* this value is equivalent to pow(4,j+1) */
D[i][j+1] = D[i][j] + (D[i][j] - D[i-1][j]) / (powerof4 -1);
}
h *= 0.5;
}
}
float F (float x)
{
return (sin(x));
}
void main()
{
int n = 10;
int i, j;
float h = 1.0;
float **D, pi3, F(float);
D = calloc((n+1), sizeof(float *));

for (i=0; i<=n; i++)
D[i] = calloc((n+1), sizeof(float));
pi3 = 4.0 * atan(1.0)/3.0;
deriv(F, pi3, n, h, D); /* to allow multiple functions to be called */

/**********************************************************************/
/* Programmer's comment: */
/* if only one function will be called, there's no need to pass the */
/* function as argument. In that case, the procedure deriv will have */
/* this format: void deriv(float, int, float, float **) */
/* */
/**********************************************************************/
for (i = 0; i < n; i++)

for (j = 0; j <= i; j++)
printf(" D[%d][%d] = %14f\n", i, j, D[i][j]);
for (i=0; i<=n; i++)

free(D[i]);
free(D);
}

18. Algorithm to implement Least Square Method for curve fitting.

Program to implement Least Square Method for curve fitting.
#include<stdio.h>
#include<conio.h>
#include<math.h>
main()
{
float x[10],y[10],a[10][10];
int i,j,k,n,itr;
printf("\n ENTER THE SIZE OF MATRIX
n:"); scanf("%d",&n);
printf("\n ENTER MATRIX ELEMENTS AND RHS:\n");
for(i=1;i<=n;i++)
{
for(j=1;j<=n+1;j++)
scanf("%f",&a[i][j]);
}
for(i=1;i<=n;i++)
{
x[i]=0.0;
y[j]=0.0;
}
itr=0.0;
top:
itr=itr+1;
for(i=1;i<=n;i++)
{
x[i]=a[i][n+1];
for(j=1;j<=n;j++)
{
if(i==j)
continue;
else
x[i]=x[i]-a[i][j]*x[j];
}
x[i]=x[i]/a[i][j];
}
for(k=1;k<=n;k++)
if(fabs(x[k]-y[k])>0.0001)
{
printf("\n ITERATION=%d}",itr);
for(i=1;i<=n;i++)
{
y[i]=x[i];
printf("\n x(%d)=%f",i,x[i]);

}
goto top;
}
else
continue;
return;

19. Algorithm to draw frequency chart like histogram, frequency curve and pie-
chart etc.

Program to draw frequency chart like histogram, frequency curve and pie-chart etc.

Numerical Techniques Lab Manual

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Numerical Techniques Lab Manual

Uploaded by

Copyright:

Available Formats

Numerical Techniques

Dev Bhoomi Institute Of Technology LABORATORY MANUAL

EXPERIMENT NO. ISSUE NO. : ISSUE DATE:

REV. NO. : REV. DATE : PAGE:

LABORATORY Name & Code: SEMESTER:

7. To implement Numerical Integration using Simpson 1/3 rule.

8. To implement Numerical Integration Simpson 3/8 rule.

9. To implement Newton‟s Forward Interpolation formula.

10. To implement Newton‟s Backward Interpolation formula.

11. To implement Gauss Forward Interpolation formula.

12. To implement Gauss Backward Interpolation formula.

13. To implement Bessel‟s Interpolation formula.

14. To implement Sterling‟s Interpolation formula.

15. To implement Newton‟s Divided Difference formula.

16. To implement Langrange‟s Interpolation formula.

17. To implement Numerical Differentiations.

18. To implement Least Square Method for curve fitting.