Random Numbers Random Walk

Size: px
Start display at page:

Download "Random Numbers Random Walk"

Transcription

1 Random Numbers Random Walk Computational Physics Random Numbers Random Walk

2 Outline Random Systems Random Numbers Monte Carlo Integration Example Random Walk Exercise 7 Introduction

3 Random Systems Deterministic Systems Describe with equations Exact solution Random or Stochastic Systems Models with random processes Describe behavior with statistics

4 Consider 1cm 3 box ~10 19 particles motion and collisions Not interested in detailed trajectories Model behavior as result action random processes Statistical Description Results: e.g. probability finding particle at particular location Example Particles in a Box

5 Generation Random Numbers Most computing systems and computer languages have a means to generate random numbers between 0 and 1. Sequence generated from recursive relationship: x n+1 (a x n + b) mod m need a "seed" to start the process same sequence generated by each seed "pseudorandom" in real systems, sequences may repeat eventually. Caveat Emptor!

6 Python Generation Random Numbers with object object is used to generate streams random numbers. Important Methods: rand() generates a sequence uniformly distributed random numbers. randn() generates a sequence normally distributed random numbers. seed(arg) seeds the random number stream with a fixed value arg. rand randn

7 About... is a class in NumPy. We use an instance this class to manage random number generation. Random numbers are generated by methods in the class (e.g. the rand or randn methods). Each instance comes with its own specific random number stream. The random number stream is initialized ( seeded ) when you create a instance. You can reset the seed using the seed() method. We can use the objects to have different random streams or to reset a stream.

8 Examples with from from numpy.random numpy.random import import # an an instance instance the the class class # used used to to make make a a stream stream random random numbers numbers t t () () 'generate 'generate array array 5 5 random random numbers numbers - - uniform uniform dist.' dist.' t.rand(5) t.rand(5) # if if we we seed seed the the with with an an integer integer # we we always always get get the the same same stream stream t2 t2 (12345) (12345) # a a random random stream stream t3 t3 (12345) (12345) # another another one one - - same same seed seed # these these give give the the same same results!! results!! 'check 'check two two streams streams with with same same seed seed - - normal normal dist.' dist.' 'first: 'first: ',t2.randn(5) ',t2.randn(5) 'second: 'second: ',t3.randn(5) ',t3.randn(5) Output: generate array 5 random numbers - uniform dist. [ ] check two streams with same seed - normal dist. first: [ ] second: [ ]

9 Monte Carlo Integration Algorithm: Select random number pair (x,y) from uniformly distributed sample 1 f(x) Check whether (x,y) is above or below f(x) curve. y (x,y) Repeat Fraction points below curve is fraction area below curve x

10 import import numpy numpy as as np np from from numpy.random numpy.random import import def def f(x): f(x): # define define function function to to be be integrated integrated return return x**2 x**2 # create create an an instance instance t t () () # create create random random x x and and y y arrays arrays n n input('number input('number monte monte carlo carlo trials: trials: ') ') x x t.rand(n) t.rand(n) y y t.rand(n) t.rand(n) sum sum for for i i in in range(n): range(n): # compare compare y y to to f(x) f(x) if( if( y[i] y[i] < < f(x[i]) f(x[i]) ): ): sum sum sum sum '{0:d} '{0:d} Monte Monte Carlo Carlo trials'.format(n) trials'.format(n) 'Monte 'Monte Carlo Carlo Answer: Answer: {0:10.7f}'.format(sum/n) {0:10.7f}'.format(sum/n) 'Exact 'Exact Answer: Answer: {0:10.7f}'.format(1./3.) {0:10.7f}'.format(1./3.) Monte Carlo Integration Example: f(x) x 2 creates 1D array with n uniformly distributed random numbers initialize "sum" to 0 to accumulate number points below curve compare each point to function and add to sum points below curve number points below curve out total number is fraction area

11 Random Walk

12 1D Random Walk import import numpy numpy as as np np import import matplotlib.pyplot matplotlib.pyplot as as pl pl from from numpy.random numpy.random import import n n # number number steps steps r r () () p p np.zeros(n) np.zeros(n) p[0] p[0] for for i i in in range(n-1): range(n-1): if if (r.rand() (r.rand() > > 0.5): 0.5): p[i+1] p[i+1] p[i] p[i] else: else: p[i+1] p[i+1] p[i] p[i] initialize array for number steps start at position 0 loop through n-1 steps rand is uniformly distributed: 0->1 take forward step if > 0.5 take backward step if < 0.5

13 7 Random Walks 100 steps

14 Random Walk Results Random Walk Properties: 1. Zero Mean 2. Dispersion which increases with number steps

15 Random Walk with 10,000,000 Walkers demonstrate that: Mean Square Distance Number Random Steps

16

17

18

19 Mean Square Distance Number Random Steps

20 Understanding this result...

21 Exercise 2D Random Walk y Θ is random number: 0-2π S Θ x s is step size x step s cosθ y step s sinθ

22 Things we want to demonstrate For an ensemble particles: Mean Square Displacement is proportional to number steps. Constant proportionality depends on the step size. For track a single particle: Mean Square Displacement after N steps for a single particle track is the same as Mean Square displacement for an ensemble particles.

Computational Physics Adaptive, Multi-Dimensional, & Monte Carlo Integration Feb 21, 2019

Computational Physics Adaptive, Multi-Dimensional, & Monte Carlo Integration Feb 21, 2019 Computational Physics Adaptive, Multi-Dimensional, & Monte Carlo Integration Feb 21, 219 http://hadron.physics.fsu.edu/~eugenio/comphy/ eugenio@fsu.edu f(x) trapezoidal rule Series Integration review from

More information

lambda forms map(), reduce(), filter(), eval(), and apply() estimating π with list comprehensions

lambda forms map(), reduce(), filter(), eval(), and apply() estimating π with list comprehensions Outline 1 Guessing Secrets functions returning functions oracles and trapdoor functions 2 anonymous functions lambda forms map(), reduce(), filter(), eval(), and apply() estimating π with list comprehensions

More information

Section 2.3: Monte Carlo Simulation

Section 2.3: Monte Carlo Simulation Section 2.3: Monte Carlo Simulation Discrete-Event Simulation: A First Course c 2006 Pearson Ed., Inc. 0-13-142917-5 Discrete-Event Simulation: A First Course Section 2.3: Monte Carlo Simulation 1/1 Section

More information

Monte Carlo methods for risk analysis

Monte Carlo methods for risk analysis Monte Carlo methods for risk analysis Eric Marsden Context Some problems cannot be expressed in analytical form Some problems are difficult to define in a deterministic

More information

Manual_implementation_of_the_Mersenne_twister_PseudoRandom_N

Manual_implementation_of_the_Mersenne_twister_PseudoRandom_N Manual_implementation_of_the_Mersenne_twister_PseudoRandom_N May 4, 2017 1 Table of Contents 1 Manual implementation of the Mersenne twister PseudoRandom Number Generator (PRNG) 1.1 Common API for the

More information

Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Scientific Computing: An Introductory Survey Chapter 13 Random Numbers and Stochastic Simulation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright

More information

Chapter 6: Simulation Using Spread-Sheets (Excel)

Chapter 6: Simulation Using Spread-Sheets (Excel) Chapter 6: Simulation Using Spread-Sheets (Excel) Refer to Reading Assignments 1 Simulation Using Spread-Sheets (Excel) OBJECTIVES To be able to Generate random numbers within a spreadsheet environment.

More information

Monte Carlo Integration COS 323

Monte Carlo Integration COS 323 Monte Carlo Integration COS 323 Last time Interpolatory Quadrature Review formulation; error analysis Newton-Cotes Quadrature Midpoint, Trapezoid, Simpson s Rule Error analysis for trapezoid, midpoint

More information

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistical Methods -

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistical Methods - Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics - Statistical Methods - Karsten Heeger heeger@wisc.edu Course Schedule and Reading course website http://neutrino.physics.wisc.edu/teaching/phys736/

More information

Integration. Volume Estimation

Integration. Volume Estimation Monte Carlo Integration Lab Objective: Many important integrals cannot be evaluated symbolically because the integrand has no antiderivative. Traditional numerical integration techniques like Newton-Cotes

More information

CVEN Computer Applications in Engineering and Construction. Programming Assignment #2 Random Number Generation and Particle Diffusion

CVEN Computer Applications in Engineering and Construction. Programming Assignment #2 Random Number Generation and Particle Diffusion CVE 0-50 Computer Applications in Engineering and Construction Programming Assignment # Random umber Generation and Particle Diffusion Date distributed: 0/06/09 Date due: 0//09 by :59 pm (submit an electronic

More information

PHYSICS 115/242 Homework 5, Solutions X = and the mean and variance of X are N times the mean and variance of 12/N y, so

PHYSICS 115/242 Homework 5, Solutions X = and the mean and variance of X are N times the mean and variance of 12/N y, so PHYSICS 5/242 Homework 5, Solutions. Central limit theorem. (a) Let y i = x i /2. The distribution of y i is equal to for /2 y /2 and zero otherwise. Hence We consider µ y y i = /2 /2 σ 2 y y 2 i y i 2

More information

Random Numbers and Monte Carlo Methods

Random Numbers and Monte Carlo Methods Random Numbers and Monte Carlo Methods Methods which make use of random numbers are often called Monte Carlo Methods after the Monte Carlo Casino in Monaco which has long been famous for games of chance.

More information

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies slides3-1 Parallel Techniques Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations Load Balancing

More information

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistics and Error Analysis -

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistics and Error Analysis - Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics - Statistics and Error Analysis - Karsten Heeger heeger@wisc.edu Feldman&Cousin what are the issues they deal with? what processes

More information

UNIVERSITETET I OSLO

UNIVERSITETET I OSLO (Continued on page 2.) UNIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: INF1100 Introduction to programming with scientific applications Day of examination: Friday, December

More information

MAT 423: Homework 3 (09/12)

MAT 423: Homework 3 (09/12) MAT 423: Homework 3 (09/12) Ex 1. [3pts] We use Gauss elimination on the following tableau 1 2 1 0 0 1 1 0 3 3 α β 1 2 1 0 0 1 1 0 0 3 α + 3 β 1 2 1 0 0 1 1 0 0 0 α β. We deduce that if α 0 then there

More information

INFOMAGR Advanced Graphics. Jacco Bikker - February April Welcome!

INFOMAGR Advanced Graphics. Jacco Bikker - February April Welcome! INFOMAGR Advanced Graphics Jacco Bikker - February April 2016 Welcome! I x, x = g(x, x ) ε x, x + S ρ x, x, x I x, x dx Today s Agenda: Introduction Stratification Next Event Estimation Importance Sampling

More information

Lecture VII : Random systems and random walk

Lecture VII : Random systems and random walk Lecture VII : Random systems and random walk I. RANDOM PROCESSES In nature, no processes are truly deterministic. However, while dealing with many physical processes such as calculating trajectories of

More information

Random Number Generators

Random Number Generators 1/17 Random Number Generators Professor Karl Sigman Columbia University Department of IEOR New York City USA 2/17 Introduction Your computer generates" numbers U 1, U 2, U 3,... that are considered independent

More information

13 Distribution Ray Tracing

13 Distribution Ray Tracing 13 In (hereafter abbreviated as DRT ), our goal is to render a scene as accurately as possible. Whereas Basic Ray Tracing computed a very crude approximation to radiance at a point, in DRT we will attempt

More information

Monte Carlo Techniques. Professor Stephen Sekula Guest Lecture PHY 4321/7305 Sep. 3, 2014

Monte Carlo Techniques. Professor Stephen Sekula Guest Lecture PHY 4321/7305 Sep. 3, 2014 Monte Carlo Techniques Professor Stephen Sekula Guest Lecture PHY 431/7305 Sep. 3, 014 What are Monte Carlo Techniques? Computational algorithms that rely on repeated random sampling in order to obtain

More information

Sample some Pi Monte. Introduction. Creating the Simulation. Answers & Teacher Notes

Sample some Pi Monte. Introduction. Creating the Simulation. Answers & Teacher Notes Sample some Pi Monte Answers & Teacher Notes 7 8 9 10 11 12 TI-Nspire Investigation Student 45 min Introduction The Monte-Carlo technique uses probability to model or forecast scenarios. In this activity

More information

No more questions will be added

No more questions will be added CSC 2545, Spring 2017 Kernel Methods and Support Vector Machines Assignment 2 Due at the start of class, at 2:10pm, Thurs March 23. No late assignments will be accepted. The material you hand in should

More information

Monte Carlo Integration

Monte Carlo Integration Lab 18 Monte Carlo Integration Lab Objective: Implement Monte Carlo integration to estimate integrals. Use Monte Carlo Integration to calculate the integral of the joint normal distribution. Some multivariable

More information

CS 179: GPU Computing. Lecture 16: Simulations and Randomness

CS 179: GPU Computing. Lecture 16: Simulations and Randomness CS 179: GPU Computing Lecture 16: Simulations and Randomness Simulations South Bay Simulations, http://www.panix.com/~brosen/graphics/iacc.400.jpg Exa Corporation, http://www.exa.com/images/f16.png Flysurfer

More information

1) Find. a) b) c) d) e) 2) The function g is defined by the formula. Find the slope of the tangent line at x = 1. a) b) c) e) 3) Find.

1) Find. a) b) c) d) e) 2) The function g is defined by the formula. Find the slope of the tangent line at x = 1. a) b) c) e) 3) Find. 1 of 7 1) Find 2) The function g is defined by the formula Find the slope of the tangent line at x = 1. 3) Find 5 1 The limit does not exist. 4) The given function f has a removable discontinuity at x

More information

METROPOLIS MONTE CARLO SIMULATION

METROPOLIS MONTE CARLO SIMULATION POLYTECHNIC UNIVERSITY Department of Computer and Information Science METROPOLIS MONTE CARLO SIMULATION K. Ming Leung Abstract: The Metropolis method is another method of generating random deviates that

More information

Goals: Course Unit: Describing Moving Objects Different Ways of Representing Functions Vector-valued Functions, or Parametric Curves

Goals: Course Unit: Describing Moving Objects Different Ways of Representing Functions Vector-valued Functions, or Parametric Curves Block #1: Vector-Valued Functions Goals: Course Unit: Describing Moving Objects Different Ways of Representing Functions Vector-valued Functions, or Parametric Curves 1 The Calculus of Moving Objects Problem.

More information

LECTURE 8: Random numbers

LECTURE 8: Random numbers LECTURE 8: Random numbers November 2, 22 Introduction. Background What is a random number? Is 58935 "more random" than 2345?.8.6.4.2.2.4.6.8.5.5 Figure : Randomly distributed points. Randomness (uncorrelatedness)

More information

Computational Methods. Randomness and Monte Carlo Methods

Computational Methods. Randomness and Monte Carlo Methods Computational Methods Randomness and Monte Carlo Methods Manfred Huber 2010 1 Randomness and Monte Carlo Methods Introducing randomness in an algorithm can lead to improved efficiencies Random sampling

More information

Lecture 7 - Path Tracing

Lecture 7 - Path Tracing INFOMAGR Advanced Graphics Jacco Bikker - November 2016 - February 2017 Lecture 7 - I x, x = g(x, x ) ε x, x + S ρ x, x, x I x, x dx Welcome! Today s Agenda: Introduction Advanced Graphics 3 Introduction

More information

An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s.

An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Using Monte Carlo to Estimate π using Buffon s Needle Problem An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Here s the problem (in a simplified form). Suppose

More information

CGT 581 G Procedural Methods Fractals

CGT 581 G Procedural Methods Fractals CGT 581 G Procedural Methods Fractals Bedrich Benes, Ph.D. Purdue University Department of Computer Graphics Technology Procedural Techniques Model is generated by a piece of code. Model is not represented

More information

SENIOR HIGH MATH LEAGUE April 24, GROUP IV Emphasis on TRIGONOMETRY

SENIOR HIGH MATH LEAGUE April 24, GROUP IV Emphasis on TRIGONOMETRY SENIOR HIGH MATH LEAGUE TEST A Write all radical expressions in simplified form and unless otherwise stated give exact answers. 1. Give the exact value for each of the following where the angle is given

More information

Homework 11 - Debugging

Homework 11 - Debugging 1 of 7 5/28/2018, 1:21 PM Homework 11 - Debugging Instructions: Fix the errors in the following problems. Some of the problems are with the code syntax, causing an error message. Other errors are logical

More information

Kevin James. MTHSC 206 Section 15.6 Directional Derivatives and the Gra

Kevin James. MTHSC 206 Section 15.6 Directional Derivatives and the Gra MTHSC 206 Section 15.6 Directional Derivatives and the Gradient Vector Definition We define the directional derivative of the function f (x, y) at the point (x 0, y 0 ) in the direction of the unit vector

More information

Monte Carlo Integration COS 323

Monte Carlo Integration COS 323 Monte Carlo Integration COS 323 Integration in d Dimensions? One option: nested 1-D integration f(x,y) g(y) y f ( x, y) dx dy ( ) = g y dy x Evaluate the latter numerically, but each sample of g(y) is

More information

Computational modeling

Computational modeling Computational modeling Lecture 8 : Monte Carlo Instructor : Cedric Weber Course : 4CCP1000 Integrals, how to calculate areas? 2 Integrals, calculate areas There are different ways to calculate areas Integration

More information

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies. Load Balancing and Termination Detection

Parallel Techniques. Embarrassingly Parallel Computations. Partitioning and Divide-and-Conquer Strategies. Load Balancing and Termination Detection Parallel Techniques Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations Load Balancing and Termination

More information

Monte Carlo Methods. Named by Stanislaw Ulam and Nicholas Metropolis in 1940s for the famous gambling casino in Monaco.

Monte Carlo Methods. Named by Stanislaw Ulam and Nicholas Metropolis in 1940s for the famous gambling casino in Monaco. Monte Carlo Methods Named by Stanislaw Ulam and Nicholas Metropolis in 1940s for the famous gambling casino in Monaco. Used in numerous applications. Any method that uses random numbers to solve a problem

More information

Week 3. Sun Jun with slides from Hans Petter Langtangen

Week 3. Sun Jun with slides from Hans Petter Langtangen Week 3 Sun Jun with slides from Hans Petter Langtangen Nested lists: list of lists A list can contain any object, also another list Instead of storing a table as two separate lists (one for each column),

More information

Finding Pi: Applications of Loops, Random Numbers, Booleans CS 8: Introduction to Computer Science, Winter 2018 Lecture #6

Finding Pi: Applications of Loops, Random Numbers, Booleans CS 8: Introduction to Computer Science, Winter 2018 Lecture #6 Finding Pi: Applications of Loops, Random Numbers, Booleans CS 8: Introduction to Computer Science, Winter 2018 Lecture #6 Ziad Matni Dept. of Computer Science, UCSB Administrative New Homework (#3) is

More information

Simulation. Monte Carlo

Simulation. Monte Carlo Simulation Monte Carlo Monte Carlo simulation Outcome of a single stochastic simulation run is always random A single instance of a random variable Goal of a simulation experiment is to get knowledge about

More information

EN1610 Image Understanding Lab # 4: Corners, Interest Points, Hough Transform

EN1610 Image Understanding Lab # 4: Corners, Interest Points, Hough Transform EN1610 Image Understanding Lab # 4: Corners, Interest Points, Hough Transform The goal of this fourth lab is to ˆ Learn how to detect corners, and use them in a tracking application ˆ Learn how to describe

More information

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. Lecture 14

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. Lecture 14 Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics Lecture 14 Karsten Heeger heeger@wisc.edu Course Schedule and Reading course website http://neutrino.physics.wisc.edu/teaching/phys736/

More information

Photon Maps. The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces)

Photon Maps. The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces) Photon Mapping 1/36 Photon Maps The photon map stores the lighting information on points or photons in 3D space ( on /near 2D surfaces) As opposed to the radiosity method that stores information on surface

More information

2/1/10. Outline. The Radiance Equation. Light: Flux Equilibrium. Light: Radiant Power. Light: Equation. Radiance. Jan Kautz

2/1/10. Outline. The Radiance Equation. Light: Flux Equilibrium. Light: Radiant Power. Light: Equation. Radiance. Jan Kautz Outline Jan Kautz Basic terms in radiometry Radiance Reflectance The operator form of the radiance equation Meaning of the operator form Approximations to the radiance equation 2005 Mel Slater, 2006 Céline

More information

Monte Carlo Ray Tracing. Computer Graphics CMU /15-662

Monte Carlo Ray Tracing. Computer Graphics CMU /15-662 Monte Carlo Ray Tracing Computer Graphics CMU 15-462/15-662 TODAY: Monte Carlo Ray Tracing How do we render a photorealistic image? Put together many of the ideas we ve studied: - color - materials - radiometry

More information

Assignment 3. Due Mar 21th Wed, 5:00PM Instructions: * This is a computer-based assignment (Total points: 8). Please write your code in Python.

Assignment 3. Due Mar 21th Wed, 5:00PM Instructions: * This is a computer-based assignment (Total points: 8). Please write your code in Python. Assignment 3 Due Mar 21th Wed, 5:00PM Instructions: * This is a computer-based assignment (Total points: 8). Please write your code in Python. (1) Submission: Your codes/programs must be submitted electronically

More information

Chapter 4: (0,1) Random Number Generation

Chapter 4: (0,1) Random Number Generation Chapter 4: (0,1) Random Number Generation Refer to Text Book: Simulation Modeling and ARENA, Manuel Rossetti, Ch. 2 Operations Research: Applications and Algorithms By Wayne L. Winston,Ch. 21 Operations

More information

TABLES AND HASHING. Chapter 13

TABLES AND HASHING. Chapter 13 Data Structures Dr Ahmed Rafat Abas Computer Science Dept, Faculty of Computer and Information, Zagazig University arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ TABLES AND HASHING Chapter 13

More information

On the data structures and algorithms for contact detection in granular media (DEM) V. Ogarko, May 2010, P2C course

On the data structures and algorithms for contact detection in granular media (DEM) V. Ogarko, May 2010, P2C course On the data structures and algorithms for contact detection in granular media (DEM) V. Ogarko, May 2010, P2C course Discrete element method (DEM) Single particle Challenges: -performance O(N) (with low

More information

Monte Carlo Simula/on and Copula Func/on. by Gerardo Ferrara

Monte Carlo Simula/on and Copula Func/on. by Gerardo Ferrara Monte Carlo Simula/on and Copula Func/on by Gerardo Ferrara Introduc)on A Monte Carlo method is a computational algorithm that relies on repeated random sampling to compute its results. In a nutshell,

More information

Bi 1x Spring 2014: Plotting and linear regression

Bi 1x Spring 2014: Plotting and linear regression Bi 1x Spring 2014: Plotting and linear regression In this tutorial, we will learn some basics of how to plot experimental data. We will also learn how to perform linear regressions to get parameter estimates.

More information

Emil Sekerinski, McMaster University, Winter Term 16/17 COMP SCI 1MD3 Introduction to Programming

Emil Sekerinski, McMaster University, Winter Term 16/17 COMP SCI 1MD3 Introduction to Programming Emil Sekerinski, McMaster University, Winter Term 16/17 COMP SCI 1MD3 Introduction to Programming Games: HiLo, Entertainment: "random quote of the day", recommendations, Simulation: traffic, queues (supermarket,

More information

Review of Trigonometry

Review of Trigonometry Worksheet 8 Properties of Trigonometric Functions Section Review of Trigonometry This section reviews some of the material covered in Worksheets 8, and The reader should be familiar with the trig ratios,

More information

Lecture 2: Introduction to Numerical Simulation

Lecture 2: Introduction to Numerical Simulation Lecture 2: Introduction to Numerical Simulation Ahmed Kebaier kebaier@math.univ-paris13.fr HEC, Paris Outline of The Talk 1 Simulation of Random variables Outline 1 Simulation of Random variables Random

More information

UNIT 9A Randomness in Computation: Random Number Generators

UNIT 9A Randomness in Computation: Random Number Generators UNIT 9A Randomness in Computation: Random Number Generators 1 Last Unit Computer organization: what s under the hood 3 This Unit Random number generation Using pseudorandom numbers 4 Overview The concept

More information

Computational modeling

Computational modeling Computational modeling Lecture 5 : Monte Carlo Integration Physics: Integration The Monte Carlo method Programming: Subroutine Differences Subroutine/Function The Fortran random number subroutine Monte

More information

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds.

Proceedings of the 2014 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds. Proceedings of the 14 Winter Simulation Conference A. Tolk, S. Y. Diallo, I. O. Ryzhov, L. Yilmaz, S. Buckley, and J. A. Miller, eds. REMOVING THE INHERENT PARADOX OF THE BUFFON'S NEEDLE MONTE CARLO SIMULATION

More information

10.4 Linear interpolation method Newton s method

10.4 Linear interpolation method Newton s method 10.4 Linear interpolation method The next best thing one can do is the linear interpolation method, also known as the double false position method. This method works similarly to the bisection method by

More information

MATH 31A HOMEWORK 9 (DUE 12/6) PARTS (A) AND (B) SECTION 5.4. f(x) = x + 1 x 2 + 9, F (7) = 0

MATH 31A HOMEWORK 9 (DUE 12/6) PARTS (A) AND (B) SECTION 5.4. f(x) = x + 1 x 2 + 9, F (7) = 0 FROM ROGAWSKI S CALCULUS (2ND ED.) SECTION 5.4 18.) Express the antiderivative F (x) of f(x) satisfying the given initial condition as an integral. f(x) = x + 1 x 2 + 9, F (7) = 28.) Find G (1), where

More information

Lecture 7: Monte Carlo Rendering. MC Advantages

Lecture 7: Monte Carlo Rendering. MC Advantages Lecture 7: Monte Carlo Rendering CS 6620, Spring 2009 Kavita Bala Computer Science Cornell University MC Advantages Convergence rate of O( ) Simple Sampling Point evaluation Can use black boxes General

More information

Introduction to Programming II W4260. Lecture 2

Introduction to Programming II W4260. Lecture 2 Introduction to Programming II W4260 Lecture 2 Overview Storing Data Basic types Arrays Controlling the flow of execution Loops (for, while) Ifthenelse Operators Arithmetic, relational, logical Functions

More information

Name: Signature: Section and TA:

Name: Signature: Section and TA: Name: Signature: Section and TA: Math 7. Lecture 00 (V. Reiner) Midterm Exam I Thursday, February 8, 00 This is a 50 minute exam. No books, notes, calculators, cell phones or other electronic devices are

More information

You ve already read basics of simulation now I will be taking up method of simulation, that is Random Number Generation

You ve already read basics of simulation now I will be taking up method of simulation, that is Random Number Generation Unit 5 SIMULATION THEORY Lesson 39 Learning objective: To learn random number generation. Methods of simulation. Monte Carlo method of simulation You ve already read basics of simulation now I will be

More information

High Level Parallel Processing

High Level Parallel Processing High Level Parallel Processing 1 GPU computing with Maple enabling CUDA in Maple 15 stochastic processes and Markov chains 2 Multiprocessing in Python scripting in computational science the multiprocessing

More information

UNIVERSITETET I OSLO

UNIVERSITETET I OSLO UNIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: IN1900 Introduction to programming with scientific applications Day of examination: Tuesday, October 10, 2017 Examination

More information

Chapter Four: Loops II

Chapter Four: Loops II Chapter Four: Loops II Slides by Evan Gallagher & Nikolay Kirov Chapter Goals To understand nested loops To implement programs that read and process data sets To use a computer for simulations Processing

More information

GEOMETRIC MODELS WITH PYTHON

GEOMETRIC MODELS WITH PYTHON GEOMETRIC MODELS WITH PYTHON José M. Garrido Department of Computer Science January 2016 College of Computing and Software Engineering Kennesaw State University Geometric Models with Python 2 Object-Oriented

More information

Evolutionary Algorithms. Workgroup 1

Evolutionary Algorithms. Workgroup 1 The workgroup sessions Evolutionary Algorithms Workgroup Workgroup 1 General The workgroups are given by: Hao Wang - h.wang@liacs.leideuniv.nl - Room 152 Furong Ye - f.ye@liacs.leidenuniv.nl Follow the

More information

RECTILINEAR MOVEMENT

RECTILINEAR MOVEMENT RECTILINEAR MOVEMENT This teaching unit continues the study of movement which we began in these two previous units: Moving bodies and Trajectory and Displacement In this one we look separately at Uniform

More information

Embarrassingly Parallel Computations

Embarrassingly Parallel Computations Parallel Techniques Embarrassingly Parallel Computations Partitioning and Divide-and-Conquer Strategies Pipelined Computations Synchronous Computations Asynchronous Computations Strategies that achieve

More information

15-110: Principles of Computing, Spring Problem Set 3 (PS3) Due: Friday, February 9 by 2:30PM on Gradescope

15-110: Principles of Computing, Spring Problem Set 3 (PS3) Due: Friday, February 9 by 2:30PM on Gradescope 15-110: Principles of Computing, Spring 2018 Problem Set 3 (PS3) Due: Friday, February 9 by 2:30PM on Gradescope HANDIN INSTRUCTIONS Download a copy of this PDF file. You have two ways to fill in your

More information

September 12, 2008, klo 11:07. University of Helsinki / Department of Mathematics and Statistics SCIENTIFIC COMPUTING Exercise 01 / Solutions

September 12, 2008, klo 11:07. University of Helsinki / Department of Mathematics and Statistics SCIENTIFIC COMPUTING Exercise 01 / Solutions . - University of Helsinki / Department of Mathematics and Statistics SCIENTIFIC COMPUTING Exercise / Solutions. Apply the recursion formula for to compute Print the results in the following format: n

More information

Math 259 Winter Unit Test 1 Review Problems Set B

Math 259 Winter Unit Test 1 Review Problems Set B Math 259 Winter 2009 Unit Test 1 Review Problems Set B We have chosen these problems because we think that they are representative of many of the mathematical concepts that we have studied. There is no

More information

Santiago AP Calculus AB/BC Summer Assignment 2018 AB: complete problems 1 64, BC: complete problems 1 73

Santiago AP Calculus AB/BC Summer Assignment 2018 AB: complete problems 1 64, BC: complete problems 1 73 Santiago AP Calculus AB/BC Summer Assignment 2018 AB: complete problems 1 64, BC: complete problems 1 73 AP Calculus is a rigorous college level math course. It will be necessary to do some preparatory

More information

The Plan: Basic statistics: Random and pseudorandom numbers and their generation: Chapter 16.

The Plan: Basic statistics: Random and pseudorandom numbers and their generation: Chapter 16. Scientific Computing with Case Studies SIAM Press, 29 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 28 What is a Monte-Carlo method?

More information

Chapter Four: Loops. Slides by Evan Gallagher. C++ for Everyone by Cay Horstmann Copyright 2012 by John Wiley & Sons. All rights reserved

Chapter Four: Loops. Slides by Evan Gallagher. C++ for Everyone by Cay Horstmann Copyright 2012 by John Wiley & Sons. All rights reserved Chapter Four: Loops Slides by Evan Gallagher The Three Loops in C++ C++ has these three looping statements: while for do The while Loop while (condition) { statements } The condition is some kind of test

More information

MAS212 Assignment #1 (2018): Rational approximations

MAS212 Assignment #1 (2018): Rational approximations MAS212 Assignment #1 (2018): Rational approximations Dr Sam Dolan (sdolan@sheffieldacuk) In this assignment you will use Python to find rational approximations to real numbers such as π, 2 and the golden

More information

Front page. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences

Front page. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Front page UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in: IN1900/INF1100 Introduction to programming for scientific applications Day of examination: December 18th 2017 Examination

More information

GPU-based Quasi-Monte Carlo Algorithms for Matrix Computations

GPU-based Quasi-Monte Carlo Algorithms for Matrix Computations GPU-based Quasi-Monte Carlo Algorithms for Matrix Computations Aneta Karaivanova (with E. Atanassov, S. Ivanovska, M. Durchova) anet@parallel.bas.bg Institute of Information and Communication Technologies

More information

Random Number Generator of STMC and simple Monte Carlo Integration

Random Number Generator of STMC and simple Monte Carlo Integration Random Number Generator of STMC and simple Monte Carlo Integration Bernd Berg FSU MCMC Course, August 26, September 2, 2008 Random Numbers and Fortran Code According to Marsaglia and collaborators a list

More information

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit IV Monte Carlo

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit IV Monte Carlo Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 2008 1 What is a Monte-Carlo

More information

UNIVERSITETET I OSLO

UNIVERSITETET I OSLO UNIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: INF1100 Introduction to programming with scientific applications Day of examination: Wednesday, December 18, 2013 Examination

More information

Decision Support and Intelligent Systems. Monte Carlo Simulation

Decision Support and Intelligent Systems. Monte Carlo Simulation 887654 Decision Support and Intelligent Systems Monte Carlo Simulation Monte Carlo Monte Carlo is a technique for selecting numbers randomly from a probability distribution. A mathematical process used

More information

Introduction to Matplotlib: 3D Plotting and Animations

Introduction to Matplotlib: 3D Plotting and Animations 1 Introduction to Matplotlib: 3D Plotting and Animations Lab Objective: 3D plots and animations are useful in visualizing solutions to ODEs and PDEs found in many dynamics and control problems. In this

More information

Monte Carlo Integration and Random Numbers

Monte Carlo Integration and Random Numbers Monte Carlo Integration and Random Numbers Higher dimensional integration u Simpson rule with M evaluations in u one dimension the error is order M -4! u d dimensions the error is order M -4/d u In general

More information

MULTI-DIMENSIONAL MONTE CARLO INTEGRATION

MULTI-DIMENSIONAL MONTE CARLO INTEGRATION CS580: Computer Graphics KAIST School of Computing Chapter 3 MULTI-DIMENSIONAL MONTE CARLO INTEGRATION 2 1 Monte Carlo Integration This describes a simple technique for the numerical evaluation of integrals

More information

Computational Insight with Monte Carlo Simulations

Computational Insight with Monte Carlo Simulations City University of New York (CUNY) CUNY Academic Works Publications and Research New York City College of Technology Summer 7-13-2011 Computational Insight with Monte Carlo Simulations Boyan Kostadinov

More information

Random Numbers. Chapter 14

Random Numbers. Chapter 14 B B Chapter 14 Random Numbers Many events in our lives are random. When you enter a full parking lot, for example, you drive around until someone pulls out of a parking space that you can claim. The event

More information

Computational Physics

Computational Physics Computational Physics Python Programming Basics Prof. Paul Eugenio Department of Physics Florida State University Jan 17, 2019 http://hadron.physics.fsu.edu/~eugenio/comphy/ Announcements Exercise 0 due

More information

Limits and Continuity: section 12.2

Limits and Continuity: section 12.2 Limits and Continuity: section 1. Definition. Let f(x,y) be a function with domain D, and let (a,b) be a point in the plane. We write f (x,y) = L if for each ε > 0 there exists some δ > 0 such that if

More information

Raytracing & Epsilon. Today. Last Time? Forward Ray Tracing. Does Ray Tracing Simulate Physics? Local Illumination

Raytracing & Epsilon. Today. Last Time? Forward Ray Tracing. Does Ray Tracing Simulate Physics? Local Illumination Raytracing & Epsilon intersects light @ t = 25.2 intersects sphere1 @ t = -0.01 & Monte Carlo Ray Tracing intersects sphere1 @ t = 10.6 Solution: advance the ray start position epsilon distance along the

More information

Superdiffusion and Lévy Flights. A Particle Transport Monte Carlo Simulation Code

Superdiffusion and Lévy Flights. A Particle Transport Monte Carlo Simulation Code Superdiffusion and Lévy Flights A Particle Transport Monte Carlo Simulation Code Eduardo J. Nunes-Pereira Centro de Física Escola de Ciências Universidade do Minho Page 1 of 49 ANOMALOUS TRANSPORT Definitions

More information

Monte Carlo Simulations

Monte Carlo Simulations Monte Carlo Simulations DESCRIPTION AND APPLICATION Outline Introduction Description of Method Cost Estimating Example Other Considerations Introduction Most interesting things are probabilistic (opinion)

More information

Introduction to Concepts in Functional Programming. CS16: Introduction to Data Structures & Algorithms Spring 2017

Introduction to Concepts in Functional Programming. CS16: Introduction to Data Structures & Algorithms Spring 2017 Introduction to Concepts in Functional Programming CS16: Introduction to Data Structures & Algorithms Spring 2017 Outline Functions State Functions as building blocks Higher order functions Map Reduce

More information

RANDOM NUMBERS GENERATION

RANDOM NUMBERS GENERATION Chapter 4 RANDOM NUMBERS GENERATION M. Ragheb 9//2013 4.1. INTRODUCTION The use and generation of random numbers uniformly distributed over the unit interval: [0, 1] is a unique feature of the Monte Carlo

More information

5/2/2012 Miscellaneous Exercises Standard Map 1

5/2/2012 Miscellaneous Exercises Standard Map 1 5/2/2012 Miscellaneous Exercises Standard Map 1 The Standard Map The standard map is a tool learning about chaos. The "map" is a prescription moving from one point (x 1,y 1 in a plane to a second point

More information