Splitting of some s-domain stability-test algorithms
From MaRDI portal
Recommendations
Cites work
- A generalised test for discrete system stability
- A simplified stability test for discrete systems using a new Z-domain continued fraction method
- A stability test for continuous systems
- Comparison between some stability criteria of discrete-time filters
- Computationally efficient stepup and stepdown procedures for real predictor coefficients
- Introduction to stochastic control theory
- Routh’s Algorithm: A Centennial Survey
- Some new results on discrete system stability
- The Nevanlinna–Pick Problem for Matrix-Valued Functions
Cited in
(8)- Derivation of recursive stability-test procedures
- Accuracy and stability of splitting with stabilizing corrections
- Efficient split algorithms for continuous-time and discrete-time systems
- The Split Levinson Algorithm is Weakly Stable
- Common setting for some classical z-domain algorithms in linear system theory
- scientific article; zbMATH DE number 4170812 (Why is no real title available?)
- scientific article; zbMATH DE number 18085 (Why is no real title available?)
- �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise
This page was built for publication: Splitting of some s-domain stability-test algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470368)