2019 IEEE 15th International Conference on Control and Automation (ICCA) 2019
DOI: 10.1109/icca.2019.8899962
|View full text |Cite
|
Sign up to set email alerts
|

Consistency and Lyapunov Stability of Linear Discrete Descriptor Time Delay Systems: A Geometric Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…Then, pre-and postmultiplying ( 14) by ξ T and ξ, respectively, yields V (k+1)−V (k) = e(k+1) T P e(k+1)−e(k) T P e(k) < 0, since A a ξ = 0 from (8). The rest of this proof follows directly from the Lyapunov theory; see, for instance, Koenig et al (2008), Buzurovic et al (2019).…”
Section: Observer Designmentioning
confidence: 99%
“…Then, pre-and postmultiplying ( 14) by ξ T and ξ, respectively, yields V (k+1)−V (k) = e(k+1) T P e(k+1)−e(k) T P e(k) < 0, since A a ξ = 0 from (8). The rest of this proof follows directly from the Lyapunov theory; see, for instance, Koenig et al (2008), Buzurovic et al (2019).…”
Section: Observer Designmentioning
confidence: 99%
“…For example, [14] provided the necessary conditions for state convergence, using frequency domain techniques like the Nyquist criterion. References [15], [16] adopted a classic method, Lyapunov stability analysis, to prove the state convergence of the MAS. Reference [14] introduced the inputto-state stability (ISS) to evaluate the stability of the control strategy in nonlinear dynamic environment.…”
Section: Introductionmentioning
confidence: 99%