Determinants of matrices greater than 3x3

Click For Summary
SUMMARY

The discussion focuses on efficient methods for calculating the determinant of matrices larger than 3x3, specifically 4x4 and greater. The traditional Laplace expansion method is deemed inefficient, requiring n! operations, while row operations provide a significantly faster alternative, requiring approximately n³ operations. For instance, calculating the determinant of a 10x10 matrix using row operations is about 3600 times faster than using Laplace expansion. The conversation emphasizes the importance of mastering row operations for practical determinant calculations.

PREREQUISITES
  • Understanding of matrix operations
  • Familiarity with determinants in linear algebra
  • Knowledge of row reduction techniques
  • Basic proficiency in Multidimensional Mathematics
NEXT STEPS
  • Study the method of row reduction for determinant calculation
  • Learn about the properties of determinants
  • Explore computational techniques for large matrices
  • Review examples of determinant calculations for matrices of various sizes
USEFUL FOR

Students of linear algebra, mathematicians, and anyone interested in efficient methods for calculating determinants of larger matrices.

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.
 
Physics 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).
 

Similar threads

Replies
13
Views
4K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K