Comparative benchmarks of full QCD algorithms

DOI10.1016/S0010-4655(00)00242-3MaRDI QIDQ5938233zbMATH OpenFDO

Authors R. Frezzotti, Martin Hasenbusch, U. Wolff, Jochen Heitger, Karl Jansen

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

zbMATH Keywords

autocorrelationsdynamical quarkshybrid Monte CarloSchrödinger functional with two flavors

Mathematics Subject Classification ID

Computational methods for problems pertaining to quantum theory (81-08) Strong interaction, including quantum chromodynamics (81V05)

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.

Recommendations

• Algorithms for calculating quark propagators on large lattices
• Quantum chromodynamics simulations on a non-dedicated highly parallel computer
• scientific article; zbMATH DE number 1206092
• Performance of lattice QCD programs on CP-PACS
• Simulation of QCD with Dynamical Quarks
• QCD evolution equations: Numerical algorithms from the Laguerre expansion

Cites work

• Implementation of Symanzik's improvement program for simulations of dynamical Wilson fermions in lattice QCD
• Ordering monomial factors of polynomials in the product representation
• SSOR preconditioning in simulations of the QCD Schrödinger functional

Cited in

(7)

• Quark mass dependence of masses and decay constants of the pseudo-Goldstone bosons in QCD
• Progress in lattice algorithms
• Speeding up lattice QCD simulations with clover-improved Wilson fermions
• Schrödinger functional at negative flavour number
• Speeding up the hybrid Monte Carlo algorithm for dynamical fermions
• Dynamical fermion algorithm for variable actions
• Monte Carlo errors with less errors

This page was built for publication: Comparative benchmarks of full QCD algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938233)