0394314 20250203191241.420130919235959.9 A numerical test of positiveness on the unit circle based on the fast Fourier transform 5 s. C cav_un_epca*0394313978-1-4799-0995-7Proceedings of the 21st Mediterranean Conference on Control and Automation 2013(MED)1050-1054Platanias-Chanial, CreteIEEE2013 numerical algorithm spatially invariant system polynomial matrix positiveness cav_un_auth*0213204 Augusta Petr Teorie řízení Department of Control Theory TŘ TR UTIA-B Department of Control Theory Ústav teorie informace a automatizace AV ČR, v. v. i. textový dokument 370 kB GPP103/12/P494 GA ČR cav_un_auth*0284930 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. cav_un_auth*0292529 The 21st Mediterranean Conference on Control and Automation (MED) Platanias-Chania 25.06.2013-28.06.2013 GR 2014 BC 1 PR RVO:67985556 http://hdl.handle.net/11104/0223785 2013 textový dokument 370 kB cav_un_epca*0394313 Proceedings of the 21st Mediterranean Conference on Control and Automation 2013(MED) 978-1-4799-0995-7 1050 1054 Platanias-Chanial, Crete IEEE 2013