连续时间辅助场算法的子矩阵更新
Sub-matrix updates for the Continuous-Time Auxiliary Field algorithm
摘要:
我们提出了一个子矩阵更新算法的连续时间辅助场方法,允许模拟大的晶格和杂质的问题。该算法利用现代CPU架构的最佳优势,始终使用矩阵,而不是向量运算,导致加速的一个因素的$\approx 8$,从而允许访问更大的系统和更低的温度。我们说明了我们的算法的力量在一个集群的动态平均场模拟的Néel过渡的三维哈伯德模型,在那里我们显示了动量依赖的自能集群与多达100个网站的例子。
英文摘要:
We present a sub-matrix update algorithm for the continuous-time auxiliary field method that allows the simulation of large lattice and impurity problems. The algorithm takes optimal advantage of modern CPU architectures by consistently using matrix instead of vector operations, resulting in a speedup of a factor of $\approx 8$ and thereby allowing access to larger systems and lower temperature. We illustrate the power of our algorithm at the example of a cluster dynamical mean field simulation of the Néel transition in the three-dimensional Hubbard model, where we show momentum dependent self-energies for clusters with up to 100 sites.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。