Optimised simulated annealing for Ising spin glasses
收藏资源简介：
This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018) Abstract We present several efficient implementations of the simulated annealing algorithm for Ising spin glasses on sparse graphs. In particular, we provide a generic code for any choice of couplings, an optimised code for bipartite graphs, and highly optimised implementations using multi-spin coding for graphs with small maximum degree and discrete couplings with a finite range. The latter codes achieve up to 50 spin flips per nanosecond on modern Intel CPUs. We also compare the performance of the c... Title of program: SimAn v1.0 Catalogue Id: AEVZ_v1_0 Nature of problem Ising spin glass ground states on sparse graphs. Versions of this program held in the CPC repository in Mendeley Data AEVZ_v1_0; SimAn v1.0; 10.1016/j.cpc.2015.02.015
本程序源自贝尔法斯特女王大学馆藏的CPC程序库（1969-2018）。 摘要 本文针对稀疏图上的伊辛自旋玻璃（Ising spin glass）问题，提出了模拟退火（simulated annealing）算法的多种高效实现方案。具体而言，我们为任意耦合参数配置提供了通用代码，为二分图（bipartite graph）提供了优化代码，并针对最大度数较小的图与有限范围离散耦合的场景，采用多自旋编码（multi-spin coding）实现了高度优化的算法版本。在现代英特尔（Intel）CPU上，此类优化代码可实现每纳秒最多50次自旋翻转操作。本文还对代码性能进行了对比（原文此处内容截断）。 程序名称：SimAn v1.0 目录编号：AEVZ_v1_0 问题属性：稀疏图上的伊辛自旋玻璃基态 Mendeley数据平台CPC库中收录的本程序版本：AEVZ_v1_0；SimAn v1.0；10.1016/j.cpc.2015.02.015
