Thumbnail
Access Restriction
Subscribed

Author Cosnard, M. ♦ Robert, Y.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1986
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract An optimal algorithm to perform the parallel QR decomposition of a dense matrix of size $\textit{N}$ is proposed. It is deduced that the complexity of such a decomposition is asymptotically $2\textit{N},$ when an unlimited number of processors is available.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1986-08-10
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 33
Issue Number 4
Page Count 12
Starting Page 712
Ending Page 723


Open content in new tab

   Open content in new tab
Source: ACM Digital Library