On a technique of stability analysis of a discrete system (Q2754754)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a technique of stability analysis of a discrete system |
scientific article; zbMATH DE number 1668394
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a technique of stability analysis of a discrete system |
scientific article; zbMATH DE number 1668394 |
Statements
4 November 2001
0 references
discrete system
0 references
decomposition
0 references
asymptotic stability
0 references
stability in large
0 references
hierarchical Lyapunov function
0 references
On a technique of stability analysis of a discrete system (English)
0 references
The author considers a discrete system \(S:\;x(\tau+1) = f[\tau, x(\tau)]\). It is assumed that the system can be decomposed into \(s\) interconnected systems \(\widetilde{S}_i: x_i(\tau+1) = g_i[\tau, x_i(\tau)] + h_i[\tau, x(\tau)]\). Each of equations describing the dynamics of independent subsystems \(S_i: x_i(\tau+1) = g_i[\tau, x_i(\tau)]\) is decomposed into \(m_i\) interconnected subsystems. To study the stability of \(S\), the author uses a two-level construction of Lyapunov function. A theorem concerning the asymptotic stability of the system and its asymptotic stability in large is proved, and some particular examples are considered.
0 references
0.9017712473869324
0 references
0.7878267765045166
0 references