✦ LIBER ✦

An Efficient Integer-Preserving Stability Test for Discrete-Time Systems

✍ Scribed by Yuval Bistritz

Publisher: Springer
Year: 2004
Tongue: English
Weight: 137 KB
Volume: 23
Category: Article
ISSN: 0278-081X
DOI: 10.1007/s00034-004-7016-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast stability test algorithm for discre

Fast stability test algorithm for discrete time systems

✍ Kaoru Kurosawa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 413 KB

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

On fast algorithm for testing the stabil

On fast algorithm for testing the stability of discrete time systems

✍ Hari Krishna; Yunbiao Wang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 424 KB