public class Matrix_c {
public int[][] matrix;
public int[][] matrixToExchange;
public int len;
public void setValue (int[][] matrix){
this.matrix=matrix;
this.len = this.matrix.length;
this.matrixToExchange = new int[len][len];
for (int i = 0; i < len; i++){
for (int j = 0; j < len; j++){
this.matrixToExchange[i][j] = matrix[i][j];
}
}
}
求行列式的值,判断是否为满秩(Getvalue)
public Integer Getvalue(int[][] m){
int n = m.length;
if (n == 1)
return m[0][0];
if (n==2){
return m[n-1][n-1]*m[n-2][n-2] - m[n-1][n-2]*m[n-2][n-1];
}else{
int sum = 0;
for (int g = 0;g<n ; g++) {
if (m[0][g]!=0) {
sum += m[0][g] * Getvalue(GetAlgebraicComplement(0,g, m)) * Math.pow(-1, g);
}
}
System.out.println("sum = " + sum);
return sum;
}
}
求代数余子式(GetAlgebraicComplement)
pub