约化格、混合作用和双迹变形的Monte Carlo算法
Monte Carlo Algorithms For Reduced Lattices, Mixed Actions, And Double-Trace Deformations
摘要:
本文对两类非线性依赖于连接变量的纯SU(N)格点规范作用量构造了有效的Monte Carlo更新算法。我们的建设推广的辅助变量的方法使用的法布里丘斯和哈恩的江口-川合模型的框架。我们首先回顾了原来的Fabricius-Haan方法构造一个伪热浴算法完全约化模型,并讨论了其扩展到晶格与任何数量的约化方向。然后,我们使用类似的方法来构造一般SU(N)混合威尔逊行动的更新算法。我们构造明确的例子的算法威尔逊行动的格元是在一个不可约的表示SU(N)的N度高达3。我们还构造了定义在R^{d-1} x S^1上的中心稳定SU(N)杨-米尔斯理论的格点版本的更新算法,包括完全约化紧致方向的情况。我们模拟的新算法,并表明,他们是,在一般情况下,显着更有效地比他们的大都市同行。
英文摘要:
We construct efficient Monte Carlo updating algorithms for two classes of pure SU(N) lattice gauge actions with non-linear dependence on the link variables. Our construction generalises the method of auxiliary variables used by Fabricius and Haan in the framework of Eguchi-Kawai models. We first review the original Fabricius-Haan method of constructing a pseudo-heatbath algorithm for fully reduced models, and discuss its extension to lattices with any number of reduced directions. We then use a similar method to construct updating algorithms for generic SU(N) mixed Wilson actions. We construct explicit examples of algorithms for Wilson actions whose plaquettes are in an irreducible representation of SU(N) with N-ality up to 3. We also construct updating algorithms for the lattice version of centre-stabilised SU(N) Yang-Mills theories defined on R^{d-1} x S^1, including the case of a fully reduced compact direction. We simulate the new algorithms and show that they are, in general, significantly more efficient than their Metropolis counterparts.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。