The University of Southampton
University of Southampton Institutional Repository

Optimization or Bayesian strategy? Performance of the Bhattacharyya distance in different algorithms of stochastic model updating

Optimization or Bayesian strategy? Performance of the Bhattacharyya distance in different algorithms of stochastic model updating
Optimization or Bayesian strategy? Performance of the Bhattacharyya distance in different algorithms of stochastic model updating

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.

Bayesian model updating, Bhattacharyya distance, Markov chain Monte Carlo, Optimization model updating, Uncertainty quantification
2332-9017
Bi, Sifeng
93deb24b-fda1-4b18-927b-6225976d8d3f
Beer, Michael
e44760ce-70c0-44f2-bb18-7197ba142788
Zhang, Jingrui
afac4b75-2f8f-4a16-b22d-d76f4769d9d9
Yang, Lechang
12a2094d-c344-4479-8307-a16f1b9d3f66
He, Kui
eb773930-5a33-4187-8e81-bfe99159fdf4
Bi, Sifeng
93deb24b-fda1-4b18-927b-6225976d8d3f
Beer, Michael
e44760ce-70c0-44f2-bb18-7197ba142788
Zhang, Jingrui
afac4b75-2f8f-4a16-b22d-d76f4769d9d9
Yang, Lechang
12a2094d-c344-4479-8307-a16f1b9d3f66
He, Kui
eb773930-5a33-4187-8e81-bfe99159fdf4

Bi, Sifeng, Beer, Michael, Zhang, Jingrui, Yang, Lechang and He, Kui (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), [020903]. (doi:10.1115/1.4050168). (In Press)

Record type: Article

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.

Text
Pre-print - RISK-20-1070
Download (1MB)

More information

Accepted/In Press date: 23 April 2021
Additional Information: Publisher Copyright: Copyright VC 2021 by ASME
Keywords: Bayesian model updating, Bhattacharyya distance, Markov chain Monte Carlo, Optimization model updating, Uncertainty quantification

Identifiers

Local EPrints ID: 490438
URI: http://eprints.soton.ac.uk/id/eprint/490438
ISSN: 2332-9017
PURE UUID: 5e36a661-325a-40b4-b3b9-b71d99ba8ac9
ORCID for Sifeng Bi: ORCID iD orcid.org/0000-0002-8600-8649

Catalogue record

Date deposited: 28 May 2024 16:43
Last modified: 01 Jun 2024 02:09

Export record

Altmetrics

Contributors

Author: Sifeng Bi ORCID iD
Author: Michael Beer
Author: Jingrui Zhang
Author: Lechang Yang
Author: Kui He

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×