.png){kind=icon}
Return
Higher-order probabilistic sensitivity calculations using the multicomplex score function method
.png){kind=icon}
OA
AI
DOI：10.1016/j.probengmech.2015.12.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The score function method used to compute first order probabilistic sensitivities is extended in this work to arbitrary-order derivatives included mixed partial derivatives through the use of multicomplex mathematics. Multicomplex mathematics provides an effective and convenient numerical means to compute the high-order kernel functions with respect to natural parameters or moments (mean and. standard deviation) obviating the need to analytically determine the kernel functions. Using these numerical kernel functions, high-order derivatives of the response moments or the probability-of-failure with respect to the parameters of the input distributions can be obtained. Numerical results indicate that the high-order probabilistic sensitivities converge with respect to the number of samples at the same rate as standard Monte Carlo estimates. Implementation of multicomplex mathematics is facilitated through the use of the Cauchy-Riemann matrices; therefore, the extension of common engineering probability distributions to matrix form is presented. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Score function
Sensitivity analysis
Complex Taylor series expansion
Multicomplex-step differentiation method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
1.7K
Citations:
4.1K