{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T14:43:43Z","timestamp":1729608223546,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1109\/clustr.2008.4663801","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T00:17:52Z","timestamp":1225930672000},"page":"402-410","source":"Crossref","is-referenced-by-count":2,"title":["A dynamic programming approach to optimizing the blocking strategy for the Householder QR decomposition"],"prefix":"10.1109","author":[{"given":"Takeshi","family":"Fukaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusaku","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shao-Liang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840311"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1055531.1055532"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840306"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/HPCASIA.2005.76"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/11946441_44"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.2172\/5604546","author":"anderson","year":"1992","journal-title":"Lapack User's Guide"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/0910005"},{"journal-title":"Matrix Computations","year":"1996","author":"golub","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/77626.79170"},{"key":"7","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-540-73940-1_35","article-title":"accelerating the singular value decomposition of rectangular matrices with the csx600 and the integrable svd","volume":"4671","author":"yamamoto","year":"2007","journal-title":"Lectire Notes in Computer Science"},{"key":"6","first-page":"31","article-title":"acceleration of the singular value decomposition algorithm for rectangular matrices with a floating-point coprocessor","volume":"48","author":"fukaya","year":"2007","journal-title":"IPSJ transactions on Advanced Computing Systems"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53065-7_101"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1147\/rd.444.0605"},{"journal-title":"Dynamic Programming","year":"2003","author":"bellman","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589"}],"event":{"name":"2008 IEEE International Conference on Cluster Computing (CLUSTER)","start":{"date-parts":[[2008,9,29]]},"location":"Tsukuba","end":{"date-parts":[[2008,10,1]]}},"container-title":["2008 IEEE International Conference on Cluster Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4655410\/4663724\/04663801.pdf?arnumber=4663801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T13:10:51Z","timestamp":1497791451000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4663801\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/clustr.2008.4663801","relation":{},"subject":[],"published":{"date-parts":[[2008,9]]}}}