4. Numerical Integration. Standard Quadrature We can find numerical value of a definite integral by the definition: where points x i are uniformly spaced.

Slides:



Advertisements
Similar presentations
Sampling: Final and Initial Sample Size Determination
Advertisements

1 Chapter 5 Numerical Integration. 2 A Review of the Definite Integral.
Use of moment generating functions. Definition Let X denote a random variable with probability density function f(x) if continuous (probability mass function.
Graduate School of Information Sciences, Tohoku University
Monte Carlo Integration Robert Lin April 20, 2004.
Sampling Distributions
Chapter 6 Introduction to Sampling Distributions
Machine Learning CUNY Graduate Center Lecture 7b: Sampling.
Quality Control Procedures put into place to monitor the performance of a laboratory test with regard to accuracy and precision.
Programme in Statistics (Courses and Contents). Elementary Probability and Statistics (I) 3(2+1)Stat. 101 College of Science, Computer Science, Education.
Fall 2006 – Fundamentals of Business Statistics 1 Chapter 6 Introduction to Sampling Distributions.
Business Statistics: A Decision-Making Approach, 6e © 2005 Prentice-Hall, Inc. Chap 6-1 Introduction to Statistics Chapter 7 Sampling Distributions.
Numerical Integration
PROBABILITY AND SAMPLES: THE DISTRIBUTION OF SAMPLE MEANS.
Lecture II-2: Probability Review
Normal and Sampling Distributions A normal distribution is uniquely determined by its mean, , and variance,  2 The random variable Z = (X-  /  is.
Basics of Sampling Theory P = { x 1, x 2, ……, x N } where P = population x 1, x 2, ……, x N are real numbers Assuming x is a random variable; Mean/Average.
Standard error of estimate & Confidence interval.
Monte Carlo Integration Digital Image Synthesis Yung-Yu Chuang with slides by Pat Hanrahan and Torsten Moller.
1 CE 530 Molecular Simulation Lecture 7 David A. Kofke Department of Chemical Engineering SUNY Buffalo
1 Chapter 5 Numerical Integration. 2 A Review of the Definite Integral.
Analysis of Monte Carlo Integration Fall 2012 By Yaohang Li, Ph.D.
Simulation of Random Walk How do we investigate this numerically? Choose the step length to be a=1 Use a computer to generate random numbers r i uniformly.
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
01/24/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
Short Resume of Statistical Terms Fall 2013 By Yaohang Li, Ph.D.
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
Chapter 7 Sampling Distribution
Noise & Uncertainty ASTR 3010 Lecture 7 Chapter 2.
Chapter 14 Monte Carlo Simulation Introduction Find several parameters Parameter follow the specific probability distribution Generate parameter.
Chap 6-1 A Course In Business Statistics, 4th © 2006 Prentice-Hall, Inc. A Course In Business Statistics 4 th Edition Chapter 6 Introduction to Sampling.
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
Business Statistics: A Decision-Making Approach, 6e © 2005 Prentice-Hall, Inc. Chap 6-1 Business Statistics: A Decision-Making Approach 6 th Edition Chapter.
Machine Learning Lecture 23: Statistical Estimation with Sampling Iain Murray’s MLSS lecture on videolectures.net:
Normal Distributions Z Transformations Central Limit Theorem Standard Normal Distribution Z Distribution Table Confidence Intervals Levels of Significance.
Monte Carlo I Previous lecture Analytical illumination formula This lecture Numerical evaluation of illumination Review random variables and probability.
Random Numbers and Simulation  Generating truly random numbers is not possible Programs have been developed to generate pseudo-random numbers Programs.
Sampling and sampling distibutions. Sampling from a finite and an infinite population Simple random sample (finite population) – Population size N, sample.
Computer Science, Software Engineering & Robotics Workshop, FGCU, April 27-28, 2012 Fault Prediction with Particle Filters by David Hatfield mentors: Dr.
Hit-and-Miss (or Rejection) Monte Carlo Method:
Lab 3b: Distribution of the mean
Hit-and-Miss (or Rejection) Monte Carlo Method: a “brute-force” method based on completely random sampling Then, how do we throw the stones and count them.
Basic Business Statistics, 11e © 2009 Prentice-Hall, Inc.. Chap 7-1 Developing a Sampling Distribution Assume there is a population … Population size N=4.
Distributions of the Sample Mean
Biostatistics Unit 5 – Samples. Sampling distributions Sampling distributions are important in the understanding of statistical inference. Probability.
Statistical Methods II: Confidence Intervals ChE 477 (UO Lab) Lecture 4 Larry Baxter, William Hecker, & Ron Terry Brigham Young University.
8 Sampling Distribution of the Mean Chapter8 p Sampling Distributions Population mean and standard deviation,  and   unknown Maximal Likelihood.
7 sum of RVs. 7-1: variance of Z Find the variance of Z = X+Y by using Var(X), Var(Y), and Cov(X,Y)
Expectation. Let X denote a discrete random variable with probability function p(x) (probability density function f(x) if X is continuous) then the expected.
CS348B Lecture 9Pat Hanrahan, Spring 2005 Overview Earlier lecture Statistical sampling and Monte Carlo integration Last lecture Signal processing view.
Numerical quadrature for high-dimensional integrals László Szirmay-Kalos.
1 Sampling distributions The probability distribution of a statistic is called a sampling distribution. : the sampling distribution of the mean.
Sampling Theory and Some Important Sampling Distributions.
Introduction to Inference Sampling Distributions.
Lecture 5 Introduction to Sampling Distributions.
MAT 4830 Mathematical Modeling 04 Monte Carlo Integrations
Introduction to Computer Simulation of Physical Systems (Lecture 10) Numerical and Monte Carlo Methods (CONTINUED) PHYS 3061.
Monte Carlo Integration Digital Image Synthesis Yung-Yu Chuang 12/3/2008 with slides by Pat Hanrahan and Torsten Moller.
Ch5.4 Central Limit Theorem
Introduction to Monte Carlo Method
4. Numerical Integration
Sec. 7-5: Central Limit Theorem
The distribution function F(x)
Chapter 7 Sampling Distributions.
The Normal Distribution…
Lecture 2 – Monte Carlo method in finance
Introduction to Probability & Statistics The Central Limit Theorem
Sampling Distribution of a Sample Proportion
Lecture 4 - Monte Carlo improvements via variance reduction techniques: antithetic sampling Antithetic variates: for any one path obtained by a gaussian.
Uncertainty Propagation
Presentation transcript:

4. Numerical Integration

Standard Quadrature We can find numerical value of a definite integral by the definition: where points x i are uniformly spaced.

Error in Quadrature Consider integral in d dimensions: The error with N sampling points is

More Accurate Methods Simpson’s rule Gaussian quadrature Non-uniform x points (abscissa) for higher accuracy.

Monte Carlo Estimates of Integrals We sample the points not on regular grids, but at random (uniformly distributed), then Where we assume the integration domain is a regular box of V=L d.

Monte Carlo Error From probability theory one can show that the Monte Carlo error decreases with sample size N as independent of dimension d.

Central Limit Theorem For large N, the sample mean = (1/N) ∑ f i follow Gaussian distribution with true mean of f, E(f), and variance σ 2 = var(f)/N where var(f) = E(f 2 ) – E(f ) 2. σ is called standard deviation.

Example, Monte Carlo Estimates of π (x,y) (1,0) Throw dots at random: x = ξ 1, y = ξ 2. Count the cases, n, that x 2 + y 2 < 1. Then n/N is an estimate of the value ¼π.

General Monte Carlo If the samples are not drawn uniformly but with some probability distribution P(X), we can compute by Monte Carlo: Where P(X) is normalized,

Variance Reduction Since the error in Monte Carlo decreases slowly as 1/N ½, the fundamental research in Monte Carlo method for improving efficiency is to reduce the pre-factor. The second problem is to develop methods for sampling X from a general distribution P(X).

Random Sequential Adsorption

A Non-Trivial Example In the study of random sequential adsorption, we need to compute the coefficients of a series expansion: where D(x 0 ) is a unit circle centered at (0,0), D(x 0,x 1 ) is the union of circles centered at x 0 and x 1, etc.

RSA: Integral Domains D(x 0 ) : |x| < 1 D(x 0,x 1 ) : |x|<1 or |x-x 1 | < 1, x 1  D(x 0 ) D(x 0,x 1,x 2 ): |x|<1 or |x- x 1 |< 1 or |x – x 2 | < 1, x 1  D(x 0 ) x 2  D(x 0,x 1 ), etc. |x| is distance (2-norm).

Monte Carlo Estimates We sample x 1 uniformly in a box of size 2; sample x 2 uniformly in a box of size 4; and x 3 in size 6, etc. If x 1  D(x 0 ) and x 2  D(x 0,x 1 ), x 3  D(x 0,x 1,x 2 ), etc, count 1, else count 0. Answer = countVolume/N

Results of S(4) We found Monte Carlo estimates: S(4)/(π/2) 4 = ± 0.008