Related papers: A fast minimal residual solver for overlap fermion…
The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
The authors propose a recycling Krylov subspace method for the solution of a sequence of self-adjoint linear systems. Such problems appear, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically…
We consider the minimum vertex cover problem having applications in e.g. biochemistry and network security. Quantum annealers can find the optimum solution of such NP-hard problems, given they can be embedded on the hardware. This is often…
The overlap fermion propagator is calculated on 2+1 flavor domain wall fermion gauge configurations on 16^3 x 32, 24^3 x 64 and 32^3 x 64 lattices. With HYP smearing and low eigenmode deflation, it is shown that the inversion of the overlap…
We present two improvements to our previous dynamical overlap HMC algorithm. We introduce a new method of differentiating the eigenvectors of the Kernel operator, which removes an instability in the fermionic force. Secondly, by simulating…
Dearing and Zeck presented a dual algorithm for the problem of the minimum covering ball in $\mathbb{R}^n$. Each iteration of their algorithm has a computational complexity of at least $\mathcal O(n^3)$. In this paper we propose a…
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…
One of the most computationally expensive steps of the low-rank ADI method for large-scale Lyapunov equations is the solution of a shifted linear system at each iteration. We propose the use of the extended Krylov subspace method for this…
The overlap operator is just the simplest of a class of Dirac operators with an exact chiral symmetry. I demonstrate how a general class of chiral Dirac operators can be constructed, show that they have no fermion doublers and that they are…
We present first, exploratory results of a hybrid Monte-Carlo algorithm for dynamical, n_f=2, four-dimensional QCD with overlap fermions. As expected, the computational requirements are typically two orders of magnitude larger for the…
We present a systematic comparison of various iterative methods to obtain the fermion propagator with both overlap and twisted mass fermions at fixed pion mass in the quenched approximation. Taking the best available algorithm in each case…
We present a unified treatment of the Fourier spectra of spherically symmetric nonlocal diffusion operators. We develop numerical and analytical results for the class of kernels with weak algebraic singularity as the distance between source…
Performing large-scale, accurate quantum simulations of many-fermion systems is a central challenge in quantum science, with applications in chemistry, materials, and high-energy physics. Despite significant progress, realizing generic…
Fractional programming (FP) arises in various communications and signal processing problems because several key quantities in the field are fractionally structured, e.g., the Cram\'{e}r-Rao bound, the Fisher information, and the…
We present a progress report on a new class of multigrid solver algorithm suitable for the solution of 5d chiral fermions such as Domain Wall fermions and the Continued Fraction overlap. Unlike HDCG \cite{Boyle:2014rwa}, the algorithm works…
We consider robust combinatorial optimization problems where the decision maker can react to a scenario by choosing from a finite set of $k$ solutions. This approach is appropriate for decision problems under uncertainty where the…
We introduce a fast algorithm for computing sparse Fourier transforms supported on smooth curves or surfaces. This problem appear naturally in several important problems in wave scattering and reflection seismology. The main observation is…
Stencil computations are widely used to simulate the change of state of physical systems across a multidimensional grid over multiple timesteps. The state-of-the-art techniques in this area fall into three groups: cache-aware tiled looping…
An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.