By Topic

Decay Properties of Restricted Isometry Constants

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jeffrey D. Blanchard ; Dept. of Math., Univ. of Utah, Salt Lake City, UT ; Coralia Cartis ; Jared Tanner

Many sparse approximation algorithms accurately recover the sparsest solution to an underdetermined system of equations provided the matrix's restricted isometry constants (RICs) satisfy certain bounds. There are no known large deterministic matrices that satisfy the desired RIC bounds; however, members of many random matrix ensembles typically satisfy RIC bounds. This experience with random matrices has colored the view of the RICs' behavior. By modifying matrices assumed to have bounded RICs, we construct matrices whose RICs behave in a markedly different fashion than the classical random matrices; RICs can satisfy desirable bounds and also take on values in a narrow range.

Published in:

IEEE Signal Processing Letters  (Volume:16 ,  Issue: 7 )