A fast technique for the generation of the spectral set of a polytope of polynomials

DOI10.1016/S0005-1098(96)00196-3zbMath0872.93067OpenAlexW2087781759MaRDI QIDQ1354871

Vito Cerone

Publication date: 13 October 1997

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0005-1098(96)00196-3

zbMATH Keywords

computational complexityrobust stabilityspectral setpolytope of polynomials

Mathematics Subject Classification ID

Robust stability (93D09)

Related Items (6)

Robust plotting of generalized lemniscates ⋮ Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach ⋮ Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems ⋮ QFT template generation for time-delay plants based on zero-inclusion test ⋮ Symbolic differentiation of factorized polynomials with repeated roots and the identification of their loci ⋮ Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid

Cites Work

• Unnamed Item
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• On robust Hurwitz and Schur polynomials
• On the spectral set for a family of polynomials

This page was built for publication: A fast technique for the generation of the spectral set of a polytope of polynomials