Computer Physics Communications
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.
Baoming Tang, Ehsan Khatami, and Marcos Rigol. "A short introduction to numerical linked-cluster expansions" Computer Physics Communications (2013): 557-564. https://doi.org/10.1016/j.cpc.2012.10.008