2020
DOI: 10.1016/j.neunet.2019.12.028
|View full text |Cite
|
Sign up to set email alerts
|

A new fixed-time stability theorem and its application to the fixed-time synchronization of neural networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
63
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 172 publications
(64 citation statements)
references
References 34 publications
1
63
0
Order By: Relevance
“…Thus, the origin of system (1) is fixed-time stable, and the settling time T (x 0 ) is estimated by (6). This is complete proof.…”
Section: Fixed-time Stabilitymentioning
confidence: 62%
See 3 more Smart Citations
“…Thus, the origin of system (1) is fixed-time stable, and the settling time T (x 0 ) is estimated by (6). This is complete proof.…”
Section: Fixed-time Stabilitymentioning
confidence: 62%
“…respectively. According to Theorem 2 and Theorem 4, one has T 6 max > T * 3 max , T 7 max > T * 3 max . Therefore T * 3 max owns higher precise.…”
Section: Remarkmentioning
confidence: 93%
See 2 more Smart Citations
“…Next, we list several existing results for finite-time stability and fixed-time stability of (1) by using Lyapunov functions. Lemma 1 (42). If there exists a function V ∶ R n → R max belongs to the class  (i-e V is continuous and strictly increasing and V(y) = 0 implies that y = 0) such that any solution of (1) satisfies following the inequalitẏ V(y(t)) ≤ −bV (y(t)) − cV (y(t))…”
Section: Preliminaries and Model Descriptionmentioning
confidence: 99%