Combining these we get that a n by n square matrix A is singular (non-invertible ) if and only if its rank is not equal to n, the amount of columns of A. If we think about this matrix as a complete unit, the dimension of it's colunmn space (it's rank) is equal to n if and only if the matrix is row equivalent to i.
#Icircuit singular matrix how to
This test is easy by hand for n=1,2,3,4, 5 in the general case, and might be tedios for larger n.įurthermore, if you have learned about how to determine if a set of column vectors are linearly independent, you know that they are linearly independent if and only if the matrix consisting of each vector as a column is row equivalent to the identity matrix, that is their span is equal to n if and only if this mentioned matrix is row equivalent to i.
So A is singular if and only if it is not row equivalent to the n by n identity matrix i. Now, if you are familiar with the "standard" way of calculating the inverse of a matrix A (row reducing to ), this process requires that A is row equivalent to the n by n identity matrix i. Using this method for lager n generally becomes rather tedious. As Adrian Keister pointed out, A is singular if and only if it's determinant is equal to zero, which can relatively easy be computed for n=1,2,3 in the general case(by hand). There are several ways of determining this. An n by n square matrix A is per definition singular if it is not invertible.
0 kommentar(er)
