0410521 20240103182219.920060210235959.9 0-7803-6641-7 Sydney IEEE 2000 7 s. 4221-4227 cav_un_auth*0015534 Henrion D. FR cav_un_auth*0212411 Ruiz-León J. J. MX cav_un_auth*0101204 Šebek Michael UTIA-B Department of Control Theory Ústav teorie informace a automatizace AV ČR, v. v. i. 09I GA102/99/1368 GA ČR cav_un_auth*0004439 VS97034 MŠMT CZ cav_un_auth*0025111 AV0Z1075907 An algorithm is described for computing the structure at infinity and extracting the infinite zeros of a given polynomial matrix. The algorithm relies on numerically reliable operations only. Applications include computation of the subspace of impulsive solution of a set of linear differential equations, derivation of the Smith format infinity of a polynomial matrix, or also enhanced computation of the characteristic polynomial of a linear system described by polynomial matrix fractions. cav_un_auth*0212734 IEEE Conference on Decision and Control /39./ Sydney AU 12.12.2000-15.12.2000 BC TŘ http://hdl.handle.net/11104/0130610 UTIA-B 20000237 2000 2000 Sydney IEEE 0-7803-6641-7 Proceedings of the 39th IEEE Conference on Decision and Control 4221 4227