publication . Other literature type . Article . 2011

Full length article: On the size of incoherent systems

Nelson, J.L.; Temlyakov, V.N.;
  • Published: 01 Sep 2011
  • Publisher: Elsevier BV
Abstract
AbstractThis paper concerns systems with small coherence parameter. Simple greedy-type algorithms perform well on these systems, which are also useful in the construction of compressed sensing matrices.We discuss the following problems for both Rn and Cn. How large can a dictionary be, if we prescribe the coherence parameter? How small could the resulting coherence parameter be, if we impose a size on the dictionary? How could we construct such a system? Several fundamental results from different areas of mathematics shed light on these important problems with far-reaching implications in approximation theory.
Subjects
free text keywords: Applied Mathematics, Analysis, General Mathematics, Numerical Analysis, Matrix (mathematics), Mathematical analysis, Areas of mathematics, Approximation theory, Mathematical optimization, Coherence (physics), Compressed sensing, Mathematics, Coherence, Gramm matrix, Mathematics(all)
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Other literature type . Article . 2011

Full length article: On the size of incoherent systems

Nelson, J.L.; Temlyakov, V.N.;