矩阵求逆代码.docVIP

public static double MatrixValue(double[,] MatrixList, int Level) //求得|A| 如果为0 说明不可逆 { //计算行列式的方法 // a1 a2 a3 // b1 b2 b3 // c1 c2 c3 // 结果为 a1·b2·c3+b1·c2·a3+c1·a2·b3-a3·b2·c1-b3·c2·a1-c3·a2·b1(注意对角线就容易记住了） double[,] dMatrix = new double[Level, Level]; //定义二维数组，行列数相同 for (int i = 0; i Level; i++) for (int j = 0; j Level; j++) dMatrix[i, j] = MatrixList[i, j]; //将参数的值，付给定义的数组 double c, x; int k = 1; for (int i = 0, j = 0; i Level j Level; i++, j++) { if (dMatrix[i, j] == 0) //判断对角线上的数据是否为0 { int m = i; for (; dMatrix[m, j] == 0; m++) ; //如果对角线上数据为0，从该数据开始依次往后判断是否为0 if (m == Level) //当该行从对角线开始数据都为0 的时候 返回0 return 0; else { // Row change between i-row and m-row for (int n = j; n Level; n++) { c = dMatrix[i, n]; dMatrix[i, n] = dMatrix[m, n]; dMatrix[m, n] = c; } // Change value pre-value k *= (-1); } } // Set 0 to the current column in the rows after current row for (int s = Level - 1; s i; s--) { x = dMatrix[s, j]; for (int t = j; t Level; t++) dMatrix[s, t] -= dMatrix[i, t] * (x / dMatrix[i, j]); } } double sn = 1; for (int i = 0; i Level; i++) { if (dMatrix[i, i] != 0) sn *= dMatrix[i, i]; els