750 likes | 911 Views
Efficient Method of Solution of Large Scale Engineering Problems with Interval Parameters Based on Sensitivity Analysis. Andrzej Pownuk Silesian University of Technology, Poland. Slightly compressible flow - 2D case. …. Measurements. Example: inexact ruler, …. Accuracy of measurements.
E N D
Efficient Method of Solution of Large Scale Engineering Problems with Interval Parameters Based on Sensitivity Analysis Andrzej Pownuk Silesian University of Technology, Poland
… Measurements
Example:inexact ruler, … Accuracy of measurements We can calculate this number in controllable environments (in laboratory). This error is not connected with probability.
Inexact measurements - accuracy of measurements
Characteristics of discrete random variable Mean value Variance
This formula is true only for Gauss PDF. Usually we don’t know probability density function (PDF) Probabilistic methods require assumptions about the probability density function.
Probability for X: Probability for Y: 1 1 2 x
Updating results using latest information Old data New data
Properties of confidence intervals • Definition of confidence intervals is not based • on the probability density function. 2) Confidence intervals can be defined using set-valued random variables (uncertain measurements).
Interval solutions of the slightly compressible flow equation Similar treatment for saturation.
Example Injection well Production well
Solution of single-region problem Solution of multi-region problem “Multi-region problems”
constraints: Result with constraints (single-region) Results without constraints (multi-region) More constraints – less uncertainty
Data file alpha_c 5.614583 /* volume conversion factor */ beta_c 1.127 /* transmissibility conversion factor */ /* size of the block */ dx 100 dy 100 h 100 /* time steps */ time_step 15 number_of_timesteps 10 reservoir_size 20 20
Comparison Single region - Multi-region [0,55] [psi] [0, 390] [psi]
- calculations of y(x) Extreme value of monotone functions
Sensitivity analysis If , then If , then
… - n derivatives 1 We have to calculate the value of n+3 functions. n 2 Complexity of the algorithm, which is based on sensitivity analysis
Vector-valued functions … In this case we have to repeat previous algorithm m times. We have to calculate the value of m*(n+2) functions.
Number of independent sign vectors: Independent sign vectors
n - derivatives 2*p – solutions (p times upper and lower bound). Complexity of the whole algorithm. 1 - solution
Complexity of the algorithm: All sensitivity vector can be calculated in one system of equations
Sensitivity analysis method give us the extreme combination of the parameters • We know which combination of upper bound or lower bound generate the exact solution.We can use these values in the design process.