2003
DOI: 10.1002/rnc.750
|View full text |Cite
|
Sign up to set email alerts
|

Refined discretized Lyapunov functional method for systems with multiple delays

Abstract: SUMMARYThe previously proposed discretized Lyapunov functional method for systems with multiple delay is refined using variable elimination and Jensen inequality. The resulting new stability criterion is simpler. Numerical examples indicate that the new method is much less conservative for a given discretization mesh.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2003
2003
2024
2024

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…The simplification to the current form discussed here is based on Gu [90]. The expression of V(¢) in the proof of Proposition 7.8 can be generalized to The one used in the proof of Proposition 7.8 is the special case of the above by setting Z = W. For nonuniform mesh with large difference of mesh size, a stability criterion based on the above expression can be less conservative but much more complicated.…”
Section: Stability Criterion and Examplesmentioning
confidence: 99%
“…The simplification to the current form discussed here is based on Gu [90]. The expression of V(¢) in the proof of Proposition 7.8 can be generalized to The one used in the proof of Proposition 7.8 is the special case of the above by setting Z = W. For nonuniform mesh with large difference of mesh size, a stability criterion based on the above expression can be less conservative but much more complicated.…”
Section: Stability Criterion and Examplesmentioning
confidence: 99%
“…Definition 1. The transformation ( 14) and ( 15) is said to decompose the system described by ( 2) and (3) with the restriction (4) if (34) is satisfied in the resulting system described by (26) to (29) with feedback (18) and (19).…”
Section: Decompositionmentioning
confidence: 99%
“…In order to demonstrate the effectiveness of this process, we will first compare the computational time for the DDE, CDDE‐RDC, and DCDDE for the cases of commensurate delays with τ2=2τ1$$ {\tau}_2=2{\tau}_1 $$ using appropriate versions of discretized Lyapunov–Krasovskii functional methods. Specifically, the method in Reference 26 is used for DDE, the method in Reference 14 is used for CDDE‐RDC and DCDDE. For the DDE case, r1=τ1$$ {r}_1={\tau}_1 $$ and r2=τ2prefix−τ1$$ {r}_2={\tau}_2-{\tau}_1 $$ (which is equal to r1$$ {r}_1 $$ in this case) are evenly divided into three sections in discretization (Nd1=Nd2=3$$ {N}_{d1}={N}_{d2}=3 $$).…”
Section: Time‐delay Systems Of Retarded Typementioning
confidence: 99%
See 1 more Smart Citation
“…Gu [4,5] proposed a discretized Lyapunov functional method for the stability analysis problem of multiple time-delay systems, which improved the restrict of time-delay to the stability mostly. Based on the method, Han [6,7] made a further improvement over the result of Gu and presented the sufficient condition of the stability criteria.…”
Section: Introductionmentioning
confidence: 99%