Theorems inverse SVD Flashcards
Let A ∈ C^m×n
If X is any matrix satisfying AXA = A then Ax = b has a
solution if and only if
AXb = b, in which case the general solution is x = Xb + (I − XA)y
where y ∈ C^n is an arbitrary vector.
Singular value decomposition
A matrix A ∈ C^m×n has a singular value decomposition:
A = UΣV*
where: U ∈ C^m×m, V ∈ C^n×n -unitary Σ = diag(σ1, . . . , σp) ∈ R^m×n p = min(m, n), where σ1 ≥ σ2 ≥ · · · ≥ σp ≥ 0. If A is real, U and V can be taken real orthogonal
If A = UΣV* ∈ C^m×n SVD then:
A+ = VΣ+U*
where Σ+ = diag(σ−1_1…., σ−1_r, 0, . . . , 0) is n × m
and r = rank(A).
Let the SVD of A ∈ C^m×n be given
U = [u1, . . . , um] and V = [v1, . . . , vn]
If k < r = rank(A)
Ak =Σ^k_i=1: σ_iu_iv*_i
then
min ||A-B||2 =||A-Ak||2 =σk+1.
rank(B)=k
Minimum 2-norm solution
For given A ∈ C^m×n and b ∈ C^m with b ∈ range(A)
The vector x = A^+b is the solution of minimum 2-norm amongst all the solutionsto Ax = b
Least squares solutions
For given A ∈ C^m×n and b ∈ C^m, the vectors
x = A+b + (I − A^+A)y y ∈ C^n arbitrary,
minimize ||Ax − b||2
Moreover xLS = A^+b is the least squares solution of minimum 2-norm