Sciweavers

44 search results - page 4 / 9
» Spectral norm of random matrices
Sort
View
MA
2010
Springer
140views Communications» more  MA 2010»
13 years 7 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
ICASSP
2010
IEEE
13 years 8 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel
SIAMMAX
2010
111views more  SIAMMAX 2010»
13 years 3 months ago
Stochastic Galerkin Matrices
We investigate the structural, spectral, and sparsity properties of Stochastic Galerkin matrices as they arise in the discretization of linear differential equations with random co...
Oliver G. Ernst, Elisabeth Ullmann
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 8 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 6 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan