Show simple item record

contributor authorNataraj S. Paluri
contributor authorJayesh J. Barve
date accessioned2017-05-09T00:19:24Z
date available2017-05-09T00:19:24Z
date copyrightJune, 2006
date issued2006
identifier issn0022-0434
identifier otherJDSMAA-26354#400_1.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/133431
description abstractWe propose an algorithm to compute the spectral set of a polytope of polynomials. The proposed algorithm offers several key guarantees that are not available with existing techniques. It guarantees that the generated spectral set: (i) contains all the actual points, (ii) is computed to a prescribed accuracy, (iii) is computed reliably in face of all kinds of computational errors, and (iv) is computed in a finite number of algorithmic iterations. A further merit is that the computational complexity of the proposed algorithm is O(n) in contrast to O(n2) for existing techniques, where n is the degree of the polynomial. The algorithm is demonstrated on a few examples.
publisherThe American Society of Mechanical Engineers (ASME)
titleA Reliable Algorithm to Compute the Spectral Set of a Polytope of Polynomials to Prescribed Accuracy
typeJournal Paper
journal volume128
journal issue2
journal titleJournal of Dynamic Systems, Measurement, and Control
identifier doi10.1115/1.2196416
journal fristpage400
journal lastpage405
identifier eissn1528-9028
keywordsAlgorithms AND Polynomials
treeJournal of Dynamic Systems, Measurement, and Control:;2006:;volume( 128 ):;issue: 002
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record