DOCSLIB.ORG

Computational Physics 1 Home Page Title Page

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computational Physics 1 Home Page Title Page Computational Physics 1 Home Page Title Page Module PH3707 Contents JJ II 10 Credits J I Page1 of 85 Go Back by Roger Stewart Full Screen Version date: Monday, 7 July 2008 Close Quit opttoa Physics Computational opttoa Physics Computational opttoa Physics Computational opttoa Physics Computational Home Page opttoa Physics Computational Physics Computational Title Page Contents opttoa Physics Computational Physics Computational opttoa Physics– Computational JJ II Computational Physics– opttoa Physics– Computational Computational Physics– opttoa Physics– Computational Computational Physics– opttoa Physics– Computational Computational Physics– J I Computational Physics Physics– Computational Computational Physics– Computational Physics opttoa Physics– Computational Computational Physics– Page2 of 85 opttoa Physics– Computational Computational Physics– opttoa Physics– Computational Computational Physics– opttoa Physics– Computational Computational Physics– Go Back Computational Physics Computational Physics Full Screen Close Computational Physics Computational Physics Quit Computational Physics Computational Physics ComputationalComputational Physics Physics Copyright c 2003 Dennis Dunn. Home Page Title Page Contents JJ II J I Page3 of 85 Go Back Full Screen Close Quit Contents Home Page Title Page Contents Contents 4 JJ II INTRODUCTION TO THE MODULE5 J I 1 ANALYSIS OF WAVEFORMS 21 Page4 of 85 1.1 Objectives 22 Go Back 1.2 Fourier Analysis 23 1.2.1 Why bother? 24 Full Screen 1.2.2 Aperiodic functions 25 Close 1.3 The Numerical Methods 26 Quit 1.4 Diffusion Equation 29 1.4.1 Exercises 30 2 EIGENVALUES AND EIGENVECTORS OF MATRICES 33 2.1 Objectives 34 2.2 Eigenvalues and eigenvectors of real symmetric or hermitian matrices 35 2.3 A Matrix Eigenvalue Package 39 2.4 Schrodinger¨ Equation 42 2.4.1 Harmonic Oscillator 43 Home Page 2.4.2 Spherically Symmetric 3D Systems 44 Title Page 3 RANDOM PROCESSES 48 3.1 Objectives 49 Contents 3.2 Introduction 50 JJ II 3.3 Random Number Generators 51 J I 3.3.1 The basic algorithm 51 3.4 Intrinsic Subroutine 52 Page5 of 85 3.4.1 Different number ranges 53 Go Back 3.4.2 Testing your random generator 54 Full Screen 3.5 Monte Carlo Integration 56 Close 3.5.1 Hit and Miss Method 56 3.5.2 Sampling Method 56 Quit 3.6 Nuclear Decay Chains 58 3.6.1 Analytic approach 58 3.6.2 Computer simulation 60 3.7 Exercises 61 4 MONTE CARLO SIMULATION 65 4.1 OBJECTIVES 66 4.2 EQUILIBRIUM AND FLUCTUATIONS 67 4.3 MONTE CARLO SIMULATIONS – THE PRINCIPLES 70 Home Page 4.4 The Metropolis Monte Carlo Algorithm 71 4.5 The Ising Model 72 Title Page 4.6 The Ising Model and the Monte Carlo Algorithm 73 Contents 4.7 Rationale 74 JJ II 4.8 MONTE CARLO SIMULATIONS – IN ACTION 75 4.9 Order Parameter - Magnetisation 76 J I 4.10 Temperature Scan (Annealing and Quenching) 77 Page6 of 85 4.11 MATHEMATICAL APPENDIX 78 Go Back 4.11.1 Fluctuations 78 4.11.2 Metropolis Monte Carlo Algorithm and Principle of Detailed Balance 79 Full Screen 4.11.3 Susceptibility and Fluctuations 80 Close 4.12 EXERCISES 82 Quit Index 85 INTRODUCTION TO THE MODULE Home Page Title Page Contents Version date: Monday, 7 July 2008 JJ II J I Page7 of 85 Go Back Full Screen Close Quit Introduction In this module you will be taught techniques employed in computational science and, in particular, computational physics using the FORTRAN95 language. The unit consists of four ‘computer ex- periments’, each of which must be completed within a specified time. Each ‘computer experiment’ is described in a separate chapter of this manual and contains a series of exercises for you to com- Home Page plete. You should work alone and should keep a detailed record of the work in a logbook that must be submitted for assessment at the end of each experiment. Title Page For three of the four projects, there will be a supervised laboratory session each week and further Contents unsupervised sessions. There will be no supervised sessions for the fourth project: These will be exercises in independent JJ II learning. The Salford Fortran95 compiler will be used in this course, and this may be started by double- J I clicking on the Plato icon under the “Programming - Salford Fortran 95” program group. A “FTN95 Page8 of 85 Help” facility is supplied with this software and can be found within the same program group. This help facility includes details of the standard FORTRAN95 commands as well as the compiler- Go Back specific graphics features. All of the programs needed during this course may be downloaded from the Part 3 - PH3707 Computational Physics page on the department’s web-server: Full Screen (www.rdg.ac.uk/physicsnet). Close Quit Web Site Information In addition to all the chapters and programs required for this course, there are links to other useful sites including a description of programming style; a description of computational science in gen- eral and FORTRAN programming in particular; a tutorial for FORTRAN90; and a description of object-oriented programming. Home Page Title Page Contents JJ II J I Page9 of 85 Go Back Full Screen Close Quit References Programming in Fortran 90/95 By J S Morgan and J L Schonfelder Published by N.A. Software 2002. 316 pages. Home Page This can be ordered online from Title Page www.fortran.com $15 Contents Fortran 95 Handbook By Jeanne Adams, Walt Brainerd, Jeanne Martin, Brian Smith, and Jerry Wagener JJ II Published by MIT Press, 1997. 710 pages. J I $55.00 Page 10 of 85 Fortran 95/2003 Explained Go Back By Michael Metcalf and John Reid Full Screen Oxford University Press ISBN 0-19-8526293-8 $35.00 Close Fortran 90 for Scientists and Engineers Quit By Brian Hahn Published by Arnold £19.99 Fortran 90/95 for Scientists and Engineers By Stephen J. Chapman McGraw-Hill, 1998 ISBN 0-07-011938-4 $68.00 Numerical Recipes in Fortran90 By William Press, Saul Teukolsky, William Vetterling, and Brian Flannery Published by Cambridge University Press, 1996. 550 pages. $49.00 Home Page A more complete list of reference texts is held at Title Page http://www.fortran.com/fortran/Books/books.html Contents where books can be ordered directly. JJ II J I Page 11 of 85 Go Back Full Screen Close Quit Logbooks You must keep an accurate and complete record of the work in a logbook. The logbook is what is assessed. In the logbook you should answer all the questions asked in the text, include copies of the programs with explanations of how they work, and record details of the program inputs and of the output created by the programs. On completion of each chapter you should write a brief summary Home Page of what has been achieved in the project. Title Page I am often asked what should go in the logbook. It is difficult to give a precise answer to this since each computer experiment is different but as a guide: it should have Contents JJ II • a complete record of your computer experiment; • sufficient detail for someone else to understand what you were doing and why; and J I • for someone else to be able to repeat the computer experiment. Page 12 of 85 In particular should also include: Go Back Full Screen • program listings; • a description of any changes you made to the programs; Close If you have made a succession of changes, you should not reproduce the complete program each time but simply specify what changes you have made and why you have made them. Quit • the data entered and results obtained from your programs (or, if there are a very large number of results, a summary of these results); • a comment on each set of results; You will lose marks if you simply record masses of computer output without commenting on its significance. • descriptions of any new techniques you have learned. It worked! A statement in your logbook of the form ”I tried the program and it worked” will not be looked on favorably. • What inputs did you provide to the program? Home Page • What output did you obtain? • What evidence do you have that this output is correct? Title Page Contents Program Testing JJ II It is always safe to assume that a program you have written is wrong in some way. If you have made some error with the programming language then the compiler will tell you about this: it may not J I always tell you precisely what is wrong! However it may be the case that what you have told the computer to do is not really what you Page 13 of 85 intended. Computers have no intelligence: You need to be very precise in your instructions. Go Back Every program should be tested. You do this by giving the program input data such that you know, or can can easily calculate, the result. If possible your method of calculation should be via a Full Screen different method than that which the computer is using: the method you have told the computer to use may be incorrect. Close Only when the program has passed your tests should you start to use it to give you new results. Quit Module Assessment The module comprises 4 computational projects. A record of each project must be kept in a logbook and the logbook submitted for assessment by the specified deadline. The final assessment will based on the best 3 project marks. Each project will be marked out of 20. A detailed marking scheme is given, in this manual, for each Home Page project. Title Page Guidelines on the assessment are given below.
Load more

Recommended publications
  • An Uncertainty-Quantification Framework for Assessing Accuracy
    An Uncertainty-Quantification Framework for Assessing Accuracy, Sensitivity, and Robustness in Computational Fluid Dynamics S. Rezaeiravesha,b,∗, R. Vinuesaa,b,∗∗, P. Schlattera,b,∗∗ aSimEx/FLOW, Engineering Mechanics, KTH Royal Institute of Technology, SE-100 44 Stockholm, Sweden bSwedish e-Science Research Centre (SeRC), Stockholm, Sweden Abstract A framework is developed based on different uncertainty quantification (UQ) techniques in order to assess validation and verification (V&V) metrics in computational physics problems, in general, and computational fluid dynamics (CFD), in particular. The metrics include accuracy, sensitivity and robustness of the simula- tor's outputs with respect to uncertain inputs and computational parameters. These parameters are divided into two groups: based on the variation of the first group, a computer experiment is designed, the data of which may become uncertain due to the parameters of the second group. To construct a surrogate model based on uncertain data, Gaussian process regression (GPR) with observation-dependent (heteroscedastic) noise structure is used. To estimate the propagated uncertainties in the simulator's outputs from first and also the combination of first and second groups of parameters, standard and probabilistic polynomial chaos expansions (PCE) are employed, respectively. Global sensitivity analysis based on Sobol decomposition is performed in connection with the computer experiment to rank the parameters based on their influence on the simulator's output. To illustrate its capabilities, the framework is applied to the scale-resolving simu- lations of turbulent channel flow using the open-source CFD solver Nek5000. Due to the high-order nature of Nek5000 a thorough assessment of the results' accuracy and reliability is crucial, as the code is aimed at high-fidelity simulations.
    [Show full text]
  • Designing Combined Physical and Computer Experiments to Maximize Prediction Accuracy
    Computational Statistics and Data Analysis 113 (2017) 346–362 Contents lists available at ScienceDirect Computational Statistics and Data Analysis journal homepage: www.elsevier.com/locate/csda Designing combined physical and computer experiments to maximize prediction accuracy Erin R. Leatherman a,∗, Angela M. Dean b, Thomas J. Santner b a West Virginia University, United States b The Ohio State University, United States article info a b s t r a c t Article history: Combined designs for experiments involving a physical system and a simulator of the Received 1 March 2016 physical system are evaluated in terms of their accuracy of predicting the mean of Received in revised form 18 July 2016 the physical system. Comparisons are made among designs that are (1) locally optimal Accepted 19 July 2016 under the minimum integrated mean squared prediction error criterion for the combined Available online 25 July 2016 physical system and simulator experiments, (2) locally optimal for the physical or simulator experiments, with a fixed design for the component not being optimized, (3) maximin Keywords: augmented nested Latin hypercube, and (4) I-optimal for the physical system experiment Augmented nested LHD Calibration and maximin Latin hypercube for the simulator experiment. Computational methods are Gaussian process Kriging interpolator proposed for constructing the designs of interest. For a large test bed of examples, the IMSPE empirical mean squared prediction errors are compared at a grid of inputs for each test Latin hypercube design surface using a statistically calibrated Bayesian predictor based on the data from each Simulator design. The prediction errors are also studied for a test bed that varies only the calibration parameter of the test surface.
    [Show full text]
  • Computational Physics: Simulation of Classical and Quantum Systems
    Computational Physics Philipp O.J. Scherer Computational Physics Simulation of Classical and Quantum Systems 123 Prof. Dr. Philipp O.J. Scherer TU München Physikdepartment T38 85748 München Germany [email protected] Additional materials to this book can be downloaded from http://extras.springer.com ISBN 978-3-642-13989-5 e-ISBN 978-3-642-13990-1 DOI 10.1007/978-3-642-13990-1 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2010937781 c Springer-Verlag Berlin Heidelberg 2010 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: eStudio Calamar S.L., Heidelberg Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) for Christine Preface Computers have become an integral part of modern physics. They help to acquire, store, and process enormous amounts of experimental data.
    [Show full text]
  • Calibrating a Large Computer Experiment Simulating Radiative
    The Annals of Applied Statistics 2015, Vol. 9, No. 3, 1141–1168 DOI: 10.1214/15-AOAS850 c Institute of Mathematical Statistics, 2015 CALIBRATING A LARGE COMPUTER EXPERIMENT SIMULATING RADIATIVE SHOCK HYDRODYNAMICS By Robert B. Gramacy∗, Derek Bingham†, James Paul Holloway‡, Michael J. Grosskopf‡, Carolyn C. Kuranz‡, Erica Rutter‡, Matt Trantham‡ and R. Paul Drake‡ University of Chicago∗, Simon Fraser University† and University of Michigan‡ We consider adapting a canonical computer model calibration apparatus, involving coupled Gaussian process (GP) emulators, to a computer experiment simulating radiative shock hydrodynamics that is orders of magnitude larger than what can typically be ac- commodated. The conventional approach calls for thousands of large matrix inverses to evaluate the likelihood in an MCMC scheme. Our approach replaces that costly ideal with a thrifty take on essential ingredients, synergizing three modern ideas in emulation, calibration and optimization: local approximate GP regression, modularization, and mesh adaptive direct search. The new methodology is motivated both by necessity—considering our particular application—and by re- cent trends in the supercomputer simulation literature. A synthetic data application allows us to explore the merits of several variations in a controlled environment and, together with results on our mo- tivating real-data experiment, lead to noteworthy insights into the dynamics of radiative shocks as well as the limitations of the calibra- tion enterprise generally. 1. Introduction. Rapid increases in computational power have made com- puter models (or simulators) commonplace as a way to explore complex physical systems, particularly as an alternative to expensive field work or physical arXiv:1410.3293v4 [stat.AP] 5 Nov 2015 experimentation.
    [Show full text]
  • Sequential Design of Computer Experimentsfor The
    Sequential design of computer experiments for the estimation of a probability of failure Julien Bect⋆ · David Ginsbourger · Ling Li · Victor Picheny · Emmanuel Vazquez⋆ Received: date / Accepted: date Abstract This paper deals with the problem of estimating the volume of the excursion set of a function f : Rd R above a given threshold, under a probability measure on Rd that is assumed to be known. In → the industrial world, this corresponds to the problem of estimating a probability of failure of a system. When only an expensive-to-simulate model of the system is available, the budget for simulations is usually severely limited and therefore classical Monte Carlo methods ought to be avoided. One of the main contributions of this article is to derive SUR (stepwise uncertainty reduction) strategies from a Bayesian-theoretic formulation of the problem of estimating a probability of failure. These sequential strategies use a Gaussian process model of f and aim at performing evaluations of f as efficiently as possible to infer the value of the probability of failure. We compare these strategies to other strategies also based on a Gaussian process model for estimating a probability of failure. Keywords Computer experiments Sequential design Gaussian processes Probability of failure · · · · Stepwise uncertainty reduction 1 Introduction The design of a system or a technological product has to take into account the fact that some design parameters are subject to unknown variations that may affect the reliability of the system. In particular, it is important to estimate the probability of the system to work under abnormal or dangerous operating conditions due to random dispersions of its characteristic parameters.
    [Show full text]
  • Design of Computer Experiments: Space Filling and Beyond Luc Pronzato, Werner Müller
    Design of computer experiments: space filling and beyond Luc Pronzato, Werner Müller To cite this version: Luc Pronzato, Werner Müller. Design of computer experiments: space filling and beyond. Statistics and Computing, Springer Verlag (Germany), 2012, 22 (3), pp.681-701. 10.1007/s11222-011-9242-3. hal-00685876 HAL Id: hal-00685876 https://hal.archives-ouvertes.fr/hal-00685876 Submitted on 6 Apr 2012 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Statistics and Computing manuscript No. (will be inserted by the editor) Design of computer experiments: space ¯lling and beyond Luc Pronzato ¢ Werner G. MÄuller January 28, 2011 Abstract When setting up a computer experiment, it 1 Introduction has become a standard practice to select the inputs spread out uniformly across the available space. These Computer simulation experiments (see, e.g., Santner so-called space-¯lling designs are now ubiquitous in cor- et al (2003); Fang et al (2005); Kleijnen (2009)) have responding publications and conferences. The statisti- now become a popular substitute for real experiments cal folklore is that such designs have superior properties when the latter are infeasible or too costly. In these when it comes to prediction and estimation of emula- experiments, a deterministic computer code, the sim- tor functions.
    [Show full text]
  • Computer Experiments
    S. Ghosh and C. R. Rao, eds., Handbook of Statistics, Vol. 13 N © 1996 Elsevier Science B.V. All rights reserved. Computer Experiments J. R. Koehler and A. B. Owen 1. Introduction Deterministic computer simulations of physical phenomena are becoming widely used in science and engineering. Computers are used to describe the flow of air over an airplane wing, combustion of gases in a flame, behavior of a metal structure under stress, safety of a nuclear reactor, and so on. Some of the most widely used computer models, and the ones that lead us to work in this area, arise in the design of the semiconductors used in the computers themselves. A process simulator starts with a data structure representing an unprocessed piece of silicon and simulates the steps such as oxidation, etching and ion injection that produce a semiconductor device such as a transistor. A device simulator takes a description of such a device and simulates the flow of current through it under varying conditions to determine properties of the device such as its switching speed and the critical voltage at which it switches. A circuit simulator takes a list of devices and the way that they are arranged together and computes properties of the circuit as a whole. In each of these computer simulations, the user must specify the values of some governing variables. For example in process simulation the user might have to specify the duration and temperature of the oxidation step, and doses and energies for each of the ion implantation steps. These are continuously valued variables.
    [Show full text]
  • Sequential Experimental Designs for Stochastic Kriging
    Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds. SEQUENTIAL EXPERIMENTAL DESIGNS FOR STOCHASTIC KRIGING Xi Chen Qiang Zhou Industrial and Systems Engineering Systems Engineering and Engineering Management Virginia Tech City University of Hong Kong Blacksburg, VA 24601, USA Kowloon Tong, HK ABSTRACT Recently the stochastic kriging (SK) methodology proposed by Ankenman et al. (2010) has emerged as an effective metamodeling tool for approximating a mean response surface implied by a stochastic simulation. Although fruitful results have been achieved through bridging applications and theoretical investigations of SK, there lacks a unified account of efficient simulation experimental design strategies for applying SK metamodeling techniques. In this paper, we propose a sequential experimental design framework for applying SK to predicting performance measures of complex stochastic systems. This framework is flexible; i.e., it can incorporate a variety of design criteria. We propose several novel design criteria under the proposed framework, and compare the performance with that of classic non-sequential designs. The evaluation uses illustrative test functions and the well-known M/M/1 and the (s;S) inventory system simulation models. 1 INTRODUCTION To build a high-quality metamodel with a given computational budget to expend, a carefully designed simu- lation experiment is critical. The literature on experimental designs for deterministic computer experiments abounds and various design schemes have been proposed, for instance, Latin hypercube designs (LHDs) (McKay et al. 1979), orthogonal array based LHDs (Tang 1993), uniform designs (Fang et al. 2000), and maximum entropy designs (Shewry and Wynn 1987), to name a few.
    [Show full text]
  • Design and Analysis of Computer Experiments for Screening Input Variables Dissertation Presented in Partial Fulfillment of the R
    Design and Analysis of Computer Experiments for Screening Input Variables Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Hyejung Moon, M.S. Graduate Program in Statistics The Ohio State University 2010 Dissertation Committee: Thomas J. Santner, Co-Adviser Angela M. Dean, Co-Adviser William I. Notz ⃝c Copyright by Hyejung Moon 2010 ABSTRACT A computer model is a computer code that implements a mathematical model of a physical process. A computer code is often complicated and can involve a large number of inputs, so it may take hours or days to produce a single response. Screening to determine the most active inputs is critical for reducing the number of future code runs required to understand the detailed input-output relationship, since the computer model is typically complex and the exact functional form of the input- output relationship is unknown. This dissertation proposes a new screening method that identifies active inputs in a computer experiment setting. It describes a Bayesian computation of sensitivity indices as screening measures. It provides algorithms for generating desirable designs for successful screening. The proposed screening method is called GSinCE (Group Screening in Computer Experiments). The GSinCE procedure is based on a two-stage group screening ap- proach, in which groups of inputs are investigated in the first stage and then inputs within only those groups identified as active at the first stage are investigated indi- vidually at the second stage. Two-stage designs with desirable properties are con- structed to implement the procedure.
    [Show full text]
  • Uncertainty Quantification of Stochastic Simulation for Black-Box Computer Experiments
    Methodol Comput Appl Probab https://doi.org/10.1007/s11009-017-9599-7 Uncertainty Quantification of Stochastic Simulation for Black-box Computer Experiments Youngjun Choe1 · Henry Lam2 · Eunshin Byon3 Received: 23 September 2016 / Revised: 15 October 2017 / Accepted: 18 October 2017 © Springer Science+Business Media, LLC 2017 Abstract Stochastic simulations applied to black-box computer experiments are becoming more widely used to evaluate the reliability of systems. Yet, the reliability evaluation or computer experiments involving many replications of simulations can take significant com- putational resources as simulators become more realistic. To speed up, importance sampling coupled with near-optimal sampling allocation for these experiments is recently proposed to efficiently estimate the probability associated with the stochastic system output. In this study, we establish the central limit theorem for the probability estimator from such pro- cedure and construct an asymptotically valid confidence interval to quantify estimation uncertainty. We apply the proposed approach to a numerical example and present a case study for evaluating the structural reliability of a wind turbine. Keywords Central limit theorem · Confidence interval · Importance sampling · Monte Carlo simulation · Variance reduction Mathematics Subject Classification (2010) 65C05 · 68U20 · 62F12 Electronic supplementary material The online version of this article (https://doi.org/10.1007/s11009-017-9599-7) contains supplementary material, which is available to authorized
    [Show full text]
  • Replication Or Exploration? Sequential Design for Stochastic Simulation Experiments
    Replication or exploration? Sequential design for stochastic simulation experiments Micka¨elBinois∗ Jiangeng Huangy Robert B. Gramacyy Mike Ludkovskiz January 28, 2019 Abstract We investigate the merits of replication, and provide methods for optimal design (including replicates), with the goal of obtaining globally accurate emulation of noisy computer simulation experiments. We first show that replication can be beneficial from both design and computational perspectives, in the context of Gaussian process surrogate modeling. We then develop a lookahead based sequential design scheme that can determine if a new run should be at an existing input location (i.e., replicate) or at a new one (explore). When paired with a newly developed heteroskedastic Gaus- sian process model, our dynamic design scheme facilitates learning of signal and noise relationships which can vary throughout the input space. We show that it does so efficiently, on both computational and statistical grounds. In addition to illustrative synthetic examples, we demonstrate performance on two challenging real-data simula- tion experiments, from inventory management and epidemiology. Keywords: computer experiment, Gaussian process, surrogate model, input-dependent noise, replicated observations, lookahead 1 Introduction Historically, design and analysis of computer experiments focused on deterministic solvers from the physical sciences via Gaussian process (GP) interpolation (Sacks et al., 1989). But arXiv:1710.03206v2 [stat.ME] 25 Jan 2019 nowadays computer modeling is common
    [Show full text]
  • International Conference on Design of Experiments ICODOE 2019
    International Conference on Design of Experiments ICODOE 2019 May 18—21 Department of Mathematical Sciences University of Memphis Memphis, TN 38152, USA msci.memphis.edu/msci/icodoe2019/ Supported by the National Science Foundation, National Security Agency, Fedex Institute of Technology and SAS Conference Organizers Manohar Aggarwal University of Memphis E. Olusegun George University of Memphis Dale Bowman University of Memphis ICODOE 2019 Committees International Advisory Committee Manohar Aggarwal University of Memphis Ching Shui Cheng University of California, Berkeley Angela Dean Ohio State University Nancy Flournoy University of Missouri E. Olusegun George University of Memphis Subir Ghosh University of California, Riverside Sue Lewis University of Southampton, UK John Morgan Virginia Tech Rahul Mukerjee Indian Institute of Management, Calcutta, India David Steinberg Tel Aviv University, Israel Deborah Street University of Technology, Sydney, Australia John Stufken Arizona State University Will Welch University of British Columbia, Canada Henry Wynn London School of Economics, UK Local Organizing Committee Manohar Aggarwal University of Memphis Paul Balister University of Memphis Dale Bowman University of Memphis Su Chen University of Memphis Lih Y. Deng University of Memphis David P. Dwiggins University of Memphis E. Olusegun George University of Memphis Ilham Tayahi University of Memphis Scientific Committee Angela Dean Ohio State University John Stufken Arizona State University Dave Woods University of Southampton, UK Program
    [Show full text]