/
Computational Physics Computational Physics

Computational Physics - PowerPoint Presentation

trish-goza
trish-goza . @trish-goza
Follow
451 views
Uploaded On 2016-08-04

Computational Physics - PPT Presentation

Random walks and the Metropolis algorithm Dr Guy Tel Zur Forest In Fog by giovanni   neri httpwwwpublicdomainpicturesnet version 02122010 1500 Diffusion Equation ID: 433211

metropolis random number algorithm random metropolis algorithm number walks problems particles time

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Computational Physics" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

Computational Physics

Random walks and the Metropolisalgorithm

Dr. Guy Tel-Zur

Forest In Fog

by

giovanni

 

neri

http://www.publicdomainpictures.net

version 02-12-2010, 15:00Slide2

Diffusion Equation

j(x, t) = T

he flux of

particles.

w(x, t)dx

is

the probability of finding a given number of particles in an interval of

length dx

in x ∈ [x,

x+dx

] at a time t

. It is the PDF.Slide3
Slide4
Slide5

This means in turn that <

x>

is independent of time!This reminds us a random walk in 1D

What about the variance of x?Slide6
Slide7
Slide8

Random walksSlide9
Slide10

Demo: computer code: Open

DEvC

++ execute a modified “program1.cpp”Slide11
Slide12

The Metropolis algorithm and detailed balance

The Best of the 20th Century: Editors Name Top 10 AlgorithmsSIAM News, Volume 33, Number 4By Barry A. Cipra1946:

John von Neumann, Stan Ulam, and Nick Metropolis, all at the Los Alamos Scientific Laboratory, cook up the Metropolisalgorithm, also known as the Monte Carlo method.The Metropolis algorithm aims to obtain approximate solutions to numerical problems with unmanageably many degrees of freedom

and to combinatorial problems of factorial size, by mimicking a random process. Given the digital computer’s reputation for

deterministic calculation, it’s fitting that one of its earliest applications was the generation of random numbers.Slide13
Slide14
Slide15
Slide16

קושי לחשב את פונ' החלוקהSlide17
Slide18
Slide19
Slide20
Slide21
Slide22
Slide23