Derivation of recursive stability-test procedures

DOI10.1007/BF02523187zbMath0825.93261OpenAlexW2078295538MaRDI QIDQ1341141

Umberto Viaro, Antonio Lepschy

Publication date: 28 November 1995

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02523187

Mathematics Subject Classification ID

Pole and zero placement problems (93B55)

Related Items (2)

Computing a Hurwitz factorization of a polynomial ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4997829 �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise]

Cites Work

• A stability test for continuous systems
• Generalized Bezoutians and families of efficient zero-location procedures
• Splitting of some s-domain stability-test algorithms
• A unifying frame for stability-test algorithms for continuous-time systems
• Immittance-domain Levinson algorithms

This page was built for publication: Derivation of recursive stability-test procedures