In this article we investigate model order reduction of large-scale systems using frequency-limited balanced truncation, which restricts the well known balanced truncation framework to prescribed frequency regions. The main emphasis is put on the efficient numerical realization of this model reduction approach. We discuss numerical methods to take care of the involved matrix-valued functions. The occurring large-scale Lyapunov equations are solved for low-rank approximations for which we also establish results regarding the eigenvalues of their solutions. These results, and also numerical experiments, will show that the eigenvalues of the Lyapunov solutions in frequency-limited balanced truncation often decay faster than those in standard balanced truncation. Moreover, we show in further numerical examples that frequency-limited balanced truncation generates reduced order models which are significantly more accurate in the considered frequency region.
5 June 2018 in Advances in Computational Mathematics
In this article we investigate model order reduction of large-scale systems using time-limited balanced truncation, which restricts the well known balanced truncation framework to prescribed finite time intervals. The main emphasis is on the efficient numerical realization of this model reduction approach in case of large system dimensions. We discuss numerical methods to deal with the resulting matrix exponential functions and Lyapunov equations which are solved for low-rank approximations. Our main tool for this purpose are rational Krylov subspace methods. We also discuss the eigenvalue decay and numerical rank of the solutions of the Lyapunov equations. These results, and also numerical experiments, will show that depending on the final time horizon, the numerical rank of the Lyapunov solutions in time-limited balanced truncation can be smaller compared to standard balanced truncation. In numerical experiments we test the approaches for computing low-rank factors of the involved Lyapunov solutions and illustrate that time-limited balanced truncation can generate reduced order models having a higher accuracy in the considered time region.
This paper introduces a new algorithm for solving large-scale continuous-time algebraic Riccati equations (CARE). The advantage of the new algorithm is in its immediate and efficient low-rank formulation, which is a generalization of the Cholesky-factored variant of the Lyapunov ADI method. We discuss important implementation aspects of the algorithm, such as reducing the use of complex arithmetic and shift selection strategies. We show that there is a very tight relation between the new algorithm and three other algorithms for CARE previously known in the literature—all of these seemingly different methods in fact produce exactly the same iterates when used with the same parameters: they are algorithmically different descriptions of the same approximation sequence to the Riccati solution.
1 January 2020 in SIAM Journal on Scientific Computing
In this paper, we discuss numerical methods for solving large-scale continuous-time algebraic Riccati equations. These methods have been the focus of intensive research in recent years, and signifi...
1 May 2014 in Computers & Mathematics with Applications