Iterative Methods for Scalable Uncertainty Quantification in Complex Networks

Details Iterative Methods for Scalable Uncertainty Quantification in Complex Networks Iterative Methods for Scalable Uncertainty Quantification in Complex Networks

2011-10-11

arxiv.org/abs/1110.2435v1

Statistics

Computation

Scientific paper

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 non-intrusive iterative schemes that exploit such weak interconnections to overcome dimensionality curse associated with traditional uncertainty quantification methods (e.g. generalized Polynomial Chaos, Probabilistic Collocation) and accelerate uncertainty propagation in systems with 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 analyze convergence properties of this scheme and illustrate it on several examples.

Affiliated with

Also associated with

No associations

Rating

Iterative Methods for Scalable Uncertainty Quantification in Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iterative Methods for Scalable Uncertainty Quantification in Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative Methods for Scalable Uncertainty Quantification in Complex Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472357