HANKEL MODEL REDUCTION WITHOUT BALANCING - A DESCRIPTOR APPROACH.

M. G. Safonov; R. Y. Chiang; D. J.N. Limebeer

doi:10.1109/cdc.1987.272701

HANKEL MODEL REDUCTION WITHOUT BALANCING - A DESCRIPTOR APPROACH.

M. G. Safonov, R. Y. Chiang, D. J.N. Limebeer

University of Southern California

Research output: Contribution to journal › Conference article › peer-review

32 Citations (Scopus)

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.

Original language	English
Pages (from-to)	112-117
Number of pages	6
Journal	Proceedings of the IEEE Conference on Decision and Control
DOIs	https://doi.org/10.1109/cdc.1987.272701
Publication status	Published - 1987
Externally published	Yes

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Access to Document

10.1109/cdc.1987.272701

Cite this

@article{fa606d9fe2494f04b92176b917c730e1,

title = "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.",

author = "Safonov, {M. G.} and Chiang, {R. Y.} and Limebeer, {D. J.N.}",

year = "1987",

doi = "10.1109/cdc.1987.272701",

language = "English",

pages = "112--117",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - HANKEL MODEL REDUCTION WITHOUT BALANCING - A DESCRIPTOR APPROACH.

AU - Safonov, M. G.

AU - Chiang, R. Y.

AU - Limebeer, D. J.N.

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023591501&partnerID=8YFLogxK

U2 - 10.1109/cdc.1987.272701

DO - 10.1109/cdc.1987.272701

M3 - Conference article

AN - SCOPUS:0023591501

SN - 0191-2216

SP - 112

EP - 117

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

ER -

HANKEL MODEL REDUCTION WITHOUT BALANCING - A DESCRIPTOR APPROACH.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this