Journal article
Expander ℓ 0 -decoding
- Abstract:
-
We introduce two new algorithms, Serial-. ℓ0 and Parallel-. ℓ0 for solving a large underdetermined linear system of equations y=Ax∈Rm when it is known that x∈Rn has at most k < m nonzero entries and that A is the adjacency matrix of an unbalanced left d-regular expander graph. The matrices in this class are sparse and allow a highly efficient implementation. A number of algorithms have been designed to work exclusively under this setting, composing the branch of combinatorial compressed-se...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 622.6KB)
-
- Publisher copy:
- 10.1016/j.acha.2017.03.001
Authors
Funding
CONACYT
More from this funder
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Applied and Computational Harmonic Analysis Journal website
- Volume:
- 45
- Issue:
- 3
- Pages:
- 642-667
- Publication date:
- 2017-03-09
- Acceptance date:
- 2017-03-06
- DOI:
- EISSN:
-
1096-603X
- ISSN:
-
1063-5203
- Source identifiers:
-
697331
Item Description
- Keywords:
- Pubs id:
-
pubs:697331
- UUID:
-
uuid:3601ee2d-483d-4f9d-b37e-47704eaa2e88
- Local pid:
- pubs:697331
- Deposit date:
- 2018-07-18
Terms of use
- Copyright holder:
- Elsevier inc
- Copyright date:
- 2017
- Notes:
- © 2017 Published by Elsevier Inc. This is the accepted manuscript version of the article. The final version is available online from Elsevier at: https://doi.org/10.1016/j.acha.2017.03.001
If you are the owner of this record, you can report an update to it here: Report update to this record