{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:21Z","timestamp":1763468181563,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642552236"},{"type":"electronic","value":"9783642552243"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-55224-3_2","type":"book-chapter","created":{"date-parts":[[2014,5,5]],"date-time":"2014-05-05T20:44:02Z","timestamp":1399322642000},"page":"15-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exploiting Data Sparsity in Parallel Matrix Powers Computations"],"prefix":"10.1007","author":[{"given":"Nicholas","family":"Knight","sequence":"first","affiliation":[]},{"given":"Erin","family":"Carson","sequence":"additional","affiliation":[]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"key":"2_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-77147-0_3","volume-title":"Hierarchical Matrices","author":"M Bebendorf","year":"2008","unstructured":"Bebendorf, M.: A means to efficiently solve elliptic boundary value problems. In: Bart, T., Griebel, M., Keyes, D., Nieminen, R., Roose, D., Schlick, T. (eds.) Hierarchical Matrices. LNCS, vol. 63, pp. 49\u201398. Springer, Heidelberg (2008)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1002\/cpe.1206","volume":"19","author":"E Chan","year":"2007","unstructured":"Chan, E., Heimlich, M., Purkayastha, A., Van De Geijn, R.: Collective communication: theory, practice, and experience. Concurrency Comput.: Pract. Exper. 19, 1749\u20131783 (2007)","journal-title":"Concurrency Comput.: Pract. Exper."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/050639028","volume":"29","author":"S Chandrasekaran","year":"2006","unstructured":"Chandrasekaran, S., Dewilde, P., Gu, M., Lyons, W., Pals, T.: A fast solver for HSS representations via sparse matrices. SIAM J. Matrix Anal. Appl. 29, 67\u201381 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2_CR4","unstructured":"Demmel, J., Hoemmen, M., Mohiyuddin, M., Yelick, K.: Avoiding communication in computing Krylov subspaces. Technical report UCB\/EECS-2007-123, University of California-Berkeley (2007)"},{"key":"2_CR5","unstructured":"Hoemmen, M.: Communication-avoiding Krylov subspace methods. Ph.D. thesis, University of California-Berkeley (2010)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Hong, J., Kung, H.: I\/O complexity: the red-blue pebble game. In: Proceedings of the 13th ACM Symposium on Theory of Computing, pp. 326\u2013333. ACM, New York (1981)","DOI":"10.1145\/800076.802486"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Knight, N., Carson, E., Demmel, J.: Exploiting data sparsity in parallel matrix powers computations. Technical report UCB\/EECS-2013-47, University of California-Berkeley (2013)","DOI":"10.21236\/ADA584727"},{"key":"2_CR8","unstructured":"Kriemann, R.: Parallele Algorithmen f\u00fcr $$\\cal H$$-Matrizen. Ph.D. thesis, Christian-Albrechts-Universit\u00e4t zu Kiel (2005)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1006\/jcss.1997.1473","volume":"54","author":"C Leiserson","year":"1997","unstructured":"Leiserson, C., Rao, S., Toledo, S.: Efficient out-of-core algorithms for linear relaxation using blocking covers. J. Comput. Syst. Sci. Int. 54, 332\u2013344 (1997)","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"2_CR10","unstructured":"Mohiyuddin, M.: Tuning hardware and software for multiprocessors. Ph.D. thesis, University of California-Berkeley (2012)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Mohiyuddin, M., Hoemmen, M., Demmel, J., Yelick, K.: Minimizing communication in sparse matrix solvers. In: Proceedings of the Conference on High Performance Computing Networking, Storage, and Analysis, pp. 36:1\u201336:12. ACM, New York (2009)","DOI":"10.1145\/1654059.1654096"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/j.apnum.2010.12.009","volume":"62","author":"B Philippe","year":"2012","unstructured":"Philippe, B., Reichel, L.: On the generation of Krylov subspace bases. Appl. Numer. Math. 62, 1171\u20131186 (2012)","journal-title":"Appl. Numer. Math."},{"key":"2_CR13","unstructured":"Wang, S., Li, X., Xia, J., Situ, Y., de Hoop, M.: Efficient scalable algorithms for hierarchically semiseparable matrices. SIAM J. Sci. Comput. (2012, under review)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55224-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T19:50:12Z","timestamp":1746215412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55224-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552236","9783642552243"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55224-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}