YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    A Reliable Algorithm to Compute the Spectral Set of a Polytope of Polynomials to Prescribed Accuracy

    Source: Journal of Dynamic Systems, Measurement, and Control:;2006:;volume( 128 ):;issue: 002::page 400
    Author:
    Nataraj S. Paluri
    ,
    Jayesh J. Barve
    DOI: 10.1115/1.2196416
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: We 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.
    keyword(s): Algorithms AND Polynomials ,
    • Download: (215.5Kb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Statistics

      A Reliable Algorithm to Compute the Spectral Set of a Polytope of Polynomials to Prescribed Accuracy

    URI
    https://yetl.yabesh.ir/yetl1/handle/yetl/133431
    Collections
    • Journal of Dynamic Systems, Measurement, and Control

    Show full 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
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian