×

Generalized subresultants for computing the Smith normal form of polynomial matrices. (English) Zbl 0851.68048

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.

MSC:

68W30 Symbolic computation and algebraic computation
PDFBibTeX XMLCite
Full Text: DOI