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).
2 code implementations • 8 Dec 2015 • Per-Gunnar Martinsson, Gregorio Quintana-Orti, Nathan Heavner, Robert van de Geijn
A fundamental problem when adding column pivoting to the Householder QR factorization is that only about half of the computation can be cast in terms of high performing matrix-matrix multiplications, which greatly limits the benefits that can be derived from so-called blocking of algorithms.
Numerical Analysis Numerical Analysis
