Related papers: Lanczos algorithm for lattice QCD matrix elements
We explain how masses and matrix elements can be computed in lattice QCD using Schr"odinger functional boundary conditions. Numerical results in the quenched approximation demonstrate that good precision can be achieved. For a statistical…
Current uncertainty quantification is memory and compute expensive, which hinders practical uptake. To counter, we develop Sketched Lanczos Uncertainty (SLU): an architecture-agnostic uncertainty score that can be applied to pre-trained…
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…
This work considers large-scale Lyapunov matrix equations of the form $AX + XA = \boldsymbol{c}\boldsymbol{c}^T$, where $A$ is a symmetric positive definite matrix and $\boldsymbol{c}$ is a vector. Motivated by the need to solve such…
We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, {\em without restricting to variational ansatzes}. The lattice of size $N$ is partitioned into two subclusters. At…
The present review will focus on recent development of exact-diagonali- zation (ED) methods that use Lanczos algorithm to transform large sparse matrices onto the tridiagonal form. We begin with a review of basic principles of the Lanczos…
Compared to the classical Lanczos algorithm, the $s$-step Lanczos variant has the potential to improve performance by asymptotically decreasing the synchronization cost per iteration. However, this comes at a cost. Despite being…
The recursion method, which solves coupled Heisenberg equations in a Lanczos operator basis, has recently emerged as a powerful nonperturbative tool for computing dynamical correlation functions in strongly correlated two- and…
In this talk I indroduce lattice fermions with suppressed cutoff modes. Then I present Lanczos based methods for stochastic evaluation of the fermion determinant.
Efficient matrix trace estimation is essential for scalable computation of log-determinants, matrix norms, and distributional divergences. In many large-scale applications, the matrices involved are too large to store or access in full,…
With the ongoing experimental interest in exploring the excited hadron spectrum, evaluations of the matrix elements describing the formation and decay of such states via radiative processes provide us with an important connection between…
In recent years, energy correlators have emerged as powerful observables for probing the fragmentation dynamics of high-energy collisions. We introduce the first numerical strategy for calculating energy correlators using the Hamiltonian…
We present results for ground and excited-state nucleon masses in quenched lattice QCD using anisotropic lattices. Group theoretical constructions of local and nonlocal straight-link irreducible operators are used to obtain suitable sources…
We present algorithmic improvements for fast and memory-efficient use of discrete spatial symmetries in Exact Diagonalization computations of quantum many-body systems. These techniques allow us to work flexibly in the reduced basis of…
Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization. The quantum…
We analyze randomized matrix-free quadrature algorithms for spectrum and spectral sum approximation. The algorithms studied include the kernel polynomial method and stochastic Lanczos quadrature, two widely used methods for these tasks. Our…
In this paper an extension of the spectral Lanczos' tau method to systems of nonlinear integro-differential equations is proposed. This extension includes (i) linearization coefficients of orthogonal polynomials products issued from…
Quantum field theories underlie all of our understanding of the fundamental forces of nature. The are relatively few first principles approaches to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the…
A thick-restart Lanczos type algorithm is proposed for Hermitian $J$-symmetric matrices. Since Hermitian $J$-symmetric matrices possess doubly degenerate spectra or doubly multiple eigenvalues with a simple relation between the degenerate…
We derive a formalism, the separation method, for the efficient and accurate calculation of two-body matrix elements for a Gaussian potential in the cylindrical harmonic-oscillator basis. This formalism is of critical importance for…