Abstract
This paper introduces a fast Gibbs sampler for solving a fully Bayesian problem in operational modal analysis. The proposed method is able to infer modal properties from the FFT of well-separated modes. System identification and related uncertainties are captured by a posterior distribution. The classical resonance description is wrapped into a hierarchical probabilistic model. The model is sampled through an enhanced Gibbs sampler including a Metropolis–Hasting step. The entire sampling scheme is new and the fast convergence of the algorithm is enabled by two strategies. First, the use of a collapsed Gibbs algorithm allows for an efficient sampling of the mode shape. Second, the use of adequate candidate distributions in the Metropolis–Hasting step provides excellent acceptance ratios, around 75%. Eventually, the numerical inference procedure is compared to the state-of-the-art Fast Bayesian FFT Algorithm (Fast-BFFTA), which is the most commonly used algorithm for Bayesian operational modal analysis. The sampler surpasses the Fast-BFFTA for small data-based identification, while remaining sustainable in terms of computing requirements.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have