Least-squared optimized polynomials for smeared link actions

DOI10.1016/J.CPC.2004.01.003MaRDI QIDQ709481zbMATH OpenOpenAlexFDO

Authors S. D. Katz, Bálint C. Tóth

Publication date 18 October 2010

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/hep-lat/0401007

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to quantum theory (81-04)

Abstract: We introduce a numerical method for generating the approximating polynomials used in fermionic calculations with smeared link actions. We investigate the stability of the algorithm and determine the optimal weight function and the optimal type of discretization. The achievable order of polynomial approximation reaches several thousands allowing fermionic calculations using the Hypercubic Smeared Link action even with physical quark masses.

Recommendations

• Using approximating polynomials in partial-global dynamical simulations
• Least-squares optimized polynomials for fermion simulations
• Quadratically optimized polynomials for fermion simulations
• Logarithmic link smearing for full QCD
• Improving the partial-global stochastic Metropolis update for dynamical smeared link fermions

Cites work

• UV-filtered fermionic Monte Carlo

Cited in

(4)

• Quadratically optimized polynomials for fermion simulations
• Least-squares optimized polynomials for fermion simulations
• A novel gauge invariant multistate smearing technique
• Using approximating polynomials in partial-global dynamical simulations

This page was built for publication: Least-squared optimized polynomials for smeared link actions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709481)