A (hopefully) friendly introduction to the complexity of polynomial matrix computations
Abstract
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.
Domains
Symbolic Computation [cs.SC]
Origin : Files produced by the author(s)