Computing Hermite forms of polynomial matrices
From MaRDI portal
Publication:5254166
DOI10.1145/1993886.1993913zbMATH Open1323.68602OpenAlexW2115982610MaRDI QIDQ5254166FDOQ5254166
Authors: Somit Gupta, Arne Storjohann
Publication date: 9 June 2015
Published in: Proceedings of the 36th international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993886.1993913
Recommendations
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- scientific article; zbMATH DE number 1254300
- On Computing the Hermite Form of a Matrix of Differential Polynomials
- Fast parallel Hermite normal form computation of matrices over $$\mathbb{F}[x]$$
- Computing Popov and Hermite forms of rectangular polynomial matrices
Hermitian, skew-Hermitian, and related matrices (15B57) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)
Cited In (13)
- Title not available (Why is that?)
- Computing Popov and Hermite forms of rectangular polynomial matrices
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
- On the complexity of inverting integer and polynomial matrices
- Applications of Hermite transforms in computer algebra.
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Title not available (Why is that?)
- On Computing the Hermite Form of a Matrix of Differential Polynomials
- Computing the Hermite form of a matrix of Ore polynomials
- Title not available (Why is that?)
- A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials
- Fast computation of approximant bases in canonical form
This page was built for publication: Computing Hermite forms of polynomial matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254166)