Show simple item record

contributor authorP. S. V. Nataraj
contributor authorR. Satyanarayan
contributor authorS. Sheela
date accessioned2017-05-09T00:09:45Z
date available2017-05-09T00:09:45Z
date copyrightDecember, 2003
date issued2003
identifier issn0022-0434
identifier otherJDSMAA-26325#654_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/128099
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.
publisherThe American Society of Mechanical Engineers (ASME)
titleA Polynomial-Time Algorithm for Efficient Extraction of Boundary Rectangles From Interval Templates
typeJournal Paper
journal volume125
journal issue4
journal titleJournal of Dynamic Systems, Measurement, and Control
identifier doi10.1115/1.1595669
journal fristpage654
journal lastpage657
identifier eissn1528-9028
keywordsAlgorithms AND Polynomials
treeJournal of Dynamic Systems, Measurement, and Control:;2003:;volume( 125 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record