Comparative Benchmarks of full QCD Algorithms
arXiv:hep-lat/0009027 · doi:10.1016/S0010-4655(00)00242-3
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.
24 pages, 3 figures, some added discussion, version submitted to Comput. Phys. Commun
References in corpus (3)
Cited by in corpus (20)
- Monte Carlo errors with less errors
- Speeding up the Hybrid-Monte-Carlo algorithm for dynamical fermions
- Dynamical Twisted Mass Fermions with Light Quarks: Simulation and Analysis Details
- Computation of the strong coupling in QCD with two dynamical flavours
- Speeding up Lattice QCD simulations with clover-improved Wilson Fermions
- Speeding up the Hybrid-Monte-Carlo algorithm for dynamical fermions
- Polynomial Hybrid Monte Carlo algorithm for lattice QCD with an odd number of flavors
- Updating algorithms with multi-step stochastic correction
- Progress in lattice algorithms
- Partially quenched chiral perturbation theory and numerical simulations
- Quark mass dependence of pseudoscalar masses and decay constants on a lattice
- Quark mass dependence of masses and decay constants of the pseudo-Goldstone bosons in QCD
- Full QCD Algorithms towards the Chiral Limit
- Cost of dynamical quark simulations: O(a) improved Wilson fermions
- Schr"odinger functional at negative flavour number
- Dynamical fermion algorithm for variable actions
- Efficient estimation of autocorrelation spectra
- Fundamental parameters of QCD
- Schrödinger functional at N_f=-2
- Lattice QCD with light dynamical quarks