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
Fast stability test algorithm for discrete time systems
β Scribed by Kaoru Kurosawa
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 413 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0165-1684
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper shows that the stability tests for 1-D discrete systems using the transformation p = (z + z-') and properties of Chebyshev polynomials developed previously can be directly obtained from the z-domain continued fraction expansion based on the functions (z+ 1) and (z-' + 1) on an alternate b
This paper is concerned with the H β control problem via state feedback for fast sampling discrete-time singularly perturbed systems. A new H β controller design method is given in terms of solutions to linear matrix inequalities (LMIs), which eliminates the regularity restrictions attached to the R
## Abstract A theorem by Hadamard gives a twoβpart condition under which a map from one Banach space to another is a homeomorphism. The theorem, while often very useful, is incomplete in the sense that it does not explicitly specify the family of maps for which the condition is met. Recently, under