A Short Introduction to Numerical Linked-Cluster Expansions
arXiv:1207.3366 · doi:10.1016/j.cpc.2012.10.008
Abstract
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.
11 pages, 6 figures, 2 tables
References in corpus (8)
- Numerical Linked-Cluster Approach to Quantum Lattice Models
- Is the Yb2Ti2O7 pyrochlore a quantum spin ice?
- Numerical Linked-Cluster Algorithms. I. Spin systems on square, triangular, and kagome lattices
- Numerical Linked-Cluster Algorithms. II. t-J models on the square lattice
- Effective models for gapped phases of strongly correlated quantum lattice models
- Effect of particle statistics in strongly correlated two-dimensional Hubbard models
- Thermodynamics of the Antiferromagnetic Heisenberg Model on the Checkerboard Lattice
- Short-Range Correlations and Cooling of Ultracold Fermions in the Honeycomb Lattice