Summary: (Blank Abstract)

Say that we have the following matrix and that we want to find its determinant.

Calculating the determinant of a matrix is a recursive process. Basically, we start by choosing any one row or column. The determinant will then be found with respect to this row or column. What this means is that we will find a sum of the products of this row or column's values and sub-determinants formed by blocking out the row and column of the particular value.

Why is this choice of row or column left to us instead of always being defined as, say, the first row? The reason is that by choosing this row or column wisely, we can sometimes reduce the amount of work we do. For example, if a certain row or column contains a few zeros, choosing it as the row/column that we take the determinant with respect to would be a smart move. As the values of this chosen row or column will be multiplied by sub-determinants of the matrix in question, a value of 0 in one of these products would mean that we have one less matrix whose determinant we need to calculate.

In the case of the matrix above, we'll compute the determinant with respect to the first column. The final equation for the determinant is:

Here,

Let's just look at the first term in Equation 2. It is basically the first element of

In a generic

To find the determinants of the

To clarify, take the following example of finding the
determinant of a numeric

First we need to choose a row or column to take the determinant with respect to. We notice that the element in the third row and third column is a zero. Knowing that choosing a row or column that contains a zero will reduce our workload, we will choose the third column. Then, by applying Equation 2, we get