Questions tagged [svd]

In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix, with many useful applications in signal processing and statistics.

In linear algebra, the singular-value decomposition (SVD) is a factorization of a real or complex matrix.

Formally, the singular value decomposition of an $m \times n$ real or complex matrix $M$ is a factorisation of the form $UAV^*$ where $U$ is an $m\times m$ real or complex unitary matrix, $A$ is an $m\times n$ rectangular diagonal matrix with non-negative real numbers on the diagonal, and $V$ is an $n\times n$ real or complex unitary matrix.

The singular-value decomposition can be computed using the following observations:

  • The left-singular vectors of $M$ are a set of orthonormal eigenvectors of $MM^*$.
  • The right-singular vectors of $M$ are a set of orthonormal eigenvectors of $M^*M$.
  • The non-zero singular values of $M$ (found on the diagonal entries of $A$) are the square roots of the non-zero eigenvalues of both $M^*M$ and $MM^*$.

Source: Wikipedia.

1502 questions
0
votes
0 answers

How does the SVD of a matrix relate to the SVD of multiple stacked duplicates of the matrix?

Suppose I have a matrix $A \in \mathbb{R}^{m \times n}$ with singular value decomposition (SVD) $A = U S V^T$. I then stack $A$ on top of itself $k$ times: $A' = [A; A; ...; A] \in \mathbb{R}^{km \times n}$ Is there any way to relate the SVD of $A'$…
0
votes
1 answer

Singular value decomposation orthogonal to another matrix

I have two real matrices $A^{k\times m}$ and $B^{k\times n}$, let's assume $k\gg m$ and $m>n$. Let's also introduce an augmented matrix $C = [A \quad qB]$. I want to get the 'almost' singular values of $A$, subject to the constraint that the left…
Sanchises
  • 536
0
votes
0 answers

Getting largest eigenvalue of A'WA for diagonal W

A is a large ill-conditioned matrix that is available only as a function performing matrix-vector products, and a diagonal (weight) matrix W that is full rank. The eigenvalues of A'A are widely spread whereas the eigenvalues of A'WA are almost flat,…
0
votes
1 answer

Does dimensionality reduction by SVD preserves the ranking order of the dot products between data vectors?

I'm learning stanford cs224n. In its assignment 1, the notebook states: We obtain a full matrix decomposition, with the singular values ordered in the diagonal $S$ matrix, and our new, shorter length-$k$ word vectors in $U_k$. This…
Kevin
  • 33
0
votes
1 answer

What is the singular value of such a simple permutation matrix?

The matrix $\left[\begin{array} &0 &1\\1& 0\end{array}\right]$ The following two solutions give different answers: The first |A-λI|=0 (-λ) 1 1 (-λ) = 0 ∴(-λ)×(-λ)-1×1=0 ∴(λ2)-1=0 ∴(λ2-1)=0 ∴(λ-1)(λ+1)=0 ∴(λ-1)=0or(λ+1)=0 ∴ The eigenvalues of…
0
votes
0 answers

Some questions regarding svd computations

0 I've some questions regarding svd: Consider a matrix A ∈ R500×5 and its SVD [U, S, V T ] = svd(A). (Assume A is centered). a) is the second left singular vector of A is the direction in R5 with the second most variance? b) is the first right…
0
votes
0 answers

Singular value decomposition for $\left(\begin{matrix}0 & 3 & 4\\0 & -3 & -4\end{matrix}\right)$ is off by a factor

Why is my singular value decomposition off? Find a singular value decomposition for $A=\left(\begin{matrix}0 & 3 & 4\\0 & -3 & -4\end{matrix}\right)=U\Sigma V^\intercal$ $AA^\intercal =\left( \begin{matrix}25 & -25 \\ -25 & 25\end{matrix}\right)$…
Vons
  • 11,004
0
votes
1 answer

Prove identity matrix with singular value decomposition

Let $I_d$ denote the $d \times d$ identity matrix and for $X \in \mathbb{R}^{m\times n}$ and $\lambda>0$ I have to prove the following: $$(X^TX+\lambda I_n)^{-1}X^T=X^T(XX^T+\lambda I_m)^{-1}$$ I think about using Singular Value Decomposition of…
Hojas
  • 113
0
votes
1 answer

Can the existence of a QR decomposition PROVE the existence of a SVD decomposition?

I have written a demonstration of the existence of SVD based on the existence of QR, but I am not sure if it's correct or if I am missing something. QR and L'Q' We know that B = QR , with Q orthogonal and R upper triangular We know that Bt = Q'R',…
0
votes
1 answer

SVD: why are the results different: hand-calculation and Matlab computation?

I am solving a SVD computatiob question. The following matrix is given: A=: $$\begin{bmatrix} 1.5 & 0.5 & 0&0 \\ 0.5 & 1.5 & 0 & 0\\ 0 & 0 & 1.5 & 0.5\\ 0&0 & 0.5 & 1.5 \end{bmatrix}$$ I have taken the SVD(A) = [ U S V]. My computation of the…
0
votes
0 answers

calculate the second singular value

$$A=\begin{bmatrix} 0.5 & 0.5 & & & & \\ & 0.5 & 0.5& & & \\ & & \ddots & \ddots & \\ & & & \ddots & 0.5\\ 0.5 & & & &0.5\\ …
ALEX
  • 117
0
votes
0 answers

singular value decomposition of the volterra operator

Can anyone help me to this question? Compute the singular value decomposition of the Volterra operator $Tu(x) = \int_{0}^{x} u (s) ds$ in $L^2(0,1)$ and use it to find $\|T\|$. Is $T$ normal ? Thank you
nmb
  • 11
0
votes
1 answer

Rows of V in reduced SVD with norm 1

Suppose, we're given the reduced/compact SVD of the rank-$r$ Matrix $A=USV^T$ where $U\in\mathbb{R}^{m\times r}$, $S\in\mathbb{R}^{r\times r}$ and $V\in\mathbb{R}^{n\times r}$ and suppose the $i$-th column of $A$ ($A_i$) is not in the span of the…
Benry
  • 11
  • 1
0
votes
0 answers

What's this QR for?

I encountered with Ax=0, A is complex matrix, it used [U,S,V]=svd(A,0) and x=V(:,end) which makes sense. However, it continues D=diag(abs(x)), [Q,R]=qr((AD).'), x=DQ(:,end); What's these last operations for (all in Matlab code)? Thank for help.
Apple
  • 1
0
votes
0 answers

A question regarding the SVD

I just read this certifiable tutorial which is indeed informative: However, I couldn't go further after the following sentence: The values of x1 and x2 are chosen such that the elements of the S are the square roots of the eigenvalues. My question…
Cardinal
  • 860