An \(NC^ 2\) algorithm for testing similarity of matrices

DOI10.1016/0020-0190(89)90203-2zbMath0666.65037OpenAlexW2050151481MaRDI QIDQ1116651

Yechezkel Zalcstein, Max H. Garzon

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90203-2

zbMATH Keywords

similarity of matricesfast parallel algorithmparallel deterministic algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Canonical forms, reductions, classification (15A21)

Cites Work

• Unnamed Item
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Decidability criteria for the similarity problem, with applications to the moduli of linear dynamical systems
• The Parallel Complexity of Abelian Permutation Group Problems
• An isomorphism criterion for modules over a principal ideal domain
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Characteristic free, improved decidability criteria for the similarity problem
• Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices

This page was built for publication: An \(NC^ 2\) algorithm for testing similarity of matrices