On fast algorithm for testing the stability of discrete time systems
β Scribed by Hari Krishna; Yunbiao Wang
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 424 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0165-1684
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
To test the stability of a discrete time system with order n, well known table form algorithms (the Marden-Jury table method and others) require O(n2) operations. Recently, Bristritz showed a stability test method which requires about a half of operations of the table form method. This paper present
The problem of deriving a frequency-domain su$cient condition for the global asymptotic stability of a discrete-time system having hysteretic controllers is considered. It is suggested that the hysteretic characteristic be replaced by a function of the form f (y, g) where y(t) is the input to the co
This paper studies the set of time-invariant linear discrete-time systems in which each system has a diagonal quadratic Lyapunov function. First, it is shown that there is generally no common diagonal quadratic Lyapunov function for such a set of systems even if the set is assumed to be commutative.
In a recent article on stability of discrete inclusions the authors argue that the problem of determining stability of discrete inclusions given by convex sets of matrices with a finite number of extremal points is NP-hard. It is shown that the argument that has been employed is inconclusive and thu