The Bhattacharyya distance: Enriching the P-box in stochastic sensitivity analysis

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

Externe Organisationen

  • Northwestern Polytechnical University
  • The University of Liverpool
  • Tongji University
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)265-281
Seitenumfang17
FachzeitschriftMechanical Systems and Signal Processing
Jahrgang129
Frühes Online-Datum24 Apr. 2019
PublikationsstatusVeröffentlicht - 15 Aug. 2019

Abstract

The tendency of uncertainty analysis has promoted the transformation of sensitivity analysis from the deterministic sense to the stochastic sense. This work proposes a stochastic sensitivity analysis framework using the Bhattacharyya distance as a novel uncertainty quantification metric. The Bhattacharyya distance is utilised to provide a quantitative description of the P-box in a two-level procedure for both aleatory and epistemic uncertainties. In the first level, the aleatory uncertainty is quantified by a Monte Carlo process within the probability space of the cumulative distribution function. For each sample of the Monte Carlo simulation, the second level is performed to propagate the epistemic uncertainty by solving an optimisation problem. Subsequently, three sensitivity indices are defined based on the Bhattacharyya distance, making it possible to rank the significance of the parameters according to the reduction and dispersion of the uncertainty space of the system outputs. A tutorial case study is provided in the first part of the example to give a clear understanding of the principle of the approach with reproducible results. The second case study is the NASA Langley challenge problem, which demonstrates the feasibility of the proposed approach, as well as the Bhattacharyya distance metric, in solving such a large-scale, strong-nonlinear, and complex problem.

ASJC Scopus Sachgebiete

Zitieren

The Bhattacharyya distance: Enriching the P-box in stochastic sensitivity analysis. / Bi, Sifeng; Broggi, Matteo; Wei, Pengfei et al.
in: Mechanical Systems and Signal Processing, Jahrgang 129, 15.08.2019, S. 265-281.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Bi S, Broggi M, Wei P, Beer M. The Bhattacharyya distance: Enriching the P-box in stochastic sensitivity analysis. Mechanical Systems and Signal Processing. 2019 Aug 15;129:265-281. Epub 2019 Apr 24. doi: 10.1016/j.ymssp.2019.04.035
Bi, Sifeng ; Broggi, Matteo ; Wei, Pengfei et al. / The Bhattacharyya distance : Enriching the P-box in stochastic sensitivity analysis. in: Mechanical Systems and Signal Processing. 2019 ; Jahrgang 129. S. 265-281.
Download
@article{af06ab6614f54e4789de76075df9ee52,
title = "The Bhattacharyya distance: Enriching the P-box in stochastic sensitivity analysis",
abstract = "The tendency of uncertainty analysis has promoted the transformation of sensitivity analysis from the deterministic sense to the stochastic sense. This work proposes a stochastic sensitivity analysis framework using the Bhattacharyya distance as a novel uncertainty quantification metric. The Bhattacharyya distance is utilised to provide a quantitative description of the P-box in a two-level procedure for both aleatory and epistemic uncertainties. In the first level, the aleatory uncertainty is quantified by a Monte Carlo process within the probability space of the cumulative distribution function. For each sample of the Monte Carlo simulation, the second level is performed to propagate the epistemic uncertainty by solving an optimisation problem. Subsequently, three sensitivity indices are defined based on the Bhattacharyya distance, making it possible to rank the significance of the parameters according to the reduction and dispersion of the uncertainty space of the system outputs. A tutorial case study is provided in the first part of the example to give a clear understanding of the principle of the approach with reproducible results. The second case study is the NASA Langley challenge problem, which demonstrates the feasibility of the proposed approach, as well as the Bhattacharyya distance metric, in solving such a large-scale, strong-nonlinear, and complex problem.",
keywords = "Bhattacharyya distance, Probability box, Sensitivity analysis, Uncertainty propagation, Uncertainty quantification",
author = "Sifeng Bi and Matteo Broggi and Pengfei Wei and Michael Beer",
note = "Funding Information: This is a work supported by the Alexander von Humboldt Foundation , which is greatly appreciated. ",
year = "2019",
month = aug,
day = "15",
doi = "10.1016/j.ymssp.2019.04.035",
language = "English",
volume = "129",
pages = "265--281",
journal = "Mechanical Systems and Signal Processing",
issn = "0888-3270",
publisher = "Academic Press Inc.",

}

Download

TY - JOUR

T1 - The Bhattacharyya distance

T2 - Enriching the P-box in stochastic sensitivity analysis

AU - Bi, Sifeng

AU - Broggi, Matteo

AU - Wei, Pengfei

AU - Beer, Michael

N1 - Funding Information: This is a work supported by the Alexander von Humboldt Foundation , which is greatly appreciated.

PY - 2019/8/15

Y1 - 2019/8/15

N2 - The tendency of uncertainty analysis has promoted the transformation of sensitivity analysis from the deterministic sense to the stochastic sense. This work proposes a stochastic sensitivity analysis framework using the Bhattacharyya distance as a novel uncertainty quantification metric. The Bhattacharyya distance is utilised to provide a quantitative description of the P-box in a two-level procedure for both aleatory and epistemic uncertainties. In the first level, the aleatory uncertainty is quantified by a Monte Carlo process within the probability space of the cumulative distribution function. For each sample of the Monte Carlo simulation, the second level is performed to propagate the epistemic uncertainty by solving an optimisation problem. Subsequently, three sensitivity indices are defined based on the Bhattacharyya distance, making it possible to rank the significance of the parameters according to the reduction and dispersion of the uncertainty space of the system outputs. A tutorial case study is provided in the first part of the example to give a clear understanding of the principle of the approach with reproducible results. The second case study is the NASA Langley challenge problem, which demonstrates the feasibility of the proposed approach, as well as the Bhattacharyya distance metric, in solving such a large-scale, strong-nonlinear, and complex problem.

AB - The tendency of uncertainty analysis has promoted the transformation of sensitivity analysis from the deterministic sense to the stochastic sense. This work proposes a stochastic sensitivity analysis framework using the Bhattacharyya distance as a novel uncertainty quantification metric. The Bhattacharyya distance is utilised to provide a quantitative description of the P-box in a two-level procedure for both aleatory and epistemic uncertainties. In the first level, the aleatory uncertainty is quantified by a Monte Carlo process within the probability space of the cumulative distribution function. For each sample of the Monte Carlo simulation, the second level is performed to propagate the epistemic uncertainty by solving an optimisation problem. Subsequently, three sensitivity indices are defined based on the Bhattacharyya distance, making it possible to rank the significance of the parameters according to the reduction and dispersion of the uncertainty space of the system outputs. A tutorial case study is provided in the first part of the example to give a clear understanding of the principle of the approach with reproducible results. The second case study is the NASA Langley challenge problem, which demonstrates the feasibility of the proposed approach, as well as the Bhattacharyya distance metric, in solving such a large-scale, strong-nonlinear, and complex problem.

KW - Bhattacharyya distance

KW - Probability box

KW - Sensitivity analysis

KW - Uncertainty propagation

KW - Uncertainty quantification

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

U2 - 10.1016/j.ymssp.2019.04.035

DO - 10.1016/j.ymssp.2019.04.035

M3 - Article

AN - SCOPUS:85064649167

VL - 129

SP - 265

EP - 281

JO - Mechanical Systems and Signal Processing

JF - Mechanical Systems and Signal Processing

SN - 0888-3270

ER -

Von denselben Autoren