4.7 Article

Estimation of small failure probability using generalized subset simulation

Journal

MECHANICAL SYSTEMS AND SIGNAL PROCESSING
Volume 163, Issue -, Pages -

Publisher

ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
DOI: 10.1016/j.ymssp.2021.108114

Keywords

Subset simulation; Markov chain; Small failure probability; Coordinate rotation

Funding

  1. National Natural Science Foundation of China [NSFC 51775439]
  2. National Science and Technology Major Project [2017-IV-0009-0046]
  3. Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University [CX201933]
  4. China Scholarships Council [201906290124]

Ask authors/readers for more resources

This paper introduces a generalized subset simulation (GSS) method for estimating small failure probability by modifying failure threshold and amplifying input variables to decompose the problem into a series of simple integrals. Two coordinate rotation schemes are used to detect important directions in high-dimensional space, transforming high-dimensional integrals into low-dimensional ones for efficient estimation. Two MCMC algorithms within GSS are introduced for low-dimensional and high-dimensional problems respectively for testing performance using benchmark examples.
This paper proposes a generalized subset simulation (GSS) method for estimating small failure probability. The basic idea is to modify the failure threshold and amplify the variability of input variables simultaneously in a sequential way. With a proper choice of the intermediate failure thresholds and amplification factors, the problem of estimation of a small failure probability is decomposed into the problem of estimating a series of simple integrals. For high-dimensional problems, two coordinate rotation schemes are introduced to detect the important directions in high-dimensional space. Using coordinate rotation, original high-dimensional integrals are transformed into a series of low-dimensional ones, and they can be estimated by Markov Chain Monte Carlo (MCMC) simulation technique efficiently. Two MCMC algorithms are introduced within GSS for low-dimensional and high-dimensional problems respectively, and a resampling method is utilized to select the initial states of each Markov chain from the existing samples. Five widely used benchmark examples are used to test the performance of the proposed method.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available