Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating

Publikation: Beitrag in FachzeitschriftArtikelForschung

Autoren

Externe Organisationen

  • Beijing Institute of Technology
  • The University of Liverpool
  • Tongji University
  • University of Science and Technology Beijing
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Aufsatznummer020903
Seitenumfang10
FachzeitschriftASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering
Jahrgang7
Ausgabenummer2
Frühes Online-Datum23 Apr. 2021
PublikationsstatusVeröffentlicht - Juni 2021

Abstract

The Bhattacharyya distance has been developed as a comprehensive uncertainty quantification metric by capturing multiple uncertainty sources from both numerical predictions and experimental measurements. This work pursues a further investigation of the performance of the Bhattacharyya distance in different methodologies for stochastic model updating, and thus to prove the universality of the Bhattacharyya distance in various currently popular updating procedures. The first procedure is the Bayesian model updating where the Bhattacharyya distance is utilized to define an approximate likelihood function and the transitional Markov chain Monte Carlo algorithm is employed to obtain the posterior distribution of the parameters. In the second updating procedure, the Bhattacharyya distance is utilized to construct the objective function of an optimization problem. The objective function is defined as the Bhattacharyya distance between the samples of numerical prediction and the samples of the target data. The comparison study is performed on a four degrees-of-freedom mass-spring system. A challenging task is raised in this example by assigning different distributions to the parameters with imprecise distribution coefficients. This requires the stochastic updating procedure to calibrate not the parameters themselves, but their distribution properties. The second example employs the GARTEUR SM-AG19 benchmark structure to demonstrate the feasibility of the Bhattacharyya distance in the presence of practical experiment uncertainty raising from measuring techniques, equipment, and subjective randomness. The results demonstrate the Bhattacharyya distance as a comprehensive and universal uncertainty quantification metric in stochastic model updating.

ASJC Scopus Sachgebiete

Zitieren

Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating. / Bi, Sifeng; Beer, Michael; Zhang, Jingrui et al.
in: ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering, Jahrgang 7, Nr. 2, 020903, 06.2021.

Publikation: Beitrag in FachzeitschriftArtikelForschung

Bi, S, Beer, M, Zhang, J, Yang, L & He, K 2021, 'Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating', ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering, Jg. 7, Nr. 2, 020903. https://doi.org/10.1115/1.4050168
Bi, S., Beer, M., Zhang, J., Yang, L., & He, K. (2021). Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating. ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering, 7(2), Artikel 020903. https://doi.org/10.1115/1.4050168
Bi S, Beer M, Zhang J, Yang L, He K. Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating. ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering. 2021 Jun;7(2):020903. Epub 2021 Apr 23. doi: 10.1115/1.4050168
Bi, Sifeng ; Beer, Michael ; Zhang, Jingrui et al. / Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating. in: ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering. 2021 ; Jahrgang 7, Nr. 2.
Download
@article{892ac50e74304acc91dea5438ec8383e,
title = "Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating",
abstract = "The Bhattacharyya distance has been developed as a comprehensive uncertainty quantification metric by capturing multiple uncertainty sources from both numerical predictions and experimental measurements. This work pursues a further investigation of the performance of the Bhattacharyya distance in different methodologies for stochastic model updating, and thus to prove the universality of the Bhattacharyya distance in various currently popular updating procedures. The first procedure is the Bayesian model updating where the Bhattacharyya distance is utilized to define an approximate likelihood function and the transitional Markov chain Monte Carlo algorithm is employed to obtain the posterior distribution of the parameters. In the second updating procedure, the Bhattacharyya distance is utilized to construct the objective function of an optimization problem. The objective function is defined as the Bhattacharyya distance between the samples of numerical prediction and the samples of the target data. The comparison study is performed on a four degrees-of-freedom mass-spring system. A challenging task is raised in this example by assigning different distributions to the parameters with imprecise distribution coefficients. This requires the stochastic updating procedure to calibrate not the parameters themselves, but their distribution properties. The second example employs the GARTEUR SM-AG19 benchmark structure to demonstrate the feasibility of the Bhattacharyya distance in the presence of practical experiment uncertainty raising from measuring techniques, equipment, and subjective randomness. The results demonstrate the Bhattacharyya distance as a comprehensive and universal uncertainty quantification metric in stochastic model updating.",
keywords = "Bayesian model updating, Bhattacharyya distance, Markov chain Monte Carlo, Optimization model updating, Uncertainty quantification",
author = "Sifeng Bi and Michael Beer and Jingrui Zhang and Lechang Yang and Kui He",
note = "Funding Information: This work was supported by the Alexander von Humboldt Foundation in Germany (Award No. 1193706) and the Beijing Institute of Technology Research Fund Program for Young Scholars in China, which are greatly appreciated. Dr. Lechang Yang acknowledges the support of the National Natural Science Foundation of China under Grant No. 52005032, the Aeronautical Science Foundation of China under Grant No. 2018ZC74001.",
year = "2021",
month = jun,
doi = "10.1115/1.4050168",
language = "English",
volume = "7",
number = "2",

}

Download

TY - JOUR

T1 - Optimization or Bayesian Strategy? Performance of the Bhattacharyya Distance in Different Algorithms of Stochastic Model Updating

AU - Bi, Sifeng

AU - Beer, Michael

AU - Zhang, Jingrui

AU - Yang, Lechang

AU - He, Kui

N1 - Funding Information: This work was supported by the Alexander von Humboldt Foundation in Germany (Award No. 1193706) and the Beijing Institute of Technology Research Fund Program for Young Scholars in China, which are greatly appreciated. Dr. Lechang Yang acknowledges the support of the National Natural Science Foundation of China under Grant No. 52005032, the Aeronautical Science Foundation of China under Grant No. 2018ZC74001.

PY - 2021/6

Y1 - 2021/6

N2 - The Bhattacharyya distance has been developed as a comprehensive uncertainty quantification metric by capturing multiple uncertainty sources from both numerical predictions and experimental measurements. This work pursues a further investigation of the performance of the Bhattacharyya distance in different methodologies for stochastic model updating, and thus to prove the universality of the Bhattacharyya distance in various currently popular updating procedures. The first procedure is the Bayesian model updating where the Bhattacharyya distance is utilized to define an approximate likelihood function and the transitional Markov chain Monte Carlo algorithm is employed to obtain the posterior distribution of the parameters. In the second updating procedure, the Bhattacharyya distance is utilized to construct the objective function of an optimization problem. The objective function is defined as the Bhattacharyya distance between the samples of numerical prediction and the samples of the target data. The comparison study is performed on a four degrees-of-freedom mass-spring system. A challenging task is raised in this example by assigning different distributions to the parameters with imprecise distribution coefficients. This requires the stochastic updating procedure to calibrate not the parameters themselves, but their distribution properties. The second example employs the GARTEUR SM-AG19 benchmark structure to demonstrate the feasibility of the Bhattacharyya distance in the presence of practical experiment uncertainty raising from measuring techniques, equipment, and subjective randomness. The results demonstrate the Bhattacharyya distance as a comprehensive and universal uncertainty quantification metric in stochastic model updating.

AB - The Bhattacharyya distance has been developed as a comprehensive uncertainty quantification metric by capturing multiple uncertainty sources from both numerical predictions and experimental measurements. This work pursues a further investigation of the performance of the Bhattacharyya distance in different methodologies for stochastic model updating, and thus to prove the universality of the Bhattacharyya distance in various currently popular updating procedures. The first procedure is the Bayesian model updating where the Bhattacharyya distance is utilized to define an approximate likelihood function and the transitional Markov chain Monte Carlo algorithm is employed to obtain the posterior distribution of the parameters. In the second updating procedure, the Bhattacharyya distance is utilized to construct the objective function of an optimization problem. The objective function is defined as the Bhattacharyya distance between the samples of numerical prediction and the samples of the target data. The comparison study is performed on a four degrees-of-freedom mass-spring system. A challenging task is raised in this example by assigning different distributions to the parameters with imprecise distribution coefficients. This requires the stochastic updating procedure to calibrate not the parameters themselves, but their distribution properties. The second example employs the GARTEUR SM-AG19 benchmark structure to demonstrate the feasibility of the Bhattacharyya distance in the presence of practical experiment uncertainty raising from measuring techniques, equipment, and subjective randomness. The results demonstrate the Bhattacharyya distance as a comprehensive and universal uncertainty quantification metric in stochastic model updating.

KW - Bayesian model updating

KW - Bhattacharyya distance

KW - Markov chain Monte Carlo

KW - Optimization model updating

KW - Uncertainty quantification

UR - http://www.scopus.com/inward/record.url?scp=85126909447&partnerID=8YFLogxK

U2 - 10.1115/1.4050168

DO - 10.1115/1.4050168

M3 - Article

VL - 7

JO - ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering

JF - ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering

SN - 2332-9017

IS - 2

M1 - 020903

ER -

Von denselben Autoren