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: 4.911 Factor de Impacto de 5 años: 3.179 SJR: 1.008 SNIP: 0.983 CiteScore™: 5.2

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

Acceso abierto

International Journal for Uncertainty Quantification

DOI: 10.1615/Int.J.UncertaintyQuantification.2012004138
pages 413-439

ITERATIVE METHODS FOR SCALABLE UNCERTAINTY QUANTIFICATION IN COMPLEX NETWORKS

Amit Surana
United Technologies Research Center, East Hartford, Connecticut 06118, USA
Tuhin Sahai
United Technologies Research Center, East Hartford, Connecticut 06118, USA
Andrzej Banaszuk
United Technologies Research Center, East Hartford, Connecticut 06118, USA

SINOPSIS

In this paper we address the problem of uncertainty management for robust design, and verification of large dynamic networks whose performance is affected by an equally large number of uncertain parameters. Many such networks (e.g., power, thermal, and communication networks) are often composed of weakly interacting subnetworks. We propose intrusive and nonintrusive iterative schemes that exploit such weak interconnections to overcome the dimensionality curse associated with traditional uncertainty quantification methods (e.g., generalized polynomial chaos, probabilistic collocation) and accelerate uncertainty propagation in systems with a large number of uncertain parameters. This approach relies on integrating graph theoretic methods and waveform relaxation with generalized polynomial chaos, and probabilistic collocation, rendering these techniques scalable. We introduce an approximate Galerkin projection that based on the results of graph decomposition computes "strong" and "weak" influence of parameters on states. An appropriate order of expansion, in terms of the parameters, is then selected for the various states. We analyze convergence properties of this scheme and illustrate it in several examples.


Articles with similar content:

DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING
International Journal for Uncertainty Quantification, Vol.4, 2014, issue 1
Bert J. Debusschere, Habib N. Najm, Peter Thornton, Cosmin Safta, Khachik Sargsyan, Daniel Ricciuto
HESSIAN-BASED SAMPLING FOR HIGH-DIMENSIONAL MODEL REDUCTION
International Journal for Uncertainty Quantification, Vol.9, 2019, issue 2
Omar Ghattas, Peng Chen
A MULTI-INDEX MARKOV CHAIN MONTE CARLO METHOD
International Journal for Uncertainty Quantification, Vol.8, 2018, issue 1
Ajay Jasra, Yan Zhou, Kengo Kamatani, Kody J.H. Law
POLYNOMIAL CHAOS FOR SEMIEXPLICIT DIFFERENTIAL ALGEBRAIC EQUATIONS OF INDEX 1
International Journal for Uncertainty Quantification, Vol.3, 2013, issue 1
Roland Pulch
AN ENSEMBLE KALMAN FILTER USING THE CONJUGATE GRADIENT SAMPLER
International Journal for Uncertainty Quantification, Vol.3, 2013, issue 4
Heikki Haario, Antti Solonen, Albert Parker, Marylesa Howard, Johnathan M. Bardsley