2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.MS2021
Efficient algorithms for computing a rank-revealing UTV factorization on parallel computing architectures
N. Heavner, F. D. Igual, G. Quintana-Ortí +1
The randomized singular value decomposition (RSVD) is by now a well established technique for efficiently computing an approximate singular value decomposition of a matrix. Buildin…
cs.MS2020★ 2 cited
Computing rank-revealing factorizations of matrices stored out-of-core
Nathan Heavner, Per-Gunnar Martinsson, Gregorio Quintana-Ortí
This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in RAM, and must instead be stored on slow external memo…