title: Computing the null space of a matrix as fast as possible
body: <p>I need to compute the nullspace of several thousand small matrices (8x9, not 4x3 as I wrote previously) in parallel (CUDA).  All references point to SVD but the algorithm in numerical recipes seems very expensive, and gives me lots of things other than the null space that I don't really need.  Is Gaussian elimination really not an option? Are there any other commonly used methods?</p>