arXiv · 1802.04541
Dynamic Greedy Algorithms for the Edwards-Anderson Model
Abstract
To provide a novel tool for the investigation of the energy landscape of the Edwards-Anderson spin-glass model we introduce an algorithm that allows an efficient execution of a greedy optimization based on data from a previously performed optimization for a similar configuration. As an application we show how the technique can be used to perform higher-order greedy optimizations and simulated annealing searches with improved performance.
Explore related subjects
Keep this discovery
Stefan Schnabel, Wolfhard Janke. 2018-02-13. Dynamic Greedy Algorithms for the Edwards-Anderson Model. https://doi.org/10.1016/j.cpc.2017.06.019
Cite the original work for its findings. Save a collection to share your selection of sources.