A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials

DOI10.1007/978-3-642-32973-9_10MaRDI QIDQ2914992zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Ordinary and skew polynomial rings and semigroup rings (16S36) Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30)

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

Cited in

(6)

• Computing the Hermite form of a matrix of Ore polynomials
• scientific article; zbMATH DE number 1262434 (Why is no real title available?)
• An O(M(n) logn) Algorithm for the Jacobi Symbol
• On solution spaces of products of linear differential or difference operators
• 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

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)