A practical implementation of a modular algorithm for Ore polynomial matrices

MaRDI QIDQ5188227zbMATH OpenFDO

Authors Howard Cheng, G. Labahn

Publication date 10 March 2010

zbMATH Keywords

\textsc{Maple}Popov form

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• A practical implementation of a modular algorithm for ore polynomial matrices
• Fraction-free row reduction of matrices of Ore polynomials.
• scientific article; zbMATH DE number 2151212
• Popov form computation for matrices of Ore polynomials
• scientific article; zbMATH DE number 1253996

Cited in

(8)

• Fraction-free row reduction of matrices of Ore polynomials.
• A practical implementation of a modular algorithm for ore polynomial matrices
• Ore polynomials in Sage
• A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials
• Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases
• scientific article; zbMATH DE number 2151212 (Why is no real title available?)
• Popov form computation for matrices of Ore polynomials
• On ranks of matrices over noncommutative domains

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A practical implementation of a modular algorithm for Ore polynomial matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188227)