Quantum Monte Carlo : origins, development, applications /

Show other versions (2)

Monte Carlo methods are a class of computational algorithms for simulating the behavior of a wide range of various physical and mathematical systems (with many variables). Their utility has increased with general availability of fast computers, and new applications are continually forthcoming. The b...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Other Authors: Anderson, James B., 1935-
Format: Electronic eBook
Language:Inglés
Published: Oxford ; New York : Oxford University Press, 2007.
Subjects:
Monte Carlo method > Abstracts.
Quantum theory > Abstracts.
Méthode de Monte-Carlo > Résumés analytiques.
Théorie quantique > Résumés analytiques.
SCIENCE > Physics > Quantum Theory.
Monte Carlo method
Quantum theory
Abstracts
Online Access:Texto completo
Table of Contents:
  • Contents; 1 E. Schrödinger: Über die Umkehrung der Naturgesetze; 2 N. Metropolis & S. Ulam: The Monte Carlo method; 3 M.H. Kalos: Monte Carlo calculations of the ground state of three- and four-body nuclei; 4 H. Conroy: Molecular Schrödinger equation. II. Monte Carlo evaluation of integrals; 5 W.L. McMillan: Ground state of liquid [sup(4)]He; 6 M.H. Kalos: Stochastic wave function for atomic helium; 7 R.C. Grimm & R.G. Storer: Monte-Carlo solution of Schrödinger's equation; 8 M.H. Kalos, D. Levesque, & L. Verlet: Helium at zero temperature with hard-sphere and other forces.
  • 9 K.S. Liu, M.H. Kalos, & G.V. Chester: Quantum hard spheres in a channel10 J.B. Anderson: A random-walk simulation of the Schrödinger equation: H[sup(+)sub(3)]; 11 D.J. Klein & H.M. Pickett: Nodal hypersurfaces and Anderson's random-walk simulation of the Schrödinger equation; 12 J.B. Anderson: Quantum chemistry by random walk. H [sup(2)]P, H[sup(+)sub(3)] D[sub(3h)] [sup(1)]A'[sub(1)], H[sub(2)] [sup(3)]S.

Similar Items