Skip to main navigation Skip to search Skip to main content

Algorithms for disconnected diagrams in lattice QCD

  • Arjun Singh Gambhir
  • , Andreas Stathopoulos
  • , Kostas Orginos
  • , Boram Yoon
  • , Rajan Gupta
  • , Sergey Syritsyn
  • College of William and Mary
  • Thomas Jefferson National Accelerator Facility
  • Los Alamos National Laboratory

Research output: Contribution to journalConference articlepeer-review

6 Scopus citations

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.

Original languageEnglish
JournalProceedings of Science
VolumePart F128557
DOIs
StatePublished - 2016
Event34th Annual International Symposium on Lattice Field Theory, LATTICE 2016 - Southampton, United Kingdom
Duration: Jul 24 2016Jul 30 2016

Fingerprint

Dive into the research topics of 'Algorithms for disconnected diagrams in lattice QCD'. Together they form a unique fingerprint.

Cite this