Popov form computation for matrices of Ore polynomials
From MaRDI portal
Recommendations
- Fraction-free row reduction of matrices of Ore polynomials.
- Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
- A practical implementation of a modular algorithm for Ore polynomial matrices
- Computing the Hermite form of a matrix of Ore polynomials
- A practical implementation of a modular algorithm for ore polynomial matrices
Cited in
(17)- Computing valuations of the Dieudonné determinants
- Fraction-free row reduction of matrices of Ore polynomials.
- A practical implementation of a modular algorithm for ore polynomial matrices
- Computing Popov forms of matrices over PBW extensions
- A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials
- Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations
- Conversion between Hermite and Popov normal forms using an FGLM-like approach
- Computing the Hermite form of a matrix of Ore polynomials
- scientific article; zbMATH DE number 1254300 (Why is no real title available?)
- Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases
- A computational view on normal forms of matrices of Ore polynomials
- A practical implementation of a modular algorithm for Ore polynomial matrices
- scientific article; zbMATH DE number 5679783 (Why is no real title available?)
- Computational Science – ICCS 2005
- Unimodular Completions and Orthogonal Complements of Matrices over Univariate Ore Extensions
- Computing valuations of the Dieudonné determinants
- On solving (non)commutative weighted Edmonds' problem
This page was built for publication: Popov form computation for matrices of Ore polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119948)