Efficient batch LU and QR decomposition on GPU

DOI10.1007/978-3-319-06548-9_4zbMATH Open1317.65075OpenAlexW2202687868MaRDI QIDQ5261396FDOQ5261396

Authors: William J. Brouwer, Pierre-Yves C. R. Taunay 

Publication date: 3 July 2015

Published in: Numerical Computations with GPUs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06548-9_4

Recommendations

• Accelerating numerical dense linear algebra calculations with GPUs
• Implementing an interior point method for linear programs on a CPU-GPU system
• Algorithm 980: Sparse QR factorization on the GPU
• Computing boundary element method's matrices on GPU
• Parallel Processing of Matrix Multiplication in a CPU and GPU Heterogeneous Environment

zbMATH Keywords

algorithmCUDAQR decompositionLU decomposition

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Cited In (3)

• Accelerating numerical dense linear algebra calculations with GPUs
• A flexible CUDA LU-based solver for small, batched linear systems
• Stability and Performance of Various Singular Value QR Implementations on Multicore CPU with a GPU

Uses Software

• CUDA

This page was built for publication: Efficient batch LU and QR decomposition on GPU

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