Some robust stability theorems for polygons of discrete polynomials

IEEE 1991 International Conference on Systems Engineering Pub Date : 1900-01-01 DOI:10.1109/ICSYSE.1991.161135

J. Peterson, L. Pujara

引用次数: 1

Abstract

How to partition an unstable polytope of polynomials into stable and unstable regions is addressed. L.R. Pujara and N. Shanghag have taken the first step by proposing a partition algorithm for unstable polygons of continuous polynomials. The present study begins with a discrete version of the segment lemma of H. Chapellat and S.P. Battacharyya (1989). Some necessary and sufficient conditions are proven for a polynomial vanishing at e* (where *=J omega /sub 0/), for some omega /sub 0/, in a polygon of discrete polynomials. These results lead directly to a method for partitioning polygons of discrete polynomials.<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

离散多项式多边形的鲁棒稳定性定理

讨论了如何将不稳定多项式多边形划分为稳定区域和不稳定区域。L.R. Pujara和N. Shanghag已经迈出了第一步，提出了连续多项式的不稳定多边形的划分算法。本研究从H. Chapellat和sp . Battacharyya(1989)的片段引理的离散版本开始。证明了离散多项式多边形中存在于e*处的多项式(其中*=J /下标0/)，存在于某个/下标0/的充要条件。这些结果直接导致了离散多项式多边形的分划方法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

IEEE 1991 International Conference on Systems Engineering

自引率

0.00%

发文量

期刊最新文献

Modelling and simulation of a heat exchanger Multidisciplinary modeling and design of a space system Robust stabilization of an aero-elastic system Inductive character learning and classification with genetic algorithms Determining bus arbitration policies and data transfer techniques for multiprocessor systems