Skip to main navigation Skip to search Skip to main content

Implementation of the SU(2) Hamiltonian symmetry for the DMRG algorithm

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

In the Density Matrix Renormalization Group (DMRG) algorithm (White, 1992, 1993) [1,2], Hamiltonian symmetries play an important rôle. Using symmetries, the matrix representation of the Hamiltonian can be blocked. Diagonalizing each matrix block is more efficient than diagonalizing the original matrix. This paper explains how the the DMRG++ code (Alvarez, 2009) [3] has been extended to handle the non-local SU(2) symmetry in a model independent way. Improvements in CPU times compared to runs with only local symmetries are discussed for the one-orbital Hubbard model, and for a two-orbital Hubbard model for iron-based superconductors. The computational bottleneck of the algorithm and the use of shared memory parallelization are also addressed.

Original languageEnglish
Pages (from-to)2226-2232
Number of pages7
JournalComputer Physics Communications
Volume183
Issue number10
DOIs
StatePublished - Oct 2012

Funding

The present code uses part of the psimag toolkit, http://psimag.org/ . I would like to thank Luis G. G. V. Dias da Silva, I. P. McCulloch, M. S. Summers, and J. C. Xavier for helpful discussions. This work was supported by the Center for Nanophase Materials Sciences , sponsored by the Scientific User Facilities Division, Basic Energy Sciences, US Department of Energy, under contract with UT-Battelle, and by the DOE early career research program. This research used resources of the National Center for Computational Sciences, as well as the OIC at Oak Ridge National Laboratory.

Keywords

  • DMRG
  • Density-matrix renormalization group
  • Generic programming
  • Strongly correlated electrons

Fingerprint

Dive into the research topics of 'Implementation of the SU(2) Hamiltonian symmetry for the DMRG algorithm'. Together they form a unique fingerprint.

Cite this