0410941 20240103182250.420060210235959.9 80-7080-500-5 1 Praha VŠCHT 2002 4 s. 207-210 polynomial matrix modular arithmetics shift cav_un_auth*0101111 Hurák Zdeněk UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0101204 Šebek Michael UTIA-B Department of Control Theory Ústav teorie informace a automatizace AV ČR, v. v. i. 09I GA102/02/0709 GA ČR cav_un_auth*0004118 CEZ:AV0Z1075907 Efficient algorithm for modular shift of a polynomial matrix is proposed in this note.The algorithm avoids any iteration that is inherent in standard Euclidean algorithm for division of polynomial matrices.It assumes that the denominator polynomial matrix is row-reduced.If it is not,it can always be transformed into row-reduced form accepting some additional computational cost. Numerical experiments with an implementation of the proposed algorithm in Matlab are reported. cav_un_auth*0212971 MATLAB 2002 Praha CZ 07.11.2002 BC TŘ http://hdl.handle.net/11104/0131028 UTIA-B 20020155 2002 2002 Praha VŠCHT 80-7080-500-5 MATLAB 2002. Sborník příspěvků 10. ročníku konference 207 210 MATLAB 2002. Proceedings of the 10th conference