Search

This paper presents a series of structure-preserving model order reduction algorithms for K-power bilinear systems via Laguerre functions. The method first aims to rewritten the K-power bilinear system as a general bilinear system and calculate the approximate low-rank factors of the cross Gramian of the bilinear system by combining the idea of Laguerre functions expansion of the matrix exponential function. After that, the approximate balanced system of the K-power bilinear system is constructed by the corresponding projection transformation of each subsystem. In order to achieve the purpose of model order reduction, the states with smaller singular values are then truncated, so as to further obtain the reduced order model. For this approach, there is a disadvantage that unstable systems may be generated although the original one is stable. To alleviate the inadequacies of this approach, we have improved the model reduction procedure, which is based upon the dominant subspace projection method. In addition, we also carried out a correlation analysis on the stability of improved algorithms. Finally, numerical experiments are employed to substantiate the effectiveness of the presented algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we discuss the Krylov subspace-based model order reduction methods of second-order systems with time delays, and present two structure-preserving methods for model order reduction of these second-order systems, which avoid to convert the second-order systems into first-order ones. One method is based on a Krylov subspace by using the Taylor series expansion, the other method is based on the Laguerre series expansion. These two methods are used in the multi-order Arnoldi algorithm to construct the projection matrices. The resulting reduced models can not only preserve the structure of the original systems, but also can match a certain number of approximate moments or Laguerre expansion coefficients. The effectiveness of the proposed methods is demonstrated by two numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, the Arnoldi-based model reduction methods are employed to fractional order linear time-invariant systems. The resulting model has a smaller dimension, while its fractional order is the same as that of the original system. The error and stability of the reduced model are discussed. And to overcome the local convergence of Padé approximation, the multi-point Arnoldi algorithm, which can recursively generate a reduced-order orthonormal basis from the corresponding Krylov subspace, is used. Numerical examples are given to illustrate the accuracy and efficiency of the proposed methods. [ABSTRACT FROM AUTHOR]