Exploring optimization for the random-field Ising model
| dc.creator | Hambrick, D. Clay | |
| dc.creator | Meinke, Jan H. | |
| dc.creator | Middleton, A. Alan | |
| dc.date | 2005-01-12 | |
| dc.date.accessioned | 2026-07-07T03:03:11Z | |
| dc.date.available | 2026-07-07T03:03:11Z | |
| dc.description | The push-relabel algorithm can be used to calculate rapidly the exact ground states for a given sample with a random-field Ising model (RFIM) Hamiltonian. Although the algorithm is guaranteed to terminate after a time polynomial in the number of spins, implementation details are important for practical performance. Empirical results for the timing in dimensions d=1,2, and 3 are used to determine the fastest among several implementations. Direct visualization of the auxiliary fields used by the algorithm provides insight into its operation and suggests how to optimize the algorithm. Recommendations are given for further study of the RFIM. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0501269 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0501269 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/25658 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Statistical Mechanics | |
| dc.title | Exploring optimization for the random-field Ising model | |
| dc.type | text |