The complexity of partial derivatives, Theoretical Computer Science, vol.22, pp.317-330, 1983. ,
A uniform approach for the fast computation of matrix-type Padé approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.804-823, 1994. ,
, Fundamental Algorithms, vol.1, 1994.
Triangular factorization and inversion by fast matrix multiplication, Math. Comp, vol.28, pp.231-236, 1974. ,
Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften, 1997. ,
On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.28, issue.7, pp.693-701, 1991. ,
DOI : 10.1007/bf01178683
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994. ,
DOI : 10.2307/2153413
Nearly optimal algorithms for canonical matrix forms, 1993. ,
DOI : 10.1137/s0097539793252687
A generalization of the fast LUP matrix decomposition algorithm and applications, Journal of Algorithms, vol.3, pp.45-56, 1982. ,
Straight-line computation of the polynomial matrix inverse, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-02101970
Linear systems, 1980. ,
Taylor expansion of the accumulated rounding errors, BIT, vol.16, pp.146-160, 1976. ,
Matrix-free linear system solving and applications to symbolic computation, Dept. Comp. Sc., Rensselaer Polytech. Instit, 1995. ,
On lattice reduction for polynomial matrices, Journal of Symbolic Computation ,
DOI : 10.1016/s0747-7171(02)00139-6
URL : https://doi.org/10.1016/s0747-7171(02)00139-6
Algorithms for Matrix Canonical Forms, 2000. ,
High-Order Lifting (Extended Abstract), International Symposium on Symbolic and Algebraic Computation, pp.246-254, 2002. ,
DOI : 10.1145/780506.780538
Gaussian elimination is not optimal, Numer. Math, vol.13, pp.354-356, 1969. ,
DOI : 10.1007/bf02165411
Vermeidung von Divisionen, J. Reine Angew. Math, vol.264, pp.182-202, 1973. ,
Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm, International Symposium on Symbolic and Algebraic Computation, pp.323-331, 2001. ,
Black box linear algebra with the LinBox library, 2002. ,
Computation of the inverse and determinant of a matrix (summary by E. Thomé), Algorithms Seminar, 2002. ,
Computing Popov and Hermite forms of polynomial matrices, International Symposium on Symbolic and Algebraic Computation, pp.250-258, 1996. ,
DOI : 10.1145/236869.237082
URL : http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/PDF/issac96.pdf
Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems, International Symposium on Symbolic and Algebraic Computation, pp.32-39, 1997. ,