arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.2957nucl-th
收藏

非正交斯莱特行列式之间哈密尔顿矩阵元的有效计算

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

Yutaka Utsuno, Noritaka Shimizu, Takaharu Otsuka, Takashi Abe

摘要:

我们提出了一个有效的数值方法计算非正交斯莱特行列式之间的哈密顿矩阵元素,专注于最耗时的计算,涉及稀疏阵列的组成部分。在通常情况下,许多矩阵元素应计算,这种计算可以转化为一个密集矩阵的乘法。它表明,本方法的基础上的矩阵矩阵乘法达到$\sim$ 80%的理论峰值性能上测得的系统配备了现代微处理器,一个因素的5-10比正常的方法,使用间接索引阵列处理稀疏阵列。这种不同的性能的原因进行了讨论,从存储器访问的观点。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑