A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials
DOI10.1007/978-3-642-32973-9_10zbMATH Open1416.65115OpenAlexW165457259MaRDI QIDQ2914992FDOQ2914992
Authors: Albert Heinle, Mark Giesbrecht 
Publication date: 21 September 2012
Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32973-9_10
Recommendations
- Computing the Hermite form of a matrix of Ore polynomials
- Popov form computation for matrices of Ore polynomials
- Computing Hermite forms of polynomial matrices
- A practical implementation of a modular algorithm for Ore polynomial matrices
- Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases
Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30) Canonical forms, reductions, classification (15A21) Ordinary and skew polynomial rings and semigroup rings (16S36)
Cited In (5)
- Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras
- Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases
- Title not available (Why is that?)
- An O(M(n) logn) Algorithm for the Jacobi Symbol
- On Solution Spaces of Products of Linear Differential or Difference Operators
This page was built for publication: A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914992)
