期刊
COMPUTER PHYSICS COMMUNICATIONS
卷 184, 期 3, 页码 557-564出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.cpc.2012.10.008
关键词
Linked-cluster expansions; Exact diagonalization; Spin systems; Lattice models
资金
- National Science Foundation (NSF) [OCI-0904597]
- NSF
- Kraken at the National Institute for Computational Science [TG-DMR100026]
- Office of Advanced Cyberinfrastructure (OAC)
- Direct For Computer & Info Scie & Enginr [0904597] Funding Source: National Science Foundation
We provide a pedagogical introduction to numerical linked-cluster expansions (NLCEs). We sketch the algorithm for generic Hamiltonians that only connect nearest-neighbor sites in a finite cluster with open boundary conditions. We then compare results for a specific model, the Heisenberg model, in each order of the NLCE with the ones for the finite cluster calculated directly by means of full exact diagonalization. We discuss how to reduce the computational cost of the NLCE calculations by taking into account symmetries and topologies of the linked clusters. Finally, we generalize the algorithm to the thermodynamic limit, and discuss several numerical resummation techniques that can be used to accelerate the convergence of the series. (C) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据