Professional Documents
Culture Documents
Module III - Static Reliability Analysis and Design
Module III - Static Reliability Analysis and Design
Module III - Static Reliability Analysis and Design
1
Static Reliability Analysis and Design(*)
PART I: Static Reliability Analysis
➢ Concept of Limit States & Reliability
➢ Monte Carlo Simulation (MCS)
➢ Expansion Methods (Taylor series)
➢ First Order Reliability Methods (FORM)
▪ Reliability Index
▪ AFOSM, HL-RF Method
➢ Univariant Dimension Reduction (UDR) Method
➢ Other Advanced Methods (Kriging, etc.)
▪ Static Reliability
• R(t) = Pr (s (x) – s0<0)
3
SE-411 All Rights Reserved @ P. Wang
PART I: Static Reliability Analysis
4
SE-411 All Rights Reserved @ P. Wang
Definition of Reliability
Static Reliability (or time-independent, structural reliability)
▪ Definition: the probability that the system performance meets
the required design performance under various uncertainty
sources (e.g., material properties, geometric tolerances, and
loading conditions).
Performance function
( ) ( )
R ( X ) = P G ( X ) 0 = 1 − P G ( X ) 0 (e.g., stress, strain,
and power output)
where X = (X1, X2,…, XN)T models uncertainty sources.
X2: operationa
that X is inside the safe G<0
region {G < 0}. Safe regio fX(x)
n
l factor
R ( X ) = P (G ( X ) 0)
= L S f X ( x ) dx
6
SE-411 All Rights Reserved @ P. Wang
An Example
Example of Static Reliability
▪ Consider a performance function G as the difference between the
strength S of and load L on an engineered system
G = L−S
where S and L are random variables and follow normal
distributions with probability density functions fS and fL.
Probability density
fS
fL
μL μS L,S 7
SE-411 All Rights Reserved @ P. Wang
An Example (cont.)
Example of Time-Independent Reliability
▪ A failure will occur when the load L is greater than the strength S,
or G (= L – S) > 0. Hence G > 0 indicates a failure.
▪ The probability of failure can therefore be defined by
Pf = Pr ( G 0 ) R = 1 − Pf = Pr ( G 0 )
▪ What does the LSF look like in a 2-D plot?
L
G>0
Failure region
G=0
Limit-state function
0 S 8
SE-411 All Rights Reserved @ P. Wang
Monte Carlo Simulation (MCS)
▪ Four sequential steps (assuming independence between X)
▪ Step 1: For each random variable Xi, generate M “pseudo random numbers”
vi1, vi2,…, viM from a standard uniform distribution (between 0 and 1). Then
obtain M random vectors v1, v2,…, vM with vj = [v1j, v2j,…, vNj]T.
▪ Step 2: Transform vij (i = 1, 2,…, N, j = 1, 2,…, M) to xij using CDF mapping
I S ( x ) = 1 I S ( x ) = 0
fX(x)
Mean point
0 X1
10
SE-411 All Rights Reserved @ P. Wang
MCS Example
Find the Reliability: R = Pr(G<0), using the MCS, where
80
G ( X1 , X 2 ) = 1 −
X 12 + 8 X 2 + 5
X1 and X2 each follow a normal distribution with the mean 4.5 and the
standard deviation 0.6.
11
SE-411 All Rights Reserved @ P. Wang
Expansion Methods
▪ Recall: Consider a performance function G as the difference
between the strength S of and load L on an engineered
system
G = L−S
13
SE-411 All Rights Reserved @ P. Wang
A Cantilever Beam Example
Assume that the vertical loads P1 and P2 follow normal
distributions with means 1000 lb and 500 lb, and standard
deviations 100 lb and 50 lb, respectively. In addition, assume
that the bending moment is deterministic (fixed at 10000 lb-ft).
P1 P2
m
10 ft 10 ft
14
SE-411 All Rights Reserved @ P. Wang
A Cantilever Beam Example (cont.)
▪ Solution
▪ At the fixed end, the maximum moment can be expressed as
mmax = 10 P1 + 20 P2 + 10000 = aT X + b
where a = [10, 20]T, b = 10000, and X = [P1, P2]T. Note that the
mean vector μX = [1000, 50]T, and the covariance matrix ΣX = [1002,
0; 0, 502].
▪ We first compute the mean of mmax
1000
mmax = aT μ X + b = 10 20 + 10000
500
= 30,000 lb-ft
▪ We then compute the variance and standard deviation of mmax
1002 0 10
s 2
mmax = a Xa = 10 20
T
2
0 50 20
= 2 106 lb-ft
2
▪ Solution
▪ Finally, the reliability can be computed as
Performance function
R = P ( mmax ma )
G = mmax − ma
mmax − mmax ma − mmax
= P
sm s
max mmax
33,000 − 30,000
= P Z = 2.12
1414
= ( 2.12 ) = 98.3%
16
SE-411 All Rights Reserved @ P. Wang
Expansion Methods (cont.)
▪ Taylor Series Expansion of the Performance Function
G' ( X 0 ) G '' ( X 0 )
G( X ) = G( X 0 ) + 1! ( X − X0) + 2! ( X − X 0 ) 2 + ...
Unknowns
▪ Choose Input Samples to Do Experiments
N total = K N v /Simulation
17
SE-411 All Rights Reserved @ P. Wang
First Order Reliability Method (FORM)
18
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
Transformation from X-Space to U-Space
▪ For a normal random variable Xi with mean μXi and standard
deviation σXi, transformation T can be simply defined as
X − Xi
Ui = T ( X i ) = , i = 1,2,..., N
s Xi
19
SE-411 All Rights Reserved @ P. Wang
FORM(cont.)
Transformation from X-Space to U-Space
▪ Transformation of a standard uniform random variable Xi to
a standard normal random variable Ui
1.0 1.0
0.8 CDF mapping 0.8
0.6 0.6
FX i(xi)
(ui)
Φi U
0.4 0.4
0.2 0.2
0 0
ui Ui xi Xi
0.9
1.0
0.6
i)
(ixi)
fU
fX
(u
i
0.3
0 00
0 ui Ui xi 1 Xi
20
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
Transformation from X-Space to U-Space
▪ Through the transformation, G(X) in the X-space is mapped to an
equivalent function G(U) = G(T(X)) in the U-space.
G(X) > 0
U2
X2
Mean point
X1 0 U1
0
G(X) = 0
fU(u) Failure surface
21
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
Most Probable Point (MPP) and Reliability Index
▪ In the U-space, the MPP u* denotes the point on the failure
surface which has the minimum distance to the origin.
G(X) > 0
U2
X2
MPP u*
Mean point
X1 0 U1
0
G(X) = 0
fU(u) Failure surface
22
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
G(X) > 0
U2
X2
23
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
Most Probable Point (MPP) and Reliability Index
▪ This reliability measure is exact only if the failure surface in
the U-space is of a linear form.
G(X) > 0
U2
X2
fX(x)
G(X) < 0
Safe region
Reliability
index β
MPP u*
Mean point
FORM
X1 0 U1
0
G(X) = 0
fU(u) Failure surface
24
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
Iterative Search of MPP
▪ The task of MPP search can be formulated as an
optimization problem with one equality constraint in the U-
space
Minimize U
Subject to G ( U) = 0
25
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
Iterative Search of MPP
▪ Hasofer-Lind and Rackwitz-Fiessler (HL-RF) method
▪ Step 1: Set the number of iterations k = 0 and the initial MPP estimate u = u(0)
that corresponds to the mean values of X..
▪ Step 2: Transform u(k) to x(k) using CDF mapping. Compute the performance
function G(u(k)) = G(x(k)) and its partial derivatives in the U-space as
G G G
UG u(( )k)
= ,
U1 U 2
,K ,
U N U=u( k )
( )
( )
n =
k
U G u( )
G ( u( ) )
k
U
k
26
SE-411 All Rights Reserved @ P. Wang
FORM (cont.)
Iterative Search of MPP
▪ Schematic of MPP search with the HL-RF method
U2
G(U) > 0
Failure region
u(0)
u(1)
( ))
G u(
0
G ( u( ) )
G(U) < 0 0
Safe region U
MPP u*
n(0)
G(U) = G(u(0)) > 0
0 U1
G(U) = 0
Failure surface
27
SE-411 All Rights Reserved @ P. Wang
An Example of FORM
Example on MPP Search
▪ Consider the following performance function
80
G ( X1 , X 2 ) = 1 −
X 12 + 8 X 2 + 5
( ) UG u( )
0
0
( ) ( )
u ( ) = u ( ) • U G u ( ) − G u ( )
1 0 0
G ( u( ) )
0
2
U
% define variables
mu = [4.5, 4.5]; stdx = [0.6, 0.6];
nd = 2; u=zeros(1,nd); iter=0; Dif=1;
( ) n( )
U(iter,:)=u/norm(u);
if iter>1 G u (k )
u( = u( ) • n( ) −
k +1) k k k
Dif=abs(U(iter-1,:)*U(iter,:)' - 1);
end
end
( )
U G u( )
k
30
SE-411 All Rights Reserved @ P. Wang
An Example of FORM (cont.)
Reliability Analysis on Simple Performance Function
▪ Graphical illustration of MPP search in the X-space
G(X) > 0
Failure region
G(X) < 0
Safe region
x(3)
x(1)
Mean point x(0) x(2)
G(X) = 0
LSF x(4)
31
SE-411 All Rights Reserved @ P. Wang
An Example of FORM (cont.)
Reliability Analysis on Simple Performance Function
▪ Graphical illustration of MPP search in the U-space
G(U) > 0
Failure region
G(U) < 0
Safe region
u(3)
u(1)
Mean point u(0) u(2)
G(U) = 0
LSF u(4)
32
SE-411 All Rights Reserved @ P. Wang
u(
k +1)
= u( ) • n( ) −
k k
G u ( ) n( )
(k )
k
FORM Exercise
( )
U G u( )
k
G ( u( ) )
k
n( ) =
k U
G ( u( ) )
k
U
G G
Iteration U1 U2 β G (U)
U1 U 2
0 0.0000 0.0000
1
2
3
… … … … … … …
Optimum
33
SE-411 All Rights Reserved @ P. Wang
FORM Explanation
r
G(u) =G ( uk ) + G ( uk ) ( u − uk )
r
G(u k+1 ) =G ( u k ) + G ( u k ) ( u k+1 − u k ) = 0
u2 G(U) r r r r T
G ( u k ) G ( u k ) + G ( u k ) ( u k+1 − u k ) = 0
r
r G ( u k )
r let n k = r
uk G ( u k )
G ( uk ) r r r
+ n k ( u k+1 − u k ) = 0
T
r
G ( u k )
r r r r r G ( uk )
u k+1 n k u k+1T = n k u k T − r
G ( u k )
u1
r r r r r G ( uk )
n k n k T u k+1 = n k u k − r
G(u) = 0 G ( u k )
r r r G (u ) r
u k+1 = n k u k − r k nk
G ( u k )
34
SE-411 All Rights Reserved @ P. Wang
FORM flowchart
k =0; uk =[0,0]
G ( u k ) ; G ( u k )
G ( u k )
nk =
G ( u k )
k =k+1
G ( uk )
k+1 =nk uk T −
G ( uk )
uk+1 =k+1 n k
u k+1 − n k ?
u k+1 ,
35
SE-411 All Rights Reserved @ P. Wang