Main Image
Volume 256 - 34th annual International Symposium on Lattice Field Theory (LATTICE2016) - Algorithms and Machines
Algorithms for disconnected diagrams in Lattice QCD
A.S. Gambhir,* A. Stathopoulos, K. Orginos, B. Yoon, R. Gupta, S. Syritsyn
*corresponding author
Full text: pdf
Pre-published on: 2016 December 27
Published on: 2017 March 24
Computing disconnected diagrams in Lattice QCD (operator insertion in a quark loop) entails the computationally demanding problem of taking the trace of the all to all quark propagator. We first outline the basic algorithm used to compute a quark loop as well as improvements to this method. Then, we motivate and introduce an algorithm based on the synergy between hierarchical probing and singular value deflation. We present results for the chiral condensate using a 2+1-flavor clover ensemble and compare estimates of the nucleon charges with the basic algorithm.
Open Access
Creative Commons LicenseCopyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.