Abstract
The computation of an order basis (also called sigma basis) is a fundamental tool for linear algebra with polynomial coefficients. Such a computation is one of the key ingredients to provide algorithms which reduce to polynomial matrices multiplication. This has been the case for column reduction or minimal nullspace basis of polynomial matrix over a field. In this poster, we are interested in the application of order basis to compute minimal matrix generators of a linear matrix sequence. In particular, we focus on the linear matrix sequence used in the Block Wiedemann algorithm.