Skip to main content

Questions tagged [singular-values]

Filter by
Sorted by
Tagged with
0 votes
0 answers
60 views

I'm working on analyzing the sensitivity of two matrix expressions. I'd like to formally show that one is more sensitive to perturbations in a covariance matrix C than the other. We are given: $$\...
Zhiyao Yang's user avatar
5 votes
1 answer
254 views

Consider the family of matrices $C(\ell,\theta)\in \mathbb{R}^{2\ell+2\times2\ell+2}$, where $\ell\in\mathbb{N}$ and $\theta\in\mathbb{R}$ given by \begin{equation*} C(\ell,\theta)=\begin{pmatrix} ...
Sqrt2toSqrt2's user avatar
1 vote
0 answers
134 views

Let $X \in \mathbb{R}^{n \times N}$ be a random matrix with columns $X_1, \dots, X_N \sim N(0, I_n)$, independently. Define the minimum $\ell_2^n \to \ell_\infty^N$ singular value $$ s_{N, n} = \inf_{...
Drew Brady's user avatar
1 vote
0 answers
47 views

I've asked a similar question before in math stack exchange and gotten no feedback, so I'll try to ask here where I think it is more likely for people to know the answer. I assume I have a finite ...
Keen-ameteur's user avatar
6 votes
1 answer
235 views

Consider an $n \times n$ matrix $A$. I'm interested in algorithms that can verify whether the largest singular value of $A$, i.e., its spectral norm $\| A \|_2$, is less than or equal to $1$ or not. ...
Weather Report's user avatar
1 vote
0 answers
169 views

Given vectors ${\bf p}_1, {\bf p}_2, \dots, {\bf p}_n \in {\Bbb R}^d$ and ${\bf q}_1, {\bf q}_2, \dots, {\bf q}_n \in {\Bbb R}^d$, define the $d \times n$ matrices $$ {\bf P} := \begin{bmatrix} ...
bbjjong's user avatar
  • 11
4 votes
1 answer
290 views

For an upper triangular matrix $T$, one can bound from above the minimum singular value with $$ \sigma_{\min}(T) \leq \min_i |T_{ii}|, $$ and it is well known that this bound can be very loose; for ...
Federico Poloni's user avatar
1 vote
0 answers
106 views

Problem Formulation Given real values $ z_{i,j}^{(k)} $ for indices $ i = 1,\ldots, n, \quad j = 1,\ldots, m, \quad k = 1,\ldots, p, $ our goal is to estimate the parameters $\alpha_{i}^{(k)}$, $\...
Strickland's user avatar
3 votes
1 answer
221 views

One way to write the Courant-Fischer theorem is the following: given symmetric $A$, $$\sigma_k(A)=\sup_{U\in\mathbb C^{n\times k},U^*U=I}\sigma_k(U^*AU)$$ where $\sigma_k$ is the $k$th largest ...
rikhavshah's user avatar
0 votes
0 answers
69 views

For $b=Ax$, is there a way to relate the minimum absolute value of the element of $b$, $\min|b_i|$, and the minimum singular value, $\sigma_\text{min}$, of $A$? What I want is something like: $\sigma_\...
William Lin's user avatar
0 votes
2 answers
119 views

Call a (not necessarily square) nonnegative matrix $M$ connected if there do not exist permutation matrices $P$ and $Q$ such that $PMQ=\begin{pmatrix}A&0\\0&B\end{pmatrix}$ for some $A$ and $B$...
David Bevan's user avatar
0 votes
0 answers
174 views

Let $K$ be a field, $A\in K^{n\times m}$ and $\lVert \cdot \rVert$ the Euclidean norm. Consider the problem: Find a $v\in K^m$ such that \begin{align} \lVert Av\rVert=\min_{\lVert x\rVert=1}\lVert Ax\...
Martin Clever's user avatar
2 votes
0 answers
205 views

Consider the symmetric space $X_\textsf{d}=\textsf{SL}(d,\Bbb R)/\textsf{SO}(d)$. For any $M\in X_d$, by transporting the Killing form on $T_I(X_d)$ (the space of symmetric matrices with trace zero) ...
Random's user avatar
  • 1,201
2 votes
1 answer
256 views

I have implemented the Cosine-Sine decomposition of a square matrix in Mathematica. That is, for a given matrix $U$ (where in my use-case, $U$ is unitary) with equally-sized partitions $$ U = \begin{...
Anti Earth's user avatar
2 votes
1 answer
80 views

Let $A \in \mathbb{R}^{n \times n}$ be a matrix. Recall $\sigma_{\min}(A)$ is the Frobenius distance between $A$ and the set of singular matrices: $$\sigma_\min(A) = \min_{E \in \mathbb{R}^{n \times n}...
Spencer Kraisler's user avatar
4 votes
1 answer
363 views

As an accidental byproduct of some numerical simulations I have been doing as part of a research paper in machine learning, I made the observation that the singular values of the random matrix $\frac{...
Paul's user avatar
  • 171
3 votes
1 answer
334 views

Is the following statement true? For all $n$ large enough, there exists an $M_n \in [-1,1]^{n \times n}$ such that the smallest singular value of $M_n$, $\sigma_n(M_n) \gtrsim \sqrt{n}$. If $n$ is ...
Mathews Boban's user avatar
2 votes
0 answers
157 views

I am trying to develop an algorithm that is very similar to one that would find the best rank one approximation to a matrix $A\in\mathbb R^{m\times n}$, and this is very similar to how SVD works. I am ...
P. Quinton's user avatar
-2 votes
1 answer
505 views

Consider $$\left\|2\sum_{i<j}L_{ij}+4\sum_i \operatorname{diag}e_i \right\|,$$ where (1) $L_{ij}=\operatorname{diag}e_i+\operatorname{diag}e_j-e_ie_j^T-e_je_i^T$ (2) $e_i$ denotes $n$-by-$1$ vector ...
tony's user avatar
  • 405
1 vote
1 answer
2k views

My statistics research requires me to understand the non-uniqueness of SVD in the degenerate case of repeated singular values. I believe that the statements and proofs on this StackExchange posts are ...
just another mathmo's user avatar
3 votes
2 answers
306 views

Let $A$ denote an $n \times n$ matrix, and $\sigma_i(\cdot)$ denote $i$-th largest singular value. Can we extend the following result to general $p \geq 1$? For all $k = 1, \dots, n$, $$ \sum_{i = 1}^...
Xiangxiang Xu's user avatar
1 vote
1 answer
188 views

I am reading an old paper by Kawpien and Pelczynski, Studia Math. 1970. It claims that singular values of a matrix (with positive entries? I am not sure) is given by $t_i=\sqrt{\sum_{j\ge 1}a(i,j)^2}$....
user92646's user avatar
  • 751
1 vote
0 answers
271 views

I am working on a following problem in my free time (which is a simplified version of a problem described here - arxiv.org/abs/0711.2613): Let $A$, $B$ be zero-trace $4 \times 4$ matrices that meet ...
Piotr Lewandowski's user avatar
2 votes
0 answers
66 views

Suppose we have matrix $A$ of size $N_t \times N_m$, containing $N_m$ measurements corrupted by some (e.g. Gaussian) noise. An SVD of this data $A = U_AS_A{V_A}^T$ can reveal the singular vectors $U_A$...
user2600239's user avatar
2 votes
1 answer
291 views

I've been playing around numerically with Haar random $\text{CUE}$ unitary matrices of size $N$ by $N$, with $N$ around $1000$. If I "truncate" the matrix by keeping the upper left $fN$ by $...
user196574's user avatar
1 vote
0 answers
148 views

Presume we have two positive semi-definite matrices $X = UDU^{\top}$ and $X' = U'D'U'^{\top}$. Is there a result on how the singular vectors for the sum $X + X'$ can be expressed in terms of $U$ and $...
foobar_98's user avatar
4 votes
1 answer
266 views

I am looking at (the limitation of) the extension of the singular value decomposition to tensors. I would like to show that there is a tensor $A_{i,j,k}$ that cannot be decomposed in the following ...
Hans's user avatar
  • 2,363
3 votes
1 answer
230 views

Let $X$ be a nodal maximally non-factorial Fano threefold. If there is $1$-node and no other singularities, they by the work of Kuznetsov-Shinder https://arxiv.org/pdf/2207.06477.pdf Lemma 6.18, $D^b(...
user41650's user avatar
  • 2,012
8 votes
0 answers
471 views

For any $X \in \mathbb{C}^{m\times n}$, let $\Sigma(X)$ be the "middle factor" in its SVD, so that $X = U\Sigma(X) V^H$ and the diagonal of $\Sigma(X)$ is arranged in descending order. ...
Nuno's user avatar
  • 269
1 vote
0 answers
322 views

For two vectors $x$ and $y$ in $\mathbb{R}^n$, recall that $y$ weakly majorizes $x$, denoted by $x\prec_w y$, if the sum of the $k$ largest entries of $x$ is smaller than or equal to that of $y$ for ...
Nuno's user avatar
  • 269
1 vote
1 answer
224 views

Suppose $S$ is a tall-and-skinny $m \times n$ matrix with iid Gaussian entries and $D$ is a $m \times m$ deterministic diagonal matrix. What can be said about the bounds on the largest and smallest ...
Max's user avatar
  • 11
12 votes
1 answer
1k views

Consider the two matrices with some parameter $s \in \mathbb R$ $$A_1= \begin{pmatrix} s& -1 &0& 0 \\1&0 &0&0 \\ 0&0&1&0 \\0&0&0&1 \end{pmatrix}$$ and $$...
Pritam Bemis's user avatar
1 vote
1 answer
373 views

$M$ is an iid random matrix with $M_{ij} \sim \mathcal{N}(0,\frac{g^2}N)$ except that the diagonal entries are $-1$. I am to compute, in the limit $N\to\infty$, the eigenvalue/singular value spectrum/...
Charlie Chang's user avatar
2 votes
0 answers
74 views

Let $A_{i} \in GL(d, \mathbb{R})$ for $i=1, 2, 3.$ For $q>0$, we denote $t_{3}^{q}=\sum_{i=0}^{3} \sigma_{1}^{q}(A_{i})\sigma_{2}^{q}(A_{i})\sigma_{3}^{q}(A_{i})$, $t_{2}^{q}=\sum_{i=0}^{3} \sigma_{...
Adam's user avatar
  • 1,045
1 vote
0 answers
101 views

Suppose I have a unit vector $\vec v$, and I write it as a matrix, e.g., $16$-vector $\vec v=(v_1,\dots,v_{16})$, where $v_i$ is the $i$-th entry of the vector $\vec v$, is written as follows $$\begin{...
narip's user avatar
  • 119
2 votes
1 answer
355 views

This question was motivated by Singular value decomposition of truncated discrete Fourier transform matrix Consider for integers $1\leq k\leq N$, $1\leq n_0\leq N-k+1$ the $k\times k$ sub-unitary ...
Carlo Beenakker's user avatar
1 vote
1 answer
210 views

I'm looking for good (as simple as it is possible) reference for the local discriminant variety. I need it in the following situation: I have an unfolding $F: (\mathbb{K}^n \times \mathbb{K}^p, 0) \to ...
Gergo Pinter's user avatar
4 votes
1 answer
318 views

Let $\left(\mathcal{M}^2,g_\mathcal{M};X\right)$ and $\left(\mathcal{N}^2,g_{\mathcal{N}};Y\right)$ be two smooth two-dimensional, simply connected Riemannian manifolds (with or without boundary), ...
Daniel Castro's user avatar
2 votes
0 answers
186 views

Given a positive integer $k$ and a matrix $X\in \mathbb{R}^{m\times n}$. A truncated frobenius norm of a matrix $X$ is defined by $$\Vert X \Vert_{k,F} = \sqrt{\sum_{i=k+1}^{m} \sigma_i^2(X)},$$ where ...
ohana's user avatar
  • 143
2 votes
1 answer
104 views

Given matrix $X \in \mathbb{R}^{m\times n}$ and sequence $\left\{X^k\right\}_k$ converges to $X$ according to the Frobenius norm. I wonder that $\sigma_i(X^k)$ converge $\sigma_i(X)$ or not (where $\...
ohana's user avatar
  • 143
1 vote
1 answer
985 views

Suppose I have a smooth time series $C(t)$ defined on the time interval $[0,T]$, from which I extract the sub-series $c = \left( x_1, \dots, x_N \right)$ of $N$ entries, where $x_i = C \left( i \frac{...
JoJo's user avatar
  • 11
37 votes
17 answers
14k views

The SVD (singular value decomposition) is taught in many linear algebra courses. It's taken for granted that it's important. I have helped teach a linear algebra course before, and I feel like I need ...
1 vote
0 answers
52 views

Let $ X $ and $Y$ be Hilbert space, $A:X \to Y $ compact and injective, $(\sigma_n;v_n,u_n)$ be its singular value decomposition, that is, $$ Av_n = \sigma_n u_n \\ A^* u_n = \sigma_n v_n $$ Since $\...
Yidong Luo's user avatar
3 votes
0 answers
184 views

$\DeclareMathOperator\svd{svd}$Consider the SVD of rectangular matrices as operators $$\svd:\mathbb C^{n\times m}\to \mathbb U_n\times \mathbb D_{n, m}\times\mathbb U_m$$ where $\mathbb U_n$ is the ...
Exodd's user avatar
  • 201
2 votes
1 answer
240 views

I'm looking for an elegant way to show the following claim. Claim: Let $m_1, m_2 \in \mathbb{R}^2$ be the two columns of matrix $M \in \mathbb{R}^{(2 \times 2)}$. The singular values of the matrix are ...
keyboardAnt's user avatar
8 votes
1 answer
842 views

Given matrices $A, B \in \mathbb{R}^{n\times n}$, I would like to solve the following optimization problem, $$\begin{array}{ll} \underset{v \in \mathbb{R}^n}{\text{maximize}} & \|Av\|_2+\|Bv\|_2\\ ...
Alex Meiburg's user avatar
  • 1,203
2 votes
1 answer
234 views

Let $D\subset\mathbb{R}^2$ be a planar domain (maybe simply connected) and consider all the mappings $f:D\to\mathbb{R}^2$ with constant, fixed, positive singular values. Let $E=(E_1,E_2)$ be the ...
Daniel Castro's user avatar
2 votes
1 answer
521 views

Let $A$ be an $n \times n$ random symmetric matrix with $E(A_{i j}) = 0$, $Var(A_{i j}) = 1/n$ for any $i,j$. $B$ is an $n \times n$ symmetric matrix with $B_{ii} = 0$. I need to find a upper bound of ...
Doris's user avatar
  • 21
3 votes
0 answers
77 views

Given a matrix $P \in \mathbb{R}^{n \times d}$, we can get $P = U \Sigma V^T$ by using SVD. Let's say, we have another matrix $P' \in \mathbb{R}^{n \times d}$, it is the $P$ matrix with normalization ...
Jiachen's user avatar
  • 31
2 votes
0 answers
183 views

If we randomly pick $k\ll n$ columns from a fixed $n\times n$ matrix $A$, what can one say about the distribution of the 2-norm condition number of the resulting $n\times k$ matrices $A_k$? I'd expect ...
Arnold Neumaier's user avatar