One-Flavor Algorithms for Simulation of Lattice QCD with Domain-Wall Fermion: EOFA versus RHMC
Yu-Chih Chen, Ting-Wai Chiu

TL;DR
This paper compares the efficiency of EOFA and RHMC algorithms in simulating lattice QCD with domain-wall fermions, highlighting their performance differences in computational physics.
Contribution
It provides a direct performance comparison between EOFA and RHMC for lattice QCD simulations with domain-wall fermions.
Findings
EOFA shows competitive performance with RHMC.
The study identifies specific scenarios where each algorithm excels.
Results inform choices for efficient lattice QCD simulations.
Abstract
We compare the performances of the exact one-flavor algorithm (EOFA) and the rational hybrid Monte Carlo algorithm (RHMC), for dynamical simulations of lattice QCD with domain-wall fermion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Chromodynamics and Particle Interactions · High-Energy Particle Collisions Research · Physics of Superconductivity and Magnetism
