Generalized subresultants for computing the Smith normal form of polynomial matrices
From MaRDI portal
Publication:1914162
DOI10.1006/jsco.1995.1050zbMath0851.68048OpenAlexW2007519147MaRDI QIDQ1914162
Publication date: 4 June 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1995.1050
Related Items (8)
Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients ⋮ An algorithm for computing minimal curves ⋮ A local construction of the Smith normal form of a matrix polynomial ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ Smith forms of circulant polynomial matrices ⋮ On Computing the Hermite Form of a Matrix of Differential Polynomials ⋮ Evaluation techniques for zero-dimensional primary decomposition ⋮ Computing rational forms of integer matrices
This page was built for publication: Generalized subresultants for computing the Smith normal form of polynomial matrices
