Year: 2010
Type: preprint
Abstract: We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.
Source: arXiv (Cornell University)
Authors: Gottlieb, Lee-Ad, Neylon, Tyler
Institutions: Ariel University, Weizmann Institute of Science
Language: English
Subfield: Computational Mechanics
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2952047957