The extended generalized distance problem in discrete time
✍ Scribed by Vlad Ionescu; Cristian Oară
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 114 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1049-8923
No coin nor oath required. For personal study only.
✦ Synopsis
We obtain the class of all solutions to the extended (two block) generalized distance problem for discretetime systems by employing the so-called 'signature condition'-a generalized Popov theory type argument which parallels the J-spectral factorization approach. The novelty is that we derive explicit state-space formulae in terms of one Riccati and one Lyapunov equation while we remove the usual assumption in the discrete case on the time reversibility (invertibility of the state matrix) of the system to be approximated.
📜 SIMILAR VOLUMES
The stability problem of linear uncertain time-delay systems is considered using a quadratic Lyapunov functional. The kernel of the functional, which is a function of two variables, is chosen as piecewise linear. As a result, the stability condition can be written as a linear matrix inequality, whic
The ten stories of this collection present glimpses of our near, middle, and far futures?Heathen God,? the author's first Nebula Award finalist, reveals the consequences of learning that our solar system may have been engineered by an alien race.?In the Distance, and Ahead in Time? and?Wayside World