Доступ предоставлен для: 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.2016017192
pages 23-56

COMPARISON OF LINEARIZATION AND GRAPH CLUSTERING METHODS FOR UNCERTAINTY QUANTIFICATION OF LARGE SCALE DYNAMICAL SYSTEMS

Arpan Mukherjee
Materials Design and Innovation Department of University at Buffalo-SUNY, Buffalo, NY
Rahul Rai
Mechanical and Aerospace Engineering Department of University at Buffalo-SUNY, Buffalo, New York, 14260, USA
Puneet Singla
Mechanical and Aerospace Engineering Department of University at Buffalo-SUNY, Buffalo, New York, 14260, USA; Aerospace Engineering Dept. of Pennsylvania State University, State College, PA
Tarunraj Singh
Mechanical and Aerospace Engineering Department of University at Buffalo-SUNY, Buffalo, New York, 14260, USA
Abani K. Patra
Mechanical and Aerospace Engineering Department of University at Buffalo-SUNY, Buffalo, New York, 14260, USA

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

The behavior of large nonlinear dynamic systems underlying complex networked systems is hard to predict. Uncertainty quantification (UQ) in such systems by conventional methods requires high computational time, and the accuracy obtained in estimating the state variables can also be low. This paper presents a novel computational method focused on performing effective uncertainty quantification in large networked systems comprising weakly coupled subsystems (WCSs). Our approach to model complex systems is to represent them as networks (graphs) whose nodes represent the dynamical units, and whose links stand for the interactions between them. We present time-domain and space-domain linearization techniques and outline a framework that integrates the concept of linearization with graph clustering algorithm to identify WCSs in high-dimensional complex networks. The outlined technique enables identification of WCSs and thus facilitates effective UQ. The work presented in this paper also highlights the review and analytic comparison of a couple of clustering techniques [spectral clustering (SC) and non-negative matrix factorization (NMF)] that are applicable in the domain of UQ of large scale dynamical systems. The SC and NMF based clustering methods have been applied to study the UQ of scalable coupled oscillators. A new metric has been developed to compare the performance of the clustering algorithms in the UQ domain. Also, key factors that affect the performance of the algorithms have been identified. We also present the results of the statistical analysis to identify the key factors contributing to the performance of the clustering based system decomposition framework.