Related papers: Parallelization and implementation of multi-spin M…
We demonstrate that substantial progress can be achieved in the study of the phase structure of 4-dimensional compact QED by a joint use of hybrid Monte Carlo and multicanonical algorithms, through an efficient parallel implementation. This…
We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of computers. The implementation makes use of a C wrapper that essentially uses the…
A review of the coupled cluster method (CCM) applied to lattice quantum spin systems is presented here. The CCM formalism is explained and an application to the spin-half {\it XXZ} model on the square lattice is presented. Low orders of…
The Simplex tableau has been broadly used and investigated in the industry and academia. With the advent of the big data era, ever larger problems are posed to be solved in ever larger machines whose architecture type did not exist in the…
We introduce a Monte-Carlo algorithm for the simulation of charged particles moving in the continuum. Electrostatic interactions are not instantaneous as in conventional approaches, but are mediated by a constrained, diffusing electric…
This paper considers clustered multi-task compressive sensing, a hierarchical model that solves multiple compressive sensing tasks by finding clusters of tasks that leverage shared information to mutually improve signal reconstruction. The…
We develop a parallel algorithm that calculates the exact partition function of a lattice polymer, by enumerating the number of conformations for each energy level. An efficient parallelization of the calculation is achieved by classifying…
Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…
Population Monte Carlo simulations in the form commonly referred to as population annealing can serve as a useful meta-algorithm for simulating systems with complex free-energy landscapes. In the present paper we provide an easily…
Correlation clustering is a central topic in unsupervised learning, with many applications in ML and data mining. In correlation clustering, one receives as input a signed graph and the goal is to partition it to minimize the number of…
We study the efficiency of parallel tempering Monte Carlo technique for calculating true ground states of the Edwards-Anderson spin glass model. Bimodal and Gaussian bond distributions were considered in two and three-dimensional lattices.…
We present a novel way of performing kinetic Monte Carlo simulations which does not require an {\it a priori} list of diffusion processes and their associated energetics and reaction rates. Rather, at any time during the simulation,…
In this work we study a disordered binary Ising model on the square lattice. The model system consists of two different particles with spin-1/2 and spin-1, which are randomly distributed on the lattice. It has been considered only spin…
We introduce a natural way to extend celebrated spin-cluster Monte Carlo algorithms for fast thermal lattice simulations at criticality, like Wolff, to systems in arbitrary fields, be they linear magnetic vector fields or nonlinear…
We propose an efficient Markov Chain Monte Carlo method for sampling equilibrium distributions for stochastic lattice models, capable of handling correctly long and short-range particle interactions. The proposed method is a Metropolis-type…
We apply a set of machine-learning (ML) techniques for the global exploration of the phase diagrams of two frustrated 2D Ising models with competing interactions. Based on raw Monte Carlo spin configurations generated for random system…
Linear-scaling electronic-structure techniques, also called O(N) techniques, rely heavily on the multiplication of sparse matrices, where the sparsity arises from spatial cut-offs. In order to treat very large systems, the calculations must…
Large-scale plasma simulations are critical for designing and developing next-generation fusion energy devices and modeling industrial plasmas. BIT1 is a massively parallel Particle-in-Cell code designed for specifically studying plasma…
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…
Sustaining a large fraction of single GPU performance in parallel computations is considered to be the major problem of GPU-based clusters. In this article, this topic is addressed in the context of a lattice Boltzmann flow solver that is…