A stability test for continuous systems
From MaRDI portal
A test for determining the zero distribution of a real polynomial with respect to the imaginary axis is presented. It is based on the construction of a sequence of polynomials of descending degree which draws on the Levinson algorithm. The proof of the stability criterion, which is based on intuitive geometrical considerations, is very simple, and the computational complexity is not greater than that for the Routh test. The critical situations that may arise are also examined and some examples are given.
Recommendations
Cites work
- A new general Routh-like algorithm to determine the number of RHP roots of a real or complex polynomial
- A note on the Routh-Hurwitz criterion
- A view of three decades of linear filtering theory
- Direct bilinear Routh stability criteria for discrete systems
- Invariance of the strict Hurwitz property for polynomials with perturbed coefficients
- Routh-Hurwitz test under vanishing leading array elements
- Routh’s Algorithm: A Centennial Survey
- Technique fixation and the Routh-Hurwitz criterion
- The negative Routh test and its application to the cases of vanishing leading elements and imaginary roots
Cited in
(28)- A simplified stability test for 1-D discrete systems
- A geometrical interpretation of the Routh test
- A stability test for real polynomials
- Derivation of recursive stability-test procedures
- A rational test for strong stabilization
- Efficient split algorithms for continuous-time and discrete-time systems
- Algebraic phase unwrapping and zero distribution of polynomial for continuous-time systems
- On delta-operator Schur-Cohn zero-location tests for fast sampling
- scientific article; zbMATH DE number 1679742 (Why is no real title available?)
- Wide sense stability of discrete- and continuous-time linear systems in the complex case
- On the mechanism of recursive stability-test algorithms
- scientific article; zbMATH DE number 3886996 (Why is no real title available?)
- Checking the parity interlacing property via the Sturm algorithm
- Splitting of some s-domain stability-test algorithms
- A unifying frame for stability-test algorithms for continuous-time systems
- scientific article; zbMATH DE number 3898130 (Why is no real title available?)
- A generalised test for discrete system stability
- Network realizability theory approach to stability of complex polynomials
- Euclid-type algorithm and its applications
- A further simplification to Jury's stability test
- scientific article; zbMATH DE number 3579328 (Why is no real title available?)
- scientific article; zbMATH DE number 524179 (Why is no real title available?)
- A new stability test for discrete systems using lossless-discreteintegrator Routh continued-fraction expansion
- scientific article; zbMATH DE number 3998286 (Why is no real title available?)
- A Short Proof of a Continued Fraction Test for the Stability of Polynomials
- �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise
- Nevanlinna test of stability
- An algorithm for segment stability
This page was built for publication: A stability test for continuous systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096573)
