An optimal fraction free Routh array†
From MaRDI portal
Publication:3877516
Cites work
- scientific article; zbMATH DE number 3138902 (Why is no real title available?)
- Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
- New reductions of Hurwitz determinants
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Routh’s Algorithm: A Centennial Survey
- Subresultants and Reduced Polynomial Remainder Sequences
Cited in
(5)- A test for robust Hurwitz stability of convex combinations of complex polynomials
- An algebraic test forA 0-stability
- Testing the robust Schur stability of a segment of complex polynomials
- The use of Routh array for testing the Hurwitz property of a segment of polynomials.
- Comment on ``The use of Routh array for testing the Hurwitz property of a segment of polynomials.
This page was built for publication: An optimal fraction free Routh array†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3877516)