We give an algorithm to compute the finite zeros of a regular matrix polynomial P(λ) [i.e. det P(λ) ≢ 0]. The approach is close to that of the algorithm in . We use nonunitary elementary matrices instead of unitary matrices for the equivalence transformations, which are somewhat cheaper. In practice the danger of growth of nonunitary matrices seems to be more remote than usually supposed.