Non-Hermitian Polynomial Hybrid Monte Carlo

TL;DR

This paper introduces a novel hybrid Monte Carlo algorithm variant that uses polynomial approximations of the inverse of a non-Hermitian operator, leveraging Chebyshev polynomials for stability and efficiency.

Contribution

The paper presents a new hybrid Monte Carlo method employing polynomial approximations for non-Hermitian operators, enhancing stability and performance.

Findings

Initial performance results demonstrate the method's viability.

The polynomial approximation improves computational stability.

The approach simplifies the inversion process for non-Hermitian operators.

Abstract

We report on a new variant of the hybrid Monte Carlo algorithm employing a polynomial approximation of the inverse of the non-Hermitian Dirac-Wilson operator. Our approximation relies on simple and stable recurrence relations of complex Chebyshev polynomials. First performance figures are presented.