### C C++ CODE : Gauss elimination for solving linear equations

Working C C++  Source code program for Gauss elimination for solving linear equations
``````/************* Gauss elimination for solving linear equations *************/

#include<iostream.h>
#include<stdio.h>
#include<conio.h>
#include<math.h>
int main()
{
int n,i,j,k,temp;
float a[10][10],c,d[10]={0};
clrscr();
cout<<"No of equation ? ";
cin>>n;
cout<<"Coefficient of all : \n";
for(i=0;i<n;i++)
{
cout<<"equation: "<<i+1<< "   ";
for(j=0;j<=n;j++)
cin>>a[i][j];
}
for(i=n-1;i>0;i--)        // partial pivoting
{
if(a[i-1][0]<a[i][0])
for(j=0;j<=n;j++)
{
c=a[i][j];
a[i][j]=a[i-1][j];
a[i-1][j]=c;
}
}
//*************** DISPLAY MATRIX*************//
for(i=0;i<n;i++)
{
for(j=0;j<=n;j++)
printf("%6.1f",a[i][j]);
printf("\n");
}
//********* changing to upper triangular matrix*************//
//********* Forward elimination process**************//
for(k=0;k<n-1;k++)
for(i=k;i<n-1;i++)
{
c= (a[i+1][k]/a[k][k]) ;

for(j=0;j<=n;j++)
a[i+1][j]-=c*a[k][j];
}

// ************DISPLAYING UPPER TRIANGULAE MATRIX***************//

printf("\n\n");
for(i=0;i<n;i++)
{
for(j=0;j<=n;j++)
printf("%6.1f",a[i][j]);

printf("\n");
}
//***************** Backward Substitution method****************//

for(i=n-1;i>=0;i--)
{
c=0;
for(j=i;j<=n-1;j++)
c=c+a[i][j]*d[j];

d[i]=(a[i][n]-c)/a[i][i];
}
//******** RESULT DISPLAY *********//
for(i=0;i<n;i++)
cout<<d[i]<<endl;

getch();
return 0;
}

``````

1. 1 -0.8 (-0.8)^2 (-0.8)^3
0 1 2(-0.8) 3(-0.8)^2
1 -0.4 (-0.4)^2 (-0.4)^3
0 1 2(-0.4) 3(-0.4)

a0
a1
a2
a3

tan(-0.8)
sec^2(-0.8)
tan(-0.4)
sec^2(-0.4)

these are 3 matrices like Ax=B

We have to find the values of x ie(a0,a1,a2,a3) using Gaussian methos

Please bro its urgent can u do that for me

2. this code is working superb...thanks

Your Comment and Question will help to make this blog better...