HANKEL MODEL REDUCTION WITHOUT BALANCING - A DESCRIPTOR APPROACH.
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....
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
IEEE
1987
|
| Summary: | 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. |
|---|