A randomized algorithm for the decomposition of matrices

2010/02/20 by Per‐Gunnar Martinsson, Per-Gunnar Martinsson, Vladimir Rokhlin +1 · 12 citations
Computer Science · Engineering · Mathematics · #Blind Source Separation Techniques #Random Matrices and Applications #Sparse and Compressive Sensing Techniques

paper · doi:10.1016/j.acha.2010.02.003

openalex publication_date 2010/02/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Citations

• Numerics of Gram-Schmidt orthogonalization

Cited by

• Matrix Factorization at Scale: a Comparison of Scientific Data Analytics in Spark and C+MPI Using Three Case Studies
• The Singular Value Decomposition, Applications and Beyond
• SingleRust: A High-Performance Toolkit for Single-Cell Data Analysis at Scale
• Local Search Algorithms for Rank-Constrained Convex Optimization
• Randomized algorithms for the low multilinear rank approximations of tensors
• ADAGIO: Fast Data-aware Near-Isometric Linear Embeddings
• Incomplete Pivoted QR-based Dimensionality Reduction
• Randomized LU decomposition
• Efficient Algorithms for Constructing an Interpolative Decomposition
• A Survey on Large-scale Machine Learning
• Efficient algorithms for computing a rank-revealing UTV factorization on parallel computing architectures
• Parametric/Stochastic Model Reduction: Low-Rank Representation, Non-Intrusive Bi-Fidelity Approximation, and Convergence Analysis