arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.4504cond-mat.stat-mechcond-mat.str-elhep-lathep-thphysics.comp-ph
收藏

符号问题的一般解法--多观测量因式分解法

A general approach to the sign problem - the factorization method with multiple observables

Konstantinos N. Anagnostopoulos, Takehiro Azuma, Jun Nishimura

摘要:

符号问题是蒙特卡罗模拟中遇到的一个著名问题,该问题的配分函数的被积函数不是实正数。因式分解法的基本思想是控制某些可观测量,以便有效地确定和采样对配分函数有重要贡献的位形空间区域。我们认为,它是至关重要的,以适当地选择一组的可观控制的方法在一般系统中成功地工作。这是证明了一个明确的例子,其中它原来是必要的,以控制一个以上的可观的。外推到大的系统尺寸是可能的,由于良好的缩放特性的因式分解的功能,和已知的结果得到的分析方法被一致地再现。

英文摘要:

The sign problem is a notorious problem, which occurs in Monte Carlo simulations of a system with the partition function whose integrand is not real positive. The basic idea of the factorization method applied on such a system is to control some observables in order to determine and sample efficiently the region of configuration space which gives important contribution to the partition function. We argue that it is crucial to choose appropriately the set of the observables to be controlled in order for the method to work successfully in a general system. This is demonstrated by an explicit example, in which it turns out to be necessary to control more than one observables. Extrapolation to large system size is possible due to the nice scaling properties of the factorized functions, and known results obtained by an analytic method are shown to be consistently reproduced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑