An Algorithm for the Principal Component Analysis of Large Data Sets
From MaRDI portal
Publication:3116449
DOI10.1137/100804139zbMath1232.65058arXiv1007.5510OpenAlexW1505090736MaRDI QIDQ3116449
Mark Tygert, Nathan Halko, Yoel Shkolnisky, Per-Gunnar Martinsson
Publication date: 23 February 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.5510
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Randomized algorithms (68W20)
Related Items
Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Model order reduction for nonlinear Schrödinger equation ⋮ Compactification of the Rigid Motions Group in Image Processing ⋮ Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches ⋮ Deep learning methods for partial differential equations and related parameter identification problems ⋮ Krylov-Aware Stochastic Trace Estimation ⋮ Fast deflation sparse principal component analysis via subspace projections ⋮ Randomized LU decomposition using sparse projections ⋮ Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ Randomized block Krylov methods for approximating extreme eigenvalues ⋮ Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition ⋮ Single-pass randomized QLP decomposition for low-rank approximation
