اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBalanced Truncation Model Reduction of Nonstationary Systems Interconnected over Arbitrary Graphs
56
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper deals with the balanced truncation model reduction of discrete-time, linear time-varying, heterogeneous subsystems interconnected over finite arbitrary directed graphs. The information transfer between the subsystems is subject to a communication latency of one time-step. The presented method guarantees the preservation of the interconnection structure and further allows for its simplification. In addition to truncating temporal states associated with the subsystems, the method allows for the order reduction of spatial states associated with the interconnections between the subsystems and even the removal of whole interconnections. Upper bounds on the l2-induced norm of the resulting error system are derived. The proposed method is illustrated through an example.
قيم البحث
اقرأ أيضاً
This paper studies model order reduction of multi-agent systems consisting of identical linear passive subsystems, where the interconnection topology is characterized by an undirected weighted graph. Balanced truncation based on a pair of specificall
y selected generalized Gramians is implemented on the asymptotically stable part of the full-order network model, which leads to a reduced-order system preserving the passivity of each subsystem. Moreover, it is proven that there exists a coordinate transformation to convert the resulting reduced-order model to a state-space model of Laplacian dynamics. Thus, the proposed method simultaneously reduces the complexity of the network structure and individual agent dynamics, and it preserves the passivity of the subsystems and the synchronization of the network. Moreover, it allows for the a priori computation of a bound on the approximation error. Finally, the feasibility of the method is demonstrated by an example.
Considering the use of dynamical systems in practical applications, often only limited regions in the time or frequency domain are of interest. Therefor, it usually pays off to compute local approximations of the used dynamical systems in the frequen
cy and time domain. In this paper, we consider a structure-preserving extension of the frequency- and time-limited balanced truncation methods to second-order dynamical systems. We give a full overview about the first-order limited balanced truncation methods and extend those methods to second-order systems by using the different second-order balanced truncation formulas from the literature. Also, we present numerical methods for solving the arising large-scale sparse matrix equations and give numerical modifications to deal with the problematic case of second-order systems. The results are then illustrated on three numerical examples.
Dynamic mode decomposition (DMD) is a data-driven technique used for capturing the dynamics of complex systems. DMD has been connected to spectral analysis of the Koopman operator, and essentially extracts spatial-temporal modes of the dynamics from
an estimate of the Koopman operator obtained from data. Recent work of Proctor, Brunton, and Kutz has extended DMD and Koopman theory to accommodate systems with control inputs: dynamic mode decomposition with control (DMDc) and Koopman with inputs and control (KIC). In this paper, we introduce a technique, called Network dynamic mode decomposition with control, or Network DMDc, which extends the DMDc to interconnected, or networked, control systems. Additionally, we provide an adaptation of Koopman theory for networks as a context in which to perform this algorithm. The Network DMDc method carefully analyzes the dynamical relationships only between components in systems which are connected in the network structure. By focusing on these direct dynamical connections and cutting out computation for relationships between unconnected components, this process allows for improvements in computational intensity and accuracy.
Network systems consist of subsystems and their interconnections, and provide a powerful framework for analysis, modeling and control of complex systems. However, subsystems may have high-dimensional dynamics, and the amount and nature of interconnec
tions may also be of high complexity. Therefore, it is relevant to study reduction methods for network systems. An overview on reduction methods for both the topological (interconnection) structure of the network and the dynamics of the nodes, while preserving structural properties of the network, and taking a control systems perspective, is provided. First topological complexity reduction methods based on graph clustering and aggregation are reviewed, producing a reduced-order network model. Second, reduction of the nodal dynamics is considered by using extensions of classical methods, while preserving the stability and synchronization properties. Finally, a structure-preserving generalized balancing method for simplifying simultaneously the topological structure and the order of the nodal dynamics is treated.
Suppressing vibrations in mechanical models, usually described by second-order dynamical systems, is a challenging task in mechanical engineering in terms of computational resources even nowadays. One remedy is structure-preserving model order reduct
ion to construct easy-to-evaluate surrogates for the original dynamical system having the same structure. In our work, we present an overview of our recently developed structure-preserving model reduction methods for second-order systems. These methods are based on modal and balanced truncation in different variants, as well as on rational interpolation. Numerical examples are used to illustrate the effectiveness of all described methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
