Fermion cluster algorithms

Published

Journal Article

Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion world lines. This solution leads to the possibility of designing fermion cluster algorithms in certain cases. Using the example of free non-relativistic fermions we discuss the ideas underlying the algorithm.

Full Text

Duke Authors

Cited Authors

  • Chandrasekharan, S

Published Date

  • January 1, 2000

Published In

Volume / Issue

  • 83-84 / 1-3

Start / End Page

  • 774 - 776

International Standard Serial Number (ISSN)

  • 0920-5632

Digital Object Identifier (DOI)

  • 10.1016/s0920-5632(00)00418-7

Citation Source

  • Scopus