LMI searches for discrete-time Zames-Falb multipliers
Research output: Contribution to conference › Paper › peer-review
Electronic versions
DOI
Recent works have proposed different searches for Zames-Falb multipliers in the continuous-time domain. Although Zames-Falb multipliers are also defined for the discrete-time domain, there is no equivalent literature for their search. In this paper, we propose the discrete-time counterparts of two recently reported algorithms for the search of a Zames-Falb multiplier. The two searches find causal and anticausal multipliers respectively. Several examples show the effectiveness of the method. The examples illustrate the necessity of conducting both causal and anticausal searches to ensure competitiveness over other methods for establishing the stability of loops with slope-restricted nonlinearities.
| Original language | Unknown |
|---|---|
| Pages | 5258-5263 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 10 Mar 2014 |
| Externally published | Yes |
| Event | 52nd IEEE Conference on Decision and Control - Firenze, Italy Duration: 10 Dec 2013 → 13 Dec 2013 |
Conference
| Conference | 52nd IEEE Conference on Decision and Control |
|---|---|
| Country/Territory | Italy |
| City | Firenze |
| Period | 10/12/13 → 13/12/13 |