抄的:
C语言.求逆矩阵线性代数算法
#include
#include
void RemainderMatrix(double (*b)[10],int row,int column, int i,int j); 、//求余了式
double ValueRank(double (*)[10],int n); //求方阵值
void main()
{
int row,column,i,j,m,n,x,y;
double a[10][10],b[10][10],Adjoint[10][10],value;
printf("Input the row of A[][]:");
scanf("%d",&row);
printf("Input the column of A[][]:");
scanf("%d",&column);
printf("Enter every value of A[][]:\n");
for(i=0;i
b[i][j]=a[i][j];
}
value=ValueRank(b,row);
for(i=0;i
for(m=0;m
for(x=0;x
printf("\n");}
RemainderMatrix(b,row,column,i,j);
for(x=0;x
printf("\n");}
printf("%f",ValueRank(b,(n-1)));
Adjoint[j][i]=pow(-1,i+j)*ValueRank(b,(n-1))/value;
}
for(i=0;i
printf("\n");
}
}
void RemainderMatrix(double (*a)[10],int h,int r,int m,int n)
{
int i,j;
for(i=m;i
a[i][j]=a[i+1][j];
}
for(i=0;i
a[i][j]=a[i][j+1];
}
}