{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T06:50:32Z","timestamp":1676875832961},"reference-count":10,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1986,8,10]]},"abstract":"\n An optimal algorithm to perform the parallel QR decomposition of a dense matrix of size\n N<\/jats:italic>\n is proposed. It is deduced that the complexity of such a decomposition is asymptotically 2\n N<\/jats:italic>\n , when an unlimited number of processors is available.\n <\/jats:p>","DOI":"10.1145\/6490.214102","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:25:57Z","timestamp":1027769157000},"page":"712-723","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Complexity of parallel\n QR<\/i>\n factorization"],"prefix":"10.1145","volume":"33","author":[{"given":"M.","family":"Cosnard","sequence":"first","affiliation":[{"name":"Univ. de Grenoble, France"}]},{"given":"Y.","family":"Robert","sequence":"additional","affiliation":[{"name":"Univ. de Grenoble, France"}]}],"member":"320","published-online":{"date-parts":[[1986,8,10]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1982.1653828"},{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1966.5273"},{"key":"e_1_2_1_3_2","first-page":"19","volume-title":"Proc. SPIE 298","author":"GENTLEMAN W. M.","year":"1981","unstructured":"GENTLEMAN , W. M. , AND KUNG , H.T. Matrix triangularization by systolic arrays . Proc. SPIE 298 , Real time signal processing 4 ( Aug. 1981 ), 19 - 26 . GENTLEMAN, W. M., AND KUNG, H.T. Matrix triangularization by systolic arrays. Proc. SPIE 298, Real time signal processing 4 (Aug. 1981), 19-26."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/1020096"},{"key":"e_1_2_1_5_2","first-page":"113","volume-title":"Proceedings of the 1982 Conference on Advanced Research in VLSI. MIT","author":"HELLER D.","year":"1982","unstructured":"HELLER , D. , AND IPSEN , I. Systolic networks for orthogonal equivalence transformations and their applications . In Proceedings of the 1982 Conference on Advanced Research in VLSI. MIT , Cambridge, Mass. , 1982 , pp. 113 - 122 . HELLER, D., AND IPSEN, I. Systolic networks for orthogonal equivalence transformations and their applications. In Proceedings of the 1982 Conference on Advanced Research in VLSI. MIT, Cambridge, Mass., 1982, pp. 113-122."},{"key":"e_1_2_1_6_2","first-page":"256","volume-title":"Sparse Matrix Proceedings 1978","author":"KUNG H. T.","year":"1979","unstructured":"KUNG , H. T. , AND LE iSE RSON , C. E. Systolic arrays for (VLSI) . In Sparse Matrix Proceedings 1978 , I. Duff and G. W. Stewart, Eds. SIAM, Philadelphia, Pa. , 1979 , pp. 256 - 282 . KUNG, H. T., AND LEiSERSON, C. E. Systolic arrays for (VLSI). In Sparse Matrix Proceedings 1978, I. Duff and G. W. Stewart, Eds. SIAM, Philadelphia, Pa., 1979, pp. 256-282."},{"key":"e_1_2_1_7_2","volume-title":"An Introduction to Combinatorial Analysis","author":"RIORDAN J.","year":"1958","unstructured":"RIORDAN , J. An Introduction to Combinatorial Analysis . Wiley , New York , 1958 . RIORDAN, J. An Introduction to Combinatorial Analysis. Wiley, New York, 1958."},{"key":"e_1_2_1_8_2","volume-title":"Numerical parallel algorithms--A survey","author":"SAMEH A.","year":"1977","unstructured":"SAMEH , A. Numerical parallel algorithms--A survey , in High-Speed Computer and Algorithm Organization, D. Kuck, D. Lawrie, and A. Sameh, Eds. Academic Press , Orlando, Fla., 1977 , 207-228. SAMEH, A. Numerical parallel algorithms--A survey, in High-Speed Computer and Algorithm Organization, D. Kuck, D. Lawrie, and A. Sameh, Eds. Academic Press, Orlando, Fla., 1977, 207-228."},{"key":"e_1_2_1_9_2","first-page":"129","article-title":"An overview of parallel algorithms","author":"SAMEH A","year":"1983","unstructured":"SAMEH , A . An overview of parallel algorithms . Bull. EDF CI ( 1983 ) 129 - 134 . SAMEH, A. An overview of parallel algorithms. Bull. EDF CI (1983) 129-134.","journal-title":"Bull. EDF"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322054"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/6490.214102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:13:38Z","timestamp":1672690418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/6490.214102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8,10]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,8,10]]}},"alternative-id":["10.1145\/6490.214102"],"URL":"https:\/\/doi.org\/10.1145\/6490.214102","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,8,10]]},"assertion":[{"value":"1986-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}