0489266 20240903170639.620180502235959.9 85047400394 000435168400005 10.14736/kyb-2018-2-0289 A fast numerical test of multivariate polynomial positiveness with applications 15 s. P cav_un_epca*02971630023-5954Kybernetika542 (2018)289-303Ústav teorie informace a automatizace AV ČR, v. v. i. stability multidimensional systems positive polynomials fast Fourier transforms numerical algorithm 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. cav_un_auth*0259382 Augustová Petra Teorie řízení Department of Control Theory TŘ TR UTIA-B Department of Control Theory CZ Ústav teorie informace a automatizace AV ČR, v. v. i. textový soubor http://library.utia.cas.cz/separaty/2018/TR/augusta-0489266.pdf 571 KB The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression. WOS BC 20000 20200 20205 2019 2 RVO:67985556 http://hdl.handle.net/11104/0283707 S 3+4 Article Computer Science Cybernetics COMPUTERSCIENCE.CYBERNETICS 0.591 0.155 13 0.00068 0.174 891 0.268 0.500 71 Q4 15.991 6.5 Q4 Q3 0.17 Q4 6.522 2018 85047400394 SCOPUS PUBMED 000435168400005 WOS textový soubor 571 KB cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 54 č. 2 2018 289 303 Ústav teorie informace a automatizace AV ČR, v. v. i.