Related papers: A comparative study of selected parallel tempering…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
We introduce new fast canonical local algorithms for discrete and continuous spin systems. We show that for a broad selection of spin systems they compare favorably to the known ones except for the Ising +/-1 spins. The new procedures use…
The random field Ising model with Gaussian disorder is studied using a new Monte Carlo algorithm. The algorithm combines the advantanges of the replica exchange method and the two-replica cluster method and is much more efficient than the…
We study metastability and mixing time for a non-reversible probabilistic cellular automaton. With a suitable choice of the parameters, we first show that the stationary distribution is close in total variation to a low temperature Ising…
We present and solve the Replica Symmetric equations in the context of the Replica Cluster Variational Method for the 2D random bond Ising model (including the 2D Edwards-Anderson spin glass model). First we solve a linearized version of…
We study dimensional crossover in Ising systems at complex temperatures by comparing three types of system: the infinite isotropic 2D Ising model; the infinite anisotropic 2D Ising model; and Ising ladders with a finite number of legs. In…
We present a novel approach to the parallelization of the parabolic fast multipole method for a space-time boundary element method for the heat equation. We exploit the special temporal structure of the involved operators to provide an…
Simulated tempering (ST) has attracted a great deal of attention in the last years, due to its capability to allow systems with complex dynamics to escape from regions separated by large entropic barriers. However its performance is…
Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. To facilitate the coupling of the two models, non-matching grids are often desirable as nonlocal…
The simulation of rare events is one of the key problems in atomistic simulations. Towards its solution a plethora of methods have been proposed. Here we combine two such methods metadynamics and inte-grated tempering sampling. In…
Metastability is a formidable challenge to Markov chain Monte Carlo methods. In this paper we present methods for algorithm design to meet this challenge. The design problem we consider is temperature selection for the infinite swapping…
Smoothing filter is the method of choice for image preprocessing and pattern recognition. We present a new concurrent method for smoothing 2D object in binary case. Proposed method provides a parallel computation while preserving the…
Various kinds of Ising machines based on unconventional computing have recently been developed for practically important combinatorial optimization. Among them, the machines implementing a heuristic algorithm called simulated bifurcation…
A spatial photonic Ising machine (SPIM) handles large-scale combinatorial optimization problems owing to optical processing with spatial parallelism. However, iterative feedback in the search for optimal solutions limits processing speed…
We have simulated, using parallel tempering, the three dimensional Ising spin glass model with binary couplings in a helicoidal geometry. The largest lattice (L=20) has been studied using a dedicated computer (the SUE machine). We have…
We propose and use a novel, hybrid Monte Carlo algorithm that combines configurational bias particle swaps with parallel tempering. We use this new method to simulate a standard model of a glass forming binary mixture above and below the…
We study the $\pm J$ three-dimensional Ising model with a longitudinal anisotropic bond randomness on the simple cubic lattice. The random exchange interaction is applied only in the $z$ direction, whereas in the other two directions, $xy$…
Global optimization heuristics are popular to optimize hard non-convex problems. Despite their irrefutably large cost-to-solution, in the lack of other working greedy or convex approaches, global optimization algorithms remain the…