Abstract
A basis-free descriptor system representation is shown to facilitate the computation of all minimum-degree and optimal k th-order all-pass extensions and Hankel-norm approximants. The descriptor representation has the same simple form for both the optimal and suboptimal cases. The method makes Hankel model reduction practical for nonminimal and nearly nonminimal systems by eliminating the ill-conditioned calculation of a minimal balanced realization. A simple, numerically sound method based on singular-value decomposition enables the results to be expressed in state-space form.
Original language | English |
---|---|
Pages (from-to) | 496-502 |
Number of pages | 7 |
Journal | IEEE Transactions on Automatic Control |
Volume | 35 |
Issue number | 4 |
DOIs | |
Publication status | Published - Apr 1990 |
Externally published | Yes |
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering