Robust Stability of Discrete-time Polynomials with Polynomic Dependency

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F05%3A03109273" target="_blank" >RIV/68407700:21230/05:03109273 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Robust Stability of Discrete-time Polynomials with Polynomic Dependency
Original language description
This paper presents very efficient and numerically stable method for testing the robust stability of discrete-time polynomials with polynomic dependency of their coefficients. The method is based on Modified Jury criterion with the elements being multivariate polynomials. The computation of those elements is performed using very efficient and reliable method based on multivariate fast Fourier transform algorithm. Positivity of elements is tested by an algorithm using a griding of space of uncertain parameters based on Sign decomposition. The necessary and sufficient condition of robust stability is obtained.
Czech name
Není k dispozici
Czech description
Není k dispozici

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
The Proceeding of IASTED International Multiconference on Automation, Control and Information Technology
ISBN
0-88986-488-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
225-230
Publisher name
Acta Press
Place of publication
Calgary
Event location
Novosibirsk
Event date
Jun 20, 2005
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)