Complex Langevin method: when can it be trusted?
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 lea...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
22 March 2010
|
| In: |
Physical review. D, Particles, fields, gravitation, and cosmology
Year: 2010, Jahrgang: 81, Heft: 5, Pages: 1-13 |
| ISSN: | 1550-2368 |
| DOI: | 10.1103/PhysRevD.81.054508 |
| Online-Zugang: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1103/PhysRevD.81.054508 Verlag, lizenzpflichtig, Volltext: https://link.aps.org/doi/10.1103/PhysRevD.81.054508 
|
| Verfasserangaben: | Gert Aarts, Erhard Seiler, Ion-Olimpiu Stamatescu |
| Zusammenfassung: | 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. |
|---|---|
| Beschreibung: | Gesehen am 15.11.2022 |
| Beschreibung: | Online Resource |
| ISSN: | 1550-2368 |
| DOI: | 10.1103/PhysRevD.81.054508 |