Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants
From MaRDI portal
(Redirected from Publication:743338)
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 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.
Recommendations
- Fast Computation of the Slater Integrals
- Efficient multi-scale computation of products of orbitals in electronic structure calculations
- Parallel sparse matrix multiplication for linear scaling electronic structure calculations
- Efficient update of determinants for many-electron wave function overlaps
- The efficient computation of certain determinants arising in the treatment of Schrödinger's equations
Cited in
(3)
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)