Sciweavers

38 search results - page 1 / 8
» Condition Numbers of Gaussian Random Matrices
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 6 months ago
Condition Numbers of Gaussian Random Matrices
Zizhong Chen, Jack Dongarra
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 8 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
CISS
2011
IEEE
12 years 11 months ago
The Restricted Isometry Property for block diagonal matrices
—In compressive sensing (CS), the Restricted Isometry Property (RIP) is a powerful condition on measurement operators which ensures robust recovery of sparse vectors is possible ...
Han Lun Yap, Armin Eftekhari, Michael B. Wakin, Ch...
JC
2008
68views more  JC 2008»
13 years 8 months ago
On the number of minima of a random polynomial
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
Jean-Pierre Dedieu, Gregorio Malajovich
ICCS
2005
Springer
14 years 1 months ago
Numerically Stable Real Number Codes Based on Random Matrices
Abstract — Error correction codes defined over realnumber and complex-number fields have been studied and recognized as useful in many applications. However, most real-number a...
Zizhong Chen, Jack Dongarra