COMP790 Spring 2005

High Performance Computing and Monte Carlo Methods
Instructor:       Yaohang Li

yaohang@ncat.edu

Book: J. M. Hammersley and D. C. Handscomb. Monte Carlo Methods. Methuen, London, 1964.
Meeting Times:            Tuesday, Thursday
11:00AM-12:15PM, McNair LR4


Introduction

This course serves to illustrate important principles in Monte Carlo simulations and to demonstrate the power of Monte Carlo methods in simulation applications. Many basic ideas in classical Monte Carlo computations, including the Metropolis-Hastings algorithm, the Gibbs sampler, Markov Chain Monte Carlo, the acceptance-rejection method, Monte Carlo integration, quasi-Monte Carlo, random number generation, will be introduced. Then the focus shifts to applying these methods to scientific computing simulations in high-performance computing environment such as tightly coupled parallel computers, clusters, and grid-computing environments. Applications to Bayesian computation, molecular dynamics, computational biology, computational material, VLSI chip design and optimization, and nuclear simulation will be illustrated.


Course Syllabus


Class Notes


Homework Descriptions and Due Dates

© 2003 NCAT Dept. of Computer Science