Efficient split algorithms for continuous-time and discrete-time systems

DOI10.1016/0016-0032(91)90009-RzbMath0725.93058OpenAlexW2063667421MaRDI QIDQ2277421

Antonio Lepschy, Umberto Viaro, Gian Antonio Mian

Publication date: 1991

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(91)90009-r

zbMATH Keywords

continuous-timesplit algorithms

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55)

Related Items (1)

[https://portal.mardi4nfdi.de/wiki/Publication:4997829 �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise]

Cites Work

• Unnamed Item
• Direct bilinear Routh stability criteria for discrete systems
• A stability test for continuous systems
• A geometrical interpretation of the Routh test
• Introduction to stochastic control theory
• Splitting of some s-domain stability-test algorithms
• Common setting for some classical z-domain algorithms in linear system theory
• A unifying frame for stability-test algorithms for continuous-time systems
• On the role of the Nevanlinna–Pick problem in circuit and system theory

This page was built for publication: Efficient split algorithms for continuous-time and discrete-time systems