Comparative benchmarks of full QCD algorithms
From MaRDI portal
Publication:5938233
DOI10.1016/S0010-4655(00)00242-3zbMath0983.81106arXivhep-lat/0009027MaRDI QIDQ5938233
Karl Jansen, Roberto Frezzotti, Martin Hasenbusch, Jochen Heitger, Ulli Wolff
Publication date: 18 July 2001
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/hep-lat/0009027
Strong interaction, including quantum chromodynamics (81V05) Computational methods for problems pertaining to quantum theory (81-08)
Related Items (7)
Speeding up lattice QCD simulations with clover-improved Wilson fermions ⋮ Quark mass dependence of masses and decay constants of the pseudo-Goldstone bosons in QCD ⋮ Schrödinger functional at negative flavour number ⋮ Monte Carlo errors with less errors ⋮ Speeding up the hybrid Monte Carlo algorithm for dynamical fermions ⋮ Dynamical fermion algorithm for variable actions ⋮ Progress in lattice algorithms
Cites Work
This page was built for publication: Comparative benchmarks of full QCD algorithms