Premium
Remarks on ‘equivalence of stability concepts for discrete time‐varying systems’
Author(s) -
Wirth Fabian
Publication year - 1998
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/(sici)1099-1239(199801)8:1<91::aid-rnc271>3.0.co;2-j
Subject(s) - equivalence (formal languages) , mathematics , stability (learning theory) , discrete time and continuous time , regular polygon , argument (complex analysis) , discrete system , pure mathematics , computer science , algorithm , geometry , statistics , biochemistry , chemistry , machine learning
In a recent article on stability of discrete inclusions the authors argue that the problem of determining stability of discrete inclusions given by convex sets of matrices with a finite number of extremal points is NP‐hard. It is shown that the argument that has been employed is inconclusive and thus the problem is still open. © 1998 John Wiley & Sons, Ltd.