Article
Version 2
This version is not peer-reviewed
Noncommutative Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem
Version 1
: Received: 15 August 2024 / Approved: 15 August 2024 / Online: 15 August 2024 (14:48:47 CEST)
Version 2 : Received: 30 August 2024 / Approved: 30 August 2024 / Online: 30 August 2024 (09:47:55 CEST)
Version 2 : Received: 30 August 2024 / Approved: 30 August 2024 / Online: 30 August 2024 (09:47:55 CEST)
How to cite: KRISHNA, K. M. Noncommutative Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem. Preprints 2024, 2024081164. https://doi.org/10.20944/preprints202408.1164.v2 KRISHNA, K. M. Noncommutative Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem. Preprints 2024, 2024081164. https://doi.org/10.20944/preprints202408.1164.v2
Abstract
Breakthrough Sparsity Theorem, derived independently by Donoho and Elad \textit{[Proc. Natl. Acad. Sci. USA, 2003]}, Gribonval and Nielsen \textit{[IEEE Trans. Inform. Theory, 2003]} and Fuchs \textit{[IEEE Trans. Inform. Theory, 2004]} says that unique sparse solution to NP-Hard $\ell_0$-minimization problem can be obtained using unique solution of P-Type $\ell_1$-minimization problem. In this paper, we derive noncommutative version of their result using frames for Hilbert C*-modules.
Keywords
sparse solution; frame; hilbert C*-module
Subject
Computer Science and Mathematics, Analysis
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment