矩阵求逆及相关运算（Matrix inverse and related operations）.docVIP

矩阵求逆及相关运算（Matrix inverse and related operations） Using System; Using System. Collections. Generic; Using System. The Text; The namespace ByteTest { / / / summary The approximate idea of / / algorithm is to take the initial transformation of the determinant. / / / / summary Public class MatrixComputer { / / / summary / / inverse matrix / / / / summary / / / param name = dMatrix param / / / returns / returns Public static double [,] dMatrix { / / the number of rows to obtain the matrix Int Level = dMatrix. GetLength (1); / / / / the determinant of the matrix / / double dMatrixValue = MatrixValue (dMatrix); / / if (dMatrixValue = = 0) / / { / / return null; / /} A double [,] dReverseMatrix = new double [Level, 2 * Level]; / / initialization matrix Level (2 * Level) For (int I = 0; I Level; I + +) { For (int j = 0; j 2 times Level; j + +) { If (j Level) { DReverseMatrix [I, j] = dMatrix [I, j]; } The else { If (j-level = = I) { DReverseMatrix [I, j] = 1; } The else { DReverseMatrix [I, j] = 0; } } } } For (int I = 0, j = 0; I Level j Level; I + +, j+ +) { If (dReverseMatrix [I, j] = = 0) { If (I = = Level - 1) { Return null; } Int m = I + 1; For (; dMatrix [m, j] = = 0; m + +) { If (m = Level - 1) { Return null; } } If (m = = Level) { Return null; } The else { / / add the I rows and m rows For (int n = j; n 2 * Level; n + +) { DReverseMatrix [I, n] + = dReverseMatrix [m, n]; } } } Double temp = dReverseMatrix [I, j]; If (temp! = 1) { / / the I row data is turned into a row of data starting at 1 For (int n = j; n 2 * Level; n + +) { If (dReverseMatrix [I, n]! = 0) { DReverseMatrix [I, n] / = temp; } } } / / the j column of all rows after I row becomes 0 (int s = Level - 1; s I; s --) { Temp = dReverseMatrix [s, j]; For (int t = j; t 2 * Level; t + +) { DReverseMatrix [s, t] - = (dReverseMatrix [I, t] * temp); } } } / / change the Level x Level of the matrix Level (2 * Level) to the identity matrix (int I = level-2; I = 0; I --) { For (int j = I