A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials

DOI10.1007/978-3-642-32973-9_10zbMath1416.65115OpenAlexW165457259MaRDI QIDQ2914992

Albert Heinle, Mark W. 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

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

Related Items (2)

Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras ⋮ 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