Related papers: Improving the dynamical overlap algorithm
The probability of accepting a candidate move in the hybrid Monte Carlo algorithm can be increased by considering a transition to be between windows of several states at the beginning and end of the trajectory, with a state within the…
I show how to avoid a two level nested conjugate gradient procedure in the context of Hybrid Monte Carlo with the overlap fermionic action. The resulting procedure is quite similar to Hybrid Monte Carlo with domain wall fermions, but is…
Current dynamical overlap fermion hybrid Monte Carlo simulations encounter large fermionic forces when there is mixing between near zero-eigenvectors of the kernel operator. This leads to low acceptance rates when there is a large density…
We present relaxation and preconditioning techniques which accelerate the inversion of the overlap operator by a factor of four on small lattices, with larger gains as the lattice size increases. These improvements can be used in both…
We report performance benchmarks for several algorithms that we have used to simulate the Schr"odinger functional with two flavors of dynamical quarks. They include hybrid and polynomial hybrid Monte Carlo with preconditioning. An appendix…
The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present an iterative method, first proposed by us in Ref. [1], which allows for an…
We present a classical enhancement to improve the accuracy of the Hybrid variant (Hybrid HHL) of the quantum algorithm for solving linear systems of equations proposed by Harrow, Hassidim, and Lloyd (HHL). We achieve this by using higher…
We propose a variant of the Simulated Annealing method for optimization in the multivariate analysis of differentiable functions. The method uses global actualizations via the Hybrid Monte Carlo algorithm in their generalized version for…
The pseudofermion action of the Hybrid Monte Carlo (HMC) algorithm for dynamical fermions is modified to directly incorporate Incomplete LU (ILU) factorisation. This reduces the stochastic noise and allows a larger molecular dynamics…
We present the preliminary tests on two modifications of the Hybrid Monte Carlo (HMC) algorithm. Both algorithms are designed to travel much farther in the Hamiltonian phase space for each trajectory and reduce the autocorrelations among…
We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single…
We construct an $O(a^2)$-improved overlap-Dirac operator by designing an improved overlap kernel, based on the Symanzik improvement program. Field rotation terms are also identified to improve off-shell amplitudes for both massless and…
We study the improvement of Kennedy-Kuti's linear accept/reject algorithm with different ordering criterion and modified Bhanot-Kennedy estimator of $e^{\Delta H}$ to reduce probability-bound violation. A new stochastic Monte Carlo…
We propose a practical formulation of the overlap Dirac operator in lattice QCD that employs the diagonal Kenney-Laub rational iterates - expressed via their partial fraction decomposition - to approximate the matrix sign function. We…
We introduce a method that automatically and jointly updates both continuous and discrete parameters of a compound lens design, to improve its performance in terms of sharpness, speed, or both. Previous methods for compound lens design use…
We construct new Ginsparg-Wilson fermions for QCD by inserting an approximately chiral Dirac operator - which involves ingredients of a perfect action - into the overlap formula. This accelerates the convergence of the overlap Dirac…
We propose a multi-level method to increase the accuracy of machine learning algorithms for approximating observables in scientific computing, particularly those that arise in systems modeled by differential equations. The algorithm relies…
We present an efficient low-rank updating algorithm for updating the trial wavefunctions used in Quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational…
We consider the problem of consistently matching multiple sets of elements to each other, which is a common task in fields such as computer vision. To solve the underlying NP-hard objective, existing methods often relax or approximate it,…
In this paper we discuss techniques, which lead to a significant improvement of the efficiency of the Monte Carlo integration, when one-loop QCD amplitudes are calculated numerically with the help of the subtraction method and contour…