no code implementations • 17 Feb 2020 • 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 memory devices such as solid-state or spinning disk hard drives (out-of-core or out-of-memory).