Simple Itrative

#include
#include
#include
#include
#define f(x) 0.5*(cos(x)+3)
int n;
float e,x0,x1;
void main(void)
{
int i,n,flag=1;
float x2;
char ch;
cout<<"\n\n\tSIMPLE ITRATIVE METHOD";
cout<<"\n\n\tENTER THE VALUE OF X0 :";
cin>>x0;
cout<<"\n\n\tENTER THE VALUE OF E :";
cin>>e;
cout<<"\n\n\tENTER THE VALUE OF N :";
cin>>n;
x1=f(x0);
for(i=0;i {
x2=x1-x0;
if(x2<0)
x2=x2*(-1);
if(x2 flag=0;
else
{
x0=x1;
x1=f(x0);
}
}
if(flag==1)
{
cout<<"\n\n\tNO Convergence";
getch();
}
else
{
cout<<"\n\nAfter\t"< getch();
}
}
Download

Secnt Method

#include
#include
#include
#define f(x) (sin(x)-5*x+2)
int n;
float e,X0,x1;
void main(void)
{
int i,flag;
float x2,f1,f0,x3,temp,denom;
char ch;
cout<<"\n\n\tSECANT METHOD";
cout<<"\n\n\tENTER THE VALUE OF X0 :";
cin>>x0;
cout<<"\n\n\tENTER THE VALUE OF X1 :";
cin>>x1;
cout<<"\n\n\tENTER THE VALUE OF N :";
cin>>n;
cout<<"\n\n\tENTER THE VALUE OF E :";
cin>>e;
for(i=0;i {
f0=f(x0);
f1=f(x1);
denom=f1-f0;
temp=denom;
if(temp=<0)
temp=temp*(-1);
if(temp {
cout<<"\n\n\tDENOMINATOR TOO SMALL";
flag=0;
break;
}
x2=((x0*f1)-(x1*f0))/denom;
x3=x2-x1;
if(x3<0)
x3=x3*(-1);
if(x3 {
cout<<"\n\n\tAFTER"< flag=0;
}
x0=x1;
x1=x2;
}
if(flag=1)
cout<<"\n\n\tNO CONVERGENCE";
getch();
}
Download

Regula Falsi

#include
#include
#inclde
#define f(x)(sin(x)-5*x+2)
int n;
float e,x0,x1;
void main(void)
{
int i,flag=1;
float x2,f1,f0,x3,temp,denom,x4,f,f2;
char ch;
cout<<"\n\n\tRegula Falsi Method";
cout<<"\n\n\tEnter The Vale Of X0\t";
cin>>x0;
cout<<"\n\n\tEnter The Vale Of X1:";
cin>>x1;
cout<<"\n\n\tEnter The Vale Of N:";
cin>>n;
cout<<"\n\n\tEnter The Vale Of E:";
cin>>e;
for(i=0;i {
f0=f(x0);
f1=f(x1);
denom=f1-f0;
temp=denom;
if(temp=<0)
temp=temp*(-1);
if(temp {
cout<<"\n\n\tDenominator Too Small";
flag=0;
break;
}
f=f0*f1;
if(f>0)
{
cout<<"\n\n\tThere is no root";
flag=0;
break;
}
x2=((x0*f1)-(x1*f0))/denom;
f2=f(x2);
f=f2*f1;
x3=x2-x1;
if(x3<0)
x3=x3*(-1);
if(x3 {
cout<<"\n\n\tAfter\t"< getch();
flag=0;
}
if(f<0)
x0=x2;
else
x1=x2;
x4=x1-x0;
if(x4<0)
x4=x4*(-1);
if(x4 {
cout<<"\n\nNo Convergence";
getch();
flag=0;
}
}
if(flag=1)
{
cout<<"\n\n\tValue of root :"< getch();
}
}
Download

Newton FRWD nd BACKWRD

#include
#include
#inlude
float interval,x0,p,array[20][20]={0.0};
int no,col,x,y;
void difftable()
{
cout<<"\tDIFFERENET TABLE";
cout<<"\n\n\tENTER THE FIRST VALUE: ";
cin>>array[0][0];
cout<<"\n\tENTER THE INTERVAL : ";
cin>>interval;
cout<<"\n\tENTER TOTAL NO. OF X:";
cin>>no;
for(int i=1;i {
array[i][0]=array[i-1][0]+interval;
}
cout<<"\n\tENTER FUNCTIONAL VALUES :\n";
for(i=0;i {
cout<<"\tX("< cin>>array[i][1];
}
cout<<"\n\tHOW MANY COLUMNS ARE REQUIRED :";
cin>>col;
for(i=2;i<=(col+2);i++)
{
for(int j=0;j<=(no-i);j++)
{
array[j][i]=array[j+1][i-1]-array[j][i-1];
}
}
clrscr();
cout<<""\t\tDIFFERENCE TABLE\n";
cout< for(j=1;i<=col;i++)
{
cout<<" col "< }
cout<<"\n";
for(i=0;i {
cout<<" "< }
x=8;y=3;
for(i=1;i<=(col+1);i++)
{
gotoxy(x,y);
for(int j=0;j<=(no-i);j++)
{
cout< y+=2;
gotoxy(x,y);
}
x+=9;y=i+3;
}
}
void findx()
{
float xp;
cout<<"\n\tXP FOR WICH VALUE OF F(X) IS REQUIRED: ";
cin>>xp;
int i=0;
while(((xp-array[i][0]/interval>1)&&(I {
i++;
}
x0=i;
p=(xp-array[x0][0]/interval;
}
void nford()
{
findx();
cout<<"\n\n\tanswr= ";
cout<<(array[x0][1]+(p*array[x0][2]+(p*(p-1)/2*array[x0][3])+p*(p-1)*(p-2)/6*array[x0][4])+(p*(p-1)*(p-2)*(p-3)/24*array[x0][5]);
}
void nback()
{
findx();
cout<<"\n\n\tanswer= ";
cout<<(array[x0][1]+(p*array[x0-1][2]+(p*(p+1)/2*array[x0-2][3])+p*(p+1)*(p+2)/6*array[x0-3][4])+(p*(p+1)*(p+2)*(p+3)/24*array[x0-4][5]);
}
void main(void)
{
clrscr();difftable();getch();
int choice;
while(1)
{
clrscr();
cout<<"\n\n\t\tMAIN MANU";
cout<<"\n\n\tFORWARD DIFFERENCE INTERPOLATION FORMULA --- 1";
cout<<"\n\n\tBACKWARD DIFFERENCE INTERPOLATION FORMULA --- 2";
cout<<"\n\n\tTO EXIT---------------------------------------3";
cout<<"\n\n\n\tENTER YOUR CHOICE :";
cin>>choice;
switch(choice)
{
case 1:clrscr();nford();getch();break;
case 2:clrscr();nback();getch();break;
case 3:exit(0)
}
}
}
Download

Newton Rophson

#include
#include
#include
#define f(x) (pow(x,2)-2*x-2)
#define f1(y) (2*y-2)
void main()
{
int i,flag=1;
cout<<"\n\n\tNEWTON RAPHSON METHOD\n";
cout<<"\n\tEnter The Value Of X0 :";
cin>>x0;
cout<<"\n\tEnter The Value Of N :";
cin>>n;
cout<<"\n\tEnter The Value Of E :";
cin>>e;
for(i=0;i {
f=f(x0);
fd=f1(x0);
x1=x0-f/fd;
x2=x1-x0;
if(x2<0)
x2=x2*(-1);
if(x2 flag=0;
else
x0=x1;
}
if(flag==)
{
cout<<"\n\n\n\n\tNO CONVERGENCE\n";
getch();
}
else
{
cout<<"\n\n\n\tAFTER"< getch();
}
}
Download

Jacobi

#include
#include
#include
#define size 8
static float temp,data[size][size],x[10],x1[10];
short no_eq,itr;
void main(void)
{
short i,j,k=8,I=20,count=1;
clrscr();
gotoxy(24,1);cout<<"JACOBI METHOD";
gotoxy(17,2);
cout<<"*************************\n";
cout<<"\nHOW MANY EQUATIONS:";
cin>>no_eq;
cout<<"\nENTER DATA FOR EQUATIONS";
cout<<"\n======================";
for(i=0;ifor(j=0;j<=no_eq;j++)
{
gotoxy(I,k);
cin>>data[i][j];
I+8;
if(j==no_rq)
{
k++;
I+20;
}
}
cout<<"\nHOW MANY ITERATIONS YOU WANT TO DO:";
cin>>itr;
for(i=0;i<=no_eq-1;i++)
{
temp=data[i][i];
for(j=0;j<=no_eq;j++)
data[i][j]/=temp;
}
cout<<"\n\nITERATIONS RESULT\n\n";
while(count<=itr)
{
for(i=0;i<==no_eq-1;i++)
{
x1(i)-=data[i][no_eq];
for(j=no_eq-1;j>=0;j--)
{
if(i==j)
j--;
x1[i]-=data[i][j]*x[j];
}
}
cout<<" "for(k=o;k<=no_eq-1;k++)
{
x[k]=x1[k];
printf(" %9.4f',x[k]);
}
cout<<"\n";
count++;
}
getch();
}
Download

Guassian Elimination

#include
#include
float temp,arr[10][6],answer[6];
int noofeq;
void readata()
{
short i,,k=8,I=20;
gotoxy(24,1);
count<<"GAUSSIAN ELIMINATION METHOD";
gotoxy(24,2);
cout<<"*****************************";
count<<"\n\tHOW MANY EQUATIONS:";
cin>>noofeq;
cout<<"\n\tENTER DATA FOR EQUATIONS:";
cout<<"\n\t==========================";
for(i=0;i<=noofeq-1;i++)
for(j=0;j<=noofeq;j++)
{
gotoxy(1,k);
cin>>arr[i][j];
I+=8;
if(j=noofeq)
{
k++;
I=20;
}
}
}
void print_result()
{
int i,j=1;
cout<<"\n\tFINAL RESULT :";
cout<<"\n\t============================\n";
for(i==noofeq-1;i>=0;i--)
{
cout<<"\tX"< }
}
void main()
{
int i,j,k,I=1,p=1;
clrscr();
readata();
for(i=1;i<=noofeq;i++)
{
for(j=i-1;j<=noofeq;j++)
arr[noofeq+i-1][j]=arr[i-1][j]/arr[i-1][i-1];
for(j=i;i<=noofeq;i++)
{
temp=arr[j][i-1];
for(k=i-1;k<=noofeq;k++)
arr[j][k]-=arr[noofeq+i-1][k]*temp;
}
}
temp=0;k=1;
answer[0]=arr[2*noofeq-1][noofeq];
for(j=2*noofeq-1;j>noofeq;j--)
{
for(k=1;k<=p;k++)
temp+=answer[k-1]*arr[j-1][noofeq-k];
answer[p++]=arr[j-1](noofeq)-temp;
temp=0;
}
print_result();
}
Dowanload

Bisection method

#include

#include

#include

#define f(x)(sin(x)-5*x+2)

float e,x1,x2;

voiad main(void)

{

int i,x1,x2;

float x3,f,f1,f2,f3,temp;

cout<<"\n\n\tBISECTION METHOD\n";

cout<<"\n\tEnter The Value Of X1 :";

cin>>x1;

cout<<"\n\tEnter The Value Of X2 :";

cin>>x2;

cout<<"\n\tEnter The Value Of E :";

cin>>e;

//x1=f(x1)

for(i=o;i<50>

{

temp=x2-x1;

if(temp<0)

temp*=(-1);

if(temp

{

flag=0;

break;

}

f1=f(x1);

f2=f(x2);

f3=f1*f2;

x3=(x1+x2)/2;

f3=f(x3)

if(f3==0)

{

cout<<"\n\n\tAFTER"<

break;

}

f=f1*f3;

if(f<0)

x2=x3;

else

{

f=f2*f3;

if(f<0)

x1=x3;

}

}

if(flag==1)

cout<<"\n\n\tSOLUTION DOES NOT EXIST";

else

cout<<"\n\n\tAFTER"<

getch();

}

Download