High-degree polynomial noise subtraction for disconnected loops

被引:0
|
作者
Lashomb, Paul [1 ]
Morgan, Ronald B. [2 ]
Whyte, Travis [3 ]
Wilcox, Walter [1 ]
机构
[1] Baylor Univ, Dept Phys, Waco, TX 76798 USA
[2] Baylor Univ, Dept Math, Waco, TX 76798 USA
[3] Univ Cambridge, Dept Appl Math & Theoret Phys, Cambridge CB3 0WA, England
关键词
Lattice QCD; Disconnected loops; GMRES; GMRES; MATRIX; ESTIMATOR; TRACE;
D O I
10.1016/j.cpc.2024.109120
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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) x 32 quenched lattice at beta = 6.0 and kappa = 0.1570 approximate to 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.
引用
收藏
页数:7
相关论文
共 50 条
  • [21] The High-Degree Cubature Kalman Filter
    Jia, Bin
    Xin, Ming
    Cheng, Yang
    2012 IEEE 51ST ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2012, : 4095 - 4100
  • [22] PROXIMITY DRAWINGS OF HIGH-DEGREE TREES
    Hurtado, Ferran
    Liotta, Giuseppe
    Wood, David R.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2013, 23 (03) : 213 - 230
  • [23] High-degree cubature Kalman filter
    Jia, Bin
    Xin, Ming
    Cheng, Yang
    AUTOMATICA, 2013, 49 (02) : 510 - 518
  • [24] A method for inverting high-degree modes
    Simmons, B
    Basu, S
    PROCEEDINGS OF SOHO 12/GONG (PLUS) 2002 ON LOCAL AND GLOBAL HELIOSEISMOLOGY: THE PRESENT AND FUTURE, 2003, 517 : 393 - 396
  • [25] High precision control in PTP trajectory planning for nonlinear systems using on high-degree polynomial and cuckoo search
    Wu, Huifeng
    Sun, Danfeng
    OPTIMAL CONTROL APPLICATIONS & METHODS, 2019, 40 (01): : 43 - 54
  • [26] FREQUENCIES OF HIGH-DEGREE SOLAR OSCILLATIONS
    LIBBRECHT, KG
    KAUFMAN, JM
    ASTROPHYSICAL JOURNAL, 1988, 324 (02): : 1172 - 1183
  • [28] APPROXIMATION OF HIGH-DEGREE AND PROCEDURAL CURVES
    WOLTER, FE
    TUOHY, ST
    ENGINEERING WITH COMPUTERS, 1992, 8 (02) : 61 - 80
  • [29] HIGH-DEGREE POLYNOMIAL APPROXIMATIONS FOR SOLVING LINEAR INTEGRAL, INTEGRO-DIFFERENTIAL, AND ORDINARY DIFFERENTIAL EQUATIONS
    Kryzhniy, Vladimir v
    COMMUNICATIONS ON ANALYSIS AND COMPUTATION, 2024, 2 (02): : 180 - 198
  • [30] Centralized fusion using high-degree cubature information filtering with unknown covariance of process noise
    Shi, Yuepeng
    Zhou, Xizhao
    Journal of Computational Information Systems, 2015, 11 (05): : 1623 - 1634