Key points are not available for this paper at this time.
The relationship between so-called Discretized and Fourier coefficient formulations of Cartesian path integration is examined. In particular, an intimate connection between the two is established by rewriting the Discretized formulation in a manifestly Fourier-like way. This leads to improved understanding of both the limit behavior and the convergence properties of computational prescriptions based on the two formalisms. The performance of various prescriptions is compared with regard to calculation of on-diagonal statistical density matrix elements for a number of prototypical 1-d potentials. A consistent convergence order among these prescriptions is established.
Rob D. Coalson (Tue,) studied this question.