𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast processor for Monte-Carlo simulation

✍ Scribed by Robert B Pearson; John L Richardson; Doug Toussain

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
502 KB
Volume
51
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast algorithm for one-dimensional quant
Fast algorithm for one-dimensional quantum Monte Carlo simulations
✍ Mihail Marcu; JΓΌrgen MΓΌller; Franz-Karl Schmatzer πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 654 KB

A fast algorithm for simulating one-dimensional quantum spin systems on CRAY 1 computers is presented. Various versions of the algorithm suitable for general spin xxz and xyz models with and without magnetic field are discussed.

A fast method to gather neighbors in vec
A fast method to gather neighbors in vectorized Monte Carlo simulations
✍ Claus Vohwinkel πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 429 KB

An algorithm is presented, which gathers neighbors for n-dimensional lattices with periodic boundary conditions. The method used does not need the usual GATHER instructions. With the exception of a few bit-vectors no additional storage is needed. The algorithm can be easily extended to more than nea

Monte Carlo Simulations for Micellar Enc
Monte Carlo Simulations for Micellar Encapsulation
✍ Sameer K. Talsania; Yongmei Wang; Raj Rajagopalan; Kishore K. Mohanty πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 396 KB

sulation are predicted by equating appropriate chemical po-The solubilization of solutes in surfactant aggregates (micelles ) tentials to each other. This approach is quite useful, but is studied using lattice-based Monte Carlo simulations. Various requires independent information on chemical potent