Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Complex Langevin method: When can it be trusted? Gert Aarts*
 

Summary: Complex Langevin method: When can it be trusted?
Gert Aarts*
Department of Physics, Swansea University, Swansea, United Kingdom
Erhard Seiler
Max-Planck-Institut fušr Physik (Werner-Heisenberg-Institut), Mušnchen, Germany
Ion-Olimpiu Stamatescu
Institut fušr Theoretische Physik, Universitašt Heidelberg and FEST, Heidelberg, Germany
(Received 18 December 2009; published 22 March 2010)
We analyze to what extent the complex Langevin method, which is in principle capable of solving the
so-called sign problems, can be considered as reliable. We give a formal derivation of the correctness and
then point out various mathematical loopholes. The detailed study of some simple examples leads to
practical suggestions about the application of the method.
DOI: 10.1103/PhysRevD.81.054508 PACS numbers: 11.15.Ha, 11.15.Bt
I. INTRODUCTION
The complex Langevin method solves in principle the
sign problems arising in simulations of various systems, in
particular, in QCD with finite chemical potential. After
being proposed in the early 1980s by Klauder [1] and
Parisi [2], it enjoyed a certain limited popularity [3,4],
but very quickly certain problems were found. The first

  

Source: Aarts, Gert - Department of Physics, University of Wales Swansea

 

Collections: Physics