Equation of State Calculations by Fast Computing Machines

Equation of State Calculations by Fast Computing Machines

Equation of State Calculations by Fast Computing Machines is an article published by Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller in the Journal of Chemical Physics in 1953.cite journal |author=N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller |title=Equation of State Calculations by Fast Computing Machines |journal=Journal of Chemical Physics |volume=21 |issue=6 |pages=1087-1092 |year=1953 |doi=10.1063/1.1699114] This paper proposed what became known as the Metropolis Monte Carlo algorithm, which forms the basis for Monte Carlo statistical mechanics simulations of atomic and molecular systems.cite journal |title=Perspective on “Equation of state calculations by fast computing machines William L. Jorgensen |volume=103 |issue=3-4 |year=2000 |doi=10.1007/s002149900053 |pages=225-227]

Monte Carlo methods are a class of computational algorithms that rely on repeated random sampling to compute their results. In statistical mechanics applications prior to the introduction of the Metropolis algorithm, the method consisted of generating a large number of random configurations of the system, computing the properties of interest (such as energy or density) for each configuration, and then producing a weighted average where the weight of each configuration is its Boltzmann factor, exp(−"E"/"kT"), where "E" is the energy, "T" is the temperature, and "k" is Boltzmann's constant. The key contribution of the Metropolis paper was the idea that

. To choose configurations with a probability exp(−"E"/"kT") that can be weighed evenly, the authors devised the following algorithm: 1) each configuration is generated by a random move on the previous configuration and the new energy is computed; 2) if the new energy is lower, the move is always accepted; otherwise the move is accepted with a probability of exp(−Δ"E"/"kT"). When a move is rejected, the last accepted configuration is counted again for the statistical averages and is used as a base for the next attempted move.

The main topic of the article was the numerical calculation of the equation of state for a system of rigid spheres in two dimensions. Subsequent work generalized the method to three dimensions and to fluids using the Lennard-Jones potential. The simulations were done for a system of 224 particles; each simulation consisted of up to 48 cycles, where each cycle consisted of moving each particle once and took about three minutes of computer time using the MANIAC computer at Los Alamos National Lab.

To minimize surface effects, the authors introduced the use of periodic boundary conditions. This means that the simulated system is treated as a unit cell in a lattice, and when a particle moves out of the cell, it automatically comes in through the other side.

According to a perspective published nearly fifty years later by William L. Jorgensen, "Metropolis et al. introduced the samplic method and periodic boundary conditions that remain at the heart of Monte Carlo statistical mechanics simulations of fluids. This was one of the major contributions to theoretical chemistry of the twentieth century." As of 2008, the article has been cited over 10,000 times. [ISI Web of Knowledge Cited Reference Search. Accessed 2008-07-10.]

In another perspective, it was said that although "the Metropolis algorithm began as a technique for attacking specific problems in numerical simulations of physical systems [...] later, the subject exploded as the scope of applications broadened in many surprising directions, including function minimization, computational geometry, and combinatorial counting. Today, topics related to the Metropolis algorithm constitute an entire field of computational science supported by a deep theory and having applications ranging from physical simulations to the foundations of computational complexity." [cite journal |author=I. Beichl and F. Sullivan |title=The Metropolis Algorithm |journal=Computing in Science and Engineering |volume=2 |issue=1 |year=2000 pages=65-69 |doi=10.1109/5992.814660]

References

* J.E. Gubernatis, Marshall Rosenbluth and the Metropolis Algorithm, Physics of Plasmas 12, 057303 (2005).
* Nicolas Metropolis (1987). [http://lib-www.lanl.gov/la-pubs/00326866.pdf The Beginning of the Monte Carlo Method] . "Los Alamos Science", No. 15, Page 125.
* Herbert Anderson (1986). [http://lib-www.lanl.gov/la-pubs/00326886.pdf Metropolis, Monte Carlo and the MANIAC] . "Los Alamos Science" No. 14, Page 69.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics …   Wikipedia

  • Metropolis–Hastings algorithm — The Proposal distribution Q proposes the next point that the random walk might move to. In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a… …   Wikipedia

  • List of mathematics articles (E) — NOTOC E E₇ E (mathematical constant) E function E₈ lattice E₈ manifold E∞ operad E7½ E8 investigation tool Earley parser Early stopping Earnshaw s theorem Earth mover s distance East Journal on Approximations Eastern Arabic numerals Easton s… …   Wikipedia

  • List of important publications in physics — Optics Book of Optics *Ibn al Haytham (Alhacen)Description: The Book of Optics (Arabic: Kitab al Manazir , Latin: De Aspectibus ) is a seven volume treatise on optics and physics, written by the Iraqi Arab Muslim scientist Ibn al Haytham… …   Wikipedia

  • Nicholas Metropolis — Nicholas Constantine Metropolis Born June 11, 1915(1915 06 11) Chicago …   Wikipedia

  • Marshall Rosenbluth — at UCSD in 1994. Born February 5, 1927 …   Wikipedia

  • MC-Simulation — Viertelkreis, dessen Fläche durch die Monte Carlo Methode angenähert wird. Damit lässt sich eine Näherung von Pi bestimmen. Monte Carlo Simulation oder Monte Carlo Studie, auch: MC Simulation, ist ein Verfahren aus der Stochastik, bei dem sehr… …   Deutsch Wikipedia

  • Monte-Carlo-Methode — Viertelkreis, dessen Fläche durch die Monte Carlo Methode angenähert wird. Damit lässt sich eine Näherung von Pi bestimmen. Monte Carlo Simulation oder Monte Carlo Studie, auch: MC Simulation, ist ein Verfahren aus der Stochastik, bei dem sehr… …   Deutsch Wikipedia

  • Monte-Carlo-Statistik — Viertelkreis, dessen Fläche durch die Monte Carlo Methode angenähert wird. Damit lässt sich eine Näherung von Pi bestimmen. Monte Carlo Simulation oder Monte Carlo Studie, auch: MC Simulation, ist ein Verfahren aus der Stochastik, bei dem sehr… …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”