{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:47:57Z","timestamp":1743004077252,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030293994"},{"type":"electronic","value":"9783030294007"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_33","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"469-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cholesky and Gram-Schmidt Orthogonalization for Tall-and-Skinny QR Factorizations on Graphics Processors"],"prefix":"10.1007","author":[{"given":"Andr\u00e9s E.","family":"Tom\u00e1s","sequence":"first","affiliation":[]},{"given":"Enrique S.","family":"Quintana-Ort\u00ed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"33_CR1","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.: Reconstructing Householder vectors from tall-skinny QR. J. Parallel Distrib. Comput. 85, 3\u201331 (2015). https:\/\/doi.org\/10.1016\/j.jpdc.2015.06.003. iPDPS 2014 Selected Papers on Numerical and Combinatorial Algorithms","journal-title":"J. Parallel Distrib. Comput."},{"key":"33_CR2","doi-asserted-by":"publisher","unstructured":"Benson, A.R., Gleich, D.F., Demmel, J.: Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures. In: 2013 IEEE International Conference on Big Data, pp. 264\u2013272, October 2013. https:\/\/doi.org\/10.1109\/BigData.2013.6691583","DOI":"10.1109\/BigData.2013.6691583"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"17617","DOI":"10.1109\/ACCESS.2019.2895541","volume":"7","author":"S Catal\u00e1n","year":"2019","unstructured":"Catal\u00e1n, S., Herrero, J.R., Quintana-Ort\u00ed, E.S., Rodr\u00edguez-S\u00e1nchez, R., Van De Geijn, R.: A case for malleable thread-level linear algebra libraries: the LU factorization with partial pivoting. IEEE Access 7, 17617\u201317633 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2895541","journal-title":"IEEE Access"},{"issue":"1","key":"33_CR4","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.: Communication-optimal parallel and sequential QR and LU factorizations. SIAM J. Sci. Comput. 34(1), 206\u2013239 (2012). https:\/\/doi.org\/10.1137\/080731992","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"JJ Dongarra","year":"1990","unstructured":"Dongarra, J.J., Du Croz, J., Hammarling, S., Duff, I.: A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16(1), 1\u201317 (1990)","journal-title":"ACM Trans. Math. Softw."},{"key":"33_CR6","doi-asserted-by":"publisher","unstructured":"Fukaya, T., Nakatsukasa, Y., Yanagisawa, Y., Yamamoto, Y.: 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, November 2014. https:\/\/doi.org\/10.1109\/ScalA.2014.11","DOI":"10.1109\/ScalA.2014.11"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00211-005-0615-4","volume":"101","author":"Luc Giraud","year":"2005","unstructured":"Giraud, L., Langou, J., Rozlo\u017en\u00edk, M., Eshof, J.v.d.: Rounding error analysis of the classical Gram-Schmidt orthogonalization process. Numerische Mathematik 101(1), 87\u2013100 (2005). https:\/\/doi.org\/10.1007\/s00211-005-0615-4","journal-title":"Numerische Mathematik"},{"key":"33_CR8","volume-title":"Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences","author":"G Golub","year":"2013","unstructured":"Golub, G., Van Loan, C.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2013)"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1055531.1055534","volume":"31","author":"BC Gunter","year":"2005","unstructured":"Gunter, B.C., van de Geijn, R.A.: Parallel out-of-core computation and updating the QR factorization. ACM Trans. Math. Softw. 31(1), 60\u201378 (2005). https:\/\/doi.org\/10.1145\/1055531.1055534","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1002\/nla.1839","volume":"20","author":"SJ Leon","year":"2013","unstructured":"Leon, S.J., Bj\u00f6rck, \u00c5., Gander, W.: Gram-Schmidt orthogonalization: 100 years and more. Numer. Linear Algebr. Appl. 20(3), 492\u2013532 (2013). https:\/\/doi.org\/10.1002\/nla.1839","journal-title":"Numer. Linear Algebr. Appl."},{"key":"33_CR11","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.: Iterative Methods for Sparse Linear Systems, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (2003)","edition":"3"},{"issue":"6","key":"33_CR12","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1137\/S1064827500370883","volume":"23","author":"A Stathopoulos","year":"2001","unstructured":"Stathopoulos, A., Wu, K.: A block orthogonalization procedure with constant synchronization requirements. SIAM J. Sci. Comput. 23(6), 2165\u20132182 (2001). https:\/\/doi.org\/10.1137\/S1064827500370883","journal-title":"SIAM J. Sci. Comput."},{"key":"33_CR13","unstructured":"Strazdins, P.: A comparison of lookahead and algorithmic blocking techniques for parallel matrix factorization. Technical report TR-CS-98-07, Department of Computer Science, The Australian National University, Canberra 0200 ACT, Australia (1998)"},{"key":"33_CR14","first-page":"306","volume":"44","author":"Y Yamamoto","year":"2015","unstructured":"Yamamoto, Y., Nakatsukasa, Y., Yanagisawa, Y., Fukaya, T.: Roundoff error analysis of the Cholesky QR2 algorithm. Electron. Trans. Numer. Anal. 44, 306\u2013326 (2015)","journal-title":"Electron. Trans. Numer. Anal."},{"issue":"3","key":"33_CR15","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.: Mixed-precision Cholesky QR factorization and its case studies on multicore CPU with multiple GPUs. SIAM J. Sci. Comput. 37(3), C307\u2013C330 (2015). https:\/\/doi.org\/10.1137\/14M0973773","journal-title":"SIAM J. Sci. Comput."},{"key":"33_CR16","doi-asserted-by":"publisher","unstructured":"Yamazaki, I., Tomov, S., Kurzak, J., Dongarra, J., Barlow, J.: Mixed-precision block Gram Schmidt orthogonalization. In: Proceedings of the 6th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, ScalA 2015, pp. 2:1\u20132:8. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2832080.2832082","DOI":"10.1145\/2832080.2832082"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:05:12Z","timestamp":1691885112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}