JIS College of Engineering

Department of Computer Science and Engineering

Numerical Methods Lab

Manual

Prepared By:
Sainik Kumar Mahata

Numerical Methods Lab Manual

List of Programs
1. To deduce error involved in polynomial equation.
2. To Find out the root of the Algebraic and Transcendental equations using Bisection method.
3. To Find out the root of the Algebraic and Transcendental equations using Regula-Falsi
method.
4. To Find out the root of the Algebraic and Transcendental equations
using
NewtonRaphson method.
5. To Find out the root of the Algebraic and Transcendental equations
using
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 Newtons Forward Interpolation formula.
10. To implement Newtons Backward Interpolation formula.
11. To implement Gauss Forward Interpolation formula.
12. To implement Gauss Backward Interpolation formula.
13. To implement Bessels Interpolation formula.
14. To implement Sterlings Interpolation formula.
15. To implement Newtons Divided Difference formula.
16. To implement Langranges Interpolation formula.
17. To implement Numerical Differentiations.
18. To implement Least Square Method for curve fitting.

Numerical Methods Lab Manual

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

Numerical Methods Lab Manual

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();
}

Page 3

Numerical Methods Lab Manual

2.

Algorithm of BISECTION METHOD.

Step-1.

Start of the program.

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.

Page 4

Numerical Methods Lab Manual

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----------------------------------------- ");

Page 5

Numerical Methods Lab Manual

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();
}

");

");

Page 6

Numerical Methods Lab Manual

3.

Algorithm of FALSE POSITION or REGULA-FALSI METHOD.

Step-1.

Start of the program.

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

Step-12.

else

Step-13.

X0 = x2 & f0 = f2

Step-14.

End loop

Step-15.

Print output

Step-16.

End the program.

& f1 = f2

Page 7

Numerical Methods Lab Manual

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++)
Page 8

Numerical Methods Lab Manual

{
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();
}

Page 9

Numerical Methods Lab Manual

4.

Algorithm of NEWTON-RAPHSON METHOD.

Step-1.

Start of the program.

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.

Page 10

Numerical Methods Lab Manual

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);
}
Page 11

Numerical Methods Lab Manual

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)
{
break;
}
x0 = x1;
}
if(error>EPS)
{
printf("\n\n\t NOTE:- ");
printf("The number of iterations are not sufficient.");
}
printf("\n\n\n\t\t\t ------------------------------");
printf("\n\t\t\t The root is %.4f ",x1);
printf("\n\t\t\t ------------------------------");
}

Page 12

Numerical Methods Lab Manual

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.
Step-3.
Step-4.

For i = 1 to n in steps of 1 do
x0 x1

Step-5.

x1 g(x0)

Step-6.

If e then, GO TO 9
end for.

Step-7.
Step-8.
Step-9.

Write Does not converge to a root, x0,

x1 Stop

Step-10.
Step-11.

Write converges to a root, i,

x1 Stop.

Page 13

Numerical Methods Lab Manual

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 doesnt exist

Step-11. End.

Page 14

Numerical Methods Lab Manual

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);
Page 15

Numerical Methods Lab Manual

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-----------------------------");
}

Page 16

Numerical Methods Lab Manual

6.

ALGORITHM OF TRAPEZOIDAL RULE

Step-1.

Start of the program.

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.

Page 17

Numerical Methods Lab Manual

PROGRAM: TRAPEZOIDAL METHOD.
# 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
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;
}

Page 18

Numerical Methods Lab Manual

7.

ALGORITHM OF SIMPSONS 1/3

rd

RULE

Step-1.

Start of the program.

Step-2.

Input Lower limit a

Step-3.

Input Upper limit b

Step-4.

Input number of subintervals n

Step-5.

h=(ba)/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-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

Page 19

Numerical Methods Lab Manual

PROGRAM: SIMPSONS 1/3

rd

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;
}

Page 20

Numerical Methods Lab Manual

8.

ALGORITHM OF SIMPSONS 3/8

Step-1.

Start of the program.

Step-2.

Input Lower limit a

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:

th

RULE

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-15. Print Output result
Step-16. End of Program
Step-17. Start of Section fun
Step-18. temp = 1/(1+(x*x))
Step-19. Return temp
Step-20. End of section fun

Page 21

Numerical Methods Lab Manual

PROGRAM: SIMPSONS 3/8

th

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=(ba)/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);
}

Page 22

Numerical Methods Lab Manual

9.

Algorithm for Newtons 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.

Page 23

Numerical Methods Lab Manual

PROGRAM: NEWTONS FORWORD METHOD OF INTERPOLATION
# include <stdio.h>
# include <conio.h>
# include <math.h>
# include <process.h>
# include <string.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++)
{
Page 24

Numerical Methods Lab Manual

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

Page 25

Numerical Methods Lab Manual

10.

Algorithm for Newtons Backward 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<n1; 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<nj; i++

Step-11. diff[i][j]=diff[i+1][j1]diff [i][j1]
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. x0=mx[i]
Step-18. sum=0
Step-19. y0=my[i]
Step-20. fun=1
Step-21. p=(xx0)/h
Step-22. sum=y0
Step-23. for k=1; k<=4; k++
Step-24. fun=(fun*(p(k1)))/k
Step-25. sum=sum+fun*diff[i][k]
Step-26. End loop k
Step-27. Print Output x,sum
Step-28. End of Program

Page 26

Numerical Methods Lab Manual

PROGRAM: NEWOTNS BACKWARD METHOD OF INTERPOLATION
#include<stdio.h>
#include<conio.h>
#include<math.h>
#include<process.h>
#include<string.h>
void main()
{
int n,i,j,k;
float mx[10],my[10],x,x0=0,y0,sum,h,fun,p,diff[20][20],y1,y2,y3,y4;
clrscr();
printf("\n enter the no. of terms ");
scanf("%d",&n);
printf("\n enter the value in the form of x - ");
for(i=0;i<n;i++)
{
printf("\n enter the value of x%d",i+1);
scanf("%f",&mx[i]);
}
printf("\n enter the value in the form of y - ");
for(i=0;i<n;i++)
{
printf("\n\n enter the value of y%d- ",i+1);
scanf("%f",&my[i]);
}
printf("\n enter the value of x for");
printf("\nwhich you want the value of of y -");
scanf("%f",&x);h=mx[1]-mx[0];
for(i=0;i<n-1;i++)
{
diff[i][1]=my[i+1]-my[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;
while(!mx[i]>x)
{
i++;
Page 27

Numerical Methods Lab Manual

}
x0=mx[i];
sum=0;
y0=my[i];
fun=1;
p=(x-x0)/h;
sum=y0;
for(k=1;k<=4;k++)
{
fun=(fun*(p-(k-1))/k);
sum=sum+fun*diff[i][k];}
printf("\n when x=%6.4f,y=%6.8f",x,sum);
printf("\n press enter to exit");
getch();
}

Page 28

Numerical Methods Lab Manual

11.

Algorithm of GAUSS FORWARD interpolation formula

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<n1;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<nj;i++

Step-11. diff[i][j]=diff[i+1][j1]diff[i][j1]
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=i1;
Step-18. p=(xax[i])/h
Step-19. y1=p*diff[i][1]
Step-20. y2=p*(p1)*diff[i1][2]/2
Step-21. y3=(p+1)*p*(p-1)*diff[i2][3]/6
Step-22. y4=(p+1)*p*(p1)*(p2)*diff[i3][4]/24
Step-23. y=ay[i]+y1+y2+y3+y4
Step-24. Print Output x,y
Step-25. End of Program

Page 29

Numerical Methods Lab Manual

PROGRAM: GAUSSS FORWORD METHOD OF INTERPOLATION
# include <stdio.h>
# include <conio.h>
# include <math.h>
# include <process.h>
# include <string.h>
void main()
{
int n;
int i,j;
float ax[10];
float ay[10];
float x;
float nr,dr;
float y=0; float h;
float p;
float diff[20][20];
float y1,y2,y3,y4;
clrscr();
printf(" 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(" Enter the value of x%d - ",i+1);
scanf("%f",&ax[i]);
}
printf(" 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++)
{
Page 30

Numerical Methods Lab Manual

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

Page 31

Numerical Methods Lab Manual

12.

Algorithm of Gausss Backward interpolation formula

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-l;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<nj;i++

Step-11. diff[i][j]=diff[i+1][j1]diff[i][j1]
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=i1;
Step-18. p=(xax[i])/h
Step-19. y1=p*diff[i-1][1]
Step-20. y2=p*(p+1)*diff[i1][2]/2
Step-21. y3=(p+1)*p*(p-1)*diff[i2][3]/6
Step-22. y4=(p+2)*(p+1)*p*(p1)*diff[i3][4]/24
Step-23. y=ay[i]+y1+y2+y3+y4
Step-24. Print Output x,y
Step-25. End of Program

Page 32

Numerical Methods Lab Manual

PROGRAM: GAUSSS BACKWARD METHOD OF INTERPOLATION.
# include <stdio.h>
# include <conio.h>
# include <math.h>
# include <process.h>
# include <string.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++)
{
diff[i][1]=ay[i+1]-ay[i];
}
for(j=2;j<=4;j++)
{
for(i=0;i<n-j;i++)
{

- ");

Page 33

Numerical Methods Lab Manual

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

Page 34

Numerical Methods Lab Manual

13.

Algorithm to implement BESSELS INTERPOLATION FORMULA

Page 35

Numerical Methods Lab Manual

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;
int i,j;
float ax[10];
float ay[10];
float x;
float y;
float h;
float p;
float diff[20][20];
float y1,y2,y3,y4;

// no. of terms.
// Loop variables
// 'X' array limit 9
// 'Y' array limit 9
// User Query for what value of X
// Calculated value for coressponding X.
// Calc. Section
// Calc. Section
// to store Y
// 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
Page 36

Numerical Methods Lab Manual

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++)
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=(xax[i])/h;
y1=p*diff[i][1];
y2=p*(p-1)*(diff[i][2]+diff[i-1][2])/4; y3=p*(p-1)*(p0.5)*diff[i-1][3]/6; y4=(p+1)*p*(p-1)*(p-2)*(diff[i2][4]+diff[i-1][4])/48;
// Taking sum
y=ay[i]+y1+y2+y3+y4;
// 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();
}

Page 37

Numerical Methods Lab Manual

14.

Algorithm of Sterlings Interpolation Formula

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 = 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-24. Print output
Step-25. End of program

Page 38

Numerical Methods Lab Manual

PROGRAM: STERLINGS 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++)
{
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];
}
Page 39

Numerical Methods Lab Manual

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

Page 40

Numerical Methods Lab Manual

15.

Algorithm to implement Newtons Divided Difference formula.

Page 41

Numerical Methods Lab Manual

Program to implement Newtons 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<ni;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");
Page 42

Numerical Methods Lab Manual

}
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();
}

Page 43

Numerical Methods Lab Manual

16.

Algorithm of LAGRANGES INTERPOLATION FORMULA.

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.

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
Step-15. End of Program

Page 44

Numerical Methods Lab Manual

PROGRAM: LAGRANGES 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();
}

Page 45

Numerical Methods Lab Manual

17.

Algorithm to implement Numerical Differentiations.

Page 46

Numerical Methods Lab Manual

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 */

Page 47

Numerical Methods Lab Manual

/**********************************************************************/
*/
/* 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);
}

Page 48

Numerical Methods Lab Manual

18.

Algorithm to implement Least Square Method for curve fitting.

Page 49

Numerical Methods Lab Manual

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]);
Page 50

Numerical Methods Lab Manual

}
goto top;
}
else
continue;
return;
}

Page 51