On a technique of stability analysis of a discrete system
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.
- New conditions for stability of a nonautonomous discrete system
- scientific article; zbMATH DE number 1800462 (Why is no real title available?)
- scientific article; zbMATH DE number 1976890 (Why is no real title available?)
- scientific article; zbMATH DE number 2160998 (Why is no real title available?)
- scientific article; zbMATH DE number 2113250 (Why is no real title available?)
- Analysis of processes in multivariable discrete systems based on Lyapunov vector functions
This page was built for publication: On a technique of stability analysis of a discrete system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754754)
