Main Image
Volume 256 - 34th annual International Symposium on Lattice Field Theory (LATTICE2016) - Algorithms and Machines
Domain Wall Fermion Simulations with the Exact One-Flavor Algorithm
D. Murphy
Full text: pdf
Pre-published on: 2016-12-27 09:53:30
Published on: 2017-03-24 10:20:24
Abstract
As algorithmic developments have driven down the cost of simulating degenerate light quark pairs the relative cost of simulating single quark flavors with the Rational Hybrid Monte Carlo (RHMC) algorithm has become more expensive. TWQCD has proposed an exact one-flavor algorithm (EOFA) that allows for HMC simulations of a single quark flavor without taking a square root of the fermion determinant. We have independently implemented EOFA in the Columbia Physics System (CPS) and BAGEL Fermion Sparse-Matrix Library (BFM) for Shamir and M\"{o}bius domain wall fermions, and begun to optimize and test our implementation against RHMC. In this talk we discuss the derivation of the EOFA action, our tests of its equivalence to RHMC, and the current state of our implementation and optimization. We find, after introducing a novel preconditioning technique for the EOFA Dirac operator, that EOFA is a factor of 2.4 times faster than RHMC per molecular dynamics trajectory for the strange quark determinant on an $N_{f} = 2+1$ M\"{o}bius DWF ensemble with physical quark masses and a $24^{3} \times 64 \times 24$ volume. We expect that further improvement is possible by retuning the integrator parameters for EOFA and by continuing to optimize our code.
Open Access
Creative Commons LicenseCopyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.