0410530 20240103182220.520060210235959.9 Alghero IEEE 1998 27 s. 1-27 triangularization polynomial matrices numerical methods 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 GA102/97/0861 GA ČR cav_un_auth*0004367 AV0Z1075907 Numerical procedures are proposed for triangularizing polynomial matrices over the field of polynomial fractions and over the ring of polynomials. They are based on two standard polynomial techniques: Sylvester matrices and interpolation. In contrast to other triangularization methods, the algorithms described in this paper only rely on well-worked numerically realiable tools. They can also be used for greatest common divisor extraction. cav_un_auth*0212744 Mediterranean Conference on Control and Automation IEEE '98 Alghero IT 23.06.1998-27.06.1998 BC TŘ http://hdl.handle.net/11104/0130619 UTIA-B 20000246 1998 1998 Alghero IEEE Proceedings of the Mediterranean Conference on Control and Automation IEEE 1 27