Optimizing linked-cluster expansions by white graphs

K. Coester and K. P. Schmidt
Phys. Rev. E 92, 022118 – Published 10 August 2015

Abstract

We introduce a white-graph expansion for the method of perturbative continuous unitary transformations when implemented as a linked-cluster expansion. The essential idea behind an expansion in white graphs is to perform an optimized bookkeeping during the calculation by exploiting the model-independent effective Hamiltonian in second quantization and the associated inherent cluster additivity. This approach is shown to be especially well suited for microscopic models with many coupling constants, since the total number of relevant graphs is drastically reduced. The white-graph expansion is exemplified for a two-dimensional quantum spin model of coupled two-leg XXZ ladders.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
1 More
  • Received 12 May 2015

DOI:https://doi.org/10.1103/PhysRevE.92.022118

©2015 American Physical Society

Authors & Affiliations

K. Coester and K. P. Schmidt

  • Lehrstuhl für Theoretische Physik I, Otto-Hahn-Str. 4, TU Dortmund, D-44221 Dortmund, Germany

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 92, Iss. 2 — August 2015

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×