Related papers: Seed methods for linear equations in lattice qcd p…
We present and compare new types of algorithms for lattice QCD with staggered fermions in the limit of infinite gauge coupling. These algorithms are formulated on a discrete spatial lattice but with continuous Euclidean time. They make use…
We propose a method to improve lattice operators composed of Wilson fermions which allows the removal of all corrections of $O(a)$, including those proportional to the quark mass, leaving only errors of $O(a^2)$. The method exploits the…
Recent literature has advocated the use of randomized methods for accelerating the solution of various matrix problems arising throughout data science and computational science. One popular strategy for leveraging randomization is to use it…
We extend results known for the randomized Gauss-Seidel and the Gauss-Southwell methods for the case of a Hermitian and positive definite matrix to certain classes of non-Hermitian matrices. We obtain convergence results for a whole range…
We formulate Dirac fermions on a (1+1)-dimensional lattice based on a Hamiltonian formalism. The species doubling problem of the lattice fermion is resolved by introducing hopping interactions that mix left- and right-handed fermions around…
We present a multi-level algorithm for the solution of five dimensional chiral fermion formulations, including domain wall and Mobius Fermions. The algorithm operates on the red-black preconditioned Hermitian operator, and directly…
In this paper we present an effective method for linearizing rational varieties of codimension at least two under Cremona transformations, starting from a given parametrization. Using these linearizing Cremonas, we simplify the equations of…
The left-right symmetric model with doublet and bi-doublet Higgs scalars can accommodate linear, inverse or double seesaw for generating small neutrino masses in the presence of three singlet fermions. If the singlet fermions have small…
The complex Langevin approach is a promising method for the numerical treatment of systems with a sign problem, for which conventional lattice field theory techniques based on importance sampling cannot be applied. However, complex Langevin…
In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs. Lattice linearity allows a node to execute its actions with old information about the state of other nodes and still preserve correctness.…
A new polynomial preconditioner for symmetric complex linear systems based on Hermitian and skew-Hermitian splitting (HSS) for complex symmetric linear systems is herein presented. It applies to Conjugate Orthogonal Conjugate Gradient…
I describe a method that places the fermion fields and the gauge fields on different lattice spacings during the Hybrid Monte Carlo generation of Ginsparg-Wilson dynamical ensembles. The idea is motivated by Wilson's formulation of the…
We present an improved upper bound for the ground state energy of lattice fermion models with sign problem. The bound can be computed by numerical simulation of a recently proposed family of deformed Hamiltonians with no sign problem. For…
This paper presents enhancement strategies for the Hermitian and skew-Hermitian splitting method based on gradient iterations. The spectral properties are exploited for the parameter estimation, often resulting in a better convergence. In…
New versions and extensions of Benson's outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each…
We derive an extension of the sequential homotopy method that allows for the application of inexact solvers for the linear (double) saddle-point systems arising in the local semismooth Newton method for the homotopy subproblems. For the…
This paper studies an integrated learning and optimization problem in which a prediction model estimates the right-hand-side parameters of a linear program (LP) using a contextual vector. Considering that such a prediction alters the…
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…
The convergence of the Conjugate Gradient method is subject to a locality limitation which imposes a lower bound on the number of iterations required before a qualitatively accurate approximation can be obtained. This limitation originates…
Most experimental studies initialize the population of evolutionary algorithms with random genotypes. In practice, however, optimizers are typically seeded with good candidate solutions either previously known or created according to some…