WWWalter Wilcox

Walter Wilcox

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Walter Wilcox has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Magnetic polarizability of a charged pion from four-point functions in lattice QCD

    by Frank X. Lee, Walter Wilcox, Andrei Alexandru, Chris Culver

    Electromagnetic dipole polarizabilities are fundamental properties of a hadron that represent its resistance to deformation under external fields. For a charged hadron, the presence of acceleration and Landau levels complicates the isolation of its deformation energy in the conventional background field method. In this work, we explore a general method based on four-point functions in lattice QCD that takes into account all photon, quark and gluon interactions. The electric polarizability ($α_E$) has been determined from the method in a previous proof-of-principle simulation. Here we focus on the magnetic polarizability ($β_M$) using the same quenched Wilson action on a $24^3\times 48$ lattice at $β=6.0$ with pion mass from 1100 to 370 MeV. The results from the connected diagrams show a large cancellation between the elastic and inelastic contributions, leading to a relatively small and negative value for $β_M$ consistent with chiral perturbation theory. We also discuss the mechanism for $α_E+β_M$ from combining the two studies.

  • Open Access

    Charged pion electric polarizability from four-point functions in lattice QCD

    by Frank X. Lee, Andrei Alexandru, Chris Culver, Walter Wilcox

    Polarizabilities reveal valuable information on the internal structure of hadrons in terms of charge and current distributions. For neutral hadrons, the standard approach is the background field method. But for a charged hadron, its acceleration under the applied field complicates the isolation of the polarization energy. In this work, we explore an alternative method based on four-point functions in lattice QCD. The approach offers a transparent picture on how polarizabilities arise from photon, quark, and gluon interactions. We carry out a proof-of-concept simulation on the electric polarizability of a charged pion, using quenched Wilson action on a $24^3\times 48$ lattice at $β=6.0$ with pion mass from 1100 to 370 MeV. We show in detail the evaluation and analysis of the four-point correlation functions and report results on charge radius and electric polarizability. Our results from connected diagrams suggest that charged pion $α_E$ is due to a cancellation between elastic and inelastic contributions. It would be interesting to see how the cancellation plays out at smaller pion masses in future simulations.

  • Open Access

    Multi-Polynomial Monte Carlo for Trace Estimation in Lattice QCD

    by Paul Lashomb, Ronald B. Morgan, Travis Whyte, Walter Wilcox

    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.

  • Open Access

    High-degree Polynomial Noise Subtraction

    by Paul Lashomb, Ronald B. Morgan, Travis Whyte, Walter Wilcox

    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 $β= 6.0$ and $κ= 0.1570 \approx κ_{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.

  • Open Access

    Two-Grid Deflated Krylov Methods for Linear Equations

    by Ronald B. Morgan, Travis Whyte, Walter Wilcox, Zhao Yang

    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.