B. Beckermann, A reliable method for computing M-Pad?? approximants on arbitrary staircases, Journal of Computational and Applied Mathematics, vol.40, issue.1, pp.19-42, 1992.
DOI : 10.1016/0377-0427(92)90039-Z
URL : http://doi.org/10.1016/0377-0427(92)90039-z

B. Beckermann and G. Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Pad?? Approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.3-804, 1994.
DOI : 10.1137/S0895479892230031

B. Beckermann and G. Labahn, Recursiveness in matrix rational interpolation problems, Journal of Computational and Applied Mathematics, vol.77, issue.1-2, pp.1-2, 1997.
DOI : 10.1016/S0377-0427(96)00120-3
URL : http://doi.org/10.1016/s0377-0427(96)00120-3

B. Beckermann, G. Labahn, and G. Villard, Shiied Normal Forms of Polynomial Matrices, ISSAC'99, pp.189-196, 1999.
DOI : 10.1145/309831.309929
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.4266

B. Codenooi and G. Looi, A fast algorithm for the division of two polynomial matrices, IEEE Transactions on Automatic Control, vol.34, issue.4, pp.446-448, 1989.
DOI : 10.1109/9.28020

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.3-251, 1990.
DOI : 10.1145/28395.28396
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

D. S. Dummit and R. M. Foote, Abstract Algebra, 2004.

D. Eisenbud, Commutative Algebra: with a View Toward Algebraic Geometry, 1995.
DOI : 10.1007/978-1-4612-5350-1

D. Eisenbud, e Geometry of Syzygies, 2005.
DOI : 10.1017/cbo9780511756382.005

P. Favati and G. Looi, Parallel algorithms for matrix polynomial division, Computers & Mathematics with Applications, vol.22, issue.7, pp.37-42, 1991.
DOI : 10.1016/0898-1221(91)90179-8
URL : http://doi.org/10.1016/0898-1221(91)90179-8

G. D. Forney and J. , Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems, SIAM Journal on Control, vol.13, issue.3, pp.493-520, 1975.
DOI : 10.1137/0313029

J. Zur-gathen and J. Gerhard, Modern Computer Algebra (third edition), pp.1-795, 2013.

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.135-142, 2003.
DOI : 10.1145/860854.860889

P. Giorgi and R. Lebreton, Online order basis algorithm and its impact on the block Wiedemann algorithm, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.202-209, 2014.
DOI : 10.1145/2608628.2608647
URL : https://hal.archives-ouvertes.fr/lirmm-01232873

S. Gupta, S. Sarkar, A. Storjohann, and J. Valeriote, Triangular x -basis decompositions and derandomization of linear algebra algorithms over K [x ], J. Symbolic Comput, vol.47, pp.4-2012, 2012.

S. Gupta and A. Storjohann, Computing hermite forms of polynomial matrices, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.155-162, 2011.
DOI : 10.1145/1993886.1993913

C. Jeannerod, V. Neiger, ´. E. Schost, and G. Villard, Fast computation of minimal interpolation bases in Popov form for arbitrary shiis, ISSAC'16, pp.295-302, 2016.

C. Jeannerod, V. Neiger, ´. E. Schost, and G. Villard, Computing minimal interpolation bases, Journal of Symbolic Computation, vol.83, pp.272-314, 2017.
DOI : 10.1016/j.jsc.2016.11.015
URL : https://hal.archives-ouvertes.fr/hal-01241781

T. Kailath, Linear Systems, 1980.

G. Labahn, V. Neiger, and W. Zhou, Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, Journal of Complexity, 2017.
DOI : 10.1016/j.jco.2017.03.003
URL : https://hal.archives-ouvertes.fr/hal-01345627

F. and L. Gall, Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.296-303, 2014.
DOI : 10.1145/2608628.2608664

J. Middeke, A computational view on normal forms of matrices of Ore polynomials. Ph.D. Dissertation. Research Institute for Symbolic Computation (RISC), 2011.

V. Neiger, Bases of relations in one or several variables: fast algorithms and applications, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01431413

V. Neiger, Fast computation of shiied Popov forms of polynomial matrices via systems of modular polynomial equations, ISSAC'16, pp.365-372, 2016.

V. M. Popov, Invariant Description of Linear, Time-Invariant Controllable Systems, SIAM Journal on Control, vol.10, issue.2, pp.252-264, 1972.
DOI : 10.1137/0310020

J. Rosenkilde and A. Storjohann, Algorithms for Simultaneous Pad?? Approximations, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, pp.405-412, 2016.
DOI : 10.1145/2930889.2930933

A. Storjohann, High-order liiing and integrality certiication, J. Symbolic Comput, vol.36, pp.3-4, 2003.
DOI : 10.1016/s0747-7171(03)00097-x
URL : http://doi.org/10.1016/s0747-7171(03)00097-x

A. Storjohann, Notes on computing minimal approximant bases, Challenges in Symbolic Computation Sooware (Dagstuhl Seminar Proceedings). hhp, p.776, 2006.

M. , V. Barel, and A. Bultheel, e computation of non-perfect Padé-Hermite approximants, Numer. Algorithms, vol.1, issue.3, pp.285-304, 1991.

M. , V. Barel, and A. Bultheel, A general module theoretic framework for vector M-Padé and matrix rational interpolation, Numer. Algorithms, vol.3, pp.451-462, 1992.

Q. Wang and C. Zhou, An efficient division algorithm for polynomial matrices, IEEE Transactions on Automatic Control, vol.31, issue.2, pp.165-166, 1986.
DOI : 10.1109/TAC.1986.1104212

W. Wolovich, A division algorithm for polynomial matrices, IEEE Transactions on Automatic Control, vol.29, issue.7, pp.656-658, 1984.
DOI : 10.1109/TAC.1984.1103609

. Shou-yuan, C. Zhang, and . Chen, An algorithm for the division of two polynomial matrices, IEEE Transactions on Automatic Control, vol.28, issue.2, pp.238-240, 1983.
DOI : 10.1109/TAC.1983.1103203

W. Zhou, Fast Order Basis and Kernel Basis Computation and Related Problems, 2012.

W. Zhou and G. Labahn, Efficient algorithms for order basis computation, Journal of Symbolic Computation, vol.47, issue.7, pp.793-819, 2012.
DOI : 10.1016/j.jsc.2011.12.009