Related papers: Minimizing storage in implementations of the overl…
Typically, the conjugate gradient (CG) algorithm employs mixed precision and even-odd preconditioning to compute propagators for highly improved staggered quarks (HISQ). This approach suffers from critical slowing down as the light quark…
We outline our implementation of the adaptive thick-restart Lanczos algorithm ($a$-TRLan) for the projection of the low-lying eigenmodes of the overlap Dirac operator in lattice QCD, and compare the performances of our code and the widely…
A systematic way to constructing optimized interpolating operators for two-hadron systems is developed by incorporating inter-hadron spatial wavefunctions. The wavefunctions can be obtained from an iterative process with an appropriate…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
We show how to introduce a quark chemical potential in the overlap Dirac operator. The resulting operator satisfies a Ginsparg-Wilson relation and has exact zero modes. It is no longer gamma_5-hermitian, but its nonreal eigenvalues still…
In a recent paper by the same authors, we provided a theoretical foundation for the component-by-component (CBC) construction of lattice algorithms for multivariate $L_2$ approximation in the worst case setting, for functions in a periodic…
In this project we study the effect of the $U_A(1)$ anomaly for (2+1)-flavour QCD at high temperature. We apply the overlap operator as a tool to probe the topological properties of gauge field configurations which have been generated…
We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for d>2 and of order sqrt(N) log(N) in the critical dimension…
We propose new techniques to implement numerically the overlap-Dirac operator which exploit the physical properties of the underlying theory to avoid nested algorithms. We test these procedures in the two-dimensional Schwinger model and the…
We propose a novel approximation hierarchy for cardinality-constrained, convex quadratic programs that exploits the rank-dominating eigenvectors of the quadratic matrix. Each level of approximation admits a min-max characterization whose…
Hierarchical matrices approximate a given matrix by a decomposition into low-rank submatrices that can be handled efficiently in factorized form. $\mathcal{H}^2$-matrices refine this representation following the ideas of fast multipole…
Let $\dlap$ be the discrete Laplace operator acting on functions (or rational matrices) $f:\mathbf{Q}_L\to\mathbb{Q}$, where $\mathbf{Q}_L$ is the two dimensional lattice of size $L$ embedded in $\mathbb{Z}_2$. Consider a rational $L\times…
We examine quenched chiral logarithms in lattice QCD with overlap Dirac quarks. From our data of m_pi^2, we determine the coefficient of quenched chiral logarithm delta = 0.203(14), 0.176(17), 0.193(17) and 0.200(13) for lattices of sizes…
We simulate quenched QCD with the overlap Dirac operator. We work with the Wilson gauge action at beta=6 on an 18^3x64 lattice. We calculate quark propagators for a single source point and quark mass ranging from am_q=0.03 to 0.75. We…
We use low lying eigenvectors of the overlap-Dirac operator as a probe of the QCD vacuum. If instantons play a significant role one would expect the low lying eigenmodes of the overlap-Dirac operator to consist mainly of the mixed ``would…
A simulation of quenched QCD with the overlap Dirac operator has been completed using 100 Wilson gauge configurations at beta=6 on an 18^3x64 lattice. We present results for meson and baryon masses, meson final state "wave functions'' and…
We present simulation results for lattice QCD with light pions. For the quark fields we apply chirally symmetric lattice Dirac operators, in particular the overlap hypercube operator, along with the standard overlap operator for comparison.…
The weighted star discrepancy is a quantitative measure for the performance of point sets in quasi-Monte Carlo algorithms for numerical integration. We consider polynomial lattice point sets, whose generating vectors can be obtained by a…
In this paper, we present a new framework that exploits combinatorial optimization for efficiently generating a large variety of combinatorial objects based on graphs, matroids, posets and polytopes. Our method relies on a simple and…
In many statistical learning problems, it is desired that the optimal solution conforms to an a priori known sparsity structure represented by a directed acyclic graph. Inducing such structures by means of convex regularizers requires…