Related papers: Short-recurrence Krylov subspace methods for the o…
We describe and test a method to compute Euclidean meson two-point functions in lattice QCD. The contribution from the low-lying eigenmodes of the Dirac operator is averaged over all positions of the quark sources. The contribution from the…
This survey explores modern approaches for computing low-rank approximations of high-dimensional matrices by means of the randomized SVD, randomized subspace iteration, and randomized block Krylov iteration. The paper compares the…
We introduce an analytical iterative method, the density matrix recursion method, to generate arbitrary reduced density matrices of superpositions of short-range dimer coverings on periodic or non-periodic quantum spin-1/2 ladder lattices,…
We propose a new first-order augmented Lagrangian algorithm ALCC for solving convex conic programs of the form min{rho(x)+gamma(x): Ax-b in K, x in chi}, where rho and gamma are closed convex functions, and gamma has a Lipschitz continuous…
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…
In lattice QCD it is possible, in principle, to determine the parameters in the effective chiral lagrangian (including weak interaction couplings) by performing numerical simulations in the $\epsilon$--regime, i.e. at quark masses where the…
We propose a block Krylov subspace version of the GCRO-DR method proposed in [Parks et al.; SISC 2005], which is an iterative method allowing for the efficient minimization of the the residual over an augmented Krylov subspace. We offer a…
In application of the complex Langevin method to QCD at high density and low temperature, the singular-drift problem occurs due to the appearance of near-zero eigenvalues of the Dirac operator. In order to avoid this problem, we proposed to…
We develop a block minimum residual (MINRES) algorithm for symmetric indefinite matrices. This version is built upon the band Lanczos method that generates one basis vector of the block Krylov subspace per iteration rather than a whole…
Despite the successful enhancement to the Harrow-Hassidim-Lloyd algorithm by Childs et al., who introduced the Fourier approach leveraging linear combinations of unitary operators, our research has identified non-trivial redundancies within…
We consider the following constrained Rayleigh quotient optimization problem (CRQopt) $$ \min_{x\in \mathbb{R}^n} x^{T}Ax\,\,\mbox{subject to}\,\, x^{T}x=1\,\mbox{and}\,C^{T}x=b, $$ where $A$ is an $n\times n$ real symmetric matrix and $C$…
We present results of a quenched QCD simulation with overlap fermions on a lattice of volume V = 16^3X32 at beta=6.0, which corresponds approximatively to a lattice cutoff of 2 GeV and an extension of 1.4 fm. From the two-point correlation…
We propose a continuous approach to computing the pseudospectra of linear operators with compact or compact-plus-scalar resolvent, following a 'solve-then-discretize' strategy. Instead of taking a finite section approach or using a…
The discretization of the double-layer potential integral equation for the interior Dirichlet Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations…
I apply a recently developed algorithm for reweighting simulations of lattice QCD from one quark mass to another to simulations performed with overlap fermions in the epsilon regime. I test it by computing the condensate from distributions…
The low-lying eigenvalue spectrum of the QCD Dirac operator in the epsilon-regime is expected to match with that of chiral Random Matrix Theory (ChRMT). We study this correspondence for the case including sea quarks by performing two-flavor…
A coarse grid correction (CGC) approach is proposed to enhance the efficiency of the matrix exponential and $\varphi$ matrix function evaluations. The approach is intended for iterative methods computing the matrix-vector products with…
The Lanczos algorithm is evaluated for solving the time-independent as well as the time-dependent Dirac equation with arbitrary electromagnetic fields. We demonstrate that the Lanczos algorithm can yield very precise eigenenergies and…
The lattice QCD simulation with the lattice chiral symmetry is very attractive, however, it is difficult to maintain the symmetry at a modest numerical computation cost. A candidate to reduce the computational cost during the configuration…
The application of Random Matrix Theory to the Dirac operator of QCD yields predictions for the probability distributions of the lowest eigenvalues. We measured Dirac operator spectra using massless overlap fermions in quenched QCD at…