DocumentCode
3173306
Title
A numerical test of positiveness on the unit circle based on the fast Fourier transform
Author
Augusta, Petr
Author_Institution
Inst. of Inf. Theor. & Autom., Prague, Czech Republic
fYear
2013
fDate
25-28 June 2013
Firstpage
1050
Lastpage
1054
Abstract
The paper presents an algorithm for checking positiveness of a symmetric polynomial matrix on the unit circle. The algorithm is based on the sampling polynomial matrices using of the fast Fourier transform. The aim of the paper is to show that this approach is significantly faster than commonly used method based on semi-definite programming expression.
Keywords
fast Fourier transforms; mathematical programming; multidimensional systems; polynomial matrices; stability; 2D system; fast Fourier transform; positiveness numerical test; sampling polynomial matrices; semidefinite programming expression; stability; symmetric polynomial matrix; unit circle; Fast Fourier transforms; MATLAB; Numerical stability; Polynomials; Stability analysis; Symmetric matrices; Transfer functions;
fLanguage
English
Publisher
ieee
Conference_Titel
Control & Automation (MED), 2013 21st Mediterranean Conference on
Conference_Location
Chania
Print_ISBN
978-1-4799-0995-7
Type
conf
DOI
10.1109/MED.2013.6608850
Filename
6608850
Link To Document