A Diffusion Monte Carlo algorithm employing depth first traversal and a stack instead of a swarm
一种采用深度优先遍历和栈而非群体的扩散蒙特卡罗算法
专题命中 可控生成 :diffusion(title,abstract)
AI总结 提出基于深度优先遍历和栈的扩散蒙特卡罗算法(DMCD),通过栈管理分裂历史,相比传统广度优先群体方法更节省内存,并统一了特征值问题与线性方程问题的算法处理。
Comments 12 pages. The code in the original (v1) Arxiv submission could randomly get trapped in a cycle where the same walker is all the time restarted with ever decreasing weight. The issue is described and addressed in this (v2) submission