Ordering monomial factors of polynomials in the product representation

Abstract

The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the polynomial. We give criteria to quantify the effects of these rounding errors on the computation of polynomials approximating the function $1/s$. We consider polynomials both in a real variable $s$ and in a Hermitian matrix. By investigating several ordering schemes for the monomials of these polynomials, we finally demonstrate that there exist orderings of the monomials that keep rounding errors at a tolerable level.

Latex2e file, 7 figures, 32 pages

References in corpus (1)

• A Polynomial Hybrid Monte Carlo Algorithm

Cited by in corpus (7)

• tmLQCD: a program suite to simulate Wilson Twisted mass Lattice QCD
• Polynomial Hybrid Monte Carlo algorithm for lattice QCD with an odd number of flavors
• Updating algorithms with multi-step stochastic correction
• Comparative Benchmarks of full QCD Algorithms
• Upper and lower Higgs boson mass bounds from a chirally invariant lattice Higgs-Yukawa model
• An Exact Algorithm for Any-flavor Lattice QCD with Kogut-Susskind Fermion
• Toward large-scale Hybrid Monte Carlo simulations of the Hubbard model on graphics processing units