Algorithm 980: Sparse QR factorization on the GPU

DOI10.1145/3065870MaRDI QIDQ4581376zbMATH OpenOpenAlexWikidataFDO

Authors Sencer Yeralan, Timothy A. Davis, Wissam M. Sid-Lakhdar, Sanjay Ranka

Publication date 17 August 2018

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3065870

zbMATH Keywords

sparse matricesGPUQR factorizationleast-square problems

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15) Orthogonalization in numerical linear algebra (65F25) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
• Multifrontal computations on GPUs and their multi-core hosts
• Effective minimally-invasive GPU acceleration of distributed sparse matrix factorization
• scientific article; zbMATH DE number 1226271
• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors

Cited in

(7)

• Efficient batch LU and QR decomposition on GPU
• Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Multifrontal computations on GPUs and their multi-core hosts
• Effective minimally-invasive GPU acceleration of distributed sparse matrix factorization
• Cholesky and Gram-Schmidt orthogonalization for tall-and-skinny QR factorizations on graphics processors
• A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems

Describes a project that uses

Uses Software

• Algorithm 980
• SuiteSparseQR
• SparseMatrix
• CHOLMOD
• CUDA
• LDL
• LAPACK
• COLAMD
• ANSYS

This page was built for publication: Algorithm 980: Sparse QR factorization on the GPU

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581376)