Skip to main content

Solving Sign Problems with Meron Algorithms

  • Conference paper

Part of the book series: Springer Proceedings in Physics ((SPPHY,volume 86))

Abstract

A new approach to the solution of sign problems in Monte-Carlo methods, based on cluster algorithms, has emerged recently. The underlying idea is to identify clusters that help match configurations of equal weight but opposite signs and hence do not contribute to the path integral. Avoiding these clusters, called merons, alleviates the sign problem and in certain cases solves it completely. Among the variety of problems that can be solved using these techniques there also exist some severe fermion sign problems. A pedagogical discussion of the above ideas is presented here with an emphasis on applications to fermionic systems.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Bietenholz, A. Pochinsky and U.-J. Wiese, Phys. Rev. Lett 75, 4524 (1995)

    Article  ADS  Google Scholar 

  2. S. Chandrasekharan and U.-J. Wiese, Phys. Rev. Lett 83, 3116 (1999)

    Article  ADS  Google Scholar 

  3. S. Chandrasekharan, J. Cox, K. Holland and U.-J. Wiese, hep-lat/9906021; to be published in Nucl. Phys. B

    Google Scholar 

  4. S. Chandrasekharan, hep-lat/0001003; talk given at Workshop on Chiral Gauge Theories (Chiral 99), Taipei, Taiwan, China, 13–18 Sep 1999, to be published in the Chinese Journal of Physics

    Google Scholar 

  5. S. Chandrasekharan and J. Osborn, manuscript in preparation

    Google Scholar 

  6. S. Chandrasekharan, hep-lat/9909007; talk given at Lattice 99, to be published in Nucl. Proc. B (proc. Suppl.)

    Google Scholar 

  7. U.-J. Wiese, Phys. Lett. B

    Google Scholar 

  8. S. Chandrasekharan, B. Scarlet, and U.-J. Wiese, cond-mat/9909451

    Google Scholar 

  9. J. Cox, C. Gattringer, K. Holland, B. Scarlet and U.J. Wiese, hep-lat/9909119; based on talks given at Lattice 99, to be published in Nucl. Phys. B (proc. Suppl.)

    Google Scholar 

  10. P. Henelius and A. Sandvik, cond-mat/0001351

    Google Scholar 

  11. R. Swendsen and J.-S. Wang, Phys. Rev. Lett. 58, 86 (1987)

    Article  ADS  Google Scholar 

  12. U. Wolff, Phys. Rev. Lett. 62, 361 (1989); Nucl. Phys. B 334, 581 (1990)

    Article  ADS  Google Scholar 

  13. H.G. Evertz, G. Lana, and M. Marcu, Phys. Rev. Lett. 70875 (1993)

    Google Scholar 

  14. H.G. Evertz, The Loop Algorithm, cond-mat/9707221 v2; to be published in Numerical Methods for Lattice Quantum Many-Body Problems, ed. D. J. Scalapino, Persus books, Frontiers in Physics, Second Edition

    Google Scholar 

  15. N. Kawashima, J.E. Gubernatis, and H.G. Evertz, Phys. Rev. B 50, 136 (1994)

    Article  ADS  Google Scholar 

  16. R. Brower, S. Chandrasekharan and U.-J. Wiese, Physica A 261, 520 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chandrasekharan, S., Osborn, J. (2001). Solving Sign Problems with Meron Algorithms. In: Landau, D.P., Lewis, S.P., Schüttler, HB. (eds) Computer Simulation Studies in Condensed-Matter Physics XIII. Springer Proceedings in Physics, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56577-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56577-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41190-1

  • Online ISBN: 978-3-642-56577-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics