Related papers: Singular value decomposition of large random matri…
Sample covariance matrices from multi-population typically exhibit several large spiked eigenvalues, which stem from differences between population means and are crucial for inference on the underlying data structure. This paper…
The higher order singular value decomposition (HOSVD) of tensors is a generalization of matrix SVD. The perturbation analysis of HOSVD under random noise is more delicate than its matrix counterpart. Recently, polynomial time algorithms…
The existence and structure of steady gaseous detonation propagating in a packed bed of solid inert particles are analyzed in the one-dimensional approximation by taking into consideration frictional and heat losses between the gas and the…
Let $(\varepsilon_{t})_{t>0}$ be a sequence of independent real random vectors of $p$-dimension and let $X_T=\sum_{t=s+1}^{s+T}\varepsilon_t\varepsilon^T_{t-s}/T$ be the lag-$s$ ($s$ is a fixed positive integer) auto-covariance matrix of…
Let $W_n= \frac{1}{\sqrt n} M_n$ be a Wigner matrix whose entries have vanishing third moment, normalized so that the spectrum is concentrated in the interval $[-2,2]$. We prove a concentration bound for $N_I = N_I(W_n)$, the number of…
In this paper we propose novel methods for compression and recovery of multilinear data under limited sampling. We exploit the recently proposed tensor- Singular Value Decomposition (t-SVD)[1], which is a group theoretic framework for…
We apply the method of determinants to study the distribution of the largest singular values of large $ m \times n $ real rectangular random matrices with independent Cauchy entries. We show that statistical properties of the (rescaled by a…
We study the gaps between consecutive singular values of random rectangular matrices. Specifically, if $M$ is an $n \times p$ random matrix with independent and identically distributed entries and $\Sigma$ is a $n \times n$ deterministic…
Singular-value statistics (SVS) has been recently presented as a random matrix theory tool able to properly characterize non-Hermitian random matrix ensembles [PRX Quantum {\bf 4}, 040312 (2023)]. Here, we perform a numerical study of the…
We consider the single eigenvalue fluctuations of random matrices of general Wigner-type, under a one-cut assumption on the density of states. For eigenvalues in the bulk, we prove that the asymptotic fluctuations of a single eigenvalue…
Given (orthonormal) approximations $\tilde{U}$ and $\tilde{V}$ to the left and right subspaces spanned by the leading singular vectors of a matrix $A$, we discuss methods to approximate the leading singular values of $A$ and study their…
We propose new iterative methods for computing nontrivial extremal generalized singular values and vectors. The first method is a generalized Davidson-type algorithm and the second method employs a multidirectional subspace expansion…
We investigate the asymptotics of eigenvalues of sample covariance matrices associated with a class of non-independent Gaussian processes (separable and temporally stationary) under the Kolmogorov asymptotic regime. The limiting spectral…
Rank minimization can be converted into tractable surrogate problems, such as Nuclear Norm Minimization (NNM) and Weighted NNM (WNNM). The problems related to NNM, or WNNM, can be solved iteratively by applying a closed-form proximal…
We investigate convexity properties of the set of eigenvalue tuples of $n\times n$ real symmetric matrices, whose all $k\times k$ (where $k\leq n$ is fixed) minors are positive semidefinite. It is proven that the set…
Denote by $\lambda_1(A), \ldots, \lambda_n(A)$ the eigenvalues of an $(n\times n)$-matrix $A$. Let $Z_n$ be an $(n\times n)$-matrix chosen uniformly at random from the matrix analogue to the classical $\ell_ p^n$-ball, defined as the set of…
A fast algorithm for solving the under-determined 3-D linear gravity inverse problem based on the randomized singular value decomposition (RSVD) is developed. The algorithm combines an iteratively reweighted approach for $L_1$-norm…
Contiguous submatrices of the Fourier matrix are known to be ill-conditioned. In a recent paper in SIAM Review A. Barnett has provided new bounds on the rate of ill-conditioning of the discrete Fourier submatrices. In this paper we focus on…
Let $\mathbf{W}\in\mathbb{C}^{n\times n}$ be a {\it single-spiked} Wishart matrix in the class $\mathbf{W}\sim \mathcal{CW}_n(m,\mathbf{I}_n+ \theta \mathbf{v}\mathbf{v}^\dagger) $ with $m\geq n$, where $\mathbf{I}_n$ is the $n\times n$…
This article first introduces the notion of weighted singular value decomposition (WSVD) of a tensor via the Einstein product. The WSVD is then used to compute the weighted Moore-Penrose inverse of an arbitrary-order tensor. We then define…