On Computing the Hermite Form of a Matrix of Differential Polynomials

DOI10.1007/978-3-642-04103-7_12zbMath1260.68479arXiv0906.4121OpenAlexW1777899759MaRDI QIDQ3644094

Myung Sub Kim, Mark W. Giesbrecht

Publication date: 10 November 2009

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.4121

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving systems of linear equations over polynomials
• Exact solution of linear equations using p-adic expansions
• Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
• On lattice reduction for polynomial matrices
• FFT-like multiplication of linear differential operators
• Generalized subresultants for computing the Smith normal form of polynomial matrices
• Fraction-free row reduction of matrices of Ore polynomials.
• On solutions of linear functional systems
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Non-commutative domains of integrity.
• Products of ordinary differential operators by evaluation and interpolation
• Invariant Description of Linear, Time-Invariant Controllable Systems

This page was built for publication: On Computing the Hermite Form of a Matrix of Differential Polynomials