Relaxation-based importance sampling for structural reliability analysis

03/23/2023
by   Jianhua Xian, et al.
0

This study presents an importance sampling formulation based on adaptively relaxing parameters from the indicator function and/or the probability density function. The formulation embodies the prevalent mathematical concept of relaxing a complex problem into a sequence of progressively easier sub-problems. Due to the flexibility in constructing relaxation parameters, relaxation-based importance sampling provides a unified framework to formulate various existing variance reduction techniques, such as subset simulation, sequential importance sampling, and annealed importance sampling. More crucially, the framework lays the foundation for creating new importance sampling strategies, tailoring to specific applications. To demonstrate this potential, two importance sampling strategies are proposed. The first strategy couples annealed importance sampling with subset simulation, focusing on low-dimensional problems. The second strategy aims to solve high-dimensional problems by leveraging spherical sampling and scaling techniques. Both methods are desirable for fragility analysis in performance-based engineering, as they can produce the entire fragility surface in a single run of the sampling algorithm. Three numerical examples, including a 1000-dimensional stochastic dynamic problem, are studied to demonstrate the proposed methods.

READ FULL TEXT

page 10

page 17

page 18

page 19

research
06/21/2022

An attempt to trace the birth of importance sampling

In this note, we try to trace the birth of importance sampling (IS) back...
research
03/11/2023

Online Neural Path Guiding with Normalized Anisotropic Spherical Gaussians

The variance reduction speed of physically-based rendering is heavily af...
research
10/25/2022

BSDF Importance Baking: A Lightweight Neural Solution to Importance Sampling General Parametric BSDFs

Parametric Bidirectional Scattering Distribution Functions (BSDFs) are p...
research
07/05/2023

Privacy Amplification via Importance Sampling

We examine the privacy-enhancing properties of subsampling a data set vi...
research
02/02/2019

Stochastic Enumeration with Importance Sampling

Many hard problems in the computational sciences are equivalent to count...
research
09/12/2018

On the uniform generation of random derangements

We show how to generate random derangements with the expected distributi...
research
09/12/2018

Efficient uniform generation of random derangements with the expected distribution of cycle lengths

We show how to generate random derangements with the expected distributi...

Please sign up or login with your details

Forgot password? Click here to reset