2019
DOI: 10.1016/j.automatica.2019.06.027
|View full text |Cite
|
Sign up to set email alerts
|

Lyapunov matrix based necessary and sufficient stability condition by finite number of mathematical operations for retarded type systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
3

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 26 publications
(25 citation statements)
references
References 19 publications
0
22
0
3
Order By: Relevance
“…Notice though that counterexamples for a strict hierarchy can be exhibited. Invoking now necessary and sufficient results [18], our result is weaker in the sense that Figure 8: Allowable delays guaranteed by Theorem 2. For a given order n, the information on the left (marker +) is related to ρ n < 1 and on the right (marker ×) to ρ n < 1.…”
Section: Illustration Of the Small Gain Theoremmentioning
confidence: 82%
See 4 more Smart Citations
“…Notice though that counterexamples for a strict hierarchy can be exhibited. Invoking now necessary and sufficient results [18], our result is weaker in the sense that Figure 8: Allowable delays guaranteed by Theorem 2. For a given order n, the information on the left (marker +) is related to ρ n < 1 and on the right (marker ×) to ρ n < 1.…”
Section: Illustration Of the Small Gain Theoremmentioning
confidence: 82%
“…the necessity has not been proven. However, in terms of the order of discretization, Table 2b highlights that our method works as soon as n = 2 instead of n 500, which is the necessary and sufficient order calculated in [18]. Moreover, as emphasized by Corollary 1, our methodology can be maintained for parameters uncertainties.…”
Section: Illustration Of the Small Gain Theoremmentioning
confidence: 85%
See 3 more Smart Citations