{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:52:01Z","timestamp":1725501121532},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540757542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75755-9_69","type":"book-chapter","created":{"date-parts":[[2007,9,22]],"date-time":"2007-09-22T02:44:54Z","timestamp":1190429094000},"page":"570-579","source":"Crossref","is-referenced-by-count":3,"title":["Rectangular Full Packed Format for LAPACK Algorithms Timings on Several Computers"],"prefix":"10.1007","author":[{"given":"Fred G.","family":"Gustavson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"Wa\u015bniewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/1067967.1067969","volume":"31","author":"B.S. Andersen","year":"2005","unstructured":"Andersen, B.S., Gunnels, J., Gustavson, F.G., Reid, J.K., Wa\u015bniewski, J.: A fully portable high performance minimal storage hybrid format Cholesky algorithm. TOMS\u00a031, 201\u2013227 (2005)","journal-title":"TOMS"},{"issue":"2","key":"69_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/383738.383741","volume":"27","author":"B.A. Andersen","year":"2001","unstructured":"Andersen, B.A., Gustavson, F.G., Wa\u015bniewski, J.: A recursive formulation of Cholesky factorization of a matrix in packed storage. TOMS\u00a027(2), 214\u2013244 (2001)","journal-title":"TOMS"},{"key":"69_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, E., et al.: LAPACK Users\u2019 Guide Release 3.0, SIAM, Philadelphia (1999), http:\/\/www.netlib.org\/lapack\/","DOI":"10.1137\/1.9780898719604"},{"key":"69_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11558958_29","volume-title":"Applied Parallel Computing","author":"J.A. Gunnels","year":"2006","unstructured":"Gunnels, J.A., Gustavson, F.G.: A New Array Format for Symmetric and Triangular Matrices. In: Dongarra, J.J., Madsen, K., Wa\u015bniewski, J. (eds.) PARA 2004. LNCS, vol.\u00a03732, pp. 247\u2013255. Springer, Heidelberg (2006)"},{"issue":"1","key":"69_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S0036144503428693","volume":"46","author":"E. Elmroth","year":"2004","unstructured":"Elmroth, E., Gustavson, F.G., K\u00e5gstr\u00f6m, B., Jonsson, I.: Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software. SIAM Review\u00a046(1), 3\u201345 (2004)","journal-title":"SIAM Review"},{"key":"69_CR6","unstructured":"Herrero, J.R.: A Framework for Efficient Execution of Matrix Computations, PhD thesis, Universitat Polit\u00e8cnica de Catalunya (May 2006)"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75755-9_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T06:26:42Z","timestamp":1684045602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75755-9_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540757542"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75755-9_69","relation":{},"subject":[]}}