Revisited Jury-Lee criterion for multivariable discrete-time Lur'e systems: Convex LMI search
Allbwn ymchwil: Cyfraniad at gynhadledd › Papur › adolygiad gan gymheiriaid
StandardStandard
2013. 2268-2273 Papur a gyflwynwyd yn 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), maui, Yr Unol Daleithiau.
Allbwn ymchwil: Cyfraniad at gynhadledd › Papur › adolygiad gan gymheiriaid
HarvardHarvard
APA
CBE
MLA
VancouverVancouver
Author
RIS
TY - CONF
T1 - Revisited Jury-Lee criterion for multivariable discrete-time Lur'e systems: Convex LMI search
AU - Ahmad, N.S.
AU - Carrasco, J.
AU - Heath, W.P.
PY - 2013/2/4
Y1 - 2013/2/4
N2 - The Tsypkin and Jury-Lee criteria are commonly used to analyse the absolute stability of discrete-time Lur'e systems with slope-restricted nonlinearities. In this paper, we construct a corresponding linear matrix inequality (LMI) condition for the Jury-Lee criterion most appropriate for monotonic, slope-restricted nonlinearities. The corresponding Lur'e-Lyapunov function is also constructed and, via the Lyapunov method, the conditions on the aforementioned criterion are relaxed. The result is explicitly compared with improved LMI-based criteria in the literature. The resulting multiplier from the criterion is also shown to satisfy the conditions of the Zames-Falb multipliers in discrete-time. This indirectly provides a convex search over a subset of the discrete-time Zames-Falb multipliers. Some numerical examples for SISO and MIMO cases are provided to compare the performance of the criteria with existing results, and we demonstrate that the result in this paper provides significant improvement
AB - The Tsypkin and Jury-Lee criteria are commonly used to analyse the absolute stability of discrete-time Lur'e systems with slope-restricted nonlinearities. In this paper, we construct a corresponding linear matrix inequality (LMI) condition for the Jury-Lee criterion most appropriate for monotonic, slope-restricted nonlinearities. The corresponding Lur'e-Lyapunov function is also constructed and, via the Lyapunov method, the conditions on the aforementioned criterion are relaxed. The result is explicitly compared with improved LMI-based criteria in the literature. The resulting multiplier from the criterion is also shown to satisfy the conditions of the Zames-Falb multipliers in discrete-time. This indirectly provides a convex search over a subset of the discrete-time Zames-Falb multipliers. Some numerical examples for SISO and MIMO cases are provided to compare the performance of the criteria with existing results, and we demonstrate that the result in this paper provides significant improvement
U2 - 10.1109/CDC.2012.6426863
DO - 10.1109/CDC.2012.6426863
M3 - Papur
SP - 2268
EP - 2273
T2 - 2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
Y2 - 10 December 2012 through 13 December 2012
ER -