Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients

DOI10.1016/0304-3975(95)00090-9zbMath0872.68055MaRDI QIDQ1351936

Henri Lombardi, Salah Labhalla, Roger Marlin

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00090-9

Mathematics Subject Classification ID

68W10: Parallel algorithms in computer science

Related Items

A local construction of the Smith normal form of a matrix polynomial, On lattice reduction for polynomial matrices, Computing rational forms of integer matrices, On Computing the Hermite Form of a Matrix of Differential Polynomials

Cites Work

• On computing the determinant in small parallel time using a small number of processors
• Complexity questions in number theory
• Solving systems of linear equations over polynomials
• Generalized subresultants for computing the Smith normal form of polynomial matrices
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations
• Spécialisation de la suite de Sturm et sous-résultants (I)
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Algorithms for the Solution of Systems of Linear Diophantine Equations
• Asymptotically Fast Triangularization of Matrices over Rings
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• A Method of Determining Explicitly the Coefficients of the Characteristic Equation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item