SOLUTION OF A SYSTEM OF LINEAR ALGEBRAIC EQUATIONS

BY GAUSS ELIMINATION METHOD

AIM:
To write a C program to solve a given system of linear algebraic equations by the
method of Gauss elimination.
PROGRAM/CODE:
#include<stdio.h>
#include<conio.h>
#include<math.h>
main()
{
inti,j,k,n;
float a[20][20],x[20],c[20];
printf("\n Gauss Elimination Method");
printf("\n Enter the number of unknowns:\n");
scanf("%d",&n);
printf("\n Enter the Constants:\n");
for (i=0;i<n;i++)
scanf("%f",&c[i]);
printf("\n Enter the coefficients :\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
scanf("%f",&a[i][j]);
}
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("\t%f",a[i][j]);
}
printf("\t%f",c[i]);
printf("\n");
}
for(k=0;k<n-1;k++)
{
for(i=k+1;i<n;i++)

{
for(j=k+1;j<n;j++)
a[i][j]=a[i][j]-(a[i][k]/a[k][k])*a[k][j];
c[i]=c[i]-(a[i][k]/a[k][k])*c[k];
}
}
x[n-1]=c[n-1]/a[n-1][n-1];
printf("\nThe solution is:\n");
printf("x[%d]=%f\n",n-1,x[n-1]);
for(k=0;k<n-1;k++)
{
i=n-k-2;
for(j=i+1;j<n;j++)
c[i]=c[i]-(a[i][j]*x[j]);
x[i]=c[i]/a[i][i];
printf("x[%d]=%f\n",i,x[i]);
}
getch();
}

OUTPUT:

LINEAR REGRESSION

DATE
EXPT. NO.

: 21-02-2012
: 13

AIM:
To write a C program to find the best fit equation for the given values by
regression.
PROGRAM/CODE:
#include<stdio.h>
#include<conio.h>
#include<math.h>
main()
{
printf("\nRegression\n");
printf("Y = a + bX");
intn,i,j,k,m;
float a,b,x[100],y[100],sumx,sumy,sumxy,sumx2;
float c[2][2],d[2],e[2];
printf("\nEnter the value of 'n':\n");
scanf("%d",&n);
printf("\nEnter the %d pair values for X and Y:\n",n);
for(i=0;i<n;i++)
{
printf("\n x[%d]

",i);

scanf("%f",&x[i]);
printf("\n y[%d]

",i);

scanf("%f",&y[i]);
}
//calculation//
sumx=0;sumy=0;sumxy=0;sumx2=0;
for(i=0;i<n;i++)
{
sumx=sumx+x[i];
sumy=sumy+y[i];

sumxy=sumxy+(x[i]*y[i]);
sumx2=sumx2+(x[i]*x[i]);
}
printf("\n%f = (n*a) +(b*%f)\n",sumy,sumx);
printf("\n%f = (a*%f) + (b*%f)\n",sumxy,sumx,sumx2);
//matrix operation//
c[0][0]=n;
c[0][1]=sumx;
c[1][0]=sumx;
c[1][1]=sumx2;
e[0]=sumy;
e[1]=sumxy;
m=2;
for(k=0;k<m-1;k++)
{
for(i=k+1;i<m;i++)
{
for(j=k+1;j<m;j++)
c[i][j]=c[i][j]-(c[i][k]/c[k][k])*c[k][j];
e[i]=e[i]-(c[i][k]/c[k][k])*e[k];
}
}
d[m-1]=e[m-1]/c[m-1][m-1];
printf("\nThe solution is:\n");
printf("b=%f\n",d[m-1]);
for(k=0;k<m-1;k++)
{
i=m-k-2;
for(j=i+1;j<m;j++)
e[i]=e[i]-(c[i][j]*d[j]);
d[i]=e[i]/c[i][i];
printf("a=%f\n",d[i]);
}
printf("\n Y = %0.2f + %0.2fX ",d[0],d[1]);

getch();
}

OUTPUT: