Computing rational forms of integer matrices

DOI10.1006/JSCO.2002.0554zbMATH Open1016.65025OpenAlexW2078168416MaRDI QIDQ1864883FDOQ1864883

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

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

zbMATH Keywords

integer matrixFrobenius rational formLas Vegas type algorithmrational Jordan form

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

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

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)