Parallel algorithms for matrix polynomial division

AbstractIn this paper, several algorithms for the matrix polynomial division are taken into consideration. Such algorithms represent extensions of known parallel algorithms for the scalar polynomial division with remainder. The interest resides in the comparison of the parallel computational cost of these algorithms in the general non scalar case