نتایج جستجو برای: singular random matrices

تعداد نتایج: 402687  

2005
S. Mendelson A. Pajor

We present deviation inequalities of random operators of the form 1 N ∑N i=1 Xi ⊗ Xi from the average operator E(X ⊗ X), where Xi are independent random vectors distributed as X, which is a random vector in R or in `2. We use these inequalities to estimate the singular values of random matrices with independent rows (without assuming that the entries are independent).

Amiya Kumar l Shyama Madhumangal Pal,

In this paper, some elementary operations on triangular fuzzynumbers (TFNs) are defined. We also define some operations on triangularfuzzy matrices (TFMs) such as trace and triangular fuzzy determinant(TFD). Using elementary operations, some important properties of TFMs arepresented. The concept of adjoints on TFM is discussed and some of theirproperties are. Some special types of TFMs (e.g. pu...

2004
A. E. Litvak A. Pajor M. Rudelson N. Tomczak-Jaegermann

We study behaviour of the smallest singular value of a rectangular random matrix, i.e., matrix whose entries are independent random variables satisfying some additional conditions. We prove a deviation inequality and show that such a matrix is a “good” isomorphism on its image. Then we obtain asymptotically sharp estimates for volumes and other geometric parameters of random polytopes (absolute...

Journal: :Journal of the European Mathematical Society 2017

2008
MARK RUDELSON ROMAN VERSHYNIN

We prove two basic conjectures on the distribution of the smallest singular value of random n×n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n−1/2, which is optimal for Gaussian matrices. Moreover, we give a optimal estimate on the tail probability. This comes as a consequence of a new and essentially sharp estimate in...

Journal: :SIAM J. Matrix Analysis Applications 2015
Namgil Lee Andrzej Cichocki

We propose new algorithms for singular value decomposition (SVD) of very large-scale matrices based on a low-rank tensor approximation technique called the tensor train (TT) format. The proposed algorithms can compute several dominant singular values and corresponding singular vectors for large-scale structured matrices given in a TT format. The computational complexity of the proposed methods ...

Journal: :CoRR 2013
Gernot Akemann Mario Kieburg Lu Wei

We consider the product ofM quadratic random matrices with complex elements and no further symmetry, where all matrix elements of each factor have a Gaussian distribution. This generalises the classical Wishart-Laguerre Gaussian Unitary Ensemble with M = 1. In this paper we first compute the joint probability distribution for the singular values of the product matrix when the matrix sizeN and t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید