8 citations · 20 across the 5 of their papers we have counts for
3 papers · 1 filter
Scaled Graph Bounding Techniques for Reset Systems
Timo de Groot, Maurice Heemels, Tom Oomen +1
Reset systems can overcome fundamental limitations of linear time-invariant control. The recently introduced notion of scaled (relative) graphs provides a promising framework for d…
A Unified Non-Strict Finsler Lemma
T. J. Meijer, K. J. A. Scheres, S. van den Eijnden +3
In this paper, we present a unified general non-strict Finsler lemma. This result is general in the sense that it does not impose any restrictions on the involved matrices and, the…
The Non-Strict Projection Lemma
T. J. Meijer, T. Holicki, S. J. A. M. van den Eijnden +2
The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis…