A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer

DOI10.1016/0167-8191(92)90102-DzbMath0746.65026OpenAlexW2010939715MaRDI QIDQ1184549

Marcos A. Kiwi, Eric Goles Chacc

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90102-d

zbMATH Keywords

lower boundstime complexityGivens rotationsGreedy algorithmparallel QR decompositionGreedy automatonshared memory SIMD computer

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

This page was built for publication: A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer