Computing a Sparse Basis for the Null Space
Gilbert, John R.; Heath, Michael T.
We present algorithms for computing a sparse basis for the null space of a sparse underdetermined matrix. We describe several possible computational strategies, both combinatorial and noncombinatorial in nature, and we compare their effectiveness for several test problems.
computer science; technical report
Previously Published As