C_矩阵基本运算代码.docxVIP

C#矩阵的运算代码 #region 矩阵运算/// summary/// 矩阵对应行列式的值/// /summary/// param /param/// returns/returnsprivate double MatrixValue(double[,] MatrixList){int Level = MatrixList.GetLength(1);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];}}int sign = 1;for (int i = 0, j = 0; i Level j Level; i++, j++){//判断改行dMatrix[i, j]是否为0，若是，则寻找i后的行（m,mi，切dMatrix[m, j]!=0)进行交换if (dMatrix[i, j] == 0){if (i == Level - 1){return 0;}int m = i + 1;//获取一个dMatrix[m, j]不为为0的行for (; dMatrix[m, j] == 0; m++){if (m == Level - 1){return 0;}}//判断是否达到矩阵的最大行，若是，则返回0//把i行和m行调换double temp;for (int n = j; n Level; n++){temp = dMatrix[i, n];dMatrix[i, n] = dMatrix[m, n];dMatrix[m, n] = temp;}sign *= (-1);}//把当前行以后的行所对应的列变成0double tmp;for (int s = Level - 1; s i; s--){tmp = dMatrix[s, j];//j行后面的所有行for (int t = j; t Level; t++){dMatrix[s, t] -= dMatrix[i, t] * (tmp / dMatrix[i, j]);}}}double result = 1;for (int i = 0; i Level; i++){if (dMatrix[i, i] != 0){result *= dMatrix[i, i];}else{return 0;}}return sign * result;} /// summary/// 矩阵减法/// /summary/// param /param/// param /param/// param /param/// param /paramprivate double[] SubMatrix(double[] A1, double[] A2){//判断矩阵的长短是否一致int a1 = A1.GetLength(0);int a2 = A2.GetLength(0);if (a1 != a2){return null;}//矩阵相减double[] B = new double[a1];for (int i = 0; i a1; i++){B[i] = A1[i] - A2[i];}return B;} /// summary/// 矩阵??法/// /summary/// param /param/// param /param/// returns/returnsprivate double[,] MultiplyMatrix(double[,] firstMatrix, double[,] secondMatrix){double[,] resultMatrix = new double[firstMatrix.GetLength(0), secondMatrix.GetLength(1)];//判断相乘矩阵是否合法，即第一个矩阵的列要等于第二个矩阵的行if (firstMatrix.GetLength(1) != secondMatrix.GetLength(0)){return null;}//求结果矩阵for (int rowIndex = 0; rowIndex firstMatrix.GetLength(0); rowIndex++){for (int colIndex = 0; colIndex se