2013
DOI: 10.1016/j.cpc.2012.10.008
|View full text |Cite
|
Sign up to set email alerts
|

A short introduction to numerical linked-cluster expansions

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 s… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
140
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 109 publications
(141 citation statements)
references
References 19 publications
1
140
0
Order By: Relevance
“…20,21,[29][30][31][32] In its original formulation, which includes all connected clusters up to a given size, one encounters a bottleneck arising from the task of computing every possible way these clusters can be embedded on a lattice; this severely limits the maximum cluster size (to about 16 sites). 32 Here we follow the approach of Ref. 20 and consider only rectangular clusters, relevant for the calculation of quantities on square-lattice systems.…”
Section: Methods For Computing the Corner Coefficientmentioning
confidence: 99%
“…20,21,[29][30][31][32] In its original formulation, which includes all connected clusters up to a given size, one encounters a bottleneck arising from the task of computing every possible way these clusters can be embedded on a lattice; this severely limits the maximum cluster size (to about 16 sites). 32 Here we follow the approach of Ref. 20 and consider only rectangular clusters, relevant for the calculation of quantities on square-lattice systems.…”
Section: Methods For Computing the Corner Coefficientmentioning
confidence: 99%
“…32). These considerations are closely related to the existence of linked-cluster-theorems for degenerate systems where non-local terms corresponding to un-linked diagrams cancel [33][34][35] . In section III A 4 we provide numerical evidence that this is indeed the case by excluding disconnected terms from the pertubative expansions.…”
Section: Third and Higher Order Correctionsmentioning
confidence: 99%
“…NLCEs use the same basis as hightemperature expansions, however, properties of clusters are calculated via exact diagonalisation, as opposed to a perturbative expansion in powers of the inverse temperature [8,33]. The site-based NLCE for the Hubbard model [34] is implemented here for a three-dimensional lattice and carried out to the eighth order for all thermodynamic quantities, except for S θ , where due to the reduced symmetry, only seven orders were obtained.…”
Section: Numerical Calculationsmentioning
confidence: 99%
“…The convergence region extends to significantly lower T /t at n = 1 and generally improves by increasing the interaction strength. At lower T /t, we take advantage of numerical resummations, such as Euler and Wynn transformations [33], to obtain an estimate. The NLCE provides a fast tool, which, given the value of U/t, generates results on a dense temperature and chemical potential grid in a single run.…”
Section: Numerical Calculationsmentioning
confidence: 99%