Parallel algorithms for QR decomposition on a shared memory multiprocessor

DOI10.1016/S0167-8191(05)80066-3zbMath0734.65014OpenAlexW2003232524MaRDI QIDQ811081

N. E. Zubov

Publication date: 1991

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80066-3

zbMATH Keywords

parallel algorithmsQR decompositionGivens rotationsshared memory multiprocessorHouseholder algorithmsalgorithm comparison

Mathematics Subject Classification ID

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

Related Items (2)

A COMPARISON OF THE QR AND QZ MATRIX FACTORISATION METHODS ON PARALLEL COMPUTERS ⋮ Parallel algorithms for \(LU\) decomposition on a shared memory multiprocessor

This page was built for publication: Parallel algorithms for QR decomposition on a shared memory multiprocessor