Comparative Benchmarks of full QCD Algorithms
Roberto Frezzotti, Martin Hasenbusch, Jochen Heitger, Karl Jansen, Ulli Wolff
Abstract
We report performance benchmarks for several algorithms that we have used to simulate the Schr"odinger 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.
Create a lesson
Related papers
Computability of GPDs near x=ξ in Lattice QCD
Yushan Su, Xiangdong Ji, Yizhuang Liu et al.
Numerical Investigations of Phase Transitions in Lattice Field Theories
Vamika Longia
Symplectic lattice gauge theories in the Grid framework: domain wall fermions and continuum extrapolations
Ed Bennett, Peter A. Boyle, Luigi Del Debbio et al.
The soft-gluon limit of the Landau gauge ghost-gluon vertex: results for pure Yang-Mills SU(3) theory from lattice simulations
Nuno Brito, Orlando Oliveira, Paulo J. Silva
Testing strong isospin breaking effects in QCD thermodynamics
D. A. Clarke, B. B. Brandt
A Vector-Vector-Axial Anomaly in 4D
Evan Berkowitz, Shi Chen, Aleksey Cherman