列主元高斯消去法求逆矩阵.docVIP

列主元高斯消去法求逆矩阵 程序代码： #include stdio.h #include math.h #define Max 10 int n; double M[Max][Max]; double E[Max][Max]; bool FindMax(int t) //列主元素 { int i, j, k=t; double max = fabs(M[t][t]), temp; for (i = t+1 ;i n; i++) if (maxfabs(M[i][t])) { max = fabs(M[i][t]); k = i; } if (max==0) return 0; for (j = 0; j n; j++) { temp = M[t][j]; M[t][j] = M[k][j]; M[k][j] = temp; temp = E[t][j]; E[t][j] = E[k][j]; E[k][j] = temp; } return 1; } void XiaoQu(int t) //消去 { int i, j; double max = M[t][t], m; for (i = t+1; i n; i++) { m=M[i][t]/max;