اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFrequency- and Time-Limited Balanced Truncation for Large-Scale Second-Order Systems
66
0
0.0
(
0
)
نشر من قبل
Steffen W. R. Werner
تاريخ النشر
2020
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 frequency 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.
قيم البحث
اقرأ أيضاً
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.
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 commun
ication 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.
Floating offshore structures often exhibit low-frequency oscillatory motions in the horizontal plane, with amplitudes in the same order as their characteristic dimensions and larger than the corresponding wave-frequency responses, making the traditio
nal formulations in an inertial coordinate system inconsistent and less applicable. To address this issue, we explore an alternative formulation completely based on a non-inertial body-fixed coordinate system. Unlike the traditional seakeeping models, this formulation consistently allows for large-amplitude horizontal motions. A numerical model based on a higher-order boundary element is applied to solve the resulting boundary-value problems in the time domain. A new set of explicit time-integration methods, which do not necessitate the use of upwind schemes for spatial derivatives, are designed to deal with the convective-type free-surface conditions. To suppress the weak saw-tooth instabilities on the free surface in time marching, we also present novel low-pass filters based on optimized weighted-least-squares, which are in principle applicable for both structured and unstructured meshes. For ship seakeeping and added resistance analyses, we show that the present computational model does not need to use soft-springs for surge and sway, in contrast to the traditional models. For a spar floating offshore wind turbine (FOWT), the importance of consistently taking into account the effects of large horizontal motions is demonstrated considering the bi-chromatic incident waves. The present model is also referred to as a complete 2nd order wave-load model, as all the 2nd order wave loads, including the sum-frequency and difference-frequency components, are solved simultaneously.
Large-scale network systems describe a wide class of complex dynamical systems composed of many interacting subsystems. A large number of subsystems and their high-dimensional dynamics often result in highly complex topology and dynamics, which pose
challenges to network management and operation. This chapter provides an overview of reduced-order modeling techniques that are developed recently for simplifying complex dynamical networks. In the first part, clustering-based approaches are reviewed, which aim to reduce the network scale, i.e., find a simplified network with a fewer number of nodes. The second part presents structure-preserving methods based on generalized balanced truncation, which can reduce the dynamics of each subsystem.
We introduce ADAHESSIAN, a second order stochastic optimization algorithm which dynamically incorporates the curvature of the loss function via ADAptive estimates of the HESSIAN. Second order algorithms are among the most powerful optimization algori
thms with superior convergence properties as compared to first order methods such as SGD and Adam. The main disadvantage of traditional second order methods is their heavier per iteration computation and poor accuracy as compared to first order methods. To address these, we incorporate several novel approaches in ADAHESSIAN, including: (i) a fast Hutchinson based method to approximate the curvature matrix with low computational overhead; (ii) a root-mean-square exponential moving average to smooth out variations of the Hessian diagonal across different iterations; and (iii) a block diagonal averaging to reduce the variance of Hessian diagonal elements. We show that ADAHESSIAN achieves new state-of-the-art results by a large margin as compared to other adaptive optimization methods, including variants of Adam. In particular, we perform extensive tests on CV, NLP, and recommendation system tasks and find that ADAHESSIAN: (i) achieves 1.80%/1.45% higher accuracy on ResNets20/32 on Cifar10, and 5.55% higher accuracy on ImageNet as compared to Adam; (ii) outperforms AdamW for transformers by 0.13/0.33 BLEU score on IWSLT14/WMT14 and 2.7/1.0 PPL on PTB/Wikitext-103; (iii) outperforms AdamW for SqueezeBert by 0.41 points on GLUE; and (iv) achieves 0.032% better score than Adagrad for DLRM on the Criteo Ad Kaggle dataset. Importantly, we show that the cost per iteration of ADAHESSIAN is comparable to first order methods, and that it exhibits robustness towards its hyperparameters.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
