๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A generalised test for discrete system stability

โœ Scribed by Yhean Lai

Book ID
117906155
Publisher
IEEE
Year
1984
Weight
245 KB
Volume
32
Category
Article
ISSN
0096-3518

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simplified stability test for 1-D disc
A simplified stability test for 1-D discrete systems
โœ P.S. Kamat ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB

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

Fast stability test algorithm for discre
Fast stability test algorithm for discrete time systems
โœ Kaoru Kurosawa ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 413 KB

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