Related papers: Variants of L\"uscher's fermion algorithm

Based on recent work by Adams, I construct a lattice fermion operator that fully lifts the staggered flavor degeneracy. The resulting operator is of Wilson type but smaller by a factor of 4, better conditioned and contains 3 instead of 15…

In this paper, we study the strong convergence of two Mann-type inertial extragradient algorithms, which are devised with a new step size, for solving a variational inequality problem with a monotone and Lipschitz continuous operator in…

This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…

We present preliminary results of $B_K$ calculated using improved staggered fermions with the mixed action (valence quarks = HYP staggered fermions and sea quarks = AsqTad staggered fermions). We analyze the data based upon the prediction…

Algorithm selection is crucial in the field of optimization, as no single algorithm performs perfectly across all types of optimization problems. Finding the best algorithm among a given set of algorithms for a given problem requires a…

Explicit discretizations of stochastic differential equations often encounter instability when the coefficients are not globally Lipschitz. The truncated schemes and tamed schemes have been proposed to handle this difficulty, but truncated…

In this paper we provide a provably convergent algorithm for the multivariate Gaussian Maximum Likelihood version of the Behrens--Fisher Problem. Our work builds upon a formulation of the log-likelihood function proposed by Buot and…

Main results and techniques of the fractional calculus of variations are surveyed. We consider variational problems containing Caputo derivatives and study them using both indirect and direct methods. In particular, we provide necessary…

To enhance solution accuracy and training efficiency in neural network approximation to partial differential equations, partitioned neural networks can be used as a solution surrogate instead of a single large and deep neural network…

Randomized iterative algorithms, such as the randomized Kaczmarz method, have gained considerable popularity due to their efficacy in solving matrix-vector and matrix-matrix regression problems. Our present work leverages the insights…

L1 -penalized regression methods such as the Lasso (Tibshirani 1996) that achieve both variable selection and shrinkage have been very popular. An extension of this method is the Fused Lasso (Tibshirani and Wang 2007), which allows for the…

We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.

We study K\"ahler-Dirac fermions on Euclidean dynamical triangulations. This fermion formulation furnishes a natural extension of staggered fermions to random geometries without requring vielbeins and spin connections. We work in the…

Lattice power-counting is extended to QCD with staggered fermions. As preparation, the difficulties encountered by Reisz's original formulation of the lattice power-counting theorem are illustrated. One of the assumptions that is used in…

We discuss conditions ensuring the (strict) convergence of stochastic gradient algorithms.

We incorporate inertial terms in the hybrid proximal-extragradient algorithm and investigate the convergence properties of the resulting iterative scheme designed for finding the zeros of a maximally monotone operator in real Hilbert…

We examine a (3+1)-dimensional model of staggered lattice fermions with a four-fermion interaction and Z(2) chiral symmetry using the Hamiltonian formulation. This model cannot be simulated with standard fermion algorithms because those…

A study of principle is conducted on the inclusion of the fermionic determinant as a Metropolis acceptance correction. It is carried out in the 2-D Schwinger model to prepare later applications to the Schr"odinger functional. A mixed…

A popular approximation in lattice gauge theory is an extrapolation in the number of fermion species away from the four fold degeneracy natural with the staggered fermions formulation. I show that at finite lattice spacing and for an odd…

For a large class of vanilla contingent claims, we establish an explicit F\"ollmer-Schweizer decomposition when the underlying is a process with independent increments (PII) and an exponential of a PII process. This allows to provide an…