Fast Parallel Randomized QR with Column Pivoting Algorithms for Reliable Low-Rank Matrix Approximations

Factorizing large matrices by QR with column pivoting (QRCP) is substantially more expensive than QR without pivoting, owing to communication costs required for pivoting decisions. In contrast, randomized QRCP (RQRCP) algorithms have proven themselves empirically to be highly competitive with high-p...

Full description

Bibliographic Details

Published in:	Proceedings, 24th IEEE International Conference on High Performance Computing : 18-21 December 2017, Jaipur, India pp. 233 - 242
Main Authors:	Xiao, Jianwei, Gu, Ming, Langou, Julien
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2017
Subjects:	Algorithm design and analysis Approximation algorithms Decorrelation distributed computing low-rank approximation Matrix decomposition QR factorization randomization spectrum-revealing Reliability theory
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!