Here is an extensive discussion.
There are a lot of algorithms.
A simple one is to take the LU
decomposition. Then, since
det M = det LU = det L * det U
and both L
and U
are triangular, the determinant is a product of the diagonal elements of L
and U
. That is O(n^3)
. There exist more efficient algorithms.
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…