Fast Truncated SVD of Sparse and Dense Matrices on Graphics Processors

Andres E. Tomas, Enrique S. Quintana-Orti, Hartwig Anzt
Universitat Politecnica de Valencia, Spain
arXiv:2403.06218 [cs.DC], (10 Mar 2024)


   title={Fast truncated SVD of sparse and dense matrices on graphics processors},






   journal={The International Journal of High Performance Computing Applications},

   publisher={SAGE Publications},

   author={Tomás, Andrés E. and Quintana-Orti, Enrique S. and Anzt, Hartwig},





Download Download (PDF)   View View   Source Source   



We investigate the solution of low-rank matrix approximation problems using the truncated SVD. For this purpose, we develop and optimize GPU implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: