Comparative benchmarks of full QCD algorithms

We report performance benchmarks for several algorithms that we have used to simulate the Schrödinger functional with two flavors of dynamical quarks. They include hybrid and polynomial hybrid Monte Carlo with preconditioning. An appendix describes a method to deal with autocorrelations for nonline...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Frezzotti, Roberto (VerfasserIn) , Hasenbusch, Martin (VerfasserIn) , Wolff, U. (VerfasserIn) , Heitger, Jochen (VerfasserIn) , Jansen, Karl (VerfasserIn)
Dokumenttyp: Article (Journal)
Sprache:Englisch
Veröffentlicht: 12 April 2001
In: Computer physics communications
Year: 2001, Jahrgang: 136, Heft: 1/2, Pages: 1-13
ISSN:1879-2944
DOI:10.1016/S0010-4655(00)00242-3
Online-Zugang:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/S0010-4655(00)00242-3
Verlag, lizenzpflichtig, Volltext: https://www.sciencedirect.com/science/article/pii/S0010465500002423
Volltext
Verfasserangaben:Roberto Frezzotti, Martin Hasenbusch, Ulli Wolff, Jochen Heitger, Karl Jansen
Beschreibung
Zusammenfassung:We report performance benchmarks for several algorithms that we have used to simulate the Schrödinger functional with two flavors of dynamical quarks. They include hybrid and polynomial hybrid Monte Carlo with preconditioning. An appendix describes a method to deal with autocorrelations for nonlinear functions of primary observables as they are met here due to reweighting.
Beschreibung:Gesehen am 06.07.2022
Beschreibung:Online Resource
ISSN:1879-2944
DOI:10.1016/S0010-4655(00)00242-3