Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Bayesian finite element model updating based on Markov chain population competition

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • معلومة اضافية
    • بيانات النشر:
      Editorial Office of Journal of Mechanical Strength, 2025.
    • الموضوع:
      2025
    • Collection:
      LCC:Mechanical engineering and machinery
      LCC:Materials of engineering and construction. Mechanics of materials
    • نبذة مختصرة :
      The traditional Markov chain Monte Carlo(MCMC) simulation method is inefficient and difficult to converge in high dimensional problems and complicated posterior probability density.In order to overcome these shortcomings, a Bayesian finite element model updating algorithm based on Markov chain population competition was proposed. First, the differential evolution algorithm was introduced in the traditional method of Metropolis-Hastings (MH) random walk algorithm.Based on the interaction of different information carried by Markov chains in the population,optimization suggestions were obtained to approach the objective function quickly. It solves the defect of sampling retention in the updating process of high-dimensional parameter model. Then, the competition algorithm was introduced, which has constant competitive incentives and a built-in mechanism for losers to learn from winners. Higher precision was obtained by using fewer Markov chains, which improves the efficiency and precision of model updating. Finally, a numerical example of finite element model updating of a truss structure was used to verify the proposed algorithm.Compared with the results of standard MH algorithm, the proposed algorithm can quickly update the high-dimensional parameter model with high accuracy and good robustness to random noise. It provides a stable and effective method for finite element model updating of large-scale structure considering uncertainty.
    • File Description:
      electronic resource
    • ISSN:
      1001-9669
    • Relation:
      http://www.jxqd.net.cn/thesisDetails#10.16579/j.issn.1001.9669.2025.02.011; https://doaj.org/toc/1001-9669
    • الرقم المعرف:
      10.16579/j.issn.1001.9669.2025.02.011
    • الرقم المعرف:
      edsdoj.12bbb57c22094c2a836d9f28ebfb5051