A division algorithm for arbitrary polynomial matrices
George F. Fragulis · 2002
A new algorithm is presented for carrying-out the division of two polynomial matrices which are not necessarily column-reduced but have arbitrary form. The given algorithm is iterative, easy to handle and due to its closed matrix form (only constant matrices take part in the algorithm) can be easily implemented in a digital computer.