A flexible numerical approach for quantification of epistemic uncertainty

  • Authors:
  • Xiaoxiao Chen;Eun-Jae Park;Dongbin Xiu

  • Affiliations:
  • Department of Mathematics, Purdue University, West Lafayette, IN 47907, USA;Department of Computational Science & Engineering, Yonsei University, Seoul 120-749, Republic of Korea;Department of Mathematics, Purdue University, West Lafayette, IN 47907, USA and Department of Mathematics, and Scientific Computing and Imagining Institute University of Utah, Salt Lake City, UT 8 ...

  • Venue:
  • Journal of Computational Physics
  • Year:
  • 2013

Quantified Score

Hi-index 31.45

Visualization

Abstract

In the field of uncertainty quantification (UQ), epistemic uncertainty often refers to the kind of uncertainty whose complete probabilistic description is not available, largely due to our lack of knowledge about the uncertainty. Quantification of the impacts of epistemic uncertainty is naturally difficult, because most of the existing stochastic tools rely on the specification of the probability distributions and thus do not readily apply to epistemic uncertainty. And there have been few studies and methods to deal with epistemic uncertainty. A recent work can be found in [J. Jakeman, M. Eldred, D. Xiu, Numerical approach for quantification of epistemic uncertainty, J. Comput. Phys. 229 (2010) 4648-4663], where a framework for numerical treatment of epistemic uncertainty was proposed. The method is based on solving an encapsulation problem, without using any probability information, in a hypercube that encapsulates the unknown epistemic probability space. If more probabilistic information about the epistemic variables is known a posteriori, the solution statistics can then be evaluated at post-process steps. In this paper, we present a new method, similar to that of Jakeman et al. but significantly extending its capabilities. Most notably, the new method (1) does not require the encapsulation problem to be in a bounded domain such as a hypercube; (2) does not require the solution of the encapsulation problem to converge point-wise. In the current formulation, the encapsulation problem could reside in an unbounded domain, and more importantly, its numerical approximation could be sought in L^p norm. These features thus make the new approach more flexible and amicable to practical implementation. Both the mathematical framework and numerical analysis are presented to demonstrate the effectiveness of the new approach.