Artículos de revistas
Model reduction of discrete time systems through linear matrix inequalities
Registro en:
International Journal Of Control. Taylor & Francis Ltd, v. 77, n. 10, n. 978, n. 984, 2004.
0020-7179
WOS:000224485900008
10.1080/00207170412331291854
Autor
Geromel, JC
Kawaoka, FRR
Egas, RG
Institución
Resumen
In this paper, model reduction of discrete time linear systems is revisited. The main objective is to define a convex programming problem expressed in terms of linear matrix inequalities which provides a good suboptimal solution to the model reduction problem. The quality of the proposed suboptimal solution is assessed through comparisons, performed via simulation, with the already classical balanced truncation method. The results lead to the conclusion that the proposed method performs equivalently when the H-2 norm of the reduction error is considered and significantly better when the H-infinity norm is considered instead. 77 10 978 984