Probabilistic methods in Open Earth Tools Ferdinand Diermanse Kees den Heijer Bas Hoonhout.

Slides:



Advertisements
Similar presentations
Copula Representation of Joint Risk Driver Distribution
Advertisements

1 8. Numerical methods for reliability computations Objectives Learn how to approximate failure probability using Level I, Level II and Level III methods.
Bayesian Estimation in MARK
Approximate methods for calculating probability of failure
CHAPTER 13 PROBABILISTIC RISK ANALYSIS RANDOM VARIABLES Factors having probabilistic outcomesFactors having probabilistic outcomes The probability that.
Reliability Based Design Optimization. Outline RBDO problem definition Reliability Calculation Transformation from X-space to u-space RBDO Formulations.
©GoldSim Technology Group LLC., 2004 Probabilistic Simulation “Uncertainty is a sign of humility, and humility is just the ability or the willingness to.
Bayesian statistics – MCMC techniques
Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.
Machine Learning Week 2 Lecture 2.
Resampling techniques Why resampling? Jacknife Cross-validation Bootstrap Examples of application of bootstrap.
Maximum likelihood Conditional distribution and likelihood Maximum likelihood estimations Information in the data and likelihood Observed and Fisher’s.
A gentle introduction to Gaussian distribution. Review Random variable Coin flip experiment X = 0X = 1 X: Random variable.
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
WFM 5201: Data Management and Statistical Analysis
A) Transformation method (for continuous distributions) U(0,1) : uniform distribution f(x) : arbitrary distribution f(x) dx = U(0,1)(u) du When inverse.
The Monte Carlo Method: an Introduction Detlev Reiter Research Centre Jülich (FZJ) D Jülich
Lecture II-2: Probability Review
Slide 1 Testing Multivariate Assumptions The multivariate statistical techniques which we will cover in this class require one or more the following assumptions.
Sampling Distributions  A statistic is random in value … it changes from sample to sample.  The probability distribution of a statistic is called a sampling.
1 5. Combination of random variables Understand why we need bottoms-up approach for reliability analysis Learn how to compute the probability density function,
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
Component Reliability Analysis
0 Pattern Classification, Chapter 3 0 Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda,
Data Mining Practical Machine Learning Tools and Techniques Slides for Chapter 5 of Data Mining by I. H. Witten, E. Frank and M. A. Hall 報告人:黃子齊
01/24/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
Jointly Distributed Random Variables
Calculus Section 1.1 A Preview of Calculus What is Calculus? Calculus is the mathematics of change Two classic types of problems: The Tangent Line Problem.
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
1 Institute of Engineering Mechanics Leopold-Franzens University Innsbruck, Austria, EU H.J. Pradlwarter and G.I. Schuëller Confidence.
Monte Carlo Simulation CWR 6536 Stochastic Subsurface Hydrology.
Copyright © 2010 Lumina Decision Systems, Inc. Monte Carlo Simulation Analytica User Group Modeling Uncertainty Series #3 13 May 2010 Lonnie Chrisman,
General Principle of Monte Carlo Fall 2013 By Yaohang Li, Ph.D.
Theory of Probability Statistics for Business and Economics.
MEGN 537 – Probabilistic Biomechanics Ch.7 – First Order Reliability Methods Anthony J Petrella, PhD.
Monte Carlo I Previous lecture Analytical illumination formula This lecture Numerical evaluation of illumination Review random variables and probability.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Use of moment generating functions 1.Using the moment generating functions of X, Y, Z, …determine the moment generating function of W = h(X, Y, Z, …).
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
7.4 – Sampling Distribution Statistic: a numerical descriptive measure of a sample Parameter: a numerical descriptive measure of a population.
Delivering Integrated, Sustainable, Water Resources Solutions Monte Carlo Simulation Robert C. Patev North Atlantic Division – Regional Technical Specialist.
4. Numerical Integration. Standard Quadrature We can find numerical value of a definite integral by the definition: where points x i are uniformly spaced.
Suppressing Random Walks in Markov Chain Monte Carlo Using Ordered Overrelaxation Radford M. Neal 발표자 : 장 정 호.
Monte Carlo Process Risk Analysis for Water Resources Planning and Management Institute for Water Resources 2008.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation --- Discrete-Time Simulation TexPoint fonts used in EMF. Read the.
Stats Probability Theory Summary. The sample Space, S The sample space, S, for a random phenomena is the set of all possible outcomes.
Machine Design Under Uncertainty. Outline Uncertainty in mechanical components Why consider uncertainty Basics of uncertainty Uncertainty analysis for.
Sampling Theory and Some Important Sampling Distributions.
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
STA347 - week 91 Random Vectors and Matrices A random vector is a vector whose elements are random variables. The collective behavior of a p x 1 random.
The KOSMOSHOWS What is it ? The statistic inside What it can do ? Future development Demonstration A. Tilquin (CPPM)
CHAPTER 2.3 PROBABILITY DISTRIBUTIONS. 2.3 GAUSSIAN OR NORMAL ERROR DISTRIBUTION  The Gaussian distribution is an approximation to the binomial distribution.
Computer Simulation Henry C. Co Technology and Operations Management,
Lesson 8: Basic Monte Carlo integration
Introduction to Monte Carlo Method
Rouwaida Kanj, *Rajiv Joshi, and Sani Nassif
Basic simulation methodology
Chapter 3 Component Reliability Analysis of Structures.
Pattern Classification, Chapter 3
Statistics & Flood Frequency Chapter 3 – Part 1
AP Statistics: Chapter 7
Multiple Random Variables
Chapter 4a Stochastic Modeling
MEGN 537 – Probabilistic Biomechanics Ch
TexPoint fonts used in EMF.
Chapter 4a Stochastic Modeling
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Lecture 4 - Monte Carlo improvements via variance reduction techniques: antithetic sampling Antithetic variates: for any one path obtained by a gaussian.
Chapter 7 The Normal Distribution and Its Applications
Lesson 9: Basic Monte Carlo integration
Presentation transcript:

Probabilistic methods in Open Earth Tools Ferdinand Diermanse Kees den Heijer Bas Hoonhout

2 Open Earth Tools Deltares software Open source Sharing code for users of matlab, python, R, …

3 Application: probabilities of unwanted events (failure) Floods (too much) Droughts (too little) Contamination (too dirty)

4 Example application: flood risk analysis Rainfall Upstream river Discharge Sea water level Sobek

5 General problem definition X1X1 System/model X2X2 XnXn Z “Boundary conditions” “system variable”

6 Notation X1X1 X2X2 XnXn Z X = (X 1, X 2, …, X n ) Z = Z(X) System/model

7 General problem definition X1X1 model X2X2 XnXn Z ? Statistical analysis Probabilistic analysis complex Time consuming

8 failure domain: unwanted events x1x1 x2x2 “failure” Z(x)=0 no “failure” Z(x)>0 Z(x)<0 Wanted: probability of failure, i.e. probability that Z<0

9 Example Z-function Failure: if water level (h) exceeds crest height (k): Z = k - h

10 Probability functions of x-variables

11 Correlations need to be included x2x2 f(x) x1x1 x1x1 x2x2 Multivariate distribution function

12 Combination of f(x) and Z(x) x2x2 x1x1 f(x) Z(x)=C* “failure” no “failure”

13 Probability of failure x2x2 x1x1 f(x) Z(x)=0

14 Problem definition  Problem cannot be solved analytically  Probabilistic estimation techniques are required  Evaluation of Z(x) can be very time consuming

15 Probabilistic methods in Open Earth Tools  Crude Monte Carlo  Monte Carlo with importance sampling  First Order Reliability Method (FORM)  Directional sampling

16 Crude Monte Carlo sampling 1.Take N random samples of the x-variables 2.Count the number of samples (M) that lead to “failure” 3.Estimate P f = M/N

17 Simple example Crude Monte Carlo: ¼ circle

18 Samples crude Monte Carlo no failure failure

19 MC estimate

20 New example: smaller probability of failure U 1 ;U 2

1000 samples 21

How many samples required? 22

23 Crude Monte Carlo Can handle a large number of random variables Number of samples required for a sufficiently accurate estimate is inversely proportional to the probability of failure For small failure probabilities, crude MC is not a good choice, especially if each sample brings with it a time consuming computation/simulation

24 “Smart” MC method 1: importance sampling Manipulation of probability denstity function Allowed with the use of a correction: Potentially much faster than Crude Monte Carlo

25 Example strategy: increase variance

26 Samples

27 Convergence of MC estimate

28 Example strategy 2

29 Samples

30 Convergence of MC estimate

31 Monte Carlo with importance sampling Potentially much faster than Crude Monte Carlo Proper choice of h(x) is crucial Therefore: Proper system knowledge is crucial

32 FORM Design point: most likely combination leading to failure

33 x u F(x) real world variable X transformed normally distributed variable u  (u) = F(x) f(x)  (u )  (u) Method is executed with standard normally distributed variables

34 Probability density independent normal values Probability density decreases away from origin

35 example u en v standard normally distributed

36 Design point Z=0 & shortest distance to origin

37 Start iterative procedure

38 Estimation of derivatives

39 Resulting tangent

40 Linearisation of Z-function based on tangent

41 First estimate of design point

42 3D view: Z-function

43 3D view: linearisation of Z-function

44 Smaller steps to prevent “accidents” (relaxation)

45 2nd iteration step

46 Linearisation in 2nd iteration step

47 3D view

48 All iteration steps

49  -value of design point in standard normal space P fail

50  -values in design point

51 FORM Very fast method Risk: iteration method does not converge, or converges to the wrong design point

52 Directional sampling

53 Search along 1 direction z

54 Resume  Crude Monte Carlo (MC)  Monte Carlo with importance sampling (MC-IS)  First Order Reliability Method (FORM)  Directional Sampling (DS)

Towards the exercises

56 Generic problem statement x2x2 x1x1 f(x) Z(x)=0

57 Generic problem statement 1.Probability functions, f(x):P -> X 2.Z-function:X -> Z