Abstract
We present a novel development of randomized algorithms for quadratic stability analysis of sampled-data systems with memoryless quantizers. The specific randomized algorithm employed generates a quadratic Lyapunov function and leads to realistic bounds on the performance of such systems. A key feature of this method is that the characteristics of quantizers are exploited to make the algorithm computationally efficient.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 5046-5051 |
| Number of pages | 6 |
| Journal | Proceedings of the American Control Conference |
| Volume | 6 |
| State | Published - 2003 |
| Event | 2003 American Control Conference - Denver, CO, United States Duration: Jun 4 2003 → Jun 6 2003 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering