Computing rational forms of integer matrices

DOI10.1006/JSCO.2002.0554MaRDI QIDQ1864883zbMATH OpenOpenAlexFDO

Authors Arne Storjohann, Mark 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

Matrices of integers (15B36) Canonical forms, reductions, classification (15A21)

Recommendations

• scientific article; zbMATH DE number 1263430
• scientific article; zbMATH DE number 1254241
• scientific article; zbMATH DE number 1256647
• A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
• Nearly Optimal Algorithms for Canonical Matrix Forms

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 4033867 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• An Inequality About Factors of Polynomials
• Approximate formulas for some functions of prime numbers
• Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
• Factor Refinement
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Generalized subresultants for computing the Smith normal form of polynomial matrices
• Modern computer algebra
• Nearly Optimal Algorithms for Canonical Matrix Forms
• On p-adic computation of the rational form of a matrix
• Parallel algorithms for matrix normal forms
• Solving systems of linear equations over polynomials

Cited in

(10)

• scientific article; zbMATH DE number 3984463 (Why is no real title available?)
• COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
• Nearly Optimal Algorithms for Canonical Matrix Forms
• On p-adic computation of the rational form of a matrix
• scientific article; zbMATH DE number 23254 (Why is no real title available?)
• Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
• Common factors in fraction-free matrix decompositions
• The Complexity of Diagonalization
• On the Moser- and super-reduction algorithms of systems of linear differential equations and their complexity
• Finding the growth rate of a regular or context-free language in polynomial time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864883)