Parrallel Implementation of Fast Randomized Algorithms for Low Rank Matrix Decomposition
Journal Article
·
· Parallel Processing Letters, 24(1):Article No. 1450004
We analyze the parallel performance of randomized interpolative decomposition by de- composing low rank complex-valued Gaussian random matrices larger than 100 GB. We chose a Cray XMT supercomputer as it provides an almost ideal PRAM model permitting quick investigation of parallel algorithms without obfuscation from hardware idiosyncrasies. We obtain that on non-square matrices performance scales almost linearly with runtime about 100 times faster on 128 processors. We also verify that numerically discovered error bounds still hold on matrices two orders of magnitude larger than those previously tested.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1214081
- Report Number(s):
- PNNL-SA-91896; 400470000
- Journal Information:
- Parallel Processing Letters, 24(1):Article No. 1450004, Journal Name: Parallel Processing Letters, 24(1):Article No. 1450004
- Country of Publication:
- United States
- Language:
- English
Similar Records
A multi-platform evaluation of the randomized CX low-rank matrix factorization in Spark
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
A parallel algorithm for mesh smoothing
Conference
·
Thu Jul 27 00:00:00 EDT 2017
·
OSTI ID:1214081
+9 more
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
Journal Article
·
Thu Oct 27 00:00:00 EDT 2016
· SIAM Journal on Scientific Computing
·
OSTI ID:1214081
+2 more
A parallel algorithm for mesh smoothing
Journal Article
·
Thu Jul 01 00:00:00 EDT 1999
· SIAM Journal on Scientific Computing
·
OSTI ID:1214081