Parallel algorithms for matrix polynomial division

In this paper we analyze some parallel algorithrns for the division of polynomial matrices wich can be applied to the solution of linear systems with polynomial coefficients and to the inversion of a polynomial matrix as well. It can be easily shown that the problem of computing the quotient and the remainder polynomial matrices of the division of two polynomial matrices N(s) by D(s) (with detD(s) ? O) is equivalent to the block triangular Toeplitz matrix inversion. Several algorithms can be used to solve this problem; three of them will be shown in section 3 together with the estimation of their parallel computational cost. In section 4 the application of the previously introduced algorithms to the solution of linear systems with polynomial coefficients is presented.