Determinants of matrices greater than 3x3

AI Thread Summary
To find the determinant of matrices larger than 3x3, the Laplace expansion is theoretically valid but inefficient, requiring n! operations. A more efficient method involves performing row operations to convert the matrix into an upper triangular form, where the determinant can then be calculated as the product of the diagonal entries, requiring only n^3 operations. For example, a 10x10 matrix calculated using row operations is significantly faster than using the Laplace expansion, with a performance difference of about 3600 times. Self-learners often use row reduction methods for manual calculations of determinants for n ≥ 3. Understanding these techniques is essential for efficient computation in multidimensional mathematics.
smize
Messages
78
Reaction score
1
I am wondering how one would find a the determinant of a 4x4 or greater. This isn't an urgent question, just a curiosity.
 
Mathematics news on Phys.org
voko said:

That is "correct", and an interesting theoretical result, but it's a hopelessly inefficient way to calculate the determinant of a general matrix, because it takes of the order of n! operations for an n x n matrix.

A much more efficient way is to do row operations on the matrix which don't change the value of the determinant (or only multiply it by -1), but systematically change the matrix so that all the entries below the diagonal are zero. The determinant is then just the product of the diagonal terms. In the worst case, that takes about n3 operations. For a 10 x 10 matrix, n3 = 1,000 and n! = about 3.6 million, so one way is about 3600 times faster than the other!
 
AlephZero said:
A much more efficient way is to do row operations on the matrix which don't change the value of the determinant (or only multiply it by -1), but systematically change the matrix so that all the entries below the diagonal are zero. The determinant is then just the product of the diagonal terms. In the worst case, that takes about n3 operations. For a 10 x 10 matrix, n3 = 1,000 and n! = about 3.6 million, so one way is about 3600 times faster than the other!

By chance, could you give an example of how to do row operations to find the determinant?
 
AlephZero said:
That is "correct", and an interesting theoretical result, but it's a hopelessly inefficient way to calculate the determinant of a general matrix, because it takes of the order of n! operations for an n x n matrix.

Whenever I get to compute a det with n >= 3 MANUALLY, I use this method. Possibly because I remember it by heart. Doing arbitrary n dets most efficiently is a distinctly different matter.
 
voko said:
Whenever I get to compute a det with n >= 3 MANUALLY, I use this method. Possibly because I remember it by heart. Doing arbitrary n dets most efficiently is a distinctly different matter.

At the moment, it is the ONLY method I have learned. (I am self-teaching myself Multidimensional Mathematics until classes start in 3 weeks).
 
Back
Top