Calculating determinant is a terribly inefficient thing for larger arrays. So, a nice alternative is to use the product of the diagonal elements of a specific matrix factorization of our square array. The best tool is to use rank. Thus, if the rank of an NxM matrix is less than min(N,M), then the matrix is singular. Suppose there is a matrix A, for which we want to check if it is singular or not, refer to the following code:
[N M] = size(A);
k = rank(A);
If(k<min(N,M))
end