Computing rank‐revealing factorizations of matrices stored out‐of‐core
- Univ. of Colorado, Boulder, CO (United States)
- Univ. of Texas, Austin, TX (United States)
- Universitat Jaume I, Castellón (Spain)
This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.
- Research Organization:
- Univ. of Texas, Austin, TX (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); National Science Foundation (NSF); US Department of the Navy, Office of Naval Research (ONR); Spanish Ministry of Science and Innovation and the Research State Agency
- Grant/Contract Number:
- SC0022251
- OSTI ID:
- 2575873
- Journal Information:
- Concurrency and Computation. Practice and Experience, Journal Name: Concurrency and Computation. Practice and Experience Journal Issue: 22 Vol. 35; ISSN 1532-0626; ISSN 1532-0634
- Publisher:
- WileyCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
A block QR factorization algorithm using restricted pivoting
Computing rank-revealing QR factorizations of dense matrices.
Related Subjects
HQRRP factorization
blocked matrix computations
householder QR factorization
out-of-core computation
partial rank-revealing factorization
randUTV factorization
randomized numerical linear algebra
rank-revealing factorization
shared-memory multicore processors
shared-memory multiprocessors