Related papers: Single flavour optimisations to Hybrid Monte Carlo
Now that lattice QCD simulations are able to include effects of light sea quarks, the prospects are good for constraining quark flavor phenomenology. This review talk for particle physics experimentalists begins with an introduction…
We discuss the lattice formulation of gauge theories with fermions in arbitrary representations of the color group, and present in detail the implementation of the HMC/RHMC algorithm for simulating dynamical fermions. We discuss the…
We simulate Quantum Chromodynamics in four Euclidean dimensions with two (degenerate mass) flavors of dynamical quarks. The Dirac operator is the so-called chirally improved operator that has been studied so far in quenched calculations. We…
We work the lattice fermions and non-Hermitian formulation in the 2D GNY model and demonstrate the numerical implementation for two flavors by the Hybrid Monte Carlo. Our approach has a notable advantage in dealing with chiral symmetry on a…
We develop a classical Monte Carlo algorithm based on a quasi-classical approximation for a pseudospin S=1 Hamiltonian in real space to construct a phase diagram of a model cuprate with a high Tc. A model description takes into account both…
Hamiltonian Monte Carlo (HMC) improves the computational efficiency of the Metropolis algorithm by reducing its random walk behavior. Riemannian Manifold HMC (RMHMC) further improves HMC's performance by exploiting the geometric properties…
In lattice QCD, the trace of the inverse of the discretized Dirac operator appears in the disconnected fermion loop contribution to an observable. As simulation methods get more and more precise, these contributions become increasingly…
We use one-flavour QCD ($N_c=3$) as a proxy to understand $\mathcal{N}=1$ SYM. For our simulations, we use tree-level improved Wilson fermions and Symanzik improved gauge action. The hadron spectrum is obtained by using LapH smearing for…
The use of APE smearing or other blocking techniques in fermion actions can provide many advantages. There are many variants of these fat link actions in lattice QCD currently, such as FLIC fermions. The FLIC fermion formalism makes use of…
We present a novel hybrid computational method to simulate accurately dendritic solidification in the low undercooling limit where the dendrite tip radius is one or more orders of magnitude smaller than the characteristic spatial scale of…
Nested multi-step stochastic correction offers a possibility to improve updating algorithms for numerical simulations of lattice gauge theories with fermions. The corresponding generalisations of the two-step multi-boson (TSMB) algorithm as…
The classical approaches to numerically integrating a function $f$ are Monte Carlo (MC) and quasi-Monte Carlo (QMC) methods. MC methods use random samples to evaluate $f$ and have error $O(\sigma(f)/\sqrt{n})$, where $\sigma(f)$ is the…
The absence of negative sign problem in quantum Monte Carlo simulations of spin and fermion systems has different origins. World-line based algorithms for spins require positivity of matrix elements whereas auxiliary field approaches for…
We discuss the main aspects of the fixed-node quantum Monte Carlo method for lattice fermions and its recent application to the problem of phase separation in the 2D Hubbard model, along with virtues, limitations and perspectives of this…
Hamiltonian Monte Carlo (HMC) is a popular Markov chain Monte Carlo (MCMC) algorithm that generates proposals for a Metropolis-Hastings algorithm by simulating the dynamics of a Hamiltonian system. However, HMC is sensitive to large time…
QCD lattice simulations with 2+1 flavours (when two quark flavours are mass degenerate) typically start at rather large up-down and strange quark masses and extrapolate first the strange quark mass and then the up-down quark mass to its…
We discuss an instability in the leapfrog integration algorithm, widely used in current Hybrid Monte Carlo (HMC) simulations of lattice QCD. We demonstrate the instability in the simple harmonic oscillator (SHO) system where it is manifest.…
We investigate the performance of the hybrid Monte Carlo algorithm in updating non-trivial global topological structures. We find that the hybrid Monte Carlo algorithm has serious problems decorrelating the global topological charge. This…
Hamiltonian Monte Carlo (HMC) and related algorithms have become routinely used in Bayesian computation. In this article, we present a simple and provably accurate method to improve the efficiency of HMC and related algorithms with…
The supercomputing platforms available for high performance computing based research evolve at a great rate. However, this rapid development of novel technologies requires constant adaptations and optimizations of the existing codes for…