arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.00426physics.chem-phcs.NE
收藏

基于遗传算法的Goldstone图自动布线

Automatic Routing of Goldstone Diagrams using Genetic Algorithms

Nils Herrmann, Michael Hanrath

摘要:

本文提出了一种算法的自动转换(=路由)的时间有序拓扑的戈德斯通图(即威克收缩)到这些拓扑的图形表示。由于没有硬性标准的最佳路由,该算法最大限度地减少了经验选择的成本函数在一组参数。后者中的一些自然是离散类型的(例如,由于反对称而导致的粒子/空穴线的互换),而其他的(例如,节点的x,y位置)自然是连续的。为了达到一个可管理的优化问题的位置空间被人为离散化。根据(i)成本函数,(ii)离散顶点放置,(iii)粒子/孔线的交换,布线问题现在是明确定义的和完全离散的。然而,它显示出指数的复杂性与顶点数建议应用遗传算法的解决方案。所提出的算法是能够路由非平凡的(几个循环和交叉)戈德斯通图。由此产生的图是完全等同于手动路由的定性。该算法已成功地应用于几个耦合集群的方法和扰动(不动点迭代)CCSD扩展与重复的图替换。

英文摘要:

This paper presents an algorithm for an automatic transformation (=routing) of time ordered topologies of Goldstone diagrams (i.e. Wick contractions) into graphical representations of these topologies. Since there is no hard criterion for an optimal routing, the proposed algorithm minimizes an empirically chosen cost function over a set of parameters. Some of the latter are naturally of discrete type (e.g. interchange of particle/hole lines due to antisymmetry) while others (e.g. x,y-position of nodes) are naturally continuous. In order to arrive at a manageable optimization problem the position space is artificially discretized. In terms of the (i) cost function, (ii) the discrete vertex placement, (iii) the interchange of particle/hole lines the routing problem is now well defined and fully discrete. However, it shows an exponential complexity with the number of vertices suggesting to apply a genetic algorithm for its solution. The presented algorithm is capable of routing non trivial (several loops and crossings) Goldstone diagrams. The resulting diagrams are qualitatively fully equivalent to manually routed ones. The proposed algorithm is successfully applied to several Coupled Cluster approaches and a perturbative (fixpoint iterative) CCSD expansion with repeated diagram substitution.

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

↑