Expander ℓ0-decoding
<p>We introduce two new algorithms, Serial-ℓ0 and Parallel-ℓ0 for solving a large underdetermined linear system of equations y = Ax ∈ ℝm when it is known that x ∈ ℝn has at most k < m nonzero entries and that A is the adjacency matrix of an unbalanced left d-regular expander graph. The...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2017
|