Related papers: Variants of L\"uscher's fermion algorithm
We have studied $O(a^2)$ improved lattice QCD with the staggered fermion by using Symanzik's program. We find that there are 5 dimension-6 fermion bilinears and gauge operators. In addition, there are 10 four-fermion operators which are…
We report on progress and future plans for calculating kaon weak matrix elements for epsilon'/epsilon using staggered fermions.
The method of relative weights, coupled with mean field theory, is applied to the problem of simulating gauge theories with dynamical staggered fermions at finite densities. We present initial results and discuss issues so far encountered.
We discuss two new DoS approaches for finite density lattice QCD. The paper extends a recent presentation of the new techniques based on Wilson fermions, while here we now discuss and test the case of finite density QCD with staggered…
Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration…
This study reexamines diffusive representations for fractional integrals with the goal of pioneering new variants of such representations. These variants aim to offer highly efficient numerical algorithms for the approximate computation of…
I discuss the behaviour of algorithms for dynamical fermions as the sea-quark mass decreases. I focus on the Hybrid-Monte-Carlo (HMC) algorithm applied to two degenerate flavours of Wilson fermions. First, I briefly review the performance…
In this paper the modification of the method conventionally used for the modeling of the massive fermions production and decays is proposed. The step by step algorithm is presented. Under the strict conditions the proposed method of…
We develop in this paper a new framework for discrete calculus of variations when the actions have densities involving an arbitrary discretization operator. We deduce the discrete Euler-Lagrange equations for piecewise continuous critical…
We propose a new adaptive algorithm for the approximation of the Landau-Lifshitz-Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically,…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…
Staggered fermion shift symmetries correspond to translations of the fermion field within the unit cell of a hypercubic lattice. They satisfy an algebra and in four Euclidean dimensions can be related to a discrete subgroup of an $SU(4)$…
L\"uscher's local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation.…
The development of Monte Carlo algorithms for generating gauge field configurations with dynamical fermions and methods for extracting the most information from ensembles are summarised.
One of the major frontiers of lattice field theory is the inclusion of light fermions in simulations, particularly in pursuit of accurate, first principles predictions from lattice QCD. With dedicated Teraflops-scale computers currently…
We investigate the validity of the square rooting procedure of the staggered determinant in the context of the Schwinger model. We find some evidence that at fixed physical quark mass the square root of the staggered determinant becomes…
The structure of the F5 algorithm to compute Gr\"obner bases makes it very efficient. However, while it is believed to terminate for so-called regular sequences, it is not clear whether it terminates for all inputs. This paper has two major…
We propose a framework to study the properties of the Lefschetz thimbles decomposition for lattice fermion models approaching the thermodynamic limit. The proposed set of algorithms includes the Schur complement solver and the exact…
The two-flavour Schwinger model is used to test the local boson action algorithm of M Luescher. The autocorrelation time is found to rise linearly with the number of auxiliary boson fields. An extension to the algorithm is proposed which…
The purpose of this note is to discuss some aspects of recently proposed fractional-order variants of complex least mean square (CLMS) and normalized least mean square (NLMS) algorithms in ``Design of Fractional-order Variants of Complex…