Suscripción a Biblioteca: Guest
Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones
International Journal for Uncertainty Quantification
Factor de Impacto: 3.259 Factor de Impacto de 5 años: 2.547 SJR: 0.531 SNIP: 0.8 CiteScore™: 1.52

ISSN Imprimir: 2152-5080
ISSN En Línea: 2152-5099

Acceso abierto

International Journal for Uncertainty Quantification

DOI: 10.1615/Int.J.UncertaintyQuantification.2014010945
pages 49-72

A GRADIENT-BASED SAMPLING APPROACH FOR DIMENSION REDUCTION OF PARTIAL DIFFERENTIAL EQUATIONS WITH STOCHASTIC COEFFICIENTS

Miroslav Stoyanov
Applied Mathematics Group, Computer Science and Mathematics Division, Oak Ridge National Laboratory, 1 Bethel Valley Road, P.O. Box 2008, Oak Ridge TN 37831-6164
Clayton G. Webster
Department of Computational and Applied Mathematics, Oak Ridge National Laboratory, One Bethel Valley Road, P.O. Box 2008, MS-6164, Oak Ridge, Tennessee 37831-6164, USA

SINOPSIS

We develop a projection-based dimension reduction approach for partial differential equations with high-dimensional stochastic coefficients. This technique uses samples of the gradient of the quantity of interest (QoI) to partition the uncertainty domain into "active" and "passive" subspaces. The passive subspace is characterized by near-constant behavior of the quantity of interest, while the active subspace contains the most important dynamics of the stochastic system. We also present a procedure to project the model onto the low-dimensional active subspace that enables the resulting approximation to be solved using conventional techniques. Unlike the classical Karhunen-Loeve expansion, the advantage of this approach is that it is applicable to fully nonlinear problems and does not require any assumptions on the correlation between the random inputs. This work also provides a rigorous convergence analysis of the quantity of interest and demonstrates: at least linear convergence with respect to the number of samples. It also shows that the convergence rate is independent of the number of input random variables. Thus, applied to a reducible problem, our approach can approximate the statistics of the QoI to within desired error tolerance at a cost that is orders of magnitude lower than standard Monte Carlo. Finally, several numerical examples demonstrate the feasibility of our approach and are used to illustrate the theoretical results. In particular, we validate our convergence estimates through the application of this approach to a reactor criticality problem with a large number of random cross-section parameters.


Articles with similar content:

FORWARD AND INVERSE UNCERTAINTY QUANTIFICATION USING MULTILEVEL MONTE CARLO ALGORITHMS FOR AN ELLIPTIC NONLOCAL EQUATION
International Journal for Uncertainty Quantification, Vol.6, 2016, issue 6
Ajay Jasra, Yan Zhou, Kody J. H. Law
Toward a Nonintrusive Stochastic Multiscale Design System for Composite Materials
International Journal for Multiscale Computational Engineering, Vol.8, 2010, issue 6
Jacob Fish, Wei Wu
A STOPPING CRITERION FOR ITERATIVE SOLUTION OF STOCHASTIC GALERKIN MATRIX EQUATIONS
International Journal for Uncertainty Quantification, Vol.6, 2016, issue 3
Christophe Audouze , Pär Håkansson, Prasanth B. Nair
UTILIZING ADJOINT-BASED ERROR ESTIMATES FOR SURROGATE MODELS TO ACCURATELY PREDICT PROBABILITIES OF EVENTS
International Journal for Uncertainty Quantification, Vol.8, 2018, issue 2
Timothy Wildey, Troy Butler
STOCHASTIC MULTIOBJECTIVE OPTIMIZATION ON A BUDGET: APPLICATION TO MULTIPASS WIRE DRAWING WITH QUANTIFIED UNCERTAINTIES
International Journal for Uncertainty Quantification, Vol.8, 2018, issue 3
Pramod Zagade, Jitesh Panchal, B. P. Gautham, Ilias Bilionis, Piyush Pandita, Amol Joshi