Frequency-domain generelaized singular peruturbation method for relative error model order reduction

Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT procedure that provides a general, structure-independent MOR framework to preserve both passivity and stability of original models. Its application toward large scale systems, however, has been limited by the complexity of solving large size continuous time algebraic Riccati equations (CAREs). This paper introduces a novel quadratic extension of the alternating direction implicit (ADI) iteration, called QADI, that efficiently solves a CARE. A Cholesky factor variant of QADI, called CFQADI, further exploits low rank matrices and and produces solution in factor form that greatly accelerates BST. Remarkable efficiency of the proposed BST/(CF)QADI integration is demonstrated with numerical examples.

Three-dimensional electromagnetic methods are fundamental tools for the analysis and design of high-speed systems. These methods often generate large systems of equations, and model order reduction (MOR) methods are used to reduce such a high complexity. When the geometric dimensions become electrically large or signal waveform rise times decrease, time delays must be included in the modeling. Design space optimization and exploration are usually performed during a typical design process that consequently requires repeated simulations for different design parameter values. Efficient performing of these design activities calls for parameterized model order reduction (PMOR) methods, which are able to reduce large systems of equations with respect to frequency and other design parameters of the circuit, such as layout or substrate features. We propose a novel PMOR method for neutral delayed differential systems, which is based on an efficient and reliable combination of univariate model order reduction methods, a procedure to find scaling and frequency shifting coefficients and positive interpolation schemes. The proposed scaling and frequency shifting coefficients enhance and improve the modeling capability of standard positive interpolation schemes and allow accurate modeling of highly dynamic systems with a limited amount of initial univariate models in the design space. The proposed method is able to provide parameterized reduced order models passive by construction over the design space of interest. Pertinent numerical examples validate the proposed PMOR approach.

Sample selection based on sensitivity analysis in parameterized model order reduction

Vibration and dissipation in vibro-acoustic systems can be assessed using frequency response analysis. Evaluating a frequency sweep on a full-order model can be very costly, so model order reduction methods are employed to compute cheap-to-evaluate surrogates. This work compares structure-preserving model reduction methods based on rational interpolation and balanced truncation with a specific focus on their applicability to vibro-acoustic systems. Such models typically exhibit a second-order structure and their material properties as well as their excitation may be depending on the driving frequency. We demonstrate the effectiveness of all considered methods in terms of their accuracy and computational cost by applying them to numerical models of vibro-acoustic systems depicting structural vibration, sound transmission, acoustic scattering, and poroelastic problems. The results of the experiments are extensively discussed to derive guidelines for the choice of model reduction methods based on the problem setting.

Studies a class of balanced truncation algorithms applicable to relative/multiplicative model reduction. These algorithms seek to balance the controllability gramian of a given transfer function and the observability gramian of its right inverse. For this reason, the algorithms are referred to as inverse-weighted balanced truncation (IWBT) algorithms. It is shown that by using IWBT algorithms one can derive relative and multiplicative L/sub /spl infin// error bounds that are known to hold for other reduction algorithms. It is also shown that the balanced stochastic truncation (BST) method is actually one special, but an optimal version of the IWBT algorithms. As such, the authors' result also serves to establish the fact that the available error bounds pertaining to BST algorithms actually hold for IWBT algorithms.

A new method for model order reduction for an important class of non-linear dynamical systems is proposed. The reduction technique is based on the frequency balanced reduction method within a desired frequency band and a developed Trajectory Piecewise-Linear (TPWL) model order reduction approach. Both the methods are recently developed techniques and they can increase the accuracy and efficiency of the reduction method. The computational load and memory are significantly reduced when the method is used in the hybrid reduction method. The accuracy enhanced hybrid method is applicable to very large scale non-linear models efficiently and accurately. The numerical results show the accuracy and efficiency enhancement of the proposed method.

This paper presents a framework for model order reduction based on Balanced Truncation (BT) method and Artificial Neural Networks (ANN). As social, architectural and technical models are witnessing rapid complexity increase, it has become essential to find solutions to obtain a lower complex version of models while still preserving the model integrity. The main idea of the proposed framework is to reduce uncertainty by cascading two different Model Order Reduction (MOR) approaches, the BT technique and the Jordan Recurrent Neural Network (JRNN). The reduced model obtained by the JRNN network is estimated using the Instrument Variable (IV) estimation approach. Finally, the BT reduced model and the estimated JRNN reduced model are cascaded to obtain the final reduced order version of the original plant. The cascading procedure takes the powerfulness of both techniques and present them in a single system capable to compensate for possible errors and uncertainties. Simulation results prove the efficiency of the proposed framework in terms of the deduction strength and the integrity level.

Sensitivity analysis of random linear differential–algebraic equations using system norms

Many new promising model order reduction (MOR) methods and algorithms were developed during the last decade. Industry and academic research institutions intend to test, validate, compare, and use these new promising MOR techniques with their own models. Therefore, an MOR toolbox bridging the gap between theoretical, algorithmic, and numerical developments to an end-user-oriented program, usable by non-experts, was developed called ‘Model Order Reduction of Elastic Multibody Systems’ (Morembs). A C++ implementation as well as a Matlab implementation including an intuitive graphical user interface is available. Import from various FE programs is possible, and the reduced elastic bodies can be exported to a variety of programs to simulate the compact models. In the course of the various projects, many improvements on the algorithmic side were added. As we learned over the years, there is not one ‘optimal’ MOR method. ‘Optimal’ MOR depends on circumstances, like boundary conditions, excitation spectra, further model usage. The toolbox is now used, e.g., in solid mechanics, biomechanics, vehicle dynamics, control of flexible structures, or crash simulations. In all these use cases, the toolbox allows the user to facilitate their well-known modeling and simulation environment. Only the critical MOR process during preprocessing is performed with Morembs, which helps to compare the various MOR techniques to find the most suited one.

The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typically gain efficiency by projecting the original system only onto one dominant subspace of the approximate system gramian (for instance using only controllability gramian). This single gramian reduction method can lead to large errors as the subspaces of controllability and observability can be quite different for general interconnects with unsymmetric system matrices. In this paper, we propose a fast balanced truncation method where the system is balanced in terms of two approximate gramians as achieved in the classical balanced truncation method. The novelty of the new method is that we can keep the similar computing costs of the single gramian method. The proposed algorithm is based on a generalized SVD-based balancing scheme such that the dominant subspace of the approximate gramian product can be obtained in a very efficient way without explicitly forming the gramians. Experimental results on a number of published benchmarks show that the proposed method is much more accurate than the single gramian method with similar computing costs.

Considering the use of dynamical systems in practical applications, often only limited regions in the time or frequency domain are of interest. Therefore, 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 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 deals with a new method for model order reduction of linear continuous time interval system. This new method is based on the Kharitonov’s theorem, the Stability equation method and the error minimization by Differential Evolution. The reduced order interval model is determined by using Kharitonov’s polynomials, which make use of the Kharitonov’s theorem and general form of the stability equation method for denominator, while the numerator is obtained by minimizing the integral square error between the transient responses of original and reduced order models using Differential Evolution algorithm. This method generates stable reduced order interval system if the original higher order system is stable and retains the steady-state value. The proposed method is illustrated with the help of typical numerical example considered from the literature.

In this paper, the authors propose a novel statistical model order reduction technique, called statistical spectrum model order reduction (SS-MOR) method, which considers both intra-die and inter-die process variations with spatial correlations. The SSMOR generates order-reduced variational models based on given variational circuits. The reduced model can be used for fast statistical performance analysis of interconnect circuits with variational input sources, such as power grid and clock networks. The SSMOR uses statistical spectrum method to compute the variational moments and Monte Carlo sampling method with the modified Krylov subspace reduction method to generate the variational reduced models. To consider spatial correlations, the authors apply orthogonal decomposition to map the correlated random variables into independent and uncorrelated variables. Experimental results show that the proposed method can deliver about 100times speedup over the pure Monte Carlo projection-based reduction method with about 2% of errors for both means and variances in statistical transient analysis

Brake squeal describes noise with different frequencies that can be emitted during the braking process. Typically, the frequencies are in the range of 1 to 16 kHz. Although the noise has virtually no effect on braking performance, strong attempts are made to identify and eliminate the noise as it can be very unpleasant and annoying. In the field of numerical simulation, the brake is typically modeled using the Finite Element method, and this results in a high‐dimensional equation of motion. For the analysis of brake squeal, gyroscopic and circulatory effects, as well as damping and friction, must be considered correctly. For the subsequent analysis, the high‐dimensional damped nonlinear equation system is linearized. This results in terms that are non‐symmetric and dependent on the rotational frequency of the brake rotor. Many parameter points to be evaluated implies many evaluations to determine the relevant parameters of the unstable system. In order to increase the efficiency of the process, the system is typically reduced with a truncated modal transformation. However, with this method the damping and the velocity‐dependent terms, which have a significant influence on the system, are neglected for the calculation of the eigenmodes, and this can lead to inaccurate reduced models. In this paper, we present results of other methods of model order reduction applied on an industrial high‐dimensional brake model. Using moment matching methods combined with parametric model order reduction, both the damping and the various parameter‐dependent terms of the brake model can be taken into account in the reduction step. Thus, better results in the frequency domain can be obtained. On the one hand, as usual in brake analysis, the complex eigenvalues are evaluated, but on the other hand also the transfer behavior in terms of the frequency response. In each case, the classical and the new reduction method are compared with each other.

We discuss methods for model order reduction (MOR) of linear systems with many input and output variables, arising in the modeling of linear (sub) circuits with a huge number of nodes and a large number of terminals, like power grids. Our work is based on the approaches SVDMOR and ESVDMOR proposed in recent publications (1; 2; 3; 4; 5). In particular, we discuss efficient numerical algorithms for their implementation. Only by using efficient tools from numerical linear algebra, these methods become applicable for truly large-scale problems.