@inproceedings{126b89d3e94b451f88dc6631bc36af3c,

title = "Approximate interval method for epistemic uncertainty propagation using Polynomial Chaos and evidence theory",

abstract = "The paper builds upon a recent approach to find the approximate bounds of a real function using Polynomial Chaos expansions. Given a function of random variables with compact support probability distributions, the intuition is to quantify the uncertainty in the response using Polynomial Chaos expansion and discard all the information provided about the randomness of the output and extract only the bounds of its compact support. To solve for the bounding range of polynomials, we transform the Polynomial Chaos expansion in the Bernstein form, and use the range enclosure property of Bernstein polynomials to find the minimum and maximum value of the response. This procedure is used to propagate Dempster-Shafer structures on closed intervals through non-linear functions and it is applied on an algebraic challenge problem.",

author = "Gabriel Terejanu and Puneet Singla and Tarunraj Singh and Scott, {Peter D.}",

note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",

year = "2010",

doi = "10.1109/acc.2010.5530816",

language = "English (US)",

isbn = "9781424474264",

series = "Proceedings of the 2010 American Control Conference, ACC 2010",

publisher = "IEEE Computer Society",

pages = "349--354",

booktitle = "Proceedings of the 2010 American Control Conference, ACC 2010",

address = "United States",

}