1 / 17

Sensitivity Analysis

Sensitivity Analysis. Jake Blanchard Fall 2010. Introduction. Sensitivity Analysis = the study of how uncertainty in the output of a model can be apportioned to different input parameters

kacia
Télécharger la présentation

Sensitivity Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Sensitivity Analysis Jake Blanchard Fall 2010

  2. Introduction • Sensitivity Analysis = the study of how uncertainty in the output of a model can be apportioned to different input parameters • Local sensitivity = focus on sensitivity at a particular set of input parameters, usually using gradients or partial derivatives • Global or domain-wide sensitivity = consider entire range of inputs

  3. Typical Approach • Consider a Point Reactor Kinetics problem

  4. Results • P(t) normalized to P0 • Mean lifetime normalized to baseline value (0.001 s) • t=3 s

  5. Results • P(t) normalized to P0 • Mean lifetime normalized to baseline value (0.001 s) • t=0.1 s

  6. Putting all on one chart – t=0.1 s

  7. Putting all on one chart – t=3 s

  8. Quantifying Sensitivity • To first order, our measure of sensitivity is the gradient of an output with respect to some particular input variable. • Suppose all variables are uncertain and • Then, if inputs are independent,

  9. Quantifying Sensitivity • Most obvious calculation of sensitivity is • This is the slope of the curves we just looked at • We can normalize about some point (y0)

  10. Quantifying Sensitivity • This normalized sensitivity says nothing about the expected variation in the inputs. • If we are highly sensitive to a variable which varies little, it may not matter in the end • Normalize to input variances

  11. Rewriting…

  12. A Different Approach • Question: If we could eliminate the variation in a single input variable, how much would we reduce output variation? • Hold one input (Px) constant • Find output variance – V(Y|Px=px) • This will vary as we vary px • So now do this for a variety of values of px and find expected value E(V(Y|Px)) • Note: V(Y)=E(V(Y|Px))+V(E(Y|Px))

  13. Now normalize • This is often called the • importance measure, • sensitivity index, • correlation ratio, or • first order effect

  14. Variance-Based Methods • Assume • Choose each term such that it has a mean of 0 • Hence, f0 is average of f(x)

  15. Variance Methods • Since terms are orthogonal, we can square everything and integrate over our domain

  16. Variance Methods • Si is first order (or main) effect of xi • Sij is second order index. It measures effect of pure interaction between any pair of output variables • Other values of S are higher order indices • “Typical” sensitivity analysis just addresses first order effects • An “exhaustive” sensitivity analysis would address other indices as well

  17. Suppose k=4 • 1=S1+S2+S3+S4+S12+S13+S14+S23+S24+S34+S123+S124+S134+S234+S1234 • Total # of terms is 4+6+4+1=15=24-1

More Related