如何计算矩阵行列式? n * n或仅5 * 5 [英] How to calculate matrix determinant? n*n or just 5*5
本文介绍了如何计算矩阵行列式? n * n或仅5 * 5的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
每个人.我需要找到矩阵n*n
(或5*5
)行列式.我有一个从Pascal转换而来的函数,但是有INDEX OUT OF RANGE EXCEPTION
.有人可以帮我吗?
everyone. I need to find matrix n*n
(or 5*5
) determinant. I have a function translated from Pascal, but there's INDEX OUT OF RANGE EXCEPTION
. Could somebody help me?
这是我的代码:
public static double DET(double[,] a, int n)
{
int i, j, k;
double det = 0;
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n + 1; j++)
{
det = a[j, i] / a[i, i];
for (k = i; k < n; k++)
a[j, k] = a[j, k] - det * a[i, k]; // Here's exception
}
}
det = 1;
for (i = 0; i < n; i++)
det = det * a[i, i];
return det;
}
感谢您的帮助.
推荐答案
for (j = i + 1; j < n + 1; j++)
最后一个J值将大于数组大小.因此,您必须重新检查数组大小以及所有如何从pascal转换所有索引.
Last J value will be bigger than array size. So you must to recheck array sizes and all how was all indexes translated from pascal.
这篇关于如何计算矩阵行列式? n * n或仅5 * 5的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文