Efficient algorithms for computing rank‐revealing factorizations on a GPU

Standard rank‐revealing factorizations such as the singular value decomposition (SVD) and column pivoted QR factorization are challenging to implement efficiently on a GPU. A major difficulty in this regard is the inability of standard algorithms to cast most operations in terms of the Level‐3 BLAS....

Full description

Saved in:
Bibliographic Details
Published in:Numerical linear algebra with applications Vol. 30; no. 6
Main Authors: Heavner, Nathan, Chen, Chao, Gopal, Abinand, Martinsson, Per‐Gunnar
Format: Journal Article
Language:English
Published: Oxford Wiley Subscription Services, Inc 01.12.2023
Subjects:
ISSN:1070-5325, 1099-1506
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first