Computational efficiency of staggered Wilson fermions: A first look

Adams, David H. and Nógrádi, Dániel and Petrashyk, Andrii and Zielinski, Christian (2013) Computational efficiency of staggered Wilson fermions: A first look. POS - PROCEEDINGS OF SCIENCE, 2013. ISSN 1824-8039

Preview

Text 1312.3265v2.pdf Available under License Creative Commons Attribution. Download (218kB) | Preview

Abstract

Results on the computational efficiency of 2-flavor staggered Wilson fermions compared to usual Wilson fermions in a quenched lattice QCD simulation on 163 ×32 lattice at β = 6 are reported. We compare the cost of inverting the Dirac matrix on a source by the conjugate gradient (CG) method for both of these fermion formulations, at the same pion masses, and without preconditioning. We find that the number of CG iterations required for convergence, averaged over the ensemble, is less by a factor of almost 2 for staggered Wilson fermions, with only a mild dependence on the pion mass. We also compute the condition number of the fermion matrix and find that it is less by a factor of 4 for staggered Wilson fermions. The cost per CG iteration, dominated by the cost of matrix-vector multiplication for the Dirac matrix, is known from previous work to be less by a factor 2-3 for staggered Wilson compared to usual Wilson fermions. Thus we conclude that staggered Wilson fermions are 4-6 times cheaper for inverting the Dirac matrix on a source in the quenched backgrounds of our study.

Actions (login required)

Edit Item