Modified Metropolis-Hastings algorithm with Delayed Rejection for High-Dimensional Reliability Analysis
نویسندگان
چکیده
The development of an efficient MCMC strategy for sampling from complex distributions is a difficult task that needs to be solved for calculating small failure probabilities encountered in high-dimensional reliability analysis of engineering systems. Usually different variations of the Metropolis-Hastings algorithm (MH) are used. However, the standard MH algorithm does generally not work in high dimensions, since it leads to very frequent repeated samples. In order to overcome this deficiency one can use the Modified Metropolis-Hastings algorithm (MMH) proposed in [1]. Another variation of the MH algorithm, called MetropolisHastings algorithm with delayed rejection (MHDR) has been proposed by [2]. The key idea behind the MHDR algorithm is to reduce the correlation between states of the Markov chain. In this paper we combine the ideas of MMH and MHDR and propose a novel modification of the MH algorithm, called Modified Metropolis-Hastings algorithm with delayed rejection (MMHDR). The efficiency of the new algorithm is demonstrated with a numerical example where MMHDR is used together with Subset simulation for computing small failure probabilities in high dimensions.
منابع مشابه
Modified Metropolis-Hastings algorithm with Delayed Rejection
The development of an efficient MCMC strategy for sampling from complex distributions is a difficult task that needs to be solved for calculating small failure probabilities encountered in high-dimensional reliability analysis of engineering systems. Usually different variations of the Metropolis-Hastings algorithm (MH) are used. However, the standard MH algorithm does generally not work in hig...
متن کاملScaling analysis of delayed rejection MCMC methods
In this paper, we study the asymptotic efficiency of the delayed rejection strategy. In particular, the efficiency of the delayed rejection Metropolis-Hastings algorithm is compared to that of the regular Metropolis algorithm. To allow for a fair comparison, the study is carried under optimal mixing conditions for each of these algorithms. After introducing optimal scaling results for the delay...
متن کاملOn the Optimal Scaling of the Modified Metropolis-Hastings algorithm
Estimation of small failure probabilities is one of the most important and challenging problems in reliability engineering. In cases of practical interest, the failure probability is given by a high-dimensional integral. Since multivariate integration suffers from the curse of dimensionality, the usual numerical methods are inapplicable. Over the past decade, the civil engineering research comm...
متن کاملR-package FME : MCMC tests
This vignette tests the Markov chain Monte Carlo (MCMC) implementation of Rpackage FME (Soetaert and Petzoldt 2010). It includes the delayed rejection and adaptive Metropolis algorithm (Haario, Laine, Mira, and Saksman 2006)
متن کامل