QR factorization for shared memory and message passing
From MaRDI portal
Publication:1853237
DOI10.1016/S0167-8191(02)00162-XzbMATH Open1014.68224OpenAlexW2035472076MaRDI QIDQ1853237FDOQ1853237
Authors: Ian N. Dunn, Gerard G. L. Meyer 
Publication date: 21 January 2003
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(02)00162-x
Recommendations
- QR factorization of a dense matrix on a shared-memory multiprocessor
- Parallel QR factorization for hybrid message passing/shared memory operation
- Parallel sparse QR factorization on shared memory architectures
- scientific article; zbMATH DE number 2090652
- Parallel algorithms for QR decomposition on a shared memory multiprocessor
Cited In (9)
- Efficient householder QR factorization for superscalar processors
- QR factorization of a dense matrix on a shared-memory multiprocessor
- Scaling up parallel computation of tiled QR factorizations by a distributed scheduling runtime system and analytical modeling
- Parallel QR factorization using the torus-wrap mapping
- Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
- Load balanced parallel QR decomposition on shared memory multiprocessors
- A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer
- Parallel out-of-core computation and updating of the QR factorization
- Parallel QR factorization for hybrid message passing/shared memory operation
Uses Software
This page was built for publication: QR factorization for shared memory and message passing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853237)
