A (hopefully) friendly introduction to the complexity of polynomial matrix computations

Claude-Pierre Jeannerod (1, 2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 ARIC - Arithmetic and Computing

This paper aims at a friendly introduction to the field of fast algorithms for polynomial matrices, and surveys the results of the ISSAC 2003 paper 'On the Complexity of Polynomial Matrix Computations' by Pascal Giorgi, Claude-Pierre Jeannerod, and Gilles Villard.

Mots clés: Polynomial matrix; algebraic complexity

Domaines: Calcul formel [cs.SC]

Claude-Pierre Jeannerod. A (hopefully) friendly introduction to the complexity of polynomial matrix computations. 2003. ⟨hal-00793484⟩