Plan Last lab will be handed out on 11/22. No more labs/home works after Thanksgiving. 11/29 lab session will be changed to lecture. In-class final (1hour):

Slides:



Advertisements
Similar presentations
Time averages and ensemble averages
Advertisements

PRAGMA – 9 V.S.S.Sastry School of Physics University of Hyderabad 22 nd October, 2005.
Simulazione di Biomolecole: metodi e applicazioni giorgio colombo
Crystallography, Birkbeck MOLECULAR SIMULATIONS ALL YOU (N)EVER WANTED TO KNOW Julia M. Goodfellow Dynamic Processes: Lecture 1 Lecture Notes.
How to setup the initial conditions for a Molecular Dynamic Simulation
Molecular Dynamics at Constant Temperature and Pressure Section 6.7 in M.M.
Solvation Models. Many reactions take place in solution Short-range effects Typically concentrated in the first solvation sphere Examples: H-bonds,
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Chemistry 6440 / 7440 Models for Solvation
Incorporating Solvent Effects Into Molecular Dynamics: Potentials of Mean Force (PMF) and Stochastic Dynamics Eva ZurekSection 6.8 of M.M.
Lecture 3: Markov processes, master equation
Monte Carlo Simulation Methods - ideal gas. Calculating properties by integration.
Module on Computational Astrophysics Professor Jim Stone Department of Astrophysical Sciences and PACM.
Evaluation of Fast Electrostatics Algorithms Alice N. Ko and Jesús A. Izaguirre with Thierry Matthey Department of Computer Science and Engineering University.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Polymers PART.2 Soft Condensed Matter Physics Dept. Phys., Tunghai Univ. C. T. Shih.
4. Modeling 3D-periodic systems Cut-off radii, charges groups Ewald summation Growth units, bonds, attachment energy Predicting crystal structures.
Continuous Time Monte Carlo and Driven Vortices in a Periodic Potential V. Gotcheva, Yanting Wang, Albert Wang and S. Teitel University of Rochester Lattice.
Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.
The Monte Carlo Method: an Introduction Detlev Reiter Research Centre Jülich (FZJ) D Jülich
Simulations Patrice Koehl Department of Biological Sciences National University of Singapore
Advanced methods of molecular dynamics Monte Carlo methods
Classical and Quantum Monte Carlo Methods Or: Why we know as little as we do about interacting fermions Erez Berg Student/Postdoc Journal Club, Oct
Monte Carlo Simulation of Interacting Electron Models by a New Determinant Approach Mucheng Zhang (Under the direction of Robert W. Robinson and Heinz-Bernd.
1 IE 607 Heuristic Optimization Simulated Annealing.
Free energies and phase transitions. Condition for phase coexistence in a one-component system:
Monte Carlo Simulation of Liquid Water Daniel Shoemaker Reza Toghraee MSE 485/PHYS Spring 2006.
TUTORIAL no. 2 Monte Carlo simulations: Lennard Jones gas G. Lattanzi Università degli studi di Bari “Aldo Moro” Trieste, July 10 th, 2012 CECAM school.
F.F. Assaad. MPI-Stuttgart. Universität-Stuttgart Numerical approaches to the correlated electron problem: Quantum Monte Carlo.  The Monte.
Monte Carlo Simulation: Simulate an Isothermal-Isobaric Ensemble Timothy Tie Dong Bing School of Physics, Computer Lab 25 th Jan 2013.
Cross section for potential scattering
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Molecular Dynamics A brief overview. 2 Notes - Websites "A Molecular Dynamics Primer", F. Ercolessi
Chicago, July 22-23, 2002DARPA Simbiosys Review 1 Monte Carlo Particle Simulation of Ionic Channels Trudy van der Straaten Umberto Ravaioli Beckman Institute.
Minimization v.s. Dyanmics A dynamics calculation alters the atomic positions in a step-wise fashion, analogous to energy minimization. However, the steps.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points.
Basics of molecular dynamics. Equations of motion for MD simulations The classical MD simulations boil down to numerically integrating Newton’s equations.
The Geometry of Biomolecular Solvation 2. Electrostatics Patrice Koehl Computer Science and Genome Center
Ionic Conductors: Characterisation of Defect Structure Lecture 15 Total scattering analysis Dr. I. Abrahams Queen Mary University of London Lectures co-financed.
Simulated Annealing.
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 14 Some materials adapted from Prof. Keith E. Gubbins:
1 M.Sc. Project of Hanif Bayat Movahed The Phase Transitions of Semiflexible Hard Sphere Chain Liquids Supervisor: Prof. Don Sullivan.
Protein Folding and Modeling Carol K. Hall Chemical and Biomolecular Engineering North Carolina State University.
Object of Plasma Physics
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
Quantum Mechanical Cross Sections In a practical scattering experiment the observables we have on hand are momenta, spins, masses, etc.. We do not directly.
Quantum Mechanics/ Molecular Mechanics (QM/MM) Todd J. Martinez.
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
Monte Carlo method: Basic ideas. deterministic vs. stochastic In deterministic models, the output of the model is fully determined by the parameter values.
Interacting Molecules in a Dense Fluid
An Introduction to Monte Carlo Methods in Statistical Physics Kristen A. Fichthorn The Pennsylvania State University University Park, PA
Review Session BS123A/MB223 UC-Irvine Ray Luo, MBB, BS.
1/18/2016Atomic Scale Simulation1 Definition of Simulation What is a simulation? –It has an internal state “S” In classical mechanics, the state = positions.
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 20 Some materials adapted from Prof. Keith E. Gubbins:
Molecular dynamics (4) Treatment of long-range interactions Computing properties from simulation results.
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
MSc in High Performance Computing Computational Chemistry Module Parallel Molecular Dynamics (i) Bill Smith CCLRC Daresbury Laboratory
D. M. Ceperley, 2000 Simulations1 Neighbor Tables Long Range Potentials A & T pgs , Today we will learn how we can handle long range potentials.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points non-Boltzmann sampling.
Molecular dynamics (MD) simulations  A deterministic method based on the solution of Newton’s equation of motion F i = m i a i for the ith particle; the.
Image Charge Optimization for the Reaction Field by Matching to an Electrostatic Force Tensor Wei Song Donald Jacobs University of North Carolina at Charlotte.
Computational Physics (Lecture 11) PHY4061. Variation quantum Monte Carlo the approximate solution of the Hamiltonian Time Independent many-body Schrodinger’s.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Systematic errors of MC simulations Equilibrium error averages taken before the system has reached equilibrium  Monitor the variables you are interested.
The Monte Carlo Method/ Markov Chains/ Metropolitan Algorithm from sec in “Adaptive Cooperative Systems” -summarized by Jinsan Yang.
Implementation of the TIP5P Potential
Simulated Annealing Chapter
Molecular Modelling - Lecture 3
Large Time Scale Molecular Paths Using Least Action.
Common Types of Simulations
Presentation transcript:

Plan Last lab will be handed out on 11/22. No more labs/home works after Thanksgiving. 11/29 lab session will be changed to lecture. In-class final (1hour): from 9:30 to 10:30 am 11/30, Tue. Take-home final (48 hours): Due 12 pm 12/03, Fri. by .

Finals In-class final: based on home works/lab reports. (25%) Take-home final: questions based on a research paper and a computer lab session without instructor helps. (25%)

Tricks of the Trade How to make force calculation fast? It can use 99% of the computation time. Avoiding square root Table look-up and spline-fit potentials Multiple time-step methods Proper handling of long-range forces Cutting corner in solvating biomolecules

Multiple Time Steps Reduce the overhead in the force calculation. Is based on the observation that forces originating from distant atoms fluctuate more slowly than forces from atoms nearby. The slowly fluctuating forces may be evaluated less frequently than the fast ones and may be extrapolated at the time steps in between.

Multiple Time Steps

Complexity of Force Calculations Complexity is the scaling with the number of degrees particles. Number of terms in pair potential is N(N-1)/2  O(N 2 ) For short range potential you can use neighbor tables to reduce it to O(N)

Long-range Forces: Ewald Summation

Long-range Forces: Ewald Summation Lattice 1: Seen from a greater distance, a Gaussian charge cloud resembles a delta-like point charge, effectively compensating the original charge it accompanies. The effect of lattice 1 is therefore best computed in real- space, where the summation will converge quite rapidly. Lattice 2: The potential sum can be computed by fast Fourier transformation. By suitably adjusting parameters, optimal convergence of both lattices may be achieved.

Solvation of Biomolecules: Periodic Boundary

Solvation of Biomolecules: Spherical Boundary

Solvation of Biomolecules: Hydration Shell

Solvation of Biomolecules: Implicit Solvent

Solvation of Biomolecules: Implicit Solvents Distance dependent dielectric in Coulomb’s law Generalized Born approximation Poisson-Boltzmann equation

Solvation of Biomolecules: Implicit Solvents Need stochastic dynamics algorithm to incorporate other properties of solvent

Molecular Dynamics

Monte Carlo Simulations Monte Carlo simulation simply imposes relatively large random motions on the system and determines whether or not the altered structure is energetically feasible at the temperature simulated. The system jumps abruptly from conformation to conformation, rather than evolving smoothly through time. It can traverse barriers without feeling them; all that matters is the relative energy of the conformations before and after the jump

Monte Carlo Simulations Goal: Achieving an equilibrium distribution according to Boltzmann’s law R’ R E’E’ E

Monte Carlo: How It Works In any simulation, we can only change the system sequentially. We need to change system configuration R A to R B, to R C, and so on. Now the problem is how to realized the changes. In Monte Carlo methods, random change is attempted every time. How to generate a given equilibrium distribution, such as Boltzmann? This lies in the probability in accepting a random configuration. By definition, equilibrium means that probability of transition_(R A → R B ) = probability of transition_(R B → R A ). This gives the detailed balance condition for the acceptance scheme.

Conf. AConf. B Probability in accepting the move (A→B) Probability distribution of A Probability in accepting the move (B→A) Probability distribution of B Detailed Balance Condition

Metropolis Monte Carlo: Generating Boltzmann Distribution We can choose W(A  B)= 1, when U(A) > U(B), i.e. when it is a downhill energy change. How about W(B  A), when the energy goes up? We should accept the move in the following way: