Tutorial: Complexity analysis of Singular Value Decomposition and its variants

Code

• github.com/UnofficialJuliaMirrorSnapshots/FameSVD.jl-9ba2d756-9ce3-11e9-1a71-0ffcb019784d
  none★ 0
• github.com/UnofficialJuliaMirror/FameSVD.jl-9ba2d756-9ce3-11e9-1a71-0ffcb019784d
  none★ 0
• github.com/MxAR/FameSVD.jl
  none★ 0

Abstract

We compared the regular Singular Value Decomposition (SVD), truncated SVD, Krylov method and Randomized PCA, in terms of time and space complexity. It is well-known that Krylov method and Randomized PCA only performs well when k << n, i.e. the number of eigenpair needed is far less than that of matrix size. We compared them for calculating all the eigenpairs. We also discussed the relationship between Principal Component Analysis and SVD.

Reproductions