Michel Cosnard, Yves Robert
Abstract
Open-access reader
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.
OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: QR decomposition, Matrix decomposition, Factorization, Decomposition, Asymptotically optimal algorithm, Computational complexity theory, Computer science, Mathematics