Model reduction of discrete time systems through linear matrix inequalities*

DOI10.1080/00207170412331291854zbMath1069.93003OpenAlexW2055214438MaRDI QIDQ4651193

José C. Geromel, R. G. Egas, F. R. R. Kawaoka

Publication date: 21 February 2005

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207170412331291854

zbMATH Keywords

linear matrix inequalitiesdiscrete-time linear systemsconvex programmingmodel reduction

Mathematics Subject Classification ID

Convex programming (90C25) Linear inequalities of matrices (15A39) Discrete-time control/observation systems (93C55) Variable structure systems (93B12)

Related Items (6)

Discrete orthogonal polynomials reduced models based on shift-transformation and discrete Walsh functions ⋮ Model reduction of a class of discrete-time nonlinear systems ⋮ A fast adaptive model reduction method based on Takenaka-Malmquist systems ⋮ On model reduction with consecutively selected rational basis ⋮ A projection-based algorithm for model-order reduction with \(H_2\) performance: a convex-optimization setting ⋮ Robust model reduction of uncertain systems maintaining uncertainty structure

Cites Work

• Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases
• All optimal Hankel-norm approximations of linear multivariable systems and theirL,^∞-error bounds†
• Controller reduction: concepts and approaches
• L2 and L2 - L model reduction via linear matrix inequalities
• H₂ and $H_\infty$ Robust Filtering for Discrete-Time Linear Systems
• Robust Filtering of Discrete-Time Linear Systems with Parameter Dependent Lyapunov Functions

This page was built for publication: Model reduction of discrete time systems through linear matrix inequalities*