下三角形矩阵求逆

#include

#include

#include OutputData

#define N 3

void qn(double a[][N],double t[][N],int n)

{

int k,i,j,m;

double sp;

for(j=0;j

{

for(k=j+1;k

{

sp=-a[k][j]/a[j][j];

printf("tkj=%f",t[k][j]);

for(m=0;m<=j;m++)

{

printf("tjm=%f",t[j][m]);

t[k][m]+=sp*t[j][m];

printf("tkm=%f",t[k][m]);

}

}

printf("Output latest matrix for %d step\n",j);

OutputData(t,n);

getchar();

printf("\n");

}

for(i=0;i

for(j=0;j<=i;j++)

t[i][j]/=a[i][i];

printf("\nFinal resut is:\n");

OutputData(t,n);

}

void mmt(double c[][N],double a[][N],double b[][N],int n) {

int i,j,k;

for(i=0;i

for(j=0;i<=i;j++)

{

c[i][j]=0.0;

for(k=0;k

c[i][j]+=a[i][k]*b[k][j];

}

}