Load balanced parallel QR decomposition on shared memory multiprocessors

DOI10.1016/S0167-8191(01)00087-4MaRDI QIDQ5941492zbMATH OpenWikidataFDO

Authors J. Boleng, M. Misra

Publication date 20 August 2001

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(01)00087-4

zbMATH Keywords

parallel QR decomposition algorithm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel algorithms for QR decomposition on a shared memory multiprocessor
• QR factorization for shared memory and message passing
• scientific article; zbMATH DE number 1226271
• scientific article; zbMATH DE number 878999
• Efficient and optimal parallel algorithms for Cholesky decomposition

Cited in

(2)

• A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer
• Numerical analysis of parallel implementation of the reorthogonalized ABS methods

This page was built for publication: Load balanced parallel QR decomposition on shared memory multiprocessors

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