✦ LIBER ✦

Linear filtering algorithms for Monte Carlo simulations

✍ Scribed by S. Amir-Azizi; G.J. Daniell

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 825 KB
Volume: 67
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(92)90052-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two Modified Staging Algorithms for Path

Two Modified Staging Algorithms for Path Integral Monte Carlo Simulations

✍ L.Cruzeiro Hansson; J.O. Baum; J.L. Finney 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Quantum-Monte-Carlo simulations on linea

Quantum-Monte-Carlo simulations on linear chains

✍ Stefan N. Kreitmeier; Donald W. Noid; Bobby G. Sumpter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 687 KB

## Abstract The diffusion Quantum‐Monte‐Carlo method is applied to a set of coupled oscillators as a first approach to a polyethylene chain. The obtained energy eigenvalues are in good agreement with normal mode analysis. For chains shorter than 50 atoms a distinction between center oscillators and

Forced Detection Monte Carlo Algorithms

Forced Detection Monte Carlo Algorithms for Accelerated Blood Vessel Image Simulations

✍ Ingemar Fredriksson; Marcus Larsson; Tomas Strömberg 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB

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.

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

Parallelization strategies for molecular

Parallelization strategies for molecular simulation using the Monte Carlo algorithm

✍ Douglas M. Jones; Julia M. Goodfellow 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 1012 KB

We describe the development of Metropolis Monte Carlo algorithms for a general network of multiple instruction multiple data (MIMD) parallel processors. The implementation of farm, event, and systolic parallel algorithms on transputer-based computers is detailed and their relative performance discus