Real and complex polynomial stability and stability domain construction via network realizability theory
作者:
J. F. DELANSKY,
N. K. BOSE,
期刊:
International Journal of Control
(Taylor Available online 1988)
卷期:
Volume 48,
issue 3
页码: 1343-1349
ISSN:0020-7179
年代: 1988
DOI:10.1080/00207178808906250
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
Network realzability theory provides the basis for a unified approach to the stability of a polynomial or a family of polynomials. In this paper conditions are given, in terms of certain decompositions of a given polynomial, that are necessary and sufficient for the given polynomial to be Hurwitz. These conditions facilitate the construction of stability domains for a family of polynomials through the use of linear inequalities. This approach provides a simple interpretation of recent results for polynomials with real coefficients and also leads to the formulation of corresponding results for the case of polynomials with complex coefficients.
点击下载:
PDF (112KB)
返 回