On the size of incoherent systems

DOI10.1016/j.jat.2011.04.001zbMath1242.41037OpenAlexW1969668982MaRDI QIDQ719361

J. L. Nelson, Vladimir N. Temlyakov

Publication date: 10 October 2011

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2011.04.001

zbMATH Keywords

coherencecompressed sensingGramm matrix

Mathematics Subject Classification ID

Multidimensional problems (41A63)

Related Items

Unit time-phase signal sets: bounds and constructions, Remote sensing via \(\ell_1\)-minimization, Explicit RIP matrices: an update, On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries, Two are better than one: fundamental parameters of frame coherence, Unnamed Item, Explicit constructions of RIP matrices and related problems, Steiner equiangular tight frames, Dictionary descent in optimization

Uses Software

• PDCO

Cites Work

• A probabilistic approach to problems of diophantine approximation
• A remark on compressed sensing
• Projection pursuit
• The octahedron is badly approximated by random subspaces
• A note on optimal unimodular lattices
• Nonlinear methods of approximation
• Grassmannian frames with applications to coding and communication
• Problems and results in extremal combinatorics. I.
• On Lebesgue-type inequalities for greedy approximation
• Atomic Decomposition by Basis Pursuit
• Decoding by Linear Programming
• Greedy approximation
• Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
• Stable signal recovery from incomplete and inaccurate measurements
• Bounds for exponential sums
• Sparse components of images and optimal atomic decompositions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item