{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:29:02Z","timestamp":1761060542423,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319699523"},{"type":"electronic","value":"9783319699530"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-69953-0_14","type":"book-chapter","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T10:54:32Z","timestamp":1521456872000},"page":"243-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["High Performance LOBPCG Method for Solving Multiple Eigenvalues of Hubbard Model: Efficiency of Communication Avoiding Neumann Expansion Preconditioner"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Yamada","sequence":"first","affiliation":[]},{"given":"Toshiyuki","family":"Imamura","sequence":"additional","affiliation":[]},{"given":"Masahiko","family":"Machida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"volume-title":"The Hubbard Model: Recent Results","year":"1991","unstructured":"Rasetti, M. (ed.): The Hubbard Model: Recent Results. World Scientific, Singapore (1991)","key":"14_CR1"},{"volume-title":"The Hubbard Model","year":"1992","unstructured":"Montorsi, A. (ed.): The Hubbard Model. World Scientific, Singapore (1992)","key":"14_CR2"},{"doi-asserted-by":"crossref","unstructured":"Cullum, J.K., Willoughby, R.A.: Lanczos Algorithms for Large Symmetric Eigenvalue Computations, vol. 1: Theory. SIAM, Philadelphia (2002)","key":"14_CR3","DOI":"10.1137\/1.9780898719192"},{"key":"14_CR4","first-page":"104","volume":"7","author":"AV Knyazev","year":"1998","unstructured":"Knyazev, A.V.: Preconditioned eigensolvers - an oxymoron? Electron. Trans. Numer. Anal. 7, 104\u2013123 (1998)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/S1064827500366124","volume":"23","author":"AV Knyazev","year":"2001","unstructured":"Knyazev, A.V.: Toward the optimal eigensolver: locally optimal block preconditioned conjugate gradient method. SIAM J. Sci. Comput. 23, 517\u2013541 (2001)","journal-title":"SIAM J. Sci. Comput."},{"doi-asserted-by":"crossref","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems: Revised Edition. SIAM (2011)","key":"14_CR6","DOI":"10.1137\/1.9781611970739"},{"doi-asserted-by":"crossref","unstructured":"Yamada, S., Imamura, T., Machida, M.: 16.447 TFlops and 159-Billion-dimensional exact-diagonalization for trapped Fermion-Hubbard Model on the Earth Simulator. In: Proceedings of SC 2005 (2005)","key":"14_CR7","DOI":"10.1109\/SC.2005.1"},{"unstructured":"Yamada, S., Imamura, T., Machida, M.: Communication avoiding Neumann expansion preconditioner for LOBPCG method: convergence property of exact diagonalization method for Hubbard model. In: Proceedings of ParCo 2017 (2017, accepted)","key":"14_CR8"},{"doi-asserted-by":"crossref","unstructured":"Barrett, R., et al.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia (1994)","key":"14_CR9","DOI":"10.1137\/1.9781611971538"},{"unstructured":"Langou, J.: AllReduce algorithms: application to Householder QR factorization. In: Proceedings of the 2007 International Conference on Preconditioning Techniques for Large Sparse Matrix Problems in Scientific and Industrial Applications, pp. 103\u2013106 (2007)","key":"14_CR10"},{"unstructured":"Demmel, J., Grigori, L., Hoemmen, M., Langou, J.: Communication-avoiding paralleland sequential QR factorizations, Technical report, Electrical Engineering and Computer Sciences, University of California Berkeley (2008)","key":"14_CR11"}],"container-title":["Lecture Notes in Computer Science","Supercomputing Frontiers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69953-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T23:54:43Z","timestamp":1570924483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69953-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319699523","9783319699530"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69953-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}