Fast probability integration explained

Fast probability integration (FPI) is a method of determining the probability of a class of events, particularly a failure event, that is faster to execute than Monte Carlo analysis.[1] It is used where large numbers of time-variant variables contribute to the reliability of a system. The method was proposed by Wen and Chen in 1987.[2]

For a simple failure analysis with one stress variable, there will be a time-variant failure barrier,

r(t)

, beyond which the system will fail. This simple case may have a deterministic solution, but for more complex systems, such as crack analysis of a large structure, there can be a very large number of variables, for instance, because of the large number of ways a crack can propagate. In many cases, it is infeasible to produce a deterministic solution even when the individual variables are all individually deterministic.[3] In this case, one defines a probabilistic failure barrier surface,

R(t)

, over the vector space of the stress variables.[4]

If failure barrier crossings are assumed to comply with the Poisson counting process an expression for maximum probable failure can be developed for each stress variable. The overall probability of failure is obtained by averaging (that is, integrating) over the entire variable vector space. FPI is a method of approximating this integral. The input to FPI is a time-variant expression, but the output is time-invariant, allowing it to be solved by first-order reliability method (FORM) or second-order reliability method (SORM).[5]

An FPI package is included as part of the core modules of the NASA-designed NESSUS software.[6] It was initially used to analyse risks and uncertainties concerning the Space Shuttle main engine,[7] but is now used much more widely in a variety of industries.[8]

Bibliography

Notes and References

  1. Murthy et al., p. 128.
  2. Beck & Melchers, p. 2201.
  3. Beck & Melchers, p. 2202.
  4. Beck & Melchers, p. 2201.
  5. Beck & Melchers, p. 2201.
  6. Shah et al., p. 5.
  7. Shah et al., p. 5.
  8. Riha et al., p. 3.