Please use this identifier to cite or link to this item:
|Title:||Modified Metropolis-Hastings algorithm with reduced chain correlation for efficient subset simulation|
|Authors:||Santoso, A.M. |
|Citation:||Santoso, A.M., Phoon, K.K., Quek, S.T. (2011-04). Modified Metropolis-Hastings algorithm with reduced chain correlation for efficient subset simulation. Probabilistic Engineering Mechanics 26 (2) : 331-341. ScholarBank@NUS Repository.|
|Abstract:||Simulation of Markov chain samples using the MetropolisHastings algorithm is useful for reliability estimation. Subset simulation is an example of the reliability estimation method utilizing this algorithm. The efficiency of the simulation is governed by the correlation between the simulated Markov chain samples. The objective of this study is to propose a modified MetropolisHastings algorithm with reduced chain correlation. The modified algorithm differs from the original in terms of the transition probability. It has been verified that the modified algorithm satisfies the reversibility condition and therefore the simulated samples follow the target distribution for the correct theoretical reasons. When applied to subset simulation, the modified algorithm produces a more accurate estimate of failure probability as indicated by a lower coefficient of variation and a lower mean square error. The advantage is more significant for small failure probability. Examples of soil slope with spatially variable properties were presented to demonstrate the applicability of the proposed modification to reliability estimation of engineering problems. It was found that the modified algorithm produces a more accurate estimator over the range of random dimensions studied. © 2010 Elsevier Ltd. All rights reserved.|
|Source Title:||Probabilistic Engineering Mechanics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 27, 2018
WEB OF SCIENCETM
checked on Apr 24, 2018
checked on Jun 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.