A selection of algorithms for the rational approximation of matrix-valued functions are discussed, including variants of the interpolatory adaptive Antoulas--Anderson (AAA) method, the rational Kry...
28 February 2022 in SIAM Journal on Scientific Computing
We present a novel reformulation of balanced truncation, a classical model reduction method. The principal innovation that we introduce comes through the use of system response data that has been e...
28 February 2022 in Journal of Scientific Computing
We extend the Adaptive Antoulas-Anderson () algorithm to develop a data-driven modeling framework for linear systems with quadratic output (). Such systems are characterized by two transfer functions: one corresponding to the linear part of the output and another one to the quadratic part. We first establish the joint barycentric representations and the interpolation theory for the two transfer functions of systems. This analysis leads to the proposed algorithm. We show that by interpolating the transfer function values on a subset of samples together with imposing a least-squares minimization on the rest, we construct reliable data-driven models. Two numerical test cases illustrate the efficiency of the proposed method.
21 May 2018 in Advances in Computational Mathematics
We propose a model order reduction approach for balanced truncation of linear switched systems. Such systems switch among a finite number of linear subsystems or modes. We compute pairs of controllability and observability Gramians corresponding to each active discrete mode by solving systems of coupled Lyapunov equations. Depending on the type, each such Gramian corresponds to the energy associated to all possible switching scenarios that start or, respectively end, in a particular operational mode. In order to guarantee that hard to control and hard to observe states are simultaneously eliminated, we construct a transformed system, whose Gramians are equal and diagonal. Then, by truncation, directly construct reduced order models. One can show that these models preserve some properties of the original model, such as stability and that it is possible to obtain error bounds relating the observed output, the control input and the entries of the diagonal Gramians.
29 January 2020 in Advances in Computational Mathematics
We propose an extension of the Loewner framework to descriptor linear systems that preserves the DAE (differential algebraic equation) structure of the underlying system. More precisely, by means of post-processing the data, the behavior at infinity is matched. As it turns out, the conventional procedure constructs a reduced model by directly compressing the data and hence losing information at infinity. By transforming the matrix pencil composed of the E and A matrices into a generalized block diagonal form, we can separate the descriptor system into two subsystems; one corresponding to the polynomial part and the other to the strictly proper part of the transfer function. Different algorithms are implemented to transform the matrix pencil into block diagonal form. Furthermore, a data-driven splitting of the descriptor system can be achieved in the Loewner framework. Hence, the coefficients of the polynomial part can be estimated directly from data. Several numerical examples are presented to illustrate the theoretical discussion.