Comparative Benchmarks of full QCD Algorithms

Preprint

22 November 2000

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.hep-lat/0009027

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.

Keywords

COMPARATIVE BENCHMARKS
PERFORMANCE BENCHMARKS
REPORT PERFORMANCE
POLYNOMIAL HYBRID
PRECONDITIONING
QCD ALGORITHMS
MONTE CARLO
FULL QCD

All Related Versions

Version 1, 2000-09-20, ArXiv
Version 2, 2000-11-22, ArXiv
Published version: Computer Physics Communications, 136 (1-2), 1.

This publication has 0 references indexed in Scilit: