The discrete-time strictly bounded-real lemma and the computation of positive definite solutions to the 2-D Lyapunov equation

DOI10.1109/31.90402zbMath0684.65042OpenAlexW2112198205WikidataQ125055564 ScholiaQ125055564MaRDI QIDQ4734674

No author found.

Publication date: 1989

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.90402

zbMATH Keywords

algorithms spectral factorization Lyapunov equation Riccati matrix equation positive definite solution stability testing strictly bounded real function

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Discrete-time control/observation systems (93C55) Matrix equations and identities (15A24)

Related Items (7)

Some new results on stability robustness of two-dimensional discrete systems ⋮ Discrete model reduction preserving bounded realness ⋮ Stability of discrete non-unit memory linear repetitive processes—a two-dimensional systems interpretation ⋮ LMI-based criterion for robust stability of 2-D discrete systems with interval time-varying delays employing quantisation / overflow nonlinearities ⋮ Robust output feedback stabilization for two-dimensional continuous systems in Roesser form. ⋮ An LMI approach to robust optimal guaranteed cost control of 2-D discrete systems described by the Roesser model ⋮ Algebraic necessary and sufficient conditions for the very strict Hurwitz property of a 2-D polynomial

This page was built for publication: The discrete-time strictly bounded-real lemma and the computation of positive definite solutions to the 2-D Lyapunov equation