A short introduction to numerical linked-cluster expansions

Baoming Tang, Ehsan Khatami, Marcos Rigol

Research output: Contribution to journalArticle

38 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)557-564
Number of pages8
JournalComputer Physics Communications
Volume184
Issue number3
DOIs
StatePublished - Mar 1 2013

Fingerprint

expansion
Hamiltonians
Topology
Boundary conditions
Thermodynamics
Costs
topology
boundary conditions
costs
thermodynamics
symmetry

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Physics and Astronomy(all)

Cite this

Tang, Baoming ; Khatami, Ehsan ; Rigol, Marcos. / A short introduction to numerical linked-cluster expansions. In: Computer Physics Communications. 2013 ; Vol. 184, No. 3. pp. 557-564.
@article{944a88a9e36a4df5a8a12437b4790a13,
title = "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 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.",
author = "Baoming Tang and Ehsan Khatami and Marcos Rigol",
year = "2013",
month = "3",
day = "1",
doi = "10.1016/j.cpc.2012.10.008",
language = "English (US)",
volume = "184",
pages = "557--564",
journal = "Computer Physics Communications",
issn = "0010-4655",
publisher = "Elsevier",
number = "3",

}

A short introduction to numerical linked-cluster expansions. / Tang, Baoming; Khatami, Ehsan; Rigol, Marcos.

In: Computer Physics Communications, Vol. 184, No. 3, 01.03.2013, p. 557-564.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A short introduction to numerical linked-cluster expansions

AU - Tang, Baoming

AU - Khatami, Ehsan

AU - Rigol, Marcos

PY - 2013/3/1

Y1 - 2013/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84872028074&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872028074&partnerID=8YFLogxK

U2 - 10.1016/j.cpc.2012.10.008

DO - 10.1016/j.cpc.2012.10.008

M3 - Article

AN - SCOPUS:84872028074

VL - 184

SP - 557

EP - 564

JO - Computer Physics Communications

JF - Computer Physics Communications

SN - 0010-4655

IS - 3

ER -