Complexity of parallel QR factorization
- 10 August 1986
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 33 (4) , 712-723
- https://doi.org/10.1145/6490.214102
Abstract
An optimal algorithm to perform the parallel QR decomposition of a dense matrix of size N is proposed. It is deduced that the complexity of such a decomposition is asymptotically 2 N , when an unlimited number of processors is available.Keywords
This publication has 4 references indexed in Scilit:
- Highly concurrent computing structures for matrix arithmetic and signal processingComputer, 1982
- A Survey of Parallel Algorithms in Numerical Linear AlgebraSIAM Review, 1978
- On Stable Parallel Linear System SolversJournal of the ACM, 1978
- Very high-speed computing systemsProceedings of the IEEE, 1966