Application of the MCMC Method for the Calibration of DSMC Parameters James S. Strand and David B. Goldstein The University of Texas at Austin Sponsored.

Slides:



Advertisements
Similar presentations
PRAGMA – 9 V.S.S.Sastry School of Physics University of Hyderabad 22 nd October, 2005.
Advertisements

Running a model's adjoint to obtain derivatives, while more efficient and accurate than other methods, such as the finite difference method, is a computationally.
Molecular Dynamics at Constant Temperature and Pressure Section 6.7 in M.M.
Application of Bayesian Statistical Methods for the Analysis of DSMC Simulations of Hypersonic Shocks James S. Strand and David B. Goldstein The University.
Bayesian Estimation in MARK
Inspiral Parameter Estimation via Markov Chain Monte Carlo (MCMC) Methods Nelson Christensen Carleton College LIGO-G Z.
Pulsar Detection and Parameter Estimation with MCMC - Six Parameters Nelson Christensen Physics and Astronomy Carleton College GWDAW December 2003.
By Addison Euhus, Guidance by Edward Phillips An Introduction To Uncertainty Quantification.
Software Demonstration and Course Description P.N. Lai.
Ch 11. Sampling Models Pattern Recognition and Machine Learning, C. M. Bishop, Summarized by I.-H. Lee Biointelligence Laboratory, Seoul National.
Markov-Chain Monte Carlo
U N C L A S S I F I E D Operated by the Los Alamos National Security, LLC for the DOE/NNSA IMPACT Project Drag coefficients of Low Earth Orbit satellites.
Incorporating Solvent Effects Into Molecular Dynamics: Potentials of Mean Force (PMF) and Stochastic Dynamics Eva ZurekSection 6.8 of M.M.
Bayesian Reasoning: Markov Chain Monte Carlo
Bayesian statistics – MCMC techniques
Suggested readings Historical notes Markov chains MCMC details
1 CE 530 Molecular Simulation Lecture 8 Markov Processes David A. Kofke Department of Chemical Engineering SUNY Buffalo
2011 DSMC Workshop Workshop 2011 DSMC Workshop Workshop Improvements to the Discrete Velocity Method for the Boltzmann Equation Peter Clarke Improvements.
Computing the Posterior Probability The posterior probability distribution contains the complete information concerning the parameters, but need often.
Density gradient at the ends of plasma cell The goal: assess different techniques for optimization density gradient at the ends of plasma cell.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
The University of Texas at Austin, CS 395T, Spring 2008, Prof. William H. Press IMPRS Summer School 2009, Prof. William H. Press 1 4th IMPRS Astronomy.
Today Introduction to MCMC Particle filters and MCMC
The Calibration Process
Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.
Robin McDougall, Ed Waller and Scott Nokleby Faculties of Engineering & Applied Science and Energy Systems & Nuclear Science 1.
1 CE 530 Molecular Simulation Lecture 7 David A. Kofke Department of Chemical Engineering SUNY Buffalo
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
Overview G. Jogesh Babu. Probability theory Probability is all about flip of a coin Conditional probability & Bayes theorem (Bayesian analysis) Expectation,
‘Tis not folly to dream: Using Molecular Dynamics to Solve Problems in Chemistry Christopher Adam Hixson and Ralph A. Wheeler Dept. of Chemistry and Biochemistry,
AN ITERATIVE METHOD FOR MODEL PARAMETER IDENTIFICATION 4. DIFFERENTIAL EQUATION MODELS E.Dimitrova, Chr. Boyadjiev E.Dimitrova, Chr. Boyadjiev BULGARIAN.
Material Model Parameter Identification via Markov Chain Monte Carlo Christian Knipprath 1 Alexandros A. Skordos – ACCIS,
1 Physical Chemistry III Molecular Simulations Piti Treesukol Chemistry Department Faculty of Liberal Arts and Science Kasetsart University :
Sensitivity Analysis for DSMC Simulations of High- Temperature Air Chemistry James S. Strand and David B. Goldstein The University of Texas at Austin Sponsored.
Free energies and phase transitions. Condition for phase coexistence in a one-component system:
Introduction to MCMC and BUGS. Computational problems More parameters -> even more parameter combinations Exact computation and grid approximation become.
Introduction to Monte Carlo Simulation. What is a Monte Carlo simulation? In a Monte Carlo simulation we attempt to follow the `time dependence’ of a.
Monte Carlo Simulation: Simulate an Isothermal-Isobaric Ensemble Timothy Tie Dong Bing School of Physics, Computer Lab 25 th Jan 2013.
Exam I review Understanding the meaning of the terminology we use. Quick calculations that indicate understanding of the basis of methods. Many of the.
Statistical Methods for the Analysis of DSMC Simulations of Hypersonic Shocks James S. Strand The University of Texas at Austin Funding and Computational.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points.
Stochastic Monte Carlo methods for non-linear statistical inverse problems Benjamin R. Herman Department of Electrical Engineering City College of New.
Comparing droplet activation parameterisations against adiabatic parcel models using a novel inverse modelling framework Warsaw: April 20 th 2015: Eulerian.
Bayesian Inversion of Stokes Profiles A.Asensio Ramos (IAC) M. J. Martínez González (LERMA) J. A. Rubiño Martín (IAC) Beaulieu Workshop ( Beaulieu sur.
Monte Carlo Methods1 T Special Course In Information Science II Tomas Ukkonen
Fast Simulators for Assessment and Propagation of Model Uncertainty* Jim Berger, M.J. Bayarri, German Molina June 20, 2001 SAMO 2001, Madrid *Project of.
Modeling the Sublimation-driven Atmosphere of Io with DSMC Andrew Walker David Goldstein, Chris Moore, Philip Varghese, and Laurence Trafton University.
An Efficient Sequential Design for Sensitivity Experiments Yubin Tian School of Science, Beijing Institute of Technology.
Understanding Molecular Simulations Introduction
Simulation techniques Summary of the methods we used so far Other methods –Rejection sampling –Importance sampling Very good slides from Dr. Joo-Ho Choi.
Bayes’ Nets: Sampling [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available.
Bayesian Reasoning: Tempering & Sampling A/Prof Geraint F. Lewis Rm 560:
Tracking Multiple Cells By Correspondence Resolution In A Sequential Bayesian Framework Nilanjan Ray Gang Dong Scott T. Acton C.L. Brown Department of.
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
Reducing MCMC Computational Cost With a Two Layered Bayesian Approach
Introduction to Sampling Methods Qi Zhao Oct.27,2004.
Basic Monte Carlo (chapter 3) Algorithm Detailed Balance Other points non-Boltzmann sampling.
Kevin Stevenson AST 4762/5765. What is MCMC?  Random sampling algorithm  Estimates model parameters and their uncertainty  Only samples regions of.
Technological/Societal Impact (1)SEM images of Silicon films deposited in pulsed laser ablation in vacuum Courtesy of A. Perrone Fluence of 3.0 J/cm^2.
Generalization Performance of Exchange Monte Carlo Method for Normal Mixture Models Kenji Nagata, Sumio Watanabe Tokyo Institute of Technology.
Bayesian Neural Networks
Reducing Photometric Redshift Uncertainties Through Galaxy Clustering
MCMC Output & Metropolis-Hastings Algorithm Part I
Optimization of Monte Carlo Integration
Advanced Statistical Computing Fall 2016
The Calibration Process
Markov Chain Monte Carlo
Computational issues Issues Solutions Large time scale
Yalchin Efendiev Texas A&M University
Presentation transcript:

Application of the MCMC Method for the Calibration of DSMC Parameters James S. Strand and David B. Goldstein The University of Texas at Austin Sponsored by the Department of Energy through the PSAAP Program Predictive Engineering and Computational Sciences

Introduction – DSMC Parameters Direct Simulation Monte Carlo (DSMC) is a valuable method for the simulation of rarefied gas flows. The DSMC model includes many parameters related to gas dynamics at the molecular level, such as:  Elastic collision cross-sections  Vibrational and rotational excitation cross-sections  Reaction cross-sections  Sticking coefficients and catalytic efficiencies for gas-surface interactions.  …etc.

Introduction – DSMC Parameters In many cases the precise values of some of these parameters are not known. Parameter values often cannot be directly measured, instead they must be inferred from experimental results. By necessity, parameters must often be used in regimes far from where their values were determined. More precise values for important parameters would lead to better simulation of the physics, and thus to better predictive capability for the DSMC method.

MCMC Method - Overview Markov Chain Monte Carlo (MCMC) is a method which solves the statistical inverse problem in order to calibrate parameters with respect to a set or sets of experimental data.

MCMC Method Establish boundaries for parameter space Select initial position Run simulation at current position Calculate probability for current position Select new candidate position Run simulation for candidate position parameters, and calculate probability Accept or reject candidate position based on a random number draw Candidate position is accepted, and becomes the current chain position Candidate position becomes current position Current position remains unchanged. Candidate automatically accepted Candidate Accepted Candidate Rejected Prob candidate < Prob current Prob candidate > Prob current

MCMC Method - Steps Simple example illustrates the MCMC method.

MCMC Method - Steps

1D Shock Simulation Base flow is a 1D, unsteady shock, moving through the computational domain. A set of sample cells moves with the shock. These sample cells continuously collect data on the shock profile. This method allows for a smooth solution in an unsteady flow without the computational cost of ensemble averaging or using excessively large numbers of particles. No prior knowledge of the post-shock conditions is required.

1D Shock Simulation

1D Shock Simulation – Measure of Error Alsmeyer’s Data Sample DSMC Results

Parallelization DSMC:  DSMC code is MPI parallel, with dynamic load rebalancing periodically during each run.  Allows very fast simulation of small problems.  Super-linear speed-up due to better cache use.  Simulations which took 20 minutes on 1 processor take less than 20 seconds on 64 processors.  Faster DSMC simulations allow for much longer chains to be run in a practical amount of time. MCMC:  Any given chain must be run in sequence.  MCMC method can be parallelized by running multiple chains simultaneously.

MCMC Parallelism All Processors

MCMC Parallelism All Processors Group 1 Group 2 Group 5 Group 4 Group 6 Group 3

MCMC Parallelism All Processors Group 1 MCMC Chain 3 Group 2 Group 5 Group 4 Group 6 Group 3 MCMC Chain 1 MCMC Chain 2

MCMC Parallelism All Processors Group 1 MCMC Chain 3 Group 2 Group 5 Group 4 Group 6 Group 3 MCMC Chain 1 MCMC Chain 2 MCMC Chain 4 MCMC Chain 6 MCMC Chain 5

MCMC Parallelism All Processors Group 1 MCMC Chain 3 Group 2 Group 5 Group 4 Group 6 Group 3 MCMC Chain 1 MCMC Chain 2 MCMC Chain 4 MCMC Chain 6 MCMC Chain 5 MCMC Chain 7 MCMC Chain 8

MCMC Parallelism All Processors Group 1 MCMC Chain 3 Group 2 Group 5 Group 4 Group 6 Group 3 MCMC Chain 1 MCMC Chain 2 MCMC Chain 4 MCMC Chain 6 MCMC Chain 5 MCMC Chain 7 Group 1 Group 2 MCMC Chain 8

MCMC Parallelism All Processors Group 1 MCMC Chain 3 Group 2 Group 5 Group 4 Group 6 Group 3 MCMC Chain 1 MCMC Chain 2 MCMC Chain 4 MCMC Chain 6 MCMC Chain 5 MCMC Chain 7 MCMC Chain 8 MCMC Chain 6

MCMC Parallelism All Processors Group 1 MCMC Chain 3 Group 2 Group 5 Group 4 Group 6 Group 3 MCMC Chain 1 MCMC Chain 2 MCMC Chain 4 MCMC Chain 6 MCMC Chain 5 MCMC Chain 7 Group 4 MCMC Chain 8 MCMC Chain 6 Group 3 Group 1

MCMC Parallelism All Processors Group 1 MCMC Chain 3 Group 2 Group 5 Group 4 Group 6 Group 3 MCMC Chain 1 MCMC Chain 2 MCMC Chain 4 MCMC Chain 6 MCMC Chain 5 MCMC Chain 7 MCMC Chain 8 MCMC Chain 6

First Calibration - Hard-Sphere Model Parameter to be calibrated is d HS, the hard-sphere diameter for argon. Normalized density profile for a Mach 3.38 shock in argon from Alsmeyer (1976) used for calibration. Uniform sampling method used to explore the parameter space. Metropolis-Hastings MCMC algorithm used to solve inverse problem.

Second Calibration - VHS Model Parameters to be calibrated are d ref and ω, the reference diameter and the temperature-viscosity exponent for argon. Normalized density profile for a Mach 3.38 shock in argon from Alsmeyer (1976) once again used for calibration.

Second Calibration - VHS Model For two parameter case, uniform sampling could still be used to explore parameter space. Simulation was run for each set of parameters on a 100×100 grid in parameter space, and a probability was calculated for each based on the error and the likelihood equation. A total of 10,000 shocks were simulated for the uniform sample.

Second Calibration - VHS Model Band structure seen here indicates that this single dataset does not provide enough information to allow unique values to be determined for both d ref and ω.

Second Calibration - VHS Model MCMC calibration was also performed for this case. 64 chains were run, each with 4000 positions, for a total of 256,000 shocks. Full MCMC run took 20 hours on 4096 processors. MCMC is overkill for this two-parameter system.

Second Calibration - VHS Model Individual MCMC chains also show the band structure.

Second Calibration - VHS Model The same band structure is seen in a scatterplot of MCMC chain positions and in a contour plot showing the number of MCMC chain positions in any given region.

Second Calibration - VHS Model We can also see the band structure by directly viewing the probabilities at each MCMC chain position.

Alsmeyer’s Data – Multiple Mach Numbers

MD Data - Valentini and Schwartzentruber (2009)

Conclusions/Future Work MCMC successfully reproduces the results from a brute-force uniform sampling technique for the calibration of the parameters for the hard-sphere and VHS methods. The normalized density profile from a single shock is insufficient to uniquely calibrate both parameters of the VHS method. Temperature and velocity distribution function data provide better calibration for the VHS parameters. The addition of internal energy modes and chemistry will increase both the number of parameters and the volume of available calibration data.