PoS - Proceedings of Science
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: December 27, 2016
Published on: March 24, 2017
Abstract
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.
DOI: https://doi.org/10.22323/1.256.0265
How to cite

Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.

Open Access
Creative Commons LicenseCopyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.