2006Unpublished venueRequires access

Adaptive Importance Sampling Algorithm for Fuzzy-Random failure Probability

Lü Zhenzhou

Open publisher page 0 citations

Abstract

An adaptive importance sampling algorithm is presented to evaluate fuzzy-random general failure probability,where a simulated annealing optimization is employed to seek the fuzzy-random design point—the Most Probable Failure Point(MPFP) in the failure region.The efficiency of the simulated annealing is more than that of the first order and second moment for seeking the MPFP,this method is especially suitable for the failure probability computation with the highly non-linear failure region and the complicated equivalent joint probability density function.The contribution of the set of importance sampling functions to the fuzzy-random failure probability is represented by the designed simulation number to lead to more accurate computation.The illustrations verify the feasibility and efficiency of the proposed method.

About this research paper

What this paper is about

An adaptive importance sampling algorithm is presented to evaluate fuzzy-random general failure probability,where a simulated annealing optimization is employed to seek the fuzzy-random design point—the Most Probable Failure Point(MPFP) in the failure region.The efficiency of the simulated annealing is more than that of the first order and second moment for seeking the MPFP,this method is especially suitable for the failure probability computation with the highly non-linear failure region and the complicated equivalent joint probability density function.The contribution of the set of importance sampling functions to the fuzzy-random failure probability is represented by the designed simulation number to lead to more accurate computation.The illustrations verify the feasibility and efficiency of the proposed method.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

An adaptive importance sampling algorithm is presented to evaluate fuzzy-random general failure probability,where a simulated annealing optimization is employed to seek the fuzzy-random design point—the Most Probable Failure Point(MPFP) in the failure region.The efficiency of the simulated annealing is more than that of the first order and second moment for seeking the MPFP,this method is especially suitable for the failure probability computation with the highly non-linear failure region and the complicated equivalent joint probability density function.The contribution of the set of importance sampling functions to the fuzzy-random failure probability is represented by the designed simulation number to lead to more accurate computation.The illustrations verify the feasibility and efficiency of the proposed method.

Key concepts: Fuzzy logic, Mathematical optimization, Algorithm, Probability density function, Computation, Simulated annealing, Mathematics, Random variable

Related papers

Back to paper searchBrowse research topicsOriginal source
Adaptive Importance Sampling Algorithm for Fuzzy-Random failure Probability — Research Paper | ScholarLens