Matrix Sparsification and the Sparse Null Space Problem

Lee Ad Gottlieb; Tyler Neylon

doi:10.1007/s00453-015-0042-6

Matrix Sparsification and the Sparse Null Space Problem

Lee Ad Gottlieb
, Tyler Neylon

Ariel University

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Pages (from-to)	426-444
Number of pages	19
Journal	Algorithmica
Volume	76
Issue number	2
DOIs	https://doi.org/10.1007/s00453-015-0042-6
State	Published - 1 Oct 2016

Keywords

Matrix sparsification
Sparse approximation
Sparse null space

Access to Document

10.1007/s00453-015-0042-6

Cite this

@article{97dbde3629ed4af69c24d3c8ce076def,

title = "Matrix Sparsification and the Sparse Null Space Problem",

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.",

keywords = "Matrix sparsification, Sparse approximation, Sparse null space",

author = "Gottlieb, \{Lee Ad\} and Tyler Neylon",

note = "Publisher Copyright: {\textcopyright} 2015, Springer Science+Business Media New York.",

year = "2016",

month = oct,

day = "1",

doi = "10.1007/s00453-015-0042-6",

language = "אנגלית",

volume = "76",

pages = "426--444",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Matrix Sparsification and the Sparse Null Space Problem

AU - Gottlieb, Lee Ad

AU - Neylon, Tyler

PY - 2016/10/1

Y1 - 2016/10/1

N2 - 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.

AB - 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.

KW - Matrix sparsification

KW - Sparse approximation

KW - Sparse null space

UR - https://www.scopus.com/pages/publications/84938630197

U2 - 10.1007/s00453-015-0042-6

DO - 10.1007/s00453-015-0042-6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84938630197

SN - 0178-4617

VL - 76

SP - 426

EP - 444

JO - Algorithmica

JF - Algorithmica

IS - 2

ER -

Matrix Sparsification and the Sparse Null Space Problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this