Introduction to Monte Carlo Methods
Lecture, three hours; discussion, one hour. Requisites: courses 100B (or Mathematics 170S), 102A. Introduction to Markov chain Monte Carlo (MCMC) algorithms for scientific computing. Generation of random numbers from specific distribution. Rejection sampling and importance sampling and their roles in MCMC. Markov chain theory and convergence properties. Metropolis and Gibbs sampling algorithms. Extensions as simulated tempering. Theoretical understanding of methods and their implementation in concrete computational problems. P/NP or letter grading.
Review Summary
- Clarity
-
N/A
- Organization
-
N/A
- Time
-
N/A
- Overall
-
N/A
Enrollment Progress
Jul 7, 11 PM PDT
LEC 2: 76/80 seats taken (Open)