The system characteristic polynomial is replaced by its inverse which is decomposed as a combination of lower-degree and lower-degree inverse polynomials. A sequence of polynomials of descending degree is determined by successive decomposition. A necessary and sufficient condition of stability as w
A simplified stability test for 1-D discrete systems
β Scribed by P.S. Kamat
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 397 KB
- Volume
- 321
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
β¦ Synopsis
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 basis. Furthermore, it is shown that the root distribution of a polynomial with real coeficient can be determined by the same algorithm.
π SIMILAR VOLUMES
## Based on Schussler's theorem, some new properties ofpolynomials containing zeros inside the unit circle are obtained. These properties give rise to (i) a new stability test of 1-D discrete systems, and (ii) some necessary coeficient conditions that have to be satisfied by the denominator polynomi
A simple sujicient stability criterionfor linear discrete systems obtained previously is proved to be necessary and sujicientfor the stability of a class of such systems with parametervariation.
In this paper we consider discrete-time, linear stochastic systems with random state and input matrices which are subjected to stochastic disturbances and controlled by dynamic output feedback. The aim is to develop an H-type theory for such systems. For this class of systems a stochastic bounded re