Show simple item record

dc.contributor.authorJinsiang Shaw
dc.contributor.authorSuhada Jayasuriya
dc.date.accessioned2017-05-08T23:49:34Z
dc.date.available2017-05-08T23:49:34Z
dc.date.copyrightSeptember, 1996
dc.date.issued1996
dc.identifier.issn0022-0434
dc.identifier.otherJDSMAA-26227#611_1.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/116641
dc.description.abstractConsidered in this paper is the robust stability of a class of systems in which a relevant characteristic equation is a family of polynomials F: f(s, q) = a0 (q) + a1 (q )s + [[ellipsis]] + a n (q)sn with its coefficients ai (q) depending linearly on q unknown-but-bounded parameters, q = (p1 , p2 , [[ellipsis]], pq )T . It is known that a necessary and sufficient condition for determining the stability of such a family of polynomials is that polynomials at all the exposed edges of the polytope of F in the coefficient space be stable (the edge theorem of Bartlett et al., 1988). The geometric structure of such a family of polynomials is investigated and an approach is given, by which the number of edges of the polytope that need to be checked for stability can be reduced considerably. An example is included to illustrate the benefit of this geometric interpretation.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleA New Algorithm for Testing the Stability of a Polytope: A Geometric Approach for Simplification
dc.typeJournal Paper
dc.journal.volume118
dc.journal.issue3
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.2801188
dc.journal.fristpage611
dc.journal.lastpage615
dc.identifier.eissn1528-9028
dc.keywordsStability
dc.keywordsAlgorithms
dc.keywordsTesting
dc.keywordsPolynomials
dc.keywordsTheorems (Mathematics) AND Equations
dc.treeJournal of Dynamic Systems, Measurement, and Control:;1996:;volume( 118 ):;issue: 003
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record