{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:52Z","timestamp":1740123532134,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T00:00:00Z","timestamp":1579824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T00:00:00Z","timestamp":1579824000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministerio de Economia y Empresa","award":["TIN2017-82972-R"],"award-info":[{"award-number":["TIN2017-82972-R"]}]},{"DOI":"10.13039\/100010664","name":"H2020 Future and Emerging Technologies","doi-asserted-by":"publisher","award":["732631"],"award-info":[{"award-number":["732631"]}],"id":[{"id":"10.13039\/100010664","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11227-020-03176-3","type":"journal-article","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T13:06:00Z","timestamp":1579871160000},"page":"8771-8786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tall-and-skinny QR factorization with approximate Householder reflectors on graphics processors"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3969-2174","authenticated-orcid":false,"given":"Andr\u00e9s E.","family":"Tom\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique S.","family":"Quintana-Ort\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"issue":"12","key":"3176_CR1","doi-asserted-by":"publisher","first-page":"2700","DOI":"10.1109\/TPDS.2018.2842785","volume":"29","author":"A Abdelfattah","year":"2018","unstructured":"Abdelfattah A, Haidar A, Tomov S, Dongarra J (2018) Analysis and design techniques towards high-performance and energy-efficient dense linear solvers on GPUs. IEEE Trans Parallel Distrib Syst 29(12):2700\u20132712. https:\/\/doi.org\/10.1109\/TPDS.2018.2842785","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3176_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jpdc.2015.06.003","volume":"85","author":"G Ballard","year":"2015","unstructured":"Ballard G, Demmel J, Grigori L, Jacquelin M, Knight N, Nguyen H (2015) Reconstructing Householder vectors from tall-skinny QR. J Parallel Distrib Comput 85:3\u201331. https:\/\/doi.org\/10.1016\/j.jpdc.2015.06.003","journal-title":"J Parallel Distrib Comput"},{"key":"3176_CR3","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-540-85451-7_79","volume-title":"Euro-Par 2008\u2014parallel processing","author":"S Barrachina","year":"2008","unstructured":"Barrachina S, Castillo M, Igual FD, Mayo R, Quintana-Ort\u00ed ES (2008) Solving dense linear systems on graphics processors. In: Luque E, Margalef T, Ben\u00edtez D (eds) Euro-Par 2008\u2014parallel processing. Springer, Heidelberg, pp 739\u2013748"},{"key":"3176_CR4","doi-asserted-by":"publisher","unstructured":"Benson AR, Gleich DF, Demmel J (2013) Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures. In: 2013 IEEE International Conference on Big Data, pp 264\u2013272. https:\/\/doi.org\/10.1109\/BigData.2013.6691583","DOI":"10.1109\/BigData.2013.6691583"},{"issue":"3","key":"3176_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01436084","volume":"7","author":"P Businger","year":"1965","unstructured":"Businger P, Golub GH (1965) Linear least squares solutions by householder transformations. Numer Math 7(3):269\u2013276. https:\/\/doi.org\/10.1007\/BF01436084","journal-title":"Numer Math"},{"issue":"1","key":"3176_CR6","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/080731992","volume":"34","author":"J Demmel","year":"2012","unstructured":"Demmel J, Grigori L, Hoemmen M, Langou J (2012) Communication-optimal parallel and sequential QR and LU factorizations. SIAM J Sci Comput 34(1):206\u2013239. https:\/\/doi.org\/10.1137\/080731992","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"3176_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"J Dongarra","year":"1990","unstructured":"Dongarra J, Du Croz J, Hammarling S, Duff IS (1990) A set of level 3 basic linear algebra subprograms. ACM Trans Math Softw 16(1):1\u201317. https:\/\/doi.org\/10.1145\/77626.79170","journal-title":"ACM Trans Math Softw"},{"issue":"2","key":"3176_CR8","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/1377612.1377616","volume":"35","author":"Z Drma\u010d","year":"2008","unstructured":"Drma\u010d Z, Bujanovi\u0107 Z (2008) On the failure of rank-revealing qr factorization software\u2014a case study. ACM Trans Math Softw 35(2):12:1\u201312:28. https:\/\/doi.org\/10.1145\/1377612.1377616","journal-title":"ACM Trans Math Softw"},{"key":"3176_CR9","doi-asserted-by":"publisher","unstructured":"Fukaya T, Nakatsukasa Y, Yanagisawa Y, Yamamoto Y (2014) CholeskyQR2: A simple and communication-avoiding algorithm for computing a tall-skinny QR factorization on a large-scale parallel system. In: 2014 5th workshop on latest advances in scalable algorithms for large-scale systems, pp 31\u201338. https:\/\/doi.org\/10.1109\/ScalA.2014.11","DOI":"10.1109\/ScalA.2014.11"},{"key":"3176_CR10","unstructured":"Fukaya T, Kannan R, Nakatsukasa Y, Yamamoto Y, Yanagisawa Y (2018) Shifted CholeskyQR for computing the QR factorization of ill-conditioned matrices, arXiv:1809.11085"},{"key":"3176_CR11","volume-title":"Matrix computations. Johns Hopkins studies in the mathematical sciences","author":"G Golub","year":"2013","unstructured":"Golub G, Van Loan C (2013) Matrix computations. Johns Hopkins studies in the mathematical sciences. Johns Hopkins University Press, Baltimore"},{"issue":"1","key":"3176_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1055531.1055534","volume":"31","author":"BC Gunter","year":"2005","unstructured":"Gunter BC, van de Geijn RA (2005) Parallel out-of-core computation and updating the QR factorization. ACM Trans Math Softw 31(1):60\u201378. https:\/\/doi.org\/10.1145\/1055531.1055534","journal-title":"ACM Trans Math Softw"},{"issue":"2","key":"3176_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1145\/1141885.1141886","volume":"32","author":"T Joffrain","year":"2006","unstructured":"Joffrain T, Low TM, Quintana-Ort\u00ed ES, Rvd Geijn, Zee FGV (2006) Accumulating householder transformations, revisited. ACM Trans Math Softw 32(2):169\u2013179. https:\/\/doi.org\/10.1145\/1141885.1141886","journal-title":"ACM Trans Math Softw"},{"issue":"3","key":"3176_CR14","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1137\/0913042","volume":"13","author":"C Puglisi","year":"1992","unstructured":"Puglisi C (1992) Modification of the householder method based on the compact WY representation. SIAM J Sci Stat Comput 13(3):723\u2013726. https:\/\/doi.org\/10.1137\/0913042","journal-title":"SIAM J Sci Stat Comput"},{"key":"3176_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y Saad","year":"2003","unstructured":"Saad Y (2003) Iterative methods for sparse linear systems, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia","edition":"3"},{"issue":"1","key":"3176_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0910005","volume":"10","author":"R Schreiber","year":"1989","unstructured":"Schreiber R, Van Loan C (1989) A storage-efficient WY representation for products of householder transformations. SIAM J Sci Comput 10(1):53\u201357. https:\/\/doi.org\/10.1137\/0910005","journal-title":"SIAM J Sci Comput"},{"issue":"6","key":"3176_CR17","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1137\/S1064827500370883","volume":"23","author":"A Stathopoulos","year":"2001","unstructured":"Stathopoulos A, Wu K (2001) A block orthogonalization procedure with constant synchronization requirements. SIAM J Sci Comput 23(6):2165\u20132182. https:\/\/doi.org\/10.1137\/S1064827500370883","journal-title":"SIAM J Sci Comput"},{"key":"3176_CR18","unstructured":"Strazdins P (1998) A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization. Tech. Rep. TR-CS-98-07, Department of Computer Science, The Australian National University, Canberra 0200 ACT, Australia"},{"key":"3176_CR19","doi-asserted-by":"publisher","unstructured":"Tom\u00e1s Dominguez AE, Quintana Orti ES (2018) Fast blocking of householder reflectors on graphics processors. In: 2018 26th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp 385\u2013393. https:\/\/doi.org\/10.1109\/PDP2018.2018.00068","DOI":"10.1109\/PDP2018.2018.00068"},{"key":"3176_CR20","unstructured":"Volkov V, Demmel JW (2008) LU, QR and Cholesky factorizations using vector capabilities of GPUs. Tech. Rep. 202, LAPACK Working Note. http:\/\/www.netlib.org\/lapack\/lawnspdf\/lawn202.pdf"},{"key":"3176_CR21","first-page":"306","volume":"44","author":"Y Yamamoto","year":"2015","unstructured":"Yamamoto Y, Nakatsukasa Y, Yanagisawa Y, Fukaya T (2015) Roundoff error analysis of the Cholesky QR2 algorithm. Electron Trans Numer Anal 44:306\u2013326","journal-title":"Electron Trans Numer Anal"},{"issue":"3","key":"3176_CR22","doi-asserted-by":"publisher","first-page":"C307","DOI":"10.1137\/14M0973773","volume":"37","author":"I Yamazaki","year":"2015","unstructured":"Yamazaki I, Tomov S, Dongarra J (2015) Mixed-precision Cholesky QR factorization and its case studies on multicore CPU with multiple GPUs. SIAM J Sci Comput 37(3):C307\u2013C330. https:\/\/doi.org\/10.1137\/14M0973773","journal-title":"SIAM J Sci Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03176-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-020-03176-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03176-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,23]],"date-time":"2021-01-23T00:59:41Z","timestamp":1611363581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-020-03176-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,24]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["3176"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03176-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2020,1,24]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}