Computing a Sparse Basis for the Null Space

Thumbnail
View/Open
PERMANENT LINK(S)
http://hdl.handle.net/1813/6570
Collections
Metadata
Show full item record
Author
Gilbert, John R.; Heath, Michael T.
Abstract
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.
Date Issued
1986-01
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-730
Type
technical report

Statistics