Abstract

AbstractIn stochastic analysis of engineering systems, the task of generating samples according to a target probability distribution involving some performance function of the system response often arises. This paper introduces an adaptive method for rejection sampling that uses adaptive kernel sampling densities (AKSD) as proposal densities for the rejection sampling algorithm in an iterative approach. The AKSD formulation relies on having available (1) a small number of samples from the target density, as well as (2) evaluations of the system performance function over some other sample set. This information is then used to establish the adaptive features of the stochastic sampling involving (1) an explicit optimization of the kernel characteristics for reduction of the computational burden, and so maximizing sampling efficiency, and (2) selection of the exact model parameters to target so that potential problems when forming proposal densities for high-dimensional vectors are avoided. Beyond this theore...

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.