Computing rank‐revealing factorizations of matrices stored out‐of‐core

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‐reveali...

Full description

Saved in:

Bibliographic Details
Published in:	Concurrency and computation Vol. 35; no. 22
Main Authors:	Heavner, N., Martinsson, P. G., Quintana‐Ortí, G.
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 10.10.2023 Wiley
Subjects:	Algorithms blocked matrix computations Computation Computer Science Data processing Factorization householder QR factorization HQRRP factorization Mathematical analysis Matrices (mathematics) Memory devices out-of-core computation partial rank-revealing factorization Random access memory randomized numerical linear algebra randUTV factorization rank-revealing factorization shared-memory multicore processors shared-memory multiprocessors Singular value decomposition
ISSN:	1532-0626, 1532-0634, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!