Show simple item record

dc.contributor.authorShih-Feng Yang
dc.date.accessioned2017-05-09T00:23:09Z
dc.date.available2017-05-09T00:23:09Z
dc.date.copyrightJuly, 2007
dc.date.issued2007
dc.identifier.issn0022-0434
dc.identifier.otherJDSMAA-26397#550_1.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/135449
dc.description.abstractThis paper presents an efficient algorithm for the generation of quantitative feedback theory (QFT) bounds for plants with affinely dependent uncertainties. For a plant with m affinely dependent uncertainties, it is shown that whether a point in the complex plane lies in the QFT bound for a frequency-domain specification at a given frequency can be tested by checking if m2m−1 one-variable quadratic equations corresponding to the edges of the domain box are all non-negative on the interval [0,1]. This test procedure is then utilized along with a pivoting procedure to trace out the boundary of the QFT bound with a prescribed accuracy or resolution. The developed algorithm can avoid the unfavorable trade-off between the computational burden and the accuracy of QFT bounds. Moreover, it is efficient in the sense that no root-finding and iterative procedures are required. Numerical examples are given to illustrate the proposed algorithm and its computational superiority.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleEfficient Algorithm for the Generation of QFT Bounds for Plants With Affinely Dependent Uncertainties
dc.typeJournal Paper
dc.journal.volume129
dc.journal.issue4
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.2745883
dc.journal.fristpage550
dc.journal.lastpage555
dc.identifier.eissn1528-9028
dc.keywordsQuantum field theory
dc.keywordsAlgorithms AND Industrial plants
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2007:;volume( 129 ):;issue: 004
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record