Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Frezzotti, Roberto (Author) , Hasenbusch, Martin (Author) , Wolff, U. (Author) , Heitger, Jochen (Author) , Jansen, Karl (Author)
Format: Article (Journal)
Language:English
Published: 12 April 2001
In: Computer physics communications
Year: 2001, Volume: 136, Issue: 1/2, Pages: 1-13
ISSN:1879-2944
DOI:10.1016/S0010-4655(00)00242-3
Online Access:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/S0010-4655(00)00242-3
Verlag, lizenzpflichtig, Volltext: https://www.sciencedirect.com/science/article/pii/S0010465500002423
Get full text
Author Notes:Roberto Frezzotti, Martin Hasenbusch, Ulli Wolff, Jochen Heitger, Karl Jansen
Description
Summary: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.
Item Description:Gesehen am 06.07.2022
Physical Description:Online Resource
ISSN:1879-2944
DOI:10.1016/S0010-4655(00)00242-3

Similar Items