Conference item
HANKEL MODEL REDUCTION WITHOUT BALANCING - A DESCRIPTOR APPROACH.
- Abstract:
- A basis-free descriptor system representation is shown to facilitate the computation of all minimum-degree and optimal kth- order all-pass extensions and Hankel-norm approximates. The descriptor representation has the same simple form for both the optimal and for the suboptimal minimum-degree cases. The method eliminates the need for the potentially ill-conditioned calculation of a minimal balanced, or partially balanced, realization of the system to be reduced. A simple, numerically sound method based on singular-value decomposition enables the results to be expressed in state-space form. A listing of PC-MATLAB code that implements the algorithm can be found in the authors' program LINF.
Actions
Authors
- Publisher:
- IEEE
- Host title:
- Proceedings of the IEEE Conference on Decision and Control
- Pages:
- 112-117
- Publication date:
- 1987-01-01
- ISSN:
-
0191-2216
- Pubs id:
-
pubs:327839
- UUID:
-
uuid:0be7f619-826d-4dc0-b7db-61bcb8d49484
- Local pid:
-
pubs:327839
- Source identifiers:
-
327839
- Deposit date:
-
2013-11-17
- ARK identifier:
Terms of use
- Copyright date:
- 1987
If you are the owner of this record, you can report an update to it here: Report update to this record