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

DOI10.1016/S0005-1098(96)00196-3zbMATH Open0872.93067OpenAlexW2087781759MaRDI QIDQ1354871FDOQ1354871

V. 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)

Cites Work

• Title not available (Why is that?)
• Root locations of an entire polytope of polynomials: It suffices to check the edges
• On the spectral set for a family of polynomials
• On robust Hurwitz and Schur polynomials

Cited In (7)

• Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach
• QFT template generation for time-delay plants based on zero-inclusion test
• Robust plotting of generalized lemniscates
• Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid
• Symbolic differentiation of factorized polynomials with repeated roots and the identification of their loci
• Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones
• Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems

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

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