Villard, Gilles Generalized subresultants for computing the Smith normal form of polynomial matrices. (English) Zbl 0851.68048 J. Symb. Comput. 20, No. 3, 269-286 (1995). Summary: We describe a new algorithm for the computation of the Smith normal form of polynomial matrices. This algorithm computes the normal form and pre- and post-multipliers in deterministic polynomial time. Noticing that the computation reduces to a linear algebra problem over the field of the coefficients, we obtain a good worst-case complexity bound. Cited in 8 Documents MSC: 68W30 Symbolic computation and algebraic computation Keywords:Smith normal form of polynomial matrices PDFBibTeX XMLCite \textit{G. Villard}, J. Symb. Comput. 20, No. 3, 269--286 (1995; Zbl 0851.68048) Full Text: DOI