DocumentCode :
3165022
Title :
Fast Computation of Dilation Integrals for Robustness Analysis
Author :
Dabbene, F. ; Shcherbakov, P.
Author_Institution :
Politecnico di Torino, Torino
fYear :
2007
fDate :
9-13 July 2007
Firstpage :
2660
Lastpage :
2665
Abstract :
It is shown how recent results on combinations of sequences of quadrature formulae with high polynomial exactness represent an efficient technique for the fast computation of the so-called dilation integrals. These integrals were introduced in the modern robustness literature as a tool for addressing approximate robustness in problems involving polynomial parameter dependence. As a result, the calculations are simplified and more precise conclusions can be made about approximate robustness. Illustrative examples of the proposed approach are presented.
Keywords :
integral equations; polynomials; dilation integrals; polynomial parameter dependence; quadrature formulae sequences; robustness analysis; Certification; Cities and towns; Grid computing; High performance computing; Hypercubes; Polynomials; Robust control; Robustness; Uncertainty; Yield estimation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, 2007. ACC '07
Conference_Location :
New York, NY
ISSN :
0743-1619
Print_ISBN :
1-4244-0988-8
Electronic_ISBN :
0743-1619
Type :
conf
DOI :
10.1109/ACC.2007.4282526
Filename :
4282526
Link To Document :
بازگشت