Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants

From MaRDI portal
Publication:743338

DOI10.1016/J.CPC.2012.09.002zbMATH Open1296.81010arXiv1202.2957OpenAlexW1975560892MaRDI QIDQ743338FDOQ743338


Authors: Yutaka Utsuno, Noritaka Shimizu, Takaharu Otsuka, Takashi Abe Edit this on Wikidata


Publication date: 24 September 2014

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: We present an efficient numerical method for computing Hamiltonian matrix elements between non-orthogonal Slater determinants, focusing on the most time-consuming component of the calculation that involves a sparse array. In the usual case where many matrix elements should be calculated, this computation can be transformed into a multiplication of dense matrices. It is demonstrated that the present method based on the matrix-matrix multiplication attains sim80% of the theoretical peak performance measured on systems equipped with modern microprocessors, a factor of 5-10 better than the normal method using indirectly indexed arrays to treat a sparse array. The reason for such different performances is discussed from the viewpoint of memory access.


Full work available at URL: https://arxiv.org/abs/1202.2957




Recommendations





Cited In (3)

Uses Software





This page was built for publication: Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743338)