Computing rational forms of integer matrices

DOI10.1006/jsco.2002.0554zbMath1016.65025OpenAlexW2078168416MaRDI QIDQ1864883

Arne Storjohann, Mark W. Giesbrecht

Publication date: 23 March 2003

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

Full work available at URL: https://doi.org/10.1006/jsco.2002.0554

zbMATH Keywords

integer matrixFrobenius rational formLas Vegas type algorithmrational Jordan form

Mathematics Subject Classification ID

Related Items (5)

The Complexity of Diagonalization ⋮ Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time ⋮ FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME ⋮ On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity ⋮ Common factors in fraction-free matrix decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On p-adic computation of the rational form of a matrix
• Parallel algorithms for matrix normal forms
• Solving systems of linear equations over polynomials
• Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
• Generalized subresultants for computing the Smith normal form of polynomial matrices
• Approximate formulas for some functions of prime numbers
• Factor Refinement
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• An Inequality About Factors of Polynomials
• Nearly Optimal Algorithms for Canonical Matrix Forms

This page was built for publication: Computing rational forms of integer matrices