The finite inclusions theorem

DOI10.1109/9.376079zbMATH Open0821.93062OpenAlexW2122773966MaRDI QIDQ4837490FDOQ4837490

Authors: Richard D. Kaminsky, Theodore E. Djaferis 

Publication date: 3 July 1995

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

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

Recommendations

• Application of the Finite Inclusions Theorem to robust analysis and synthesis
• A note on the location of the roots of a polynomial
• The finite inclusions theorem: a tool for robust design.
• Finite Nyquist and finite inclusions theorems for disjoint stability regions
• A necessary and sufficient condition for Schur invariance and generalized stability of polytopes of polynomials

zbMATH Keywords

robust controllersfinite inclusions theoremparametrically uncertain systemsNyquist's stability theorempolynomial roots location

Mathematics Subject Classification ID

Pole and zero placement problems (93B55) Robust stability (93D09)

Cited In (6)

• Finite Nyquist and finite inclusions theorems for disjoint stability regions
• The inclusion-exclusion principle for finitely many isolated sets
• The finite inclusions theorem: a tool for robust design.
• Polynomial approach for design and robust analysis of Lateral missile control
• Application of the Finite Inclusions Theorem to robust analysis and synthesis
• Finite union theorem with restrictions

This page was built for publication: The finite inclusions theorem

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