Fraction-free row reduction of matrices of Ore polynomials.

DOI10.1016/j.jsc.2005.10.002zbMath1151.16025MaRDI QIDQ2457346

Bernhard Beckermann, George Labahn, Howard Cheng

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2005.10.002

zbMATH Keywords

Ore polynomials; exact arithmetic; matrix normal forms

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

16S36: Ordinary and skew polynomial rings and semigroup rings

15B33: Matrices over special rings (quaternions, finite fields, etc.)

16Z05: Computational aspects of associative rings (general theory)

15A21: Canonical forms, reductions, classification

Related Items

Output-sensitive modular algorithms for polynomial matrix normal forms, On Computing the Hermite Form of a Matrix of Differential Polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursiveness in matrix rational interpolation problems
• Fast projection methods for minimal design problems in linear system theory
• On lattice reduction for polynomial matrices
• Normal forms for general polynomial matrices
• Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
• On solutions of linear functional systems
• EG-eliminations
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination