finding a smart way to calculate a determinant I was trying to solve the following determinant: 
$$det(M)=\begin{vmatrix}2 & -1 & -1 & 0 & 0 & 0 & 0\\
0 & 2 & 0 & -1 & -1 & 0 & 0\\
0 & 0 & 2 & 0 & 0 & -1 & -1\\
-1 & 0 & 0 & 2 & 0 & 0 & 0\\
0 & -1 & -1 & 0 & 2 & 0 & 0\\
0 & 0 & 0 & -1 & -1 & 2 & 0\\
0 & 0 & 0 & 0 & 0 & -1 & 1
\end{vmatrix}$$
I have succeeded in solving it and proving that $det(M) = 16$, but It took me a while and I just moved from one minor into two and so on. I was wondering if there is a "smart" way to solve this determinant. For example, so how to get in into a triangular matrix and then just to multiply the diagonal.  
 A: A smart way would be using the Elementary Row or Column  Operations to generate more zero's.
For example if you perform $$ C_6+C_7\to C_6 $$ you will generate a column with one more zero.    
A: You can do multiple things that will make the determinant unchanged yet the matrix will be much more simple. Amongst those that leaves the determinant invariant are the following.


*

*Adding arbitrary multiple of one row to another row.

*Adding arbitrary multiple of one column to another column.

*Transposing the matrix.


There are other rules you can use that simplifies the matrix but changes the determinant so you have to be careful to count in the changes, e.g.


*

*Multiplying a row/column with a number yields a matrix that has the determinant of the original matrix times the number you multiplied the row/column.

*Switching rows/columns changes the sign of the determinant.


There are also other rules you can apply, more information you can find, for example in this wiki article about determinant. Note that you can combine all the above steps so you get quite a toolkit of possible steps to simplify your matrix before actually computing the determinant. 
