André Schleife Department of Materials Science and Engineering

Similar documents
Random Walks A&T and F&S 3.1.2

Monte Carlo (MC) Simulation Methods. Elisa Fadda

Monte Carlo. Lecture 15 4/9/18. Harvard SEAS AP 275 Atomistic Modeling of Materials Boris Kozinsky

André Schleife Department of Materials Science and Engineering

Basics of Statistical Mechanics

ICCP Project 2 - Advanced Monte Carlo Methods Choose one of the three options below

Kinetic Monte Carlo (KMC)

Introduction to molecular dynamics

Today: Fundamentals of Monte Carlo

3.320 Lecture 18 (4/12/05)

Today: Fundamentals of Monte Carlo

What is Classical Molecular Dynamics?

Today: Fundamentals of Monte Carlo

Kinetic Monte Carlo (KMC) Kinetic Monte Carlo (KMC)

MatSci 331 Homework 4 Molecular Dynamics and Monte Carlo: Stress, heat capacity, quantum nuclear effects, and simulated annealing

Monte Carlo Simulation of the Ising Model. Abstract

Basics of Statistical Mechanics

Markov Chain Monte Carlo Method

Multiple time step Monte Carlo

Metropolis Monte Carlo simulation of the Ising Model

Ab initio molecular dynamics. Simone Piccinin CNR-IOM DEMOCRITOS Trieste, Italy. Bangalore, 04 September 2014

The XY-Model. David-Alexander Robinson Sch th January 2012

MD Thermodynamics. Lecture 12 3/26/18. Harvard SEAS AP 275 Atomistic Modeling of Materials Boris Kozinsky

3.320: Lecture 19 (4/14/05) Free Energies and physical Coarse-graining. ,T) + < σ > dµ

Simulations with MM Force Fields. Monte Carlo (MC) and Molecular Dynamics (MD) Video II.vi

Wang-Landau sampling for Quantum Monte Carlo. Stefan Wessel Institut für Theoretische Physik III Universität Stuttgart


4/18/2011. Titus Beu University Babes-Bolyai Department of Theoretical and Computational Physics Cluj-Napoca, Romania

Introduction to the Renormalization Group

Markov Processes. Stochastic process. Markov process

Molecular Dynamics 9/6/16

Same idea for polyatomics, keep track of identical atom e.g. NH 3 consider only valence electrons F(2s,2p) H(1s)

Computer simulation methods (1) Dr. Vania Calandrini

Markov Chain Monte Carlo The Metropolis-Hastings Algorithm

Temperature and Pressure Controls

Importance Sampling in Monte Carlo Simulation of Rare Transition Events

Monte Caro simulations

Molecular Interactions F14NMI. Lecture 4: worked answers to practice questions

Molecular Dynamics. What to choose in an integrator The Verlet algorithm Boundary Conditions in Space and time Reading Assignment: F&S Chapter 4

Computational Physics. J. M. Thijssen

Copyright 2001 University of Cambridge. Not to be quoted or copied without permission.

Ab Ini'o Molecular Dynamics (MD) Simula?ons

Monte Carlo Methods in High Energy Physics I

Set the initial conditions r i. Update neighborlist. r i. Get new forces F i

Temperature and Pressure Controls

Molecular Dynamics. The Molecular Dynamics (MD) method for classical systems (not H or He)

Brief Review of Statistical Mechanics

Introduction to Computer Simulations of Soft Matter Methodologies and Applications Boulder July, 19-20, 2012

MONTE CARLO METHOD. Reference1: Smit Frenkel, Understanding molecular simulation, second edition, Academic press, 2002.

Classical Monte-Carlo simulations

Introduction to Simulation - Lectures 17, 18. Molecular Dynamics. Nicolas Hadjiconstantinou

Controlled healing of graphene nanopore

Monte Carlo simulations of alloy segregation in PtAg octahedral nanoparticles

Quantum Monte Carlo. Matthias Troyer, ETH Zürich

Modeling & Simulation of Glass Structure

Convergence Rate of Markov Chains

LECTURE 10: Monte Carlo Methods II

Computational statistics

Bioengineering 215. An Introduction to Molecular Dynamics for Biomolecules

Monte Carlo integration (naive Monte Carlo)

Interatomic Potentials. The electronic-structure problem

CE 530 Molecular Simulation

Advanced Monte Carlo Methods Problems

REVIEW: Derivation of the Mean Field Result

1. Introductory Examples

J ij S i S j B i S i (1)

Physics 115/242 Monte Carlo simulations in Statistical Physics

Computational Physics (6810): Session 13

Introduction Statistical Thermodynamics. Monday, January 6, 14

Computer simulation methods (2) Dr. Vania Calandrini

Multi-Ensemble Markov Models and TRAM. Fabian Paul 21-Feb-2018

Lecture 2+3: Simulations of Soft Matter. 1. Why Lecture 1 was irrelevant 2. Coarse graining 3. Phase equilibria 4. Applications

Advanced Sampling Algorithms

Janus: FPGA Based System for Scientific Computing Filippo Mantovani

Molecular Dynamics and Accelerated Molecular Dynamics

General Construction of Irreversible Kernel in Markov Chain Monte Carlo

The Markov Chain Monte Carlo Method

Metropolis, 2D Ising model

The Phase Transition of the 2D-Ising Model

Numerical Analysis of 2-D Ising Model. Ishita Agarwal Masters in Physics (University of Bonn) 17 th March 2011

Understanding temperature and chemical potential using computer simulations

Old Dominion University Physics 811 Fall 2008

Wang-Landau Monte Carlo simulation. Aleš Vítek IT4I, VP3

Advanced sampling. fluids of strongly orientation-dependent interactions (e.g., dipoles, hydrogen bonds)

Doing Physics with Random Numbers

ONETEP PB/SA: Application to G-Quadruplex DNA Stability. Danny Cole

Lecture 14: Advanced Conformational Sampling

Understanding Molecular Simulation 2009 Monte Carlo and Molecular Dynamics in different ensembles. Srikanth Sastry

Physics 562: Statistical Mechanics Spring 2002, James P. Sethna Prelim, due Wednesday, March 13 Latest revision: March 22, 2002, 10:9

Supporting Online Material (1)

CE 530 Molecular Simulation

Ab initio Molecular Dynamics Born Oppenheimer and beyond

Minicourse on: Markov Chain Monte Carlo: Simulation Techniques in Statistics

Using AutoDock 4 with ADT: A Tutorial

Free Energy Estimation in Simulations

Importance Sampling in Monte Carlo Simulation of Rare Transition Events

TR&D3: Brownian Mover DBP4: Biosensors

Thermodynamic behaviour of mixtures containing CO 2. A molecular simulation study

Monte Carlo Study of the Crystalline and Amorphous NaK Alloy

Time-Dependent Statistical Mechanics 1. Introduction

Transcription:

André Schleife Department of Materials Science and Engineering

Length Scales (c) ICAMS: http://www.icams.de/cms/upload/01_home/01_research_at_icams/length_scales_1024x780.png

Goals for today: Background Molecular Dynamics Monte-Carlo Techniques Web site: http://schleife.matse.illinois.edu/teaching.html Literature recommendations: Understanding Molecular Simulation, Frenkel and Smit Introduction to Computational Materials Science: Fundamentals to Applications, Richard LeSar

CCMS 2014: Computational Methods for Atomistic Length and Time Scales Atomistic Simulations How to get information out of this? Clay platelet in water; (c) ANL: https://www.alcf.anl.gov/files/figure2_0.jpg Andre Schleife @ MatSE @ UIUC Email: schleife@illinois.edu Web: http://schleife.matse.illinois.edu

Key: Statistical Mechanics phase space S used to characterize a simulation: classical mechanics: positions {qi} and momenta {pi} Ising model: spins (up or down) simulation: changing the state: Sn+1=T(Sn) 1. deterministic (set of rules): Molecular Dynamics http://upload.wikimedia.org/wikipedia/commons/e/ea/ Simple_Harmonic_Motion_Orbit.gif 2. random (samples from a distribution): Monte Carlo S0 > S1 > S2 > S3 > > Sn > index n can be time, pseudo-time, iteration index,

Molecular Dynamics technique to simulate classical many-body dynamics very similar to carrying out a real experiment: 1. prepare sample: initial conditions 2. measure (extract quantities of interest) 3. calculate forces between atoms 4. move atoms according to forces 5. repeat for good statistics to reduce error common mistakes are similar too Example: Video

How to measure? Particle positions, velocities: known during simulation Forces: calculated during simulation any other observable: express as function of positions, momenta example: temperature (use equipartition theorem) other examples: diffusion coefficient, density, crystal phase,

Forces: How to determine them? start with ideal gas ideal gas law: pv = nrt

Forces: QM Electronic-Structure Problem H = XN e i=1 1 X 2 r2 i + i<j 1 r ij XN e i=1 XN I I=1 Z I r ii XN e I=1 m X e r 2 I 2M + I I<J Z I Z J r IJ +(external fields) electron KE+interaction electron+ion ion KE + interaction couples to individual particles Atomic units : = me = e = 1 Energy in Hartree = 27.2 ev = 316,000 K Lengths in Bohr radii = 0.529 Å = 5.29 10-9 cm Accuracy needed to address questions at room temp.: 100 K = 0.3 mha = 0.01 ev Many Decimal Places Solving this is difficult

Forces: How to Determine them in Practice Semi-empirical approach (very common): make good guess and use experimental data to adjust it fast; may not reveal correct details; Quantum chemistry approach: compute the surface at a few points and fit to a reasonable form hard/slow, accurate Ab-initio approach: do the QM calculations on the fly (along with trajectory) couple a quantum calculation of the electrons with a classical one of the nuclei large computer effort, but no analytic form needed

Quantum forces: Potential Energy Surface R Force on nuclei: F = rv J. Chem. Phys. 113, 3480-3481 (2000)

Empirical forces: Lennard Jones X V(r i ) = v r i i<j apple v(r) =4 r 12 r j r 6 proposed 1924 by John Lennard-Jones extensively used due to simplicity, even though more accurate ones exist

Overview: Semi-empirical potentials

Practical issues time step: short enough to capture physics time step: adjust to get energy conservation to 1% of kinetic energy boundary conditions: important because spatial scales are limited boundary conditions: different possibilities: free: e.g. droplet/cluster/protein in vacuum periodic: most popular choice because there are no surfaces

How to translate into code? Initialize(state_now) Initialize_verlet(state_now,state_old) for step in range(nsteps): Find_V_and_F(state_now) # NOTE: only needs.r information Verlet_propagate(state_now,state_old) AverageProperties(state_now) Thermostat(state_now) * compatible with the structure that is to be simulated * make sure: no overlap (e.g. grid) * initial condition chosen such that grid melts rapidly * set total momentum to zero * scale velocities to match temperature

Force calculation Initialize(state_now) Initialize_verlet(state_now,state_old) for step in range(nsteps): Find_V_and_F(state_now) # NOTE: only needs.r information Verlet_propagate(state_now,state_old) AverageProperties(state_now) Thermostat(state_now) most time-consuming part for pair-wise interactions: scales as N 2 keep boundary conditions in mind (more details later) compute distances compute forces (e.g. Lennard Jones)

Integration of equations of motion Initialize(state_now) Initialize_verlet(state_now,state_old) for step in range(nsteps): Find_V_and_F(state_now) # NOTE: only needs.r information Verlet_propagate(state_now,state_old) AverageProperties(state_now) Thermostat(state_now) many algorithms available Verlet algorithm is simple and has many good properties time reversal built in discard old positions and update calculate temperature, energy,

Example: Anti-cancer drugs drug: effect achieved by reaching specific target receptor chemically bind to the receptor problem: can bind to many different other receptors/proteins before reaching target this leads to efficacy reduction (structure determines binding) specific example: cisplatin (chemotherapy drug) kills cancerous cells by binding to their DNA this process: investigated using CPMD/MM problem: only small percentage reaches cancer DNA in the cell Read more here Cl Cl Pt NH3 NH3

Example: Anti-cancer drugs long-term (futuristic) goal: design cisplatin derivatives with increased affinity to DNA rather than other proteins necessary to understand how cisplatin enters cell experiment: known that it uses copper transport proteins CPMD/MM used to clarify structure of a realistic model: binding region taken as CPMD part rest: force field (e.g. AMBER) successful comparison to spectroscopic data (CD, EXAFS, NMR) goal: parameterize force field for longtime scale MD

Reminder: Molecular Dynamics vs. Monte Carlo http://upload.wikimedia.org/wikipedia/commons/e/ea/ Simple_Harmonic_Motion_Orbit.gif 1. deterministic (set of rules): Molecular Dynamics 2. random (samples from a distribution): Monte Carlo

Example: Buffon s needle (Monte Carlo determination of Pi) one quadrant of circle in a square: area of 1/4 circle area of square = r2 /4 r 2 = 4 like throwing darts at unit square target: use random numbers in (0,1) to pick a pair of coordinates (x,y) count # of points in circle section versus total points in shaded circle divided by points in square: ~ π/4 Applet

Markov chain is a random walk through phase space: s 1 s 2 s 3 s 4 transition probability is P(s n s n+1 ) a stochastic matrix Random Walk and Markov Chain P(s s 0 ) 0 X s 0 P(s s 0 ) = 1 Markov chain: distribution of s n+1 depends only on s n

Application: Metropolis algorithm simple and powerful: can be used to sample essentially any distribution function (in any number of dimensions) disadvantage: correct only asymptotically idea: construct a Markov chain that has a user-defined distribution as its equilibrium distribution central criterion: detailed balance P(s s )π(s) = P(s s)π(s ) wait a bit (until equilibrium is reached), then all new random numbers are according to equilibrium distribution: Applet

Application: Metropolis algorithm algorithm: 1. choose distribution to sample: 2. choose starting point s (s) 3. propose new location s according to some (prescribed) rule: probability distribution T(s s ), (any transition rule is allowed as long as you can go anywhere in phase space with a finite number of steps - ergodicity) 4. accept or reject new location according to probability A(s s ) A(s s 0 )=min note: P(s s ) = T(s s )*A(s s ) 1, (s0 )T (s 0 s) (s)t (s s 0 )

Metropolis algorithm of 1953 algorithm: 1. choose distribution to sample: 2. choose starting point s 3. T(s s ) = constant 4. accept or reject new location according to probability A(s s ) A(s s 0 )=min (s) = exp ( 1, (s0 )T (s 0 s) (s)t (s s 0 ) Z H(s)) A(s s 0 )=min 1, (s0 ) (s) =min(1, exp ( [E(s) E(s 0 )]))

Picture of Metropolis Rejection e βδe 1 Always Accept Reject Accept ΔE if ΔE < 0, it lowers the system energy accept otherwise 1. generate uniform random number u n on (0,1) 2. compare u n to e βδe : if lower accept, otherwise reject

Example: Ising Model consider a lattice (e.g. a square lattice) each lattice site has a single spin variable: s i = ±1 external field h and nearest neighbor coupling J H = X i,j J ij s i s j X h i s i i J is the nearest-neighbor (i,j) coupling if all Jij are: > 0: ferromagnetic < 0: antiferromagnetic = 0: non-interacting otherwise: non-ferromagnetic Applet

Comparison of MC and MD: Which is better? MD can compute dynamics: MD is sometimes very effective in highly constrained systems MC has a kinetics but dynamics is not necessarily physical MC dynamics is useful for studying long-term diffusive process MC is simpler: No forces, no time-step errors; a direct simulation of canonical ensemble in MC you can invent better transition rules to make it faster ergodicity is less of a problem MC is more general (can handle discrete degrees of freedom: e.g. spin models, quantum systems), grand canonical ensemble...

You should memorize (at least) this: http://upload.wikimedia.org/wikipedia/commons/e/ea/ Simple_Harmonic_Motion_Orbit.gif 1. deterministic (set of rules): Molecular Dynamics 2. random (samples from a distribution): Monte Carlo