Abstract
The author considers the gap metric introduced by G. Zames and A.K. El-Sakkary (1980). He derives an expression for the gap metric that is computable using well-known techniques from interpolation theory. The author also derives an alternate proof that the graph and the gap matrices are equivalent. This gives rise to upper and lower bounds for the graph metric, which is difficult to evaluate exactly.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1360-1361 |
| Number of pages | 2 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| State | Published - 1988 |
| Event | Proceedings of the 27th IEEE Conference on Decision and Control - Austin, TX, USA Duration: Dec 7 1988 → Dec 9 1988 |
Bibliographical note
Funding Information:* This research was supported in part by NSF under Grant No. ECS-8705291 and MIP-8708811.