AbstractThe randomized singular value decomposition (SVD) is a popular and effective algorithm for computing a near-best rank $k$ approximation of a matrix $A$ using matrix-vector products with standard
gaussian vectors. Here, we generalize the theory of
→