Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
Applied Numerical Mathematics
Krylov subspace methods for large-scale matrix problems in control
Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control
A note on stability in model reduction
International Journal of Systems Science
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
This paper considers an implicitly restarted Krylov subspace method that approximates a stable, linear transfer function $f(s)$ of order $n$ by one of order $m$, where $n\gg m$. It is well known that oblique projections onto a Krylov subspace may generate unstable partial realizations. To remedy this situation, the oblique projectors obtained via classical Krylov subspace methods are supplemented with further projectors which enable the formation of stable partial realizations directly from $f(s)$. A key feature of this process is that it may be incorporated into an implicit restart scheme. A second difficulty arises from the fact that Krylov subspace methods often generate partial realizations that contain nonessential modes. To this end, balanced truncation may be employed to discard the unwanted part of the reduced-order model. This paper proposes oblique projection methods for large-scale model reduction that simultaneously compute stable reduced-order models while discarding all nonessential modes. It is shown that both of these tasks may be effected by a single oblique projection process. Furthermore, the process is shown to naturally fit into an implicit restart framework. The theoretical properties of these methods are thoroughly investigated, and exact low-dimensional expressions for the $\L^{\infty}$-norm of the residual errors are derived. Finally, the behavior of the algorithm is illustrated on two large-scale examples.