Доступ предоставлен для: Guest
Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции
International Journal for Uncertainty Quantification
Импакт фактор: 3.259 5-летний Импакт фактор: 2.547 SJR: 0.417 SNIP: 0.8 CiteScore™: 1.52

ISSN Печать: 2152-5080
ISSN Онлайн: 2152-5099

Свободный доступ

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

Краткое описание

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:

COMPARISON OF LINEARIZATION AND GRAPH CLUSTERING METHODS FOR UNCERTAINTY QUANTIFICATION OF LARGE SCALE DYNAMICAL SYSTEMS
International Journal for Uncertainty Quantification, Vol.7, 2017, issue 1
Abani K. Patra, Puneet Singla, Rahul Rai, Arpan Mukherjee, Tarunraj Singh
A PRIORI ERROR ANALYSIS OF STOCHASTIC GALERKIN PROJECTION SCHEMES FOR RANDOMLY PARAMETRIZED ORDINARY DIFFERENTIAL EQUATIONS
International Journal for Uncertainty Quantification, Vol.6, 2016, issue 4
Christophe Audouze , Prasanth B. Nair
MODELING HETEROGENEITY IN NETWORKS USING POLYNOMIAL CHAOS
International Journal for Multiscale Computational Engineering, Vol.14, 2016, issue 3
Ioannis G. Kevrekidis, Carlo R. Laing, Constantinos I. Siettos, Karthikeyan Rajendran, Andreas C. Tsoumanis
PROPERTY & FIELD DARBOUX TRANSFORMATIONS (PROFIDT METHOD): A VERSATILE TOOLBOX FOR GENERATING EXACT ANALYTICAL SOLUTIONS TO DIFFUSION-LIKE AND WAVE-LIKE EQUATIONS IN GRADED MEDIA
International Heat Transfer Conference 16, Vol.2, 2018, issue
Jean-Claude Krapez
DIFFERENTIAL CONSTRAINTS FOR THE PROBABILITY DENSITY FUNCTION OF STOCHASTIC SOLUTIONS TO THE WAVE EQUATION
International Journal for Uncertainty Quantification, Vol.2, 2012, issue 3
George Em Karniadakis, Daniele Venturi