Minimizing storage in implementations of the overlap lattice-Dirac operator

Research output: Contribution to journalArticle

32 Scopus citations

Abstract

The overlap lattice-Dirac operator contains the sign function ∈(H). Recent practical implementations replace ∈(H) by a ratio of polynomials, HPn(H2)/Qn(H2), and require storage of 2n + 2 large vectors. Here I show that one can use only four large vectors at the cost of executing the core conjugate algorithm twice. The slow-down might be less than by a factor of 2, depending on the architecture of the computer one uses.

Original languageEnglish (US)
Pages (from-to)1051-1057
Number of pages7
JournalInternational Journal of Modern Physics C
Volume10
Issue number6
DOIs
StatePublished - Sep 1999

All Science Journal Classification (ASJC) codes

  • Statistical and Nonlinear Physics
  • Mathematical Physics
  • Physics and Astronomy(all)
  • Computer Science Applications
  • Computational Theory and Mathematics

Keywords

  • Lattice Gauge Theory
  • Overlap Lattice-Dirac Operator
  • Storage

Fingerprint Dive into the research topics of 'Minimizing storage in implementations of the overlap lattice-Dirac operator'. Together they form a unique fingerprint.

  • Cite this