arXiv subjects

Travis Whyte

Publications and source records attributed to Travis Whyte.

11 recordsLinked to original sources

arXiv2025

Accelerating multigrid with streaming chiral SVD for Wilson fermions in lattice QCD

A modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD is presented. A larger basis of test vectors than that used in conventional multigrid is calculated by the smoother and truncated by singular value decomposition on the chiral components of the test vectors. The truncated basis is used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification of the setup method is demonstrated to increase the convergence of linear solvers on an anisotropic lattice with $m_{\pi} \approx 239$ MeV from the Hadron Spectrum Collaboration and an isotropic lattice with $m_{\pi} \approx 220$ MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined. Increasing the number of test vectors improves speedup up to a point, but storing these vectors becomes impossible in limited memory resources such as GPUs. To address storage cost, we implement a \emph{streaming} singular value decomposition of the basis of test vectors on the chiral components and demonstrate a decrease in the number of fine level iterations by a factor of 1.7 for $m_q \approx m_{crit}$.

hep-lat↗

arXiv2025

Chiral rank-$k$ truncations for the multigrid preconditioner of Wilson fermions in lattice QCD

We present a modification to the setup algorithm for the multigrid preconditioner of Wilson fermions in lattice QCD. A larger number of test vectors than that used in conventional multigrid is generated by the smoother. This set of test vectors is then truncated by a singular value decomposition on the chiral components of the test vectors, which are subsequently used to form the prolongation and restriction matrices of the multigrid hierarchy. This modification is demonstrated to improve the convergence of linear equations on an anisotropic lattice with $m_{\pi} \approx 239$ MeV from the Hadron Spectrum Collaboration and an isotropic lattice with $m_{\pi} \approx 220$ MeV from the MILC Collaboration. The lattice volume dependence of the method is also examined.

hep-lat↗

arXiv2024

Near-threshold states in coupled $DD^{\ast}-D^{\ast}D^{\ast}$ scattering from lattice QCD

The first determination of doubly-charmed isospin-0 coupled-channel $DD^\ast-D^\ast D^\ast$ scattering amplitudes from lattice QCD is presented. The finite-volume spectrum is computed for three lattice volumes with a light-quark mass corresponding to $m_\pi\approx 391$ MeV and is used to extract the scattering amplitudes in $J^P = 1^+$ via the L\"{u}scher quantization condition. By analytically continuing the scattering amplitudes to complex energies, a $T_{cc}$ pole corresponding to a virtual bound state is found below $DD^\ast$ threshold. We also find a second pole, $T_{cc}^\prime$, corresponding to a resonance pole below the kinematically closed $D^\ast D^\ast$ channel, to which it has a strong coupling. A non-zero coupling is robustly found between the $S$-wave $D D^\ast$ and $D^\ast D^\ast$ channels producing a clear cusp in the $D D^\ast$ amplitude at the $D^\ast D^\ast$ threshold energy. This suggests that the experimental $T_{cc}^\prime$ should be observable in $D D^\ast$ and $D^\ast D^\ast$ final states at ongoing experiments.

hep-lat↗

arXiv2023

Multipolynomial Monte Carlo Trace Estimation

In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a multilevel system. The polynomials are developed from the GMRES algorithm for solving linear equations. To reduce orthogonalization expense, the highest degree polynomial is a composite or double polynomial found with a polynomial preconditioned GMRES iteration. Matrix deflation is used in three different ways: in the Monte Carlo levels, in the main solves, and in the deflation of the highest level double polynomial. A numerical comparison with optimized Hutchinson is performed on a quenched $24^4$ lattice. The results demonstrate that the new Multipolynomial Monte Carlo method can significantly improve the trace computation for matrices that have a difficult spectrum due to small eigenvalues.}

hep-lat↗

arXiv2023

Multi-Polynomial Monte Carlo for Trace Estimation in Lattice QCD

Estimating the trace of the inverse of a large matrix is an important problem in lattice quantum chromodynamics. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials for the levels. The polynomials are developed from the GMRES algorithm for solving linear equations. To reduce orthogonalization expense, the highest degree polynomial is a composite or double polynomial found with a polynomial preconditioned GMRES iteration. Added to some of the Monte Carlo pieces is deflation of eigenvalues that reduces the variance. Deflation is also used for finding a reduced degree deflated polynomial. The new Multipolynomial Monte Carlo method can significantly improve the trace computation for matrices that have a difficult spectrum due to small eigenvalues.

hep-lat↗

arXiv2023

High-degree Polynomial Noise Subtraction

In lattice QCD, the calculation of physical quantities from disconnected quark loop calculations have large variance due to the use of Monte Carlo methods for the estimation of the trace of the inverse lattice Dirac operator. In this work, we build upon our POLY and HFPOLY variance reduction methods by using high-degree polynomials. Previously, the GMRES polynomials used were only stable for low-degree polynomials, but through application of a new, stable form of the GMRES polynomial, we have achieved higher polynomial degrees than previously used. While the variance is not dependent on the trace correction term within the methods, the evaluation of this term will be necessary for forming the vacuum expectation value estimates. This requires computing the trace of high-degree polynomials, which can be evaluated stochastically through our new Multipolynomial Monte Carlo method. With these new high-degree noise subtraction polynomials, we obtained a variance reduction for the scalar operator of nearly an order of magnitude over that of no subtraction on a $24^3 \times 32$ quenched lattice at $\beta = 6.0$ and $\kappa = 0.1570 \approx \kappa_{crit}$. Additionally, we observe that for sufficiently high polynomial degrees, POLY and HFPOLY approach the same level of effectiveness. We also explore the viability of using double polynomials for variance reduction as a means of reducing the required orthogonalization and memory costs associated with forming high-degree GMRES polynomials.

hep-lat↗

arXiv2022

Optimizing Shift Selection in Multilevel Monte Carlo for Disconnected Diagrams in Lattice QCD

The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. In this article, we present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore choose shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation, and that these shifts can be used for multiple configurations within the same ensemble with no penalty to performance.

hep-lat↗

arXiv2020

Two-Grid Deflated Krylov Methods for Linear Equations

An approach is given for solving large linear systems that combines Krylov methods with use of two different grid levels. Eigenvectors are computed on the coarse grid and used to deflate eigenvalues on the fine grid. GMRES-type methods are first used on both the coarse and fine grids. Then another approach is given that has a restarted BiCGStab (or IDR) method on the fine grid. While BiCGStab is generally considered to be a non-restarted method, it works well in this context with deflating and restarting. Tests show this new approach can be very efficient for difficult linear equations problems.

math.NA↗

arXiv2019

Disconnected Loop Subtraction Methods in Lattice QCD

Noise subtraction methods are a set of techniques that aim to reduce the variance of signals in LQCD which are often flooded with noise. The standard approach is a pertubative subtraction. In this work, we demonstrate the abilities of our new noise subtraction methods with methods which show considerable improvement over pertubative subtraction in the reduction of the variance for the set of LQCD operators that were studied. The methods were tested at $\kappa_{crit}$ on quenched configurations, as well as on dynamical quark configurations at $\kappa = 0.1453$. A significant improvement in the reduction of operator variance was observed in both cases.

hep-lat↗

arXiv2019

Deflated GMRES with Multigrid for Lattice QCD

Lattice QCD solvers encounter critical slowing down for fine lattice spacings and small quark mass. Traditional matrix eigenvalue deflation is one approach to mitigating this problem. However, to improve scaling we study the effects of deflating on the coarse grid in a hierarchy of three grids for adaptive mutigrid applications of the two dimensional Schwinger model. We compare deflation at the fine and coarse levels with other non deflated methods. We find the inclusion of a partial solve on the intermediate grid allows for a low tolerance deflated solve on the coarse grid. We find very good scaling in lattice size near critical mass when we deflate at the coarse level using the GMRES-DR and GMRES-Proj algorithms.

hep-lat↗

arXiv2019

Disconnected Loop Subtraction Methods in Lattice QCD

Lattice QCD calculations of disconnected quark loop operators are extremely computer time-consuming to evaluate. To compute these diagrams using lattice techniques, one generally uses stochastic noise methods. These employ a randomly generated set of noise vectors to project out physical signals. In order to strengthen the signal in these calculations, various noise subtraction techniques may be employed. In addition to the standard method of perturbative subtraction, one may also employ matrix deflation techniques using the GMRES-DR and MINRES-DR algorithms as well as polynomial subtraction techniques to reduce statistical uncertainty. Our matrix deflation methods play two roles: they both speed up the solution of the linear equations as well as decrease numerical noise. We show how to combine deflation with either perturbative and polynomial methods to produce extremely powerful noise suppression algorithms. We use a variety of lattices to study the effects. In order to set a benchmark, we first use the Wilson matrix in the quenched approximation. We see strong low eigenmode dominance at kappa critical ($\kappa_{crit}$) in the variance of the vector and scalar operators. We also use MILC dynamic lattices, where we observe deflation subtraction results consistent with the effectiveness seen in the quenched data.

hep-lat↗