java 逆矩阵,java – 如何创建逆变换矩阵

这是我在计算机图形学课程中使用的一些代码,基本上我使用高斯Jordan消除来计算矩阵的逆.对于可逆的矩阵,其行列式值必须不等于零.我没有在我的代码中处理过这种情况,我不打算为你做这一切.

Matrix4* Matrix4::FindInverse(Matrix4 &a){

int n = R;

int i = 0;

int j = 0;

float pivot = 0;

Matrix4* invA = NULL;

//TODO: Check whether the matrix is invertible.Else Return

invA = new Matrix4();

invA->SetMatrix4(1,0,0,0, 0,1,0,0, 0,0,1,0, 0,0,0,1);

for(i = 0; i < n; i++){

pivot = a.v[i][i];

if(pivot != 1.0 and pivot != 0){

for(int t = i; t < n; t++){

a.v[i][t] = a.v[i][t]/pivot;

invA->v[i][t] = invA->v[i][t]/pivot;

}

}

//Update to the new pivot which must be 1.0

pivot = a.v[i][i];

for(j = 0; j < n; j++){

if( j==i ){

continue;

}

else{

float l = a.v[j][i]/pivot;

for(int m = 0; m < n; m++){

a.v[j][m] = a.v[j][m] - l * a.v[i][m];

invA->v[j][m] = invA->v[j][m] - (l * invA->v[i][m]);

}

}

}

}

return invA;

}