Computing a Sparse Basis for the Null Space

1 July 1987

journal article
Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods

Vol. 8 (3) , 446-459
https://doi.org/10.1137/0608037

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.

Keywords

This publication has 7 references indexed in Scilit:

The Null Space Problem I. Complexity
SIAM Journal on Algebraic Discrete Methods, 1986
An algorithm to compute a sparse basis of the null space
Numerische Mathematik, 1985
Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
SIAM Journal on Scientific and Statistical Computing, 1984
Large Sparse Numerical Optimization
Lecture Notes in Computer Science, 1984
On computational procedures for the force method
International Journal for Numerical Methods in Engineering, 1982
Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
SIAM Journal on Scientific and Statistical Computing, 1982
On Algorithms for Obtaining a Maximum Transversal
ACM Transactions on Mathematical Software, 1981