Show simple item record

dc.contributor.authorP. S. V. Nataraj
dc.contributor.authorR. Satyanarayan
dc.contributor.authorS. Sheela
dc.date.accessioned2017-05-09T00:09:45Z
dc.date.available2017-05-09T00:09:45Z
dc.date.copyrightDecember, 2003
dc.date.issued2003
dc.identifier.issn0022-0434
dc.identifier.otherJDSMAA-26325#654_1.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/128099
dc.description.abstractA polynomial-time O(n2) algorithm is presented for extracting the boundary rectangles from a given interval template having no “inner windings.” The algorithm involves only comparisons and list operations. The performance of the algorithm is tested and compared with those of four boundary extraction algorithms existing in the QFT literature. The testing is done on a benchmark suite of eleven transfer function examples, using computational time and effort (flops) as the performance metrics. The test results show the proposed algorithm to be superior in every example. The typical improvement in terms of these metrics is by several orders of magnitude.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleA Polynomial-Time Algorithm for Efficient Extraction of Boundary Rectangles From Interval Templates
dc.typeJournal Paper
dc.journal.volume125
dc.journal.issue4
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.1595669
dc.journal.fristpage654
dc.journal.lastpage657
dc.identifier.eissn1528-9028
dc.keywordsAlgorithms AND Polynomials
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2003:;volume( 125 ):;issue: 004
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record