zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Finite time synchronization of complex dynamical networks. (Chinese. English summary) Zbl 1212.93008
Summary: Complex networks are everywhere. Synchronization is a very important nonlinear phenomenon which universally exists in nature. Over the last decade, many researchers have further investigated the synchronization of complex dynamical networks, including identical synchronization, clustering synchronization, partial synchronization, etc. The characterization of the synchronization speed of complex dynamical networks in most known results is asymptotic. That is, complex networks can realize synchronization only when the time $t$ tends to infinity. However, there are few results reported on how long complex networks can reach synchronization. Based on two kinds of typical complex dynamical networks with nonlinear coupling, this paper further explores the finite-time synchronization of complex dynamical networks. In detail, under some suitable conditions, it is proved that the above complex dynamical networks can realize accurate synchronization within finite-time. Moreover, a typical numerical simulation is then given to validate the effectiveness of the proposed criteria for finite-time synchronization. It should be especially pointed out that the finite-time synchronization successfully overcomes the difficulty of infinite synchronization time. The above results have some important practical meaning for real-world engineering applications.

93A30Mathematical modelling of systems
90B10Network models, deterministic (optimization)
93C10Nonlinear control systems
93A15Large scale systems