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

A fast algorithm for investigations on the three-dimensional Ising model

โœ Scribed by Michael Creutz; P. Mitra; K.J.M. Moriarty


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
400 KB
Volume
33
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis


Nature of the physical problem

Program available from: CPC Program Library, Queen's Uni-

We wish to study the critical temperature and critical expoversity of Belfast, N. Ireland (see application form


๐Ÿ“œ SIMILAR VOLUMES


FORTRAN code for the three-dimensional I
โœ Michael Creutz; K.J.M. Moriarty ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 556 KB

Title of program: MICROIS mentary magnets in a large three-dimensional Ising model system so that the critical inverse temperature and critical Catalogue number: AADW exponents can be measured. Program available from: CPC Program Library, Queen's Uni-Method of solution versity of Belfast, N. Ireland

FORTRAN code for the three-dimensional I
โœ J.-M. Drouffe; K.J.M. Moriarty ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 800 KB

In order to test universality, the three-dimensional Ising model with the microcanonical method with demons is formulated on the bcc and fcc lattices.

A fast vectorized Fortran 77 program for
โœ Hans-Otto Heuer ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 904 KB

Multispin coding techniques have been combined with self-consistent boundary conditions to simulate three-dimensional Ising systems at a speed of 305 million spin updates per second, including magnetization and energy calculation, on a single processor of the CRAY YMP 832.

A Fast Algorithm for the Optimal Alignme
โœ Lloyd Allison ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB

LLOYD ALLISON Department of Computer Science, Monash University, Australia 3168 (Received on 15 December 1992, Accepted in revised form on 10 March 1993) Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting alg