Related papers: Computer simulation of two continuous spin models …
In this paper, a new progressive mesh algorithm is introduced in order to perform fast physical simulations by the use of a lattice Boltzmann method (LBM) on a single-node multi-GPU architecture. This algorithm is able to mesh automatically…
We propose a method for simulating the stochastic dynamics of classical spin systems with long-range interactions. The method incorporates the stochastic cutoff (SCO) method, which is originally specialized for simulating equilibrium state,…
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…
We report on numerical simulations of the two-dimensional Blume-Capel ferromagnet embedded in the triangular lattice. The model is studied in both its first- and second-order phase transition regime for several values of the crystal field…
We investigate a Hamiltonian lattice version of the two-dimensional Wess-Zumino model by Quantum Monte Carlo simulations. In order to study the pattern of supersymmetry breaking, we measure the ground state energy and the correlation length…
A rigourous Monte Carlo method for protein folding simulation on lattice model is introduced. We show that a parameter which can be seen as the rigidity of the conformations has to be introduced in order to satisfy the detailed balance…
We continue the investigation on the applications of the Kramers equation to the numerical simulation of field theoretic models. In a previous paper we have described the theory and proposed various algorithms. Here, we compare the simplest…
We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to…
When performing a Monte Carlo calculation, the running time should in principle be much longer than the autocorrelation time in order to get reliable results. Among different lattice fermion models, the Holstein model is notorious for its…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
We consider Monte Carlo algorithms for the simulation of charged lattice gases with purely local dynamics. We study the mobility of particles as a function of temperature and show that the poor mobility of particles at low temperatures is…
We find an exact mapping from the generalized Ising models with many-spin interactions to equivalent Boltzmann machines, i.e., the models with only two-spin interactions between physical and auxiliary binary variables accompanied by local…
We propose a new Monte Carlo algorithm for the free energy calculation based on configuration space sampling. We implement this algorithm for Ising model. Comparison with the exact free energy shows an excellent agreement. We analyse the…
In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by…
A hybrid lattice Boltzmann method (LBM) for binary mixtures based on the free-energy approach is proposed. Non-ideal terms of the pressure tensor are included as a body force in the LBM kinetic equations, used to simulate the continuity and…
We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is the splitting of the pseudo-fermion action into two parts. We test…
We developed a general framework for simulating multicomponent and multiphase systems using the lattice Boltzmann framework. Despite the fact that there is no restriction on the number of components in principle, in this article we focus an…
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 report an implementation of the lattice Boltzmann method (LBM) to integrate the Bloch-Torrey equation, which describes the evolution of the transverse magnetization vector and the fate of the signal of diffusion magnetic resonance…
It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that…