Equivalence of methods for uncertainty propagation of real-valued random variables
From MaRDI portal
Publication:707243
DOI10.1016/j.ijar.2003.07.013zbMath1095.68118OpenAlexW1974961081MaRDI QIDQ707243
Helen M. Regan, Scott A. Ferson, Daniel J. Berleant
Publication date: 9 February 2005
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2003.07.013
Related Items (18)
An efficient uncertainty propagation method for parameterized probability boxes ⋮ Numerical accuracy and efficiency in the propagation of epistemic and aleatory uncertainties ⋮ On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems ⋮ Some properties of a random set approximation to upper and lower distribution functions ⋮ Unifying practical uncertainty representations. I. Generalized \(p\)-boxes ⋮ Utilizing belief functions for the estimation of future climate change ⋮ Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity ⋮ Propagation algorithm for hybrid uncertainty parameters based on polynomial chaos expansion ⋮ A generalization of \(p\)-boxes to affine arithmetic ⋮ Potential based clouds in robust design optimization ⋮ Probability boxes on totally preordered spaces for multivariate modelling ⋮ EMPIRICAL COMPARISON OF METHODS FOR THE HIERARCHICAL PROPAGATION OF HYBRID UNCERTAINTY IN RISK ASSESSMENT, IN PRESENCE OF DEPENDENCES ⋮ Computing best-possible bounds for the distribution of a sum of several variables is NP-hard ⋮ Geometric constructions with discretized random variables ⋮ Stochastic finite element methods for partial differential equations with random input data ⋮ Possibility theory and statistical reasoning ⋮ Risk-informed decision-making in the presence of epistemic uncertainty ⋮ Idempotent version of the Fréchet contingency array problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to copulas.
- Probabilistic arithmetic. I: Numerical methods for calculating convolutions and dependency bounds
- Best-possible bounds for the distribution of a sum -- a problem of Kolmogorov
- Bounding the results of arithmetic operations on random variables of unknown dependency using intervals
- Statool: A tool for distribution envelope determination (DEnv), an interval-based algorithm for arithmetic on random variables
- Measures of uncertainty in expert systems
- Arithmetic and other operations on Dempster-Shafer structures
- Estimates for the Distribution Function of a Sum of Two Random Variables When the Marginal Distributions are Fixed
This page was built for publication: Equivalence of methods for uncertainty propagation of real-valued random variables