×

zbMATH — the first resource for mathematics

Efficient parallel simulations of dynamic Ising spin systems. (English) Zbl 0642.65001
Many of the important computational aspects of fundamental problems in Physical Sciences have been attracting much attention of late. Efficient handling of modelling and simulation, while solving problems calls for the discovery of apt and time-saving algorithms. There are seven sections: Introduction, Saturated algorithms, Examples, Super-saturation and the BKL algorithm, Collecting statistics, Performance and Conclusion. The paper demonstrates in explicit terms an effective parallel scheme for simulating continuous time Ising spin systems. The intimate contacts between several features of the basic spin physics as well as computational intricacies are carefully discussed, their being a very challenging mathematical problem also.
Reviewer: P.Achuthan

MSC:
65C05 Monte Carlo methods
65Y05 Parallel numerical computation
81V25 Other elementary particle theory in quantum theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Berge, C., Graphs and hypergraphs, (1976), Elsevier New York · Zbl 0483.05029
[2] ()
[3] Bortz, A.B.; Kalos, M.H.; Lebowitz, J.T., J. comput. phys., 17, 10, (1975)
[4] Creutz, M., Ann. phys. (N.Y.), 167, 62, (1986)
[5] Friedberg, R.; Cameron, J.E., J. chem. phys., 52, 6049, (1970)
[6] Glauber, R.J., J. math. phys., 4, 294, (1963)
[7] Hillis, W.D., The connection machine, (1985), MIT Press Cambridge, MA
[8] Ising, F., Z. phys., 31, 253, (1925)
[9] Keilson, J., Markov chain models—rarity and exponentiality, (1979), Springer New York · Zbl 0411.60068
[10] Kruskal, C.P., (), (unpublished)
[11] Lubachevsky, B.D., (), (unpublished)
[12] Metropolis, N.; Rosenbluth, A.W.; Rosenbluth, M.N.; Teller, A.H.; Teller, E., J. chem. phys., 21, 1087, (1953)
[13] Ogielski, A.T., Phys. rev. B, 32, 7384, (1985)
[14] Ross, S.M., Introduction to probability models, (1985), Academic Press New York · Zbl 0647.60002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.