๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A vectorized algorithm for cluster formation in the Swendsen-Wang dynamics

โœ Scribed by Hidetoshi Mino

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
537 KB
Volume
66
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present a vectorized implementation of the Swendsen-Wang (SW) dynamics, which is one of the promising methods to simulate large systems near criticality. Formation of spin clusters, the most time consuming step in the SW dynamics, is efficiently vectorized by the help of the "union-find algorithm". Efficiency was measured for the two-dimensional q-state Potts models on the HITAC-S820/80 vector computer. We achieved a speed of 2.4 million spin updates per second which is faster by one order than that of scalar algorithms. This implementation can be effective on many other vector machines and is also easily applicable to simulations on parallel machines.

๐Ÿ“œ SIMILAR VOLUMES

A vectorized algorithm for calculating t
A vectorized algorithm for calculating the accessible surface area of macromolecules
โœ Huajun Wang; Cyrus Levinthal ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 378 KB

An algorithm is presented for calculating the solvent accessible surface area of proteins using a threedimensional grid. Since it requires only calculations based on single atomic positions, the algorithm is easy to be vectorized. It has been implemented on STlOO and may also be implemented on super

A vectorized algorithm on the ETA 10-P f
A vectorized algorithm on the ETA 10-P for molecular dynamics simulation of large number of particles confined in a long cylinder
โœ J. Moล›ciล„ski; J. Kitowski; Z.A. Rycerz; P.W.M. Jacobs ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 591 KB

In this paper we describe an algorithm suitable for molecular dynamics (MD) computer simulation of particles confined in a cylinder and interacting by short-ranged forces. A procedure for determining neighbours is based on sorting the particles according to values of one coordinate along the axis of

A dynamic algorithm for integration in t
A dynamic algorithm for integration in the boundary element method
โœ Bruce A. Ammons; Madhukar Vable ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 182 KB ๐Ÿ‘ 3 views

The discretization of the boundary in boundary element method generates integrals over elements that can be evaluated using numerical quadrature that approximate the integrands or semi-analytical schemes that approximate the integration path. In semi-analytical integration schemes, the integration p