Common setting for some classical z-domain algorithms in linear system theory
From MaRDI portal
Publication:3476717
DOI10.1080/00207729008910405zbMath0698.93068OpenAlexW2119197634MaRDI QIDQ3476717
Umberto Viaro, Gian Antonio Mian, Antonio Lepschy
Publication date: 1990
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729008910405
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Efficient split algorithms for continuous-time and discrete-time systems ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4997829 �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise]
Cites Work
- Direct bilinear Routh stability criteria for discrete systems
- Stability, instability and aperiodicity tests for linear discrete systems
- A unifying frame for stability-test algorithms for continuous-time systems
- Comparison between some stability criteria of discrete-time filters
- The Nevanlinna–Pick Problem for Matrix-Valued Functions
- A view of three decades of linear filtering theory
- On another approach to the Schur-Cohn criterion
This page was built for publication: Common setting for some classical z-domain algorithms in linear system theory
