Fourier路径积分累积量展开的收敛特性
Convergence Characteristics of the Cumulant Expansion for Fourier Path Integrals
摘要:
研究了傅里叶路径积分方法的累积量表示,以确定时间密度矩阵关于路径变量数$N$的渐近收敛特性。证明了当累积量展开式在$p$阶截断时,密度矩阵的渐近收敛速度类似于$N^{-(2p+1)}$。与证明相关的复杂代数通过引入贡献项的图形表示以及相关的链接簇定理来简化。将各阶累积量项展开成级数,从而在不需要计算$p$阶全累积量的情况下保持渐近收敛速度.使用这种截断展开的每个累积量在$p$阶,在发展傅立叶路径积分表达式具有收敛阶$N^{-(2p+1)}$的数值成本被证明是近似线性的所需的势能评估,使实际的数值实现的方法有前途的数量。
英文摘要:
The cumulant representation of the Fourier path integral method is examined to determine the asymptotic convergence characteristics of the imaginary-time density matrix with respect to the number of path variables $N$ included. It is proved that when the cumulant expansion is truncated at order $p$, the asymptotic convergence rate of the density matrix behaves like $N^{-(2p+1)}$. The complex algebra associated with the proof is simplified by introducing a diagrammatic representation of the contributing terms along with an associated linked-cluster theorem. The cumulant terms at each order are expanded in a series such that the the asymptotic convergence rate is maintained without the need to calculate the full cumulant at order $p$. Using this truncated expansion of each cumulant at order $p$, the numerical cost in developing Fourier path integral expressions having convergence order $N^{-(2p+1)}$ is shown to be approximately linear in the number of required potential energy evaluations making the method promising for actual numerical implementation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。