𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Fast stability test algorithm for discre
✍ 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

A simplified stability test for 1-D disc
✍ 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

control for fast sampling discrete-time
✍ Jiuxiang Dong; Guang-Hong Yang πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 475 KB

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

Stability and linearization: discrete-ti
✍ Irwin W. Sandberg πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 83 KB

## 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