An efficient numerical method for the discrete-time symmetric matrix polynomial equation

0410531 20240103182220.620060210235959.9 An efficient numerical method for the discrete-time symmetric matrix polynomial equation 6 s. cav_un_epca*02567131350-2379IEE Proceedings. Control Theory and Applications1455 (1998)443-448 matrix polynomial equation cav_un_auth*0015534 Henrion D. FR cav_un_auth*0101204 Šebek Michael UTIA-B Department of Control Theory Ústav teorie informace a automatizace AV ČR, v. v. i. 09I KSK1075601 GA AV CZ cav_un_auth*0027435 AV0Z1075907 A numerical procedure is proposed to solve a matrix polynomial frequently encountered in discrete-time control and signal processing. The algorithm is based on simple rewriting of the original equation in terms of a reduced Sylvester matrix. In contrast to previously published methods, it does not make use of elementary polynomial operations. Moreover and most notably, it is numerically reliable. BC TŘ http://hdl.handle.net/11104/0130620 UTIA-B 20000247 1998 cav_un_epca*0256713 IEE Proceedings. Control Theory and Applications 1350-2379 Roč. 145 č. 5 1998 443 448 do 2007