TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX

DOI10.1017/S000497271700034XzbMath1373.05024OpenAlexW2623722398MaRDI QIDQ4589152

Hai-Feng Liu, Jihua Zhu, Ji-Gen Peng

Publication date: 7 November 2017

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s000497271700034x

zbMATH Keywords

lower boundcompressive sensingmutual coherencesparkcoherence function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial inequalities (05A20)

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
• Greedy-like algorithms for the cosparse analysis model
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Greed is Good: Algorithmic Results for Sparse Approximation
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Sparse and Redundant Representations
• Uncertainty principles and ideal atomic decomposition
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Compressed sensing

This page was built for publication: TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX