Applications of higher order composite factorization schemes in imaginary time path integral simulations

Abstract

An attempt is made to demonstrate that the GSF algorithm is almost as easily implemented as the PF algorithm and can yield significant improvements in the convergence of imaginary time path integral simulations as the function of the number of discretizations P. The three scenarios where the GSF algorithm can be especially useful are highlighted. It is also shown that the algorithm has a free parameter αε[0,1].