Single-pass randomized QLP decomposition for low-rank approximation

C. Eckart, G. Young, The approximation of one matrix by another of lower rank, Psychometrika, 1 (1936) 211–218

1936

Earlier work this paper cites.

I.T. Jolliffe, Principal Component Analysis, Springer-Verlag, New York, 1986

1986

Earlier work this paper cites.

R.A. Hron, C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, 1991

1991

Earlier work this paper cites.

G.W. Stewart, The QLP approximation to the singular value decomposition, SIAM J. Sci. Comput., 20 (1999) 1336–1348

1999

Earlier work this paper cites.

D.A. Huckaby, T.F. Chan, On the convergence of Stewart’s QLP algorithm for approximating the SVD. Numer. Algorithms, 32 (2003) 287–316

2003

Earlier work this paper cites.

A.E. Litvak, A. Pajor, M. Rudelson, Smallest singular value of random matrices and geometry of random polytopes, Adv., Math., 195 (2005) 491–523

2005

Earlier work this paper cites.

P.C. Hansen, Regularization tools: a MATLAB package for analysis and solution of discrete ill-posed problems (version 4.1 for MATLAB 7.3), Numer. Algorithms, 46 (2007) 189–194

2007

Earlier work this paper cites.

V. Rokhlin, A. Szlam, M. Tygert, A randomized algorithm for principal component analysis, SIAM J. Matrix Anal. Appl., 31 (2009) 1100–1124

2009

Earlier work this paper cites.

J. Xia, M. Gu, Robust approximate Cholesky factorization of rank-structured symmetric positive definite matrices, SIAM J. Matrix Anal. Appl., 31 (2010) 2899–2920

2010

Earlier work this paper cites.

A.E. Litvak, O. Rivasplata, Smallest singular value of sparse random matrices, Studia Math., 212 (2010) 195–218

2010

Cited alongside, same era.

N. Halko, P.-G. Martinsson, Y. Shkolnisky, M. Tygert, An algorithm for the principal component analysis of large data sets, SIAM J. Sci. Comput., 33 (2011) 2580–2594

2011

Cited alongside, same era.

M. Mahoney, Randomized algorithms for matrices and data, arXiv preprint arXiv: 1104.5557, 2011

2011

Cited alongside, same era.

P.-G. Martinsson, A fast randomized algorithm for computing a hierarchically semi-separable representation of a matrix, SIAM J. Matrix Anal. Appl., 32 (2011) 1251–1274

2011

Cited alongside, same era.

N. Halko, P.G. Martinsson, J.A. Tropp, Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev., 53 (2011) 217–288

2011

J.A. Tropp, A. Yurtsever, M. Udell, V. Cevher, Practical sketching algorithms for low-rank matrix approximation, SIAM J. Matrix Anal. Appl., 38 (2017) 1454–1485

2017

Later among the works it cites.

X. Feng, Y. Xie, M. Song, W. Yu, J. Tang, Fast randomized PCA for sparse data, In Proc. ACML, 95 (2018) 710–725

2018

Later among the works it cites.

M.F. Kaloorazi, R.C. de Lamare, Subspace-orbit randomized decomposition for low-rank matrix approximations, IEEE Trans. Singnal Process., 66 (2018) 4409–4424

2018

Later among the works it cites.

G. Shabat, Y. Shmueli, Y. Aizenbud, A. Averbuch, Randomized LU decomposition, Appl. Comput. Harmon. Anal., 44 (2018) 246–272

2018

Later among the works it cites.

E.K. Bjarkason, Pass-efficient randomized algorithms for low-rank matrix approximation using any number of views, SIAM J. Sci. Comput., 41 (2019) A2355–A2383

2019