The stability of a family of polynomials can be deduced from a finite number 0(k/sup 3/) of frequency checks

DOI10.1109/9.35812zbMATH Open0693.93065OpenAlexW2050892733MaRDI QIDQ3469002FDOQ3469002

Theodore E. Djaferis, Christopher V. Hollot

Publication date: 1989

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.35812

zbMATH Keywords

parpolygon

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Stability of control systems (93D99)

Cited In (6)

• Analysis of preservation of stability for families of polynomials and quasipolynomials.
• Bibliography on robust control
• Title not available (Why is that?)
• Hurwitz testing sets for parallel potytopes of polynomials
• An efficient algorithm for checking the robust stability of a polytope of polynomials
• A Routh-like test for the stability of families of polynomials with linear uncertainty

   Recommendations

• Title not available (Why is that?) 👍 👎
• An efficient algorithm for checking the robust stability of a polytope of polynomials 👍 👎
• Robust stability of nested polynomial families 👍 👎
• Analysis of preservation of stability for families of polynomials and quasipolynomials. 👍 👎
• Parameter partitioning via shaping conditions for the stability of families of polynomials 👍 👎

This page was built for publication: The stability of a family of polynomials can be deduced from a finite number 0(k/sup 3/) of frequency checks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3469002)