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

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

2012-02-14

arxiv.org/abs/1202.2957v1

Physics

Nuclear Physics

Nuclear Theory

5 pages, 2 figures

Scientific paper

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 $\sim$80\% 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.

Affiliated with

Also associated with

No associations

Rating

Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88770